ZOJ Problem Set - 3261 Connections in Galaxy War(并查集)
来源:互联网 发布:苹果手机越狱助手软件 编辑:程序博客网 时间:2024/06/04 18:31
In order to strengthen the defense ability, many stars in galaxy allied together and built many bidirectional tunnels to exchange messages. However, when the Galaxy War began, some tunnels were destroyed by the monsters from another dimension. Then many problems were raised when some of the stars wanted to seek help from the others.
In the galaxy, the stars are numbered from 0 to N-1 and their power was marked by a non-negative integer pi. When the star A wanted to seek help, it would send the message to the star with the largest power which was connected with star A directly or indirectly. In addition, this star should be more powerful than the star A. If there were more than one star which had the same largest power, then the one with the smallest serial number was chosen. And therefore, sometimes star A couldn't find such star for help.
Given the information of the war and the queries about some particular stars, for each query, please find out whether this star could seek another star for help and which star should be chosen.
Input
There are no more than 20 cases. Process to the end of file.
For each cases, the first line contains an integer N (1 <= N <= 10000), which is the number of stars. The second line contains N integers p0, p1, ... , pn-1 (0 <= pi <= 1000000000), representing the power of the i-th star. Then the third line is a single integer M (0 <= M <= 20000), that is the number of tunnels built before the war. Then M lines follows. Each line has two integers a, b (0 <= a, b <= N - 1, a != b), which means star a and star bhas a connection tunnel. It's guaranteed that each connection will only be described once.
In the (M + 2)-th line is an integer Q (0 <= Q <= 50000) which is the number of the information and queries. In the following Q lines, each line will be written in one of next two formats.
"destroy a b" - the connection between star a and star b was destroyed by the monsters. It's guaranteed that the connection between star a and star b was available before the monsters' attack.
"query a" - star a wanted to know which star it should turn to for help
There is a blank line between consecutive cases.
Output
For each query in the input, if there is no star that star a can turn to for help, then output "-1"; otherwise, output the serial number of the chosen star.
Print a blank line between consecutive cases.
Sample Input
210 2010 15query 0query 1destroy 0 1query 0query 1
Sample Output
1-1-1-1
Author: MO, Luyi
Source: ZOJ Monthly, November 2009
有删边操作,倒着处理,然后输出。这题的坑点在:建图时的边a->b,删边时可能是b->a!
#include<cstdio>#include<map>#include<queue>#include<cstring>#include<iostream>#include<algorithm>#include<vector>#include<list>#include<set>#include<cmath>using namespace std;const int maxn = 1e5 + 5;const int INF = 1e9;const double eps = 1e-6;typedef unsigned long long ULL;typedef long long LL;typedef pair<int, int> P;#define fi first#define se secondint fa[maxn], val[maxn];struct Ins{ string s; int x, y;};Ins ins[maxn];P edge[maxn];map<P, int> M;int Find(int x){return x==fa[x]?x:fa[x]=Find(fa[x]);}void Union(int x, int y){ int X = Find(x); int Y = Find(y); if(X != Y){ int maxx = val[X]; int maxy = val[Y]; if(maxx < maxy || ((maxx==maxy) && X>Y)){ fa[X] = Y; } else fa[Y] = X; }}vector<int> ans;int main(){ int n, kase = 0; while(scanf("%d", &n) != EOF){ if(kase) puts(""); kase++; for(int i = 0;i < n;i++) scanf("%d", &val[i]); int m; scanf("%d", &m); for(int i = 0;i < m;i++){ int x, y; scanf("%d%d", &x, &y); edge[i] = P(x, y); } M.clear(); int q; scanf("%d", &q); for(int i = 0;i < q;i++){ string s; cin >> s; int x, y = 0; if(s == "query"){ scanf("%d", &x); ins[i] = (Ins){s, x, y}; } else{ scanf("%d%d", &x, &y); ins[i] = (Ins){s, x, y}; M[P(x, y)] = 1; } } for(int i = 0;i < n;i++){ fa[i] = i; } for(int i = 0;i < m;i++){ int x = edge[i].fi; int y = edge[i].se; if(M.count(P(x, y))==0 && M.count(P(y, x))==0){ Union(x, y); } } ans.clear(); for(int i = q-1;i >= 0;i--){ int x = ins[i].x; int y = ins[i].y; if(ins[i].s == "query"){ int X = Find(x); if(val[X] == val[x]){ ans.push_back(-1); } else{ ans.push_back(X); } } else{ Union(x, y); } } reverse(ans.begin(), ans.end()); for(int i = 0;i < ans.size();i++){ cout << ans[i] << endl; } } return 0;}/*51 2 3 4 530 12 42 35query 0query 1destroy 3 2query 2query 4*/
- ZOJ Problem Set - 3261 Connections in Galaxy War(并查集)
- ZOJ 3261 Connections in Galaxy War(并查集)
- zoj 3261 Connections in Galaxy War(逆向并查集)
- ZOJ 3261 Connections in Galaxy War【并查集】
- ZOJ 3261 Connections in Galaxy War (并查集)
- zoj 3261 - Connections in Galaxy War(并查集)
- ZOJ 3261 Connections in Galaxy War 并查集
- Zoj 3261 Connections in Galaxy War【逆序并查集】
- ZOJ-3261-Connections in Galaxy War [逆向并查集]
- zoj Connections in Galaxy War(逆向并查集)
- Zoj 3261 Connections in Galaxy War (逆向并查集)
- zoj 3261 Connections in Galaxy War(并查集+离线逆向操作)
- ZOJ-3261(Connections in Galaxy War)——并查集
- ZOJ 3261 Connections in Galaxy War (离线处理+逆向并查集)
- Zoj 3563 Connections in Galaxy War 逆向并查集
- Connections in Galaxy War并查集+set+脑洞
- [并查集+路径压缩]zoj 3261:Connections in Galaxy War
- zoj 3261 Connections in Galaxy War 删边并查集模板
- (六) 系统数据文件和信息
- bash的环境配置文件
- 终端命令
- 刚接触java,利用一个下午的时间来写了一个简单的日历程序,请多多指教!
- PickerView 的使用方法
- ZOJ Problem Set - 3261 Connections in Galaxy War(并查集)
- Ubuntu环境变量PATH设置
- poj3253Fence Repair
- 第十一周项目1输出星号图
- Mysql存储过程
- PhoneGap移动开发框架简介
- 黄金大米负责人:最快4年后引进中国 欧美不需要(1)
- python 学习笔记2
- 反编译工具Reflector ILSpy