Description
User ainta has a permutation p1, p2, ..., pn. As the New Year is coming, he wants to make his permutation as pretty as possible.
Permutation a1, a2, ..., an is prettier than permutation b1, b2, ..., bn, if and only if there exists an integer k (1 ≤ k ≤ n) where a1 = b1, a2 = b2, ..., ak - 1 = bk - 1 and ak < bk all holds.
As known, permutation p is so sensitive that it could be only modified by swapping two distinct elements. But swapping two elements is harder than you think. Given an n × n binary matrix A, user ainta can swap the values of pi and pj (1 ≤ i, j ≤ n, i ≠ j) if and only if Ai, j = 1.
Given the permutation p and the matrix A, user ainta wants to know the prettiest permutation that he can obtain.
Input
The first line contains an integer n (1 ≤ n ≤ 300) — the size of the permutation p.
The second line contains n space-separated integers p1, p2, ..., pn — the permutation p that user ainta has. Each integer between 1 andn occurs exactly once in the given permutation.
Next n lines describe the matrix A. The i-th line contains n characters '0' or '1' and describes the i-th row of A. The j-th character of thei-th line Ai, j is the element on the intersection of the i-th row and the j-th column of A. It is guaranteed that, for all integers i, j where 1 ≤ i < j ≤ n, Ai, j = Aj, i holds. Also, for all integers i where 1 ≤ i ≤ n, Ai, i = 0 holds.
Output
In the first and only line, print n space-separated integers, describing the prettiest permutation that can be obtained.
Sample Input
7 5 2 4 3 6 7 1 0001001 0000000 0000010 1000001 0000000 0010000 1001000
1 2 4 3 6 7 5
5 4 2 1 5 3 00100 00011 10010 01101 01010
1 2 3 4 5
Hint
In the first sample, the swap needed to obtain the prettiest permutation is: (p1, p7).
In the second sample, the swaps needed to obtain the prettiest permutation is (p1, p3), (p4, p5), (p3, p4).
A permutation p is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Thei-th element of the permutation p is denoted as pi. The size of the permutation p is denoted as n.
并查集也能写,只是以前对floyd算法理解不太到位加深一下理解,就是把所有相关联的数连在一起,从第一个数开始遍历求与其直接或间接关联的数的最小值并与其交换。应用到了谈心思想。
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N = 303;
int a[N],map[N][N];
int n;
void floyd() {
for(int k=0; k<n; k++) {
for(int i=0; i<n; i++) {
for(int j=0; j<n; j++) {
map[i][j]=(map[i][k]&&map[k][j])?1:map[i][j];
}
}
}
}
int main() {
while(scanf("%d",&n)!=EOF) {
memset(map,0,sizeof(map));
for(int i=0; i<n; i++) {
scanf("%d",&a[i]);
}
char c;
for(int i=0; i<n; i++) {
getchar();
for(int j=0; j<n; j++) {
scanf("%c",&c);
map[i][j]=c-'0';
}
}
floyd();
for(int i=0; i<n; i++) {
int cnt=a[i],k=i;
for(int j=i+1; j<n; j++) {
if(map[i][j]&&cnt>a[j]) {
cnt=a[j];
k=j;
}
}
swap(a[i],a[k]);
}
for(int i=0; i<n; i++) {
if(i==n-1)
printf("%d\n",a[i]);
else
printf("%d ",a[i]);
}
}
return 0;
}