Codeforces 500B：New Year Permutation（并查集||Floyd+思维）

B. New Year Permutation

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ifAi, 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 1and n 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 the i-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.

Examples

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

Note

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. The i-th element of the permutation p is denoted as pi. The size of the permutation p is denoted as n.

题目大意：给你一个n个数字的序列，然后给你一个01图，比如map[i][j]为1，那么说明之前那个序列的第i个数字能和第j个数字交换顺序。根据这个map01图，将给的序列尽量变换成升序的序列。

解题思路：①并查集：扫一遍图，然后把能交换的数的编号放到一个集合里面，形成多个集合，然后一遍类似于冒泡排序的，每当两个数是一个集合（可交换），且不是升序的，那么交换两数的位置，最后输出即可。

②floyd：将map关系先映射到flag数组里面，然后floyd三重for循环，将可交换的数字编号联系起来，之后还是类似于冒泡排序，扫一遍即可。

代码如下：

并查集：

#include <cstdio>
int n,a[310];
char map[310][310];//存0、1图 
int pre[310];//父节点 
int find(int x)
{
	int r=x;
	while(r!=pre[r])
	{
		r=pre[r];
	}
	int k=x,t;
	while(k!=r)//路径压缩 
	{
		t=pre[k];
		pre[k]=r;
		k=t;
	}
	return r;
}
int main()
{
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&a[i]);//储存初始序列 
	}
	for(int i=0;i<n;i++)//初始化父节点 
	{
		pre[i]=i;
	}
	for(int i=0;i<n;i++)
	{
		scanf("%s",map[i]);
		for(int j=0;j<n;j++)
		{
			if(map[i][j]=='1')//是1，那么a[i]和a[j]能互相交换，把他们放到一个即合理 
			{
				int fx=find(a[i]);
				int fy=find(a[j]);
				if(fx!=fy)
				{
					pre[fx]=fy;
				}
			}
		}
	}
	for(int i=0;i<n;i++)//类似于冒泡排序 
	{
		for(int j=i+1;j<n;j++)
		{
			if(find(a[i])==find(a[j])&&a[i]>a[j])//在一个集合里（可以交换），且顺序不是升序的，那么交换 
			{
				int t=a[i];
				a[i]=a[j];
				a[j]=t;
			}
		}
	}
	for(int i=0;i<n-1;i++)
	{
		printf("%d ",a[i]);
	}
	printf("%d\n",a[n-1]);
	return 0;
}

Floyd：

#include <cstdio>
int a[310];
int flag[310][310];
char map[310][310];
int main()
{
	int n;
	scanf("%d",&n);
	for(int i=0;i<n;i++)
	{
		scanf("%d",&a[i]);
	}
	for(int i=0;i<n;i++)
	{
		scanf("%s",map[i]);
		for(int j=0;j<n;j++)
		{
			if(map[i][j]=='1')//将map的信息先存到flag里 
			{
				flag[i][j]=1;
				flag[j][i]=1;
			}
			else
			{
				flag[i][j]=0;
				flag[j][i]=0;
			}
		}
	}
		for(int k=0;k<n;k++)//Floyd 
		{
			for(int i=0;i<n;i++)
			{
				for(int j=0;j<n;j++)
				{
					if(flag[i][k]==1&&flag[k][j]==1)
					{
						flag[i][j]=1;
					}
				}
			}
		}
		for(int i=0;i<n;i++)
		{
			for(int j=i+1;j<n;j++)
			{
				if(flag[i][j]==1&&a[i]>a[j])//能交换且不是升序的，那么交换 
				{
					int t=a[i];
					a[i]=a[j];
					a[j]=t;
				}
			}
		}
		for(int i=0;i<n-1;i++)
		{
			printf("%d ",a[i]);
		}
		printf("%d\n",a[n-1]);
		return 0;
}