2018 ACM-ICPC Asia Nanjing Regional Contest
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.