Difference between revisions of "2019-2020 ICPC Southwestern European Regional Programming Contest (SWERC 2019-20)"
Jump to navigation
Jump to search
(Created page with "== Problem A == Solved by . 01:30 (+) == Problem B == Solved by . 00:12 (+) == Problem C == Solved by . 00:23 (+6) == Problem D == Unsolved. == Problem E == Unsolved....") |
|||
| (6 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
== Problem A == | == Problem A == | ||
| − | Solved by . 01:30 (+) | + | Solved by bingoier. 01:30 (+) |
| + | |||
| + | 将一个点拆成两个点做一次dijkstra即可 | ||
== Problem B == | == Problem B == | ||
| − | Solved by . 00:12 (+) | + | Solved by bingoier. 00:12 (+) |
| + | |||
| + | 签到 | ||
== Problem C == | == Problem C == | ||
| − | Solved by . 00:23 (+6) | + | Solved by yanghong. 00:23 (+6) |
| + | |||
| + | 查找不在集合中的最小自然数 | ||
== Problem D == | == Problem D == | ||
| Line 25: | Line 31: | ||
== Problem G == | == Problem G == | ||
| − | Solved by . 04:39 (+4) | + | Solved by bingoier. 04:39 (+4) |
| + | |||
| + | 记录每一个动物所有非朋友种类的动物中最后的一个所在的位置，这个动物想要被选到，那么这些位置的动物一定要是已经被选的。 | ||
| + | |||
| + | 因此把这些位置向这个动物连一条有向边，用堆进行拓扑排序即可。 | ||
== Problem H == | == Problem H == | ||
| Line 42: | Line 52: | ||
== Problem K == | == Problem K == | ||
| − | Solved by . 02:41 (+4) | + | Solved by bingoier. 02:41 (+4) |
| + | |||
| + | tarjan缩完点后用队列宽搜删边，如果一个点单独出来的那么它就是答案 | ||
== Promblem L == | == Promblem L == | ||
Unsolved. | Unsolved. | ||
Latest revision as of 05:56, 22 October 2020
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.