New Year Permutation

B - New Year Permutation

Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

Submit  Status

Description

User ainta has a permutation p₁, p₂, ..., p_n. As the New Year is coming, he wants to make his permutation as pretty as possible.

Permutation a₁, a₂, ..., a_n is prettier than permutation b₁, b₂, ..., b_n, if and only if there exists an integer k (1 ≤ k ≤ n) where a₁ = b₁, a₂ = b₂, ..., a_k - 1 = b_k - 1 and a_k < b_k 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 p_i and p_j (1 ≤ i, j ≤ n, i ≠ j) if and only if A_i, 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 p₁, p₂, ..., p_n — 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 A_i, 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, A_i, j = A_j, i holds. Also, for all integers i where 1 ≤ i ≤ n, A_i, 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

Input

7
5 2 4 3 6 7 1
0001001
0000000
0000010
1000001
0000000
0010000
1001000

Output

1 2 4 3 6 7 5

Input

5
4 2 1 5 3
00100
00011
10010
01101
01010

Output

1 2 3 4 5

Hint

In the first sample, the swap needed to obtain the prettiest permutation is: (p₁, p₇).

In the second sample, the swaps needed to obtain the prettiest permutation is (p₁, p₃), (p₄, p₅), (p₃, p₄).

A permutation p is a sequence of integers p₁, p₂, ..., p_n, consisting of n distinct positive integers, each of them doesn't exceed n. Thei-th element of the permutation p is denoted as p_i. The size of the permutation p is denoted as n.

矩阵中s[i][j]=1，表示给定的序列中a[i]和a[j]的值可以交换，通过给定的矩阵让给定序列尽量为递增序列

并查集和Floyd的做法是一个意识，将所有能交换的连在一起，直接比较就可以

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int fu[333];
int a[333];
char s[1001][1001];
int findroot(int x)
{
	while(x!=fu[x])
	{
		x=fu[x];
	}
	return x;
}
void Union(int x,int y)
{
	int fx=findroot(x);
	int fy=findroot(y);
	if(fx!=fy)
		fu[fx]=fy;
}
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%d",&a[i]);
	 	fu[i]=i;	
	}
		
	for(int i=0;i<n;i++)
	{
		scanf("%s",&s[i]);
		for(int j=0;j<n;j++)
		{
			if(s[i][j]=='1'){
				Union(a[i],a[j]);
			}
		}
	}
	for(int i=0;i<n;i++)
	{
		for(int j=i+1;j<n;j++)
		{
			if(findroot(a[i])==findroot(a[j])&&a[i]>a[j]){
				int p;
				p=a[i];
				a[i]=a[j];
				a[j]=p;
			}
		}
	}
	for(int i=0;i<n;i++){
		if(i==0)
			printf("%d",a[i]);
		else
			printf(" %d",a[i]);
	}
	return 0;
}