Difference between revisions of "ACM-ICPC 2018 Qingdao Online Contest"
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
Solved by ultmaster. 02:14 (+) | Solved by ultmaster. 02:14 (+) | ||
| + | |||
| + | 题意：给一棵黑白树，定义白节点代价为 0，黑节点代价为到最近的白节点祖先的距离。每次询问一个点集，允许修改一个黑节点为白节点，求点集中代价最大的东西的最小值。 | ||
| + | |||
| + | 题解：二分答案，然后求超过答案的部分的 LCA。然后将这个点染白，检查超过答案的部分是不是被卡进答案范围内了。 | ||
== Problem C == | == Problem C == | ||
| Line 30: | Line 34: | ||
Solved by ultmaster. 00:55 (+) | Solved by ultmaster. 00:55 (+) | ||
| + | |||
| + | 题意：直线上红绿灯每秒变换，求所有点对的旅行代价。 | ||
| + | |||
| + | 题解：应该瞎 DP 一下就好了。奇偶搞错了自闭了好一会儿。 | ||
== Problem I == | == Problem I == | ||
| Line 40: | Line 48: | ||
Solved by kblack. 00:14 (+) | Solved by kblack. 00:14 (+) | ||
| − | |||
= One,Two,Three,AK = | = One,Two,Three,AK = | ||
Revision as of 10:15, 16 September 2018
ECNU Foreigners
Problem A
Solved by zerol. 00:12 (+)
Problem B
Solved by ultmaster. 02:14 (+)
题意：给一棵黑白树，定义白节点代价为 0，黑节点代价为到最近的白节点祖先的距离。每次询问一个点集，允许修改一个黑节点为白节点，求点集中代价最大的东西的最小值。
题解：二分答案，然后求超过答案的部分的 LCA。然后将这个点染白，检查超过答案的部分是不是被卡进答案范围内了。
Problem C
Solved by zerol. 00:35 (+)
Problem D
Solved by kblack. 04:10 (+4)
Problem E
Problem F
Unsolved. 04:59 (-5)
Problem G
Solved by zerol. 02:50 (+)
Problem H
Solved by ultmaster. 00:55 (+)
题意：直线上红绿灯每秒变换，求所有点对的旅行代价。
题解：应该瞎 DP 一下就好了。奇偶搞错了自闭了好一会儿。
Problem I
Problem J
Solved by kblack. 01:04 (+)
Problem K
Solved by kblack. 00:14 (+)
One,Two,Three,AK
Problem A
Solved by .
Problem B
Solved by .
Problem C
Solved by .
Problem D
Solved by .
Problem E
Solved by .
Problem F
Solved by .
Problem G
Solved by .
Problem H
Solved by .
Problem I
Solved by .
Problem J
Solved by .
Problem K
Solved by .