Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 13352 | Accepted: 4674 |
Description
Windy has a country, and he wants to build an army to protect his country. He has picked up N girls and M boys and wants to collect them to be his soldiers. To collect a soldier without any privilege, he must pay 10000 RMB. There are some relationships between girls and boys and Windy can use these relationships to reduce his cost. If girl x and boy y have a relationship d and one of them has been collected, Windy can collect the other one with 10000-d RMB. Now given all the relationships between girls and boys, your assignment is to find the least amount of money Windy has to pay. Notice that only one relationship can be used when collecting one soldier.
Input
The first line of input is the number of test case.
The first line of each test case contains three integers, N, M and R.
Then R lines followed, each contains three integers xi, yi and di.
There is a blank line before each test case.
1 ≤ N, M ≤ 10000
0 ≤ R ≤ 50,000
0 ≤ xi < N
0 ≤ yi < M
0 < di < 10000
Output
Sample Input
2 5 5 8 4 3 6831 1 3 4583 0 0 6592 0 1 3063 3 3 4975 1 3 2049 4 2 2104 2 2 781 5 5 10 2 4 9820 3 2 6236 3 1 8864 2 4 8326 2 0 5156 2 0 1463 4 1 2439 0 4 4373 3 4 8889 2 4 3133
Sample Output
7107154223
这道题用Keruskal的好处就在于处理重边,然后我之前还在想,怎么最后处理出答案呢?单个点的find和根节点的find一样岂不是
GG,但这是为动脑子的后果,cin会TL
#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<algorithm> using namespace std; int T; int N,M,R; class Edge { public: int from; int to; int value; }; Edge grap[50001]; bool cmp(Edge a,Edge b) { return a.value > b.value; } int pre[30001]; int find(int k) { int r=k; while(pre[r]!=r) r=pre[r]; int x=k,y; while(pre[x]!=r) { y=pre[x]; pre[x]=r; x=y; } return r; } void union_(int a,int b) { int xx=find(a); int yy=find(b); if(xx!=yy) { pre[xx]=yy; } } int keruskal() { int i,j; int sum=0; for(i=0;i<R;i++) { int aa,bb; aa=find(grap[i].from); bb=find(grap[i].to); if(aa!=bb) { sum+=grap[i].value; union_(aa,bb); } } return sum; } int main() { cin>>T; int i,j; while(T--) { scanf("%d%d%d",&N,&M,&R); for(i=0;i<=30000;i++) pre[i]=i; for(i=0;i<R;i++) { int u,v,d; scanf("%d%d%d",&u,&v,&d); grap[i].from=u; grap[i].to=v+N; grap[i].value=d; } sort(grap,grap+R,cmp); printf("%d\n",(N+M)*10000-keruskal()); } return 0; }