hdu 1512 Monkey King (可并堆)
2017-01-09 09:18
316 查看
Monkey King
Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5405 Accepted Submission(s): 2326
[align=left]Problem Description[/align]
Once in a forest, there lived N aggressive monkeys. At the beginning, they each does things in its own way and none of them knows each other. But monkeys can't avoid quarrelling, and it only happens between two monkeys who does not
know each other. And when it happens, both the two monkeys will invite the strongest friend of them, and duel. Of course, after the duel, the two monkeys and all of there friends knows each other, and the quarrel above will no longer happens between these
monkeys even if they have ever conflicted.
Assume that every money has a strongness value, which will be reduced to only half of the original after a duel(that is, 10 will be reduced to 5 and 5 will be reduced to 2).
And we also assume that every monkey knows himself. That is, when he is the strongest one in all of his friends, he himself will go to duel.
[align=left]Input[/align]
There are several test cases, and each case consists of two parts.
First part: The first line contains an integer N(N<=100,000), which indicates the number of monkeys. And then N lines follows. There is one number on each line, indicating the strongness value of ith monkey(<=32768).
Second part: The first line contains an integer M(M<=100,000), which indicates there are M conflicts happened. And then M lines follows, each line of which contains two integers x and y, indicating that there is a conflict between the Xth monkey and Yth.
[align=left]Output[/align]
For each of the conflict, output -1 if the two monkeys know each other, otherwise output the strongness value of the strongest monkey in all friends of them after the duel.
[align=left]Sample Input[/align]
5
20
16
10
10
4
5
2 3
3 4
3 5
4 5
1 5
[align=left]Sample Output[/align]
8
5
5
-1
10
[align=left]Author[/align]
JIANG, Yanyan
[align=left]Source[/align]
ZOJ 3rd Anniversary Contest
[align=left]Recommend[/align]
linle | We have carefully selected several similar problems for you: 1509 1710 1504 1510 1500
Statistic | Submit | Discuss
|
Note
题解:可并堆
#include<iostream> #include<cstdio> #include<algorithm> #include<cstring> #include<cmath> #define N 100003 using namespace std; int fa ,a ,lch ,rch ,d ; int n,m; int find(int x) { if (fa[x]==x) return x; fa[x]=find(fa[x]); return fa[x]; } int merge(int x,int y) { if (!x) return y; if (!y) return x; if (a[x]<a[y]) swap(x,y); rch[x]=merge(rch[x],y); if (d[lch[x]]<d[rch[x]]) swap(lch[x],rch[x]); d[x]=d[rch[x]]+1; return x; } int solve(int x) { if (!lch[x]&&!rch[x]) { a[x]=a[x]/2; return x; } int t=merge(lch[x],rch[x]); fa[t]=t; fa[x]=x; lch[x]=0; rch[x]=0; a[x]=a[x]/2; int t1=merge(t,x); fa[t]=fa[x]=t1; return t1; } int main() { freopen("a.in","r",stdin); freopen("my.out","w",stdout); while (scanf("%d",&n)!=EOF) { memset(a,0,sizeof(a)); memset(lch,0,sizeof(lch)); memset(rch,0,sizeof(rch)); memset(d,0,sizeof(d)); for (int i=1;i<=n;i++) scanf("%d",&a[i]),fa[i]=i; scanf("%d",&m); for (int i=1;i<=m;i++) { int x,y; scanf("%d%d",&x,&y); int r1=find(x); int r2=find(y); if (r1==r2) { printf("-1\n"); continue; } r1=solve(r1); r2=solve(r2); int t=merge(r1,r2); fa[r1]=fa[r2]=t; printf("%d\n",a[t]); } } }
相关文章推荐
- hdu1512 Monkey King(可并堆插入+删除)
- HDU 1512 Monkey King
- 洛谷P1456 (HDU 1512)Monkey King
- ZOJ 2334 HDU 1512 Monkey King
- hdu1512-Monkey King- 左偏树+并查集
- hdu 1512 Monkey King 左偏树
- HDU 1512 Monkey King(左偏树模板题)
- 【HDU】1512 Monkey King 左偏树
- HDU 1512 Monkey King
- |Hdu 1512|可并堆|并查集|Monkey King
- hdu1512 Monkey King
- HDU 1512 Monkey King(左偏树)
- hdu 1512 Monkey King
- HDU 1512 Monkey King
- HDU 1512 Monkey King(左偏树)
- HDU 1512 Monkey King(左偏树+并查集)
- HDU 1512 Monkey King [可并堆]
- HDU 1512 Monkey King(左偏树+并查集)
- hdu 1512 Monkey King
- hdu 1512 Monkey King