Difference between revisions of "2016 ACM-ICPC World Finals"
Jump to navigation
Jump to search
Line 28: | Line 28: | ||
Solved by kblack. 02:19 (+2) | Solved by kblack. 02:19 (+2) | ||
+ | |||
+ | 题意:要一根不平行于 x 轴的直线使得相交的线段数最长。 | ||
+ | |||
+ | 题解:总可以调整使得目标直线至少经过一条线段的某个顶点,转一圈。 | ||
== Problem H == | == Problem H == |
Revision as of 11:05, 24 March 2019
Problem A
Solved by zerol. 04:30 (+1)
CF 突然炸了。就交在 kattis 上了。
Problem B
Solved by ultmaster. 03:38 (+1)
Problem C
Solved by zerol. 00:20 (+)
Problem D
Solved by ultmaster. 01:10 (+1)
Problem E
Solved by ultmaster. 01:40 (+2)
Problem F
Unsolved.
Problem G
Solved by kblack. 02:19 (+2)
题意:要一根不平行于 x 轴的直线使得相交的线段数最长。
题解:总可以调整使得目标直线至少经过一条线段的某个顶点,转一圈。
Problem H
Unsolved.
Problem I
Unsolved.
Problem J
Unsolved.
Problem K
Solved by zerol. 02:40 (+1)
Problem L
Solved by kblack. 00:49 (+)
大鱼吃小鱼签到。
Problem M
Unsolved.