Difference between revisions of "2014-2015 ACM-ICPC, Asia Tokyo Regional Contest"
Jump to navigation
Jump to search
(Created page with "== Problem A == Solved by zerol. 00:23 (+) == Problem B == Solved by zerol. 00:12 (+) == Problem C == Solved by ultmaster. 00:31 (+) == Problem D == Solved by ultmaster...") |
|||
| Line 10: | Line 10: | ||
Solved by ultmaster. 00:31 (+) | Solved by ultmaster. 00:31 (+) | ||
| + | |||
| + | 题意：从一条直线的一端走到另一端，有若干对关系 $(c_i, d_i)$ 表示 $c_i$ 必须在 $d_i$ 之后经过至少一次。求最小路程。 | ||
| + | |||
| + | 题解：一定是第一种情形。扫描线一下就好了。 | ||
| + | |||
| + | [[File:Screen Shot 2018-07-29 at 12.15.57 PM.png|600px]] | ||
| + | |||
| + | 图是从多校偷的。 | ||
== Problem D == | == Problem D == | ||
Revision as of 11:11, 17 November 2018
Problem A
Solved by zerol. 00:23 (+)
Problem B
Solved by zerol. 00:12 (+)
Problem C
Solved by ultmaster. 00:31 (+)
题意：从一条直线的一端走到另一端，有若干对关系 $(c_i, d_i)$ 表示 $c_i$ 必须在 $d_i$ 之后经过至少一次。求最小路程。
题解：一定是第一种情形。扫描线一下就好了。
图是从多校偷的。
Problem D
Solved by ultmaster. 01:57 (+)
Problem E
Solved by zerol. 03:09 (+)
Problem F
Solved by zerol. 01:15 (+)
Problem G
Solved by kblack. 01:21 (+1)
Problem H
Problem I
Upsolved by ultmaster & zerol.