Difference between revisions of "2019-2020 ACM-ICPC Brazil Subregional Programming Contest"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) |
Xiejiadong (talk | contribs) |
||
Line 2: | Line 2: | ||
Solved by Xiejiadong. 01:05 (+) | Solved by Xiejiadong. 01:05 (+) | ||
+ | |||
+ | 题意:要从 $(0,0)$ 走到 $(n,m)$ ,沿路有一些监视器,每个监视器有一定的监视范围,求能不能逃脱监控,走到终点。 | ||
+ | |||
+ | 题解:显然,监控能够阻断道路,当且仅当地图的左上边界和右下边界通过监视器联通了起来。 | ||
+ | |||
+ | 于是通过 $O(n^2)$ 枚举建边,直接 BFS 就好了。 | ||
== Problem B == | == Problem B == |
Revision as of 06:47, 6 October 2019
Problem A
Solved by Xiejiadong. 01:05 (+)
题意:要从 $(0,0)$ 走到 $(n,m)$ ,沿路有一些监视器,每个监视器有一定的监视范围,求能不能逃脱监控,走到终点。
题解:显然,监控能够阻断道路,当且仅当地图的左上边界和右下边界通过监视器联通了起来。
于是通过 $O(n^2)$ 枚举建边,直接 BFS 就好了。
Problem B
Solved by Xiejiadong. 00:10 (+)
温暖的签到。
Problem C
Unsolved.
Problem D
Solved by Kilo_5723. 00:38 (+)
Problem E
Unsolved.
Problem F
Solved by Xiejiadong. 04:48 (+3)
Problem G
Solved by Xiejiadong && Kilo_5723. 02:27 (+)
Problem H
Solved by Kilo_5723. 00:05 (+)
Problem I
Unsolved.
Problem J
Solved by Kilo_5723. 02:37 (+)
Problem K
Solved by Weaver_zhu. 04:01 (+)
Problem L
Solved by Kilo_5723. 00:49 (+)
Problem M
Solved by Xiejiadong. 00:23 (+)