Difference between revisions of "XVII Open Cup named after E.V. Pankratiev. Grand Prix of Tatarstan"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Solved by Xiejiadong. 0:43 (+1) == Problem B == Unsolved. == Problem C == Unsolved. == Problem D == Solved by Kilo_5723. 0:46 (+) == Problem E == Solv...") |
Xiejiadong (talk | contribs) |
||
Line 46: | Line 46: | ||
Solved by Xiejiadong. 1:50 (+3) | Solved by Xiejiadong. 1:50 (+3) | ||
+ | |||
+ | 题意:选定一个没有 `+` 的位置放置一个 `+` ,求能攻击掉多少个 `+` 。 | ||
+ | |||
+ | 题解:显然,`+` 的攻击是可逆的。那么我们对于其中一个 `+` 被激活以后可以攻击到的所有 `+` ,一定是这所有相关联的 `+` 其中一个被激活,即可攻击到所有的。 | ||
+ | |||
+ | 于是按照这个原理,我们可以把 `+` 按照联通块的形式划分。 | ||
+ | |||
+ | 然后对于每一个非 `+` ,最多可以放四个方向攻击,判断那个非 `+` 可以攻击最多的 `+` 即可。 |
Revision as of 07:50, 1 November 2019
Problem A
Solved by Xiejiadong. 0:43 (+1)
Problem B
Unsolved.
Problem C
Unsolved.
Problem D
Solved by Kilo_5723. 0:46 (+)
Problem E
Solved by Weaver_zhu. 0:48 (+)
Problem F
Upsolved by Weaver_zhu. (-5)
Problem G
Unsolved.
Problem H
Solved by Kilo_5723. 4:34 (+)
Problem I
Unsolved. (-3)
Problem J
Solved by Kilo_5723. 1:50 (+4)
Problem K
Unsolved.
Problem L
Solved by Xiejiadong. 1:50 (+3)
题意:选定一个没有 `+` 的位置放置一个 `+` ,求能攻击掉多少个 `+` 。
题解:显然,`+` 的攻击是可逆的。那么我们对于其中一个 `+` 被激活以后可以攻击到的所有 `+` ,一定是这所有相关联的 `+` 其中一个被激活,即可攻击到所有的。
于是按照这个原理,我们可以把 `+` 按照联通块的形式划分。
然后对于每一个非 `+` ,最多可以放四个方向攻击,判断那个非 `+` 可以攻击最多的 `+` 即可。