solved by JJLeo
简化后题意:给出一张二分图,每次操作加一条边或删一条边,每次操作后,如果左侧有点度数为$0$,输出$-1$,否则输出连通块数量减去右侧度数为$0$的点的数量,不强制在线。
线段树分治模板题。
upsolved by
upsolved by
solved by
upsolved by
solved by
upsolved by
solved by
solved by Bazoka13
每次可以选择给定两个整数中的一个,并且选择的数字必须未被选过,输出最多选择的数字数量
类似于 $2-sat$ 的想法,每组数字互相建边后 $bfs$ 计算即可
upsolved by
0min:开局分题
???min:看榜冲I
60min:WA2,K更签到ZYF冲K
87min:ZYF AC K
110min:CSK AC I,ZYF 冲G
145min:ZYF AC G,ZYF 冲A
237min:ZYF AC A
till end:进入垃圾时间