HDU 1540
来源:互联网 发布:淘宝助力打印发货单 编辑:程序博客网 时间:2024/05/16 13:48
Tunnel Warfare
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3240 Accepted Submission(s): 1252
Problem Description
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!
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!
Input
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.
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
Output the answer to each of the Army commanders’ request in order on a separate line.
Sample Input
7 9D 3D 6D 5Q 4Q 5RQ 4RQ 4
Sample Output
1024
Source
POJ Monthly
Recommend
LL
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<set>using namespace std;#define nMax 5010set<int> S;int x;char s[nMax];int n,m;int st[nMax],top;int main() {freopen("input.txt","r",stdin);while(~scanf("%d%d",&n,&m)) {top = 0;S.clear() ;S.insert(0);S.insert(n+1);for(int i=0;i<m;i++) {scanf("%s",s);if(s[0]=='R') {if(top==0) continue;S.erase(st[top]);top--;}else {scanf("%d",&x);if(s[0]=='D') {st[++top]=x;S.insert(x);}else {if(S.count(x)){printf("%d\n",0);continue;}set<int>::iterator it = lower_bound(S.begin(),S.end(),x);int ret = *(it);it --;ret -= *(it);printf("%d\n",ret-1);}}}}return 0;}
- hdu 1540
- HDU 1540
- HDU 1540
- hdu 1540
- Hdu 1540
- hdu 1540 Tunnel Warfare
- hdu 1540 线段树
- hdu 1540 Tunnel Warfare
- hdu 1540 Tunnel Warfare
- hdu 1540 线段树
- hdu 1540 区间合并
- hdu 1540 && poj 2892
- hdu 1540 Tunnel Warfare
- HDU 1540 Tunnel Warfare
- hdu 1540 Tunnel Warfare
- HDU 1540 Tunnel Warfare
- HDU 1540 Tunnel Warfare
- hdu 1540 Tunnel Warfare
- Android缓存:图片缓存管理
- hdu 4498 && 4667
- 开启CSS3.0的学习之旅(一)
- 安装 ssh
- Hibernate实验项目全程跟踪,手把手教你配置Hibernate
- HDU 1540
- 惠普为什么衰败
- Linux学习之道:Crontab 定时任务 命令详解
- shell简单编程——自动ping多台主机,返回结果
- 《C++游戏开发》十六 游戏中的寻路算法(二):迷宫&A*算法基础
- ubuntu远程控制——包括图形界面控制
- SOJ 1036. Crypto Columns
- Android 开发学习手记(二):PullToRefresh如何滚动到最顶部?以及PullToRefresh的实质。
- SOJ题型分类