Good Bye 2014 B. New Year Permutation

最新推荐文章于 2022-02-14 13:20:24 发布

Last0rder

最新推荐文章于 2022-02-14 13:20:24 发布

阅读量923

点赞数

分类专栏：暴力

本文链接：https://blog.csdn.net/stl112514/article/details/42918811

版权

暴力专栏收录该内容

17 篇文章 0 订阅

订阅专栏

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 and 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 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 test(s)

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

Output

1 2 3 4 5

Note

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₄).

$\text{[math]}$

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

首先跑一次floyd把所有能够联通的两点标记好，然后跑一次冒泡

#include<map>
#include<string>
#include<cstring>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<queue>
#include<vector>
#include<iostream>
#include<algorithm>
#include<bitset>
#include<climits>
#include<list>
using namespace std;
int p[310];
bool a[310][310];
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>p[i];
	string s;
	for(int i=0;i<n;i++)
	{
		cin>>s;
		for(int j=0;j<n;j++)
			a[i][j]=s[j]-'0';
	}
	for(int k=0;k<n;k++)
		for(int i=0;i<n;i++)
			for(int j=0;j<n;j++)
				a[i][j]|=a[i][k]&a[k][j];
	for(int i=0;i<n;i++)
		for(int j=i+1;j<n;j++)
			if(p[i]>p[j]&&a[i][j])
				swap(p[i],p[j]);
	for(int i=0;i<n;i++)
	{
		if(i)
			cout<<" ";
		cout<<p[i];
	}
}