2019-2020 ICPC Southwestern European Regional Programming Contest (SWERC 2019-20)
Jump to navigation
Jump to search
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.
Problem A
Solved by bingoier. 01:30 (+)
将一个点拆成两个点做一次dijkstra即可
Problem B
Solved by bingoier. 00:12 (+)
签到
Problem C
Solved by yanghong. 00:23 (+6)
查找不在集合中的最小自然数
Problem D
Unsolved.
Problem E
Unsolved.
Problem F
Solved by . 00:44 (+5)
Problem G
Solved by bingoier. 04:39 (+4)
记录每一个动物所有非朋友种类的动物中最后的一个所在的位置，这个动物想要被选到，那么这些位置的动物一定要是已经被选的。
因此把这些位置向这个动物连一条有向边，用堆进行拓扑排序即可。
Problem H
Unsolved.
Problem I
Solved by . 0:09(+)
Problem J
Solved by . 03:33 (+)
Problem K
Solved by bingoier. 02:41 (+4)
tarjan缩完点后用队列宽搜删边，如果一个点单独出来的那么它就是答案
Promblem L
Unsolved.