poj2892 Tunnel Warface
来源:互联网 发布:淘宝商品降价提醒 编辑:程序博客网 时间:2024/05/18 02:50
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!
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 9D 3D 6D 5Q 4Q 5RQ 4RQ 4
Sample Output
1024
Hint
An illustration of the sample input:
OOOOOOOD 3 OOXOOOOD 6 OOXOOXOD 5 OOXOXXOR OOXOOXOR OOXOOOO
Source
平衡树的应用
平衡树中保存所有被炸毁的节点。
对于炸毁和修复操作,直接在平衡树中插入或删除。
对于查询操作,先判断该节点是否被炸毁,如果被炸毁答案为0,否则在平衡树中求出前驱x和后继y,答案为y-x-1。
还有一种方法是二分+树状数组,感觉速度比这个慢就没有写…
#include<iostream>#include<cstdio>#include<cmath>#include<cstring>#include<cstdlib>#include<algorithm>#include<stack>#define F(i,j,n) for(int i=j;i<=n;i++)#define D(i,j,n) for(int i=j;i>=n;i--)#define LL long long#define MAXN 50005#define pa pair<int,int>#define INF 1000000000using namespace std;int n,m,x,tot=0,rt=0,l[MAXN],r[MAXN],rnd[MAXN],v[MAXN];char op;bool f[MAXN];stack<int> st;inline int read(){int ret=0,flag=1;char ch=getchar();while (ch<'0'||ch>'9'){if (ch=='-') flag=-1;ch=getchar();}while (ch>='0'&&ch<='9'){ret=ret*10+ch-'0';ch=getchar();}return ret*flag;}inline void rturn(int &k){int tmp=l[k];l[k]=r[tmp];r[tmp]=k;k=tmp;}inline void lturn(int &k){int tmp=r[k];r[k]=l[tmp];l[tmp]=k;k=tmp;}inline void ins(int &k,int x){if (!k){k=++tot;v[k]=x;l[k]=r[k]=0;rnd[k]=rand();return;}if (x<v[k]) {ins(l[k],x);if (rnd[l[k]]<rnd[k]) rturn(k);}else {ins(r[k],x);if (rnd[r[k]]<rnd[k]) lturn(k);}}inline void del(int &k,int x){if (v[k]==x){if (!l[k]||!r[k]) k=l[k]+r[k];else if (rnd[l[k]]<rnd[r[k]]) {rturn(k);del(k,x);}else {lturn(k);del(k,x);}return;}if (x<v[k]) del(l[k],x);else del(r[k],x);}inline int pre(int k,int x){if (!k) return 0;else if (x<=v[k]) return pre(l[k],x);else {int tmp=pre(r[k],x);return tmp==0?v[k]:tmp;}}inline int suc(int k,int x){if (!k) return n+1;if (x>=v[k]) return suc(r[k],x);else {int tmp=suc(l[k],x);return tmp==n+1?v[k]:tmp;}}inline int getans(int x){if (f[x]) return 0;return suc(rt,x)-pre(rt,x)-1;}int main(){memset(f,false,sizeof(f));n=read();m=read();while (m--){op=getchar();while (op<'A'||op>'Z') op=getchar();if (op=='D') {x=read();f[x]=true;st.push(x);ins(rt,x);}else if (op=='Q') {x=read();printf("%d\n",getans(x));}else {del(rt,st.top());f[st.top()]=false;st.pop();}}}
- poj2892 Tunnel Warface
- POJ2892 Tunnel Warfare
- hdu1540 && POJ2892 Tunnel Warfare
- poj2892 Tunnel Warfare
- poj2892——Tunnel Warfare
- poj2892--Tunnel Warfare(线段树)
- POJ2892 HDU1540 Tunnel Warfare(Splay)
- POJ2892 HDU 1540 Tunnel Warfare, 树状数组
- POJ2892地道战Tunnel Warfare(线段树)
- poj2892 同hdu1540 Tunnel Warfare 线段树
- POJ2892 Tunnel Warfare (平衡树)
- poj2892&&HDU1540 Tunnel Warfare(线段树)
- hdu1540 poj2892 Tunnel Warfare 线段树端点更新 SBT
- poj2892 Tunnel Warfare(数状数组+二分)
- poj2892
- poj2892
- poj2892
- tunnel
- 解决itunes启动后一直显示 正在访问iTunes Store 的问题
- 使用Python开发windows GUI程序入门实例
- 我的思维方式和我的性格
- 冰山
- C#_字符串中的Compare和Equal方法
- poj2892 Tunnel Warface
- Android进程和线程 --消息队列模型--ThreadLocal (3)(2015-12-02 19:41)
- SIFT特征--方向赋值与关键点描述
- 黑马程序员—javaSE—异常
- Android Studio 快捷键整理分享
- IOS 入门之基础控件学习1
- Android 工程图片资源命名禁忌
- uImage、zImage、bzImage、vlinzx区别
- Linux内核与根文件系统的关系