Tunnel Warfare POJ - 2892(SET)
来源:互联网 发布:淘宝高马二溪茶怎么样 编辑:程序博客网 时间:2024/06/04 17:48
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!
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.
Output
Output the answer to each of the Army commanders’ request in order on a separate line.
Sample Input
7 9
D 3
D 6
D 5
Q 4
Q 5
R
Q 4
R
Q 4
Sample Output
1
0
2
4
Hint
An illustration of the sample input:
OOOOOOO
D 3 OOXOOOO
D 6 OOXOOXO
D 5 OOXOXXO
R OOXOOXO
R OOXOOOO
查询每个点的连通数即与他相连的O的数量+1,只需要找到其往左第一个X和往右第一个X,然后求差值-1,注意边界。用set处理很方便。
#include<iostream>#include<stdio.h>#include<algorithm>#include<string.h>#include<string>#include<map>#include<set>#include<vector>using namespace std;bool p[50005];int d[50005];int n,m;int dnum;set<int> s;int main(){ scanf("%d%d",&n,&m); dnum=0; string str; int num; for(int i=1;i<=n;i++){p[i]=1;} for(int i=0;i<m;i++){ cin>>str; if(str=="D"){scanf("%d",&num); d[dnum++]=num; s.insert(num); p[num]=0; } else if(str=="Q"){ scanf("%d",&num); if(p[num]==0){printf("0\n");} else{ set<int>::iterator it=s.lower_bound(num); int ans=n+1; if(it!=s.end()){ans=(*it);} if(it!=s.begin()){ it--; ans-=(*it); } ans--; printf("%d\n",ans); } } else{ dnum--; p[d[dnum]]=1; s.erase(s.find(d[dnum])); } }return 0;}
- Tunnel Warfare POJ - 2892(SET)
- POJ 2892Tunnel Warfare splay或set
- poj 2892 Tunnel Warfare
- poj 2892 Tunnel Warfare
- poj 2892 Tunnel Warfare
- poj 2892 Tunnel Warfare
- POJ 2892 Tunnel Warfare
- poj 2892 Tunnel Warfare
- POJ 2892 Tunnel Warfare
- POJ 2892 Tunnel Warfare
- poj 2892Tunnel Warfare
- POJ-2892 Tunnel Warfare
- Poj 2892 Tunnel Warfare
- POJ 2892 Tunnel Warfare
- POJ 2892 Tunnel Warfare
- POJ 2892 Tunnel Warfare
- poj 2892 Tunnel Warfare
- poj 2892 Tunnel Warfare(线段树)
- PAT甲级练习1018. Public Bike Management (30)
- GeoHash核心原理解析
- 2017年2月16日 第三天
- LeetCode #3. Longest Substring Without Repeating Characters
- 资源同步
- Tunnel Warfare POJ - 2892(SET)
- jquery的ajax
- requestWindowFeature(Window.FEATURE_NO_TITLE)无效解决方法
- 使用SVN标准目录结构进行项目开发
- iOS小数去除末位无效零问题
- java并发:内置锁 synchronized
- kube-proxy源码分析
- 常见算法问题之最长公共子串问题(Longest common substring problem)
- SDN开发实战(1)-透明HTTP代理[Openflow+floodlight]