当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

1540:Tunnel Warfare

题目描述
During the War of Resistance Against Japan, tunnel warfare was carried out extensively in the vast areas of north China Plain. Generally speaking, villages connected by tunnels lay in a line. Except the two at the ends, every village was directly connected with two neighboring ones.

Frequently the invaders launched attack on some of the villages and destroyed the parts of tunnels in them. The Eighth Route Army commanders requested the latest connection state of the tunnels and villages. If some villages are severely isolated, restoration of connection must be done immediately!
输入解释
The first line of the input contains two positive integers n and m (n, m ≤ 50,000) indicating the number of villages and events. Each of the next m lines describes an event.

There are three different events described in different format shown below:

D x: The x-th village was destroyed.

Q x: The Army commands requested the number of villages that x-th village was directly or indirectly connected with including itself.

R: The village destroyed last was rebuilt.
输出解释
Output the answer to each of the Army commanders’ request in order on a separate line.
输入样例
7 9
D 3
D 6
D 5
Q 4
Q 5
R
Q 4
R
Q 4
输出样例
1
0
2
4
来自杭电HDUOJ的附加信息
Recommend LL

该题目是Virtual Judge题目,来自 杭电HDUOJ

题目来源 POJ Monthly

源链接: HDU-1540

最后修改于 2020-10-25T22:45:52+00:00 由爬虫自动更新

共提交 2

通过率 50.0%
时间上限 内存上限
4000/2000MS(Java/Others) 65536/32768K(Java/Others)