Difference between revisions of "2018 ACM-ICPC Asia Nanjing Regional Contest"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) () |
Xiejiadong (talk | contribs) (→Replay) |
||
| Line 6: | Line 6: | ||
Xiejiadong: | Xiejiadong: | ||
| + | |||
| + | 躺在地上看队友各种过题，差点零贡献领奖。 | ||
== Problem A == | == Problem A == | ||
Revision as of 11:42, 14 October 2018
Replay
oxx1108:
dreamcloud:
Xiejiadong:
躺在地上看队友各种过题，差点零贡献领奖。
Problem A
Solved by oxx1108.
Problem B
Unsolved.
IOI2014原题。
Problem C
Unsolved.
Problem D
Solved by Redbook.
题意：三位一体求最小覆盖。
题解：红书原题，甚至数据范围小了很多。
Problem E
Unsolved.
Problem F
Unsolved.
Problem G
Solved by oxx1108.
Problem H
Unsolved.
Problem I
Solved by dreamcloud.
Problem J
Solved by oxx1108.
Problem K
Unsolved.
Problem L
Unsolved.
Problem M
Solved by Xiejiadong && dreamcloud.