2017-2018 ACM-ICPC, NEERC, Northern Subregional Contest
| Rank | Solved | A | B | C | D | E | F | G | H | I | J | K | L |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 74/414 | 8/12 | O | O | O | . | O | Ø | Ø | O | O | . | O | O |
O: 当场通过
Ø: 赛后通过
.: 尚未通过
A Auxiliary Project
solved by chelly
chelly's solution
B Boolean Satisfability
solved by ch
ch's solution
C Consonant Fencity
solved by ch
ch's solution
D Dividing Marbles
unsolved
E Equal Numbers
solved by chelly
chelly's solution
F Fygon 2.0
upsolved by chelly
chelly's solution
G Grand Test
upsolved by chelly
chelly's solution
H Hidden Supervisors
solved by chelly
chelly's solution
I Intelligence in Perpendicularia
solved by feynman
feynman's solution
J Joker
unsolved
K Kotlin Island
solved by chelly
chelly's solution
L Little Difference
solved by chelly&feynman
chelly's solution
Dirt Replay
L -2 一发是因为没有考虑到数字自身的情况；另外一发是用int存储了数字而没有用longlong
B -1
G -5 5发都是因为从所选起点S开始去找第一个环的时候，可能会出现个问题，就是S邻接点都被选入第一个环，然后第二个环走不出。解决方法就是加多找环时候的限制，同时也还是不带回溯的找环，复杂度OK，正确性当时是蒙过去的，但后来仔细分析了一下确实是对的……
