Rank | Solved | A | B | C | D | E | F | G | H | I | J |
---|---|---|---|---|---|---|---|---|---|---|---|
51/384 | 4/10 | . | . | ? | . | O | O | . | O | . | O |
O
: 当场通过
?
: 赛后通过
.
: 尚未通过
A Domains
unsolved
B K-Dimensional Foil
unsolved
C Graph
upsolved by chelly
chelly‘s solution
很显然的思路就是莫队+并查集
但众所周知并查集可以支持可撤销,但不是很好支持可持久化
于是就可以用上回滚莫队的套路了,回滚莫队可以把一般莫队的删除操作变成撤销操作,复杂度不改变
于是这题用回滚莫队+可撤销并查集即可解决
注意回滚莫队的时候,处理右半边的点的时候,不能连向左半边的点,否则rollback的时候跨越中间的边并没有撤销
D Chinese Checkers
unsolved
E Cats and Fish
solved by chelly
chelly‘s solution
F Secret Poems
solved by chelly
chelly‘s solution
G Liaoning Ship’s Voyage
unsolved
H Puzzle Game
solved by chelly
chelly‘s solution
I Colored Nodes
unsolved
J Pangu and Stones
solved by chelly
chelly‘s solution
Replay
原文地址:https://www.cnblogs.com/Amadeus/p/9986324.html
时间: 2024-11-09 14:43:19