ZOJ 3204 Connect them

Connect them

Time Limit: 1 Second      Memory Limit: 32768 KB

You have n computers numbered from 1 to n and you want to connect them to make a small local area network (LAN). All connections are two-way (that is connecting computers i and j is the same as connecting computers j and i). The cost of connecting computer i and computer j is cij. You cannot connect some pairs of computers due to some particular reasons. You want to connect them so that every computer connects to any other one directly or indirectly and you also want to pay as little as possible.

Given n and each cij , find the cheapest way to connect computers.

Input

There are multiple test cases. The first line of input contains an integer T (T <= 100), indicating the number of test cases. Then T test cases follow.

The first line of each test case contains an integer n (1 < n <= 100). Then n lines follow, each of which contains n integers separated by a space. The j-th integer of the i-th line in these n lines is cij, indicating the cost of connecting computers i and j (cij = 0 means that you cannot connect them). 0 <= cij <= 60000, cij = cjicii = 0, 1 <= ij <= n.

Output

For each test case, if you can connect the computers together, output the method in in the following fomat:

i1 j1 i1 j1 ......

where ik ik (k >= 1) are the identification numbers of the two computers to be connected. All the integers must be separated by a space and there must be no extra space at the end of the line. If there are multiple solutions, output the lexicographically smallest one (see hints for the definition of "lexicography small") If you cannot connect them, just output "-1" in the line.

Sample Input

```2
3
0 2 3
2 0 5
3 5 0
2
0 0
0 0```

Sample Output

```1 2 1 3
-1```

Hints: A solution A is a line of p integers: a1a2, ...ap. Another solution B different from A is a line of q integers: b1b2, ...bq. A is lexicographically smaller than B if and only if: (1) there exists a positive integer r (r <= pr <= q) such that ai = bi for all 0 < i < r and ar < br OR

(2) p < q and ai = bi for all 0 < i <= p

```#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
#include <math.h>
#include <stdio.h>

using namespace std;
const int INF=1e5;
struct Node
{
int x;int y;
int value;
}a;
int cmp(Node a,Node b)
{
if(a.value==b.value)
{
if(a.x==b.x)
{
return a.y<b.y;
}
return a.x<b.x;
}
else
return a.value<b.value;
}
struct node
{
int x;
int y;
}ans[INF+5];
int cmp2(node a,node b)
{
if(a.x==b.x)
return a.y<b.y;
else
return a.x<b.x;
}
int n;
int father[INF+5];
int find(int x)
{
if(father[x]!=x)
father[x]=find(father[x]);
return father[x];
}

int main()
{
int t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
int tot=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[++tot].value);
a[tot].x=i;
a[tot].y=j;
if(a[tot].value==0)
a[tot].value=INF;
}
}
sort(a+1,a+tot+1,cmp);
for(int i=1;i<=n;i++)
father[i]=i;
int cot=0;
for(int i=1;i<=tot;i++)
{
if(a[i].value==INF)
continue;
int xx=find(a[i].x);
int yy=find(a[i].y);
if(xx!=yy)
{
father[xx]=yy;
ans[++cot].x=a[i].x;
ans[cot].y=a[i].y;
}
}
int root=find(1);
bool res=true;
for(int i=2;i<=n;i++)
{
find(i);
if(father[i]!=root)
res=false;
}
if(!res)
printf("-1\n");
else
{
sort(ans+1,ans+1+cot,cmp2);
for(int i=1;i<=cot;i++)
{
if(i==cot)
printf("%d %d\n",ans[i].x,ans[i].y);
else
printf("%d %d ",ans[i].x,ans[i].y);
}
}

}
return 0;
}```

0 条评论

相关文章

4324

2757

POJ 3278 Catch That Cow(BFS,板子题)

Catch That Cow Time Limit: 2000MS Memory Limit: 65536K Total Submissions...

2975

1693

Leetcode 154 Find Minimum in Rotated Sorted Array II

Follow up for "Find Minimum in Rotated Sorted Array": What if duplicates are a...

1856

3153

2096

AtCoder Beginner Contest 069【A，水，B，水，C，数学，D，暴力】

A - K-City ---- Time limit : 2sec / Memory limit : 256MB Score : 100 points Prob...

5144

842

LeetCode-1- Two Sum

Given an array of integers, return indices of the two numbers such that they add...

2948 