Codeforces 500B New Year Permutation [贪心]
2016-10-11 08:42
603 查看
B. New Year Permutation
time limit per test2 seconds
memory limit per test256 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 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 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 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.
给出可以交换的位置(i,j),传递关系后从第一位贪心选择可以交换到的最小的数即可。
time limit per test2 seconds
memory limit per test256 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 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 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 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.
给出可以交换的位置(i,j),传递关系后从第一位贪心选择可以交换到的最小的数即可。
#include<iostream> #include<cstdio> #include<cstring> #include<cstdlib> #include<cmath> #include<vector> #include<queue> #include<stack> #include<map> #include<set> #include<string> #include<iomanip> #include<ctime> #include<climits> #include<cctype> #include<algorithm> #define AUTO "%I64d" using namespace std; #define smax(x,tmp) x=max((x),(tmp)) #define smin(x,tmp) x=min((x),(tmp)) #define maxx(x1,x2,x3) max(max(x1,x2),x3) #define minn(x1,x2,x3) min(min(x1,x2),x3) const int INF=0x3f3f3f3f; const int maxn = 305; bool g[maxn][maxn]; int perm[maxn]; int n; int main() { #ifndef ONLINE_JUDGE freopen("perm.in","r",stdin); freopen("perm.out","w",stdout); #endif scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%d",perm+i); char ch; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { ch = getchar(); while(!isdigit(ch)) ch = getchar(); g[i][j] = (ch=='1'); } for(int k=1;k<=n;k++) for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) g[i][j] |= g[i][k]&&g[k][j]; for(int i=1;i<n;i++) { int pos = i; for(int j=i+1;j<=n;j++) if(g[i][j]) if(perm[j] < perm[pos]) pos = j; if(i^pos) swap(perm[i],perm[pos]); } for(int i=1;i<n;i++) printf("%d ",perm[i]); printf("%d",perm ); return 0; }
相关文章推荐
- codeforces 158B Taxi(贪心小水题)
- Codeforces 798D Mike and distribution(二维贪心)
- CodeForces - 803C Maximal GCD(贪心)
- Codeforces 472C Design Tutorial: Make It Nondeterministic【贪心】
- 【CodeForces】508C - Anya and Ghosts(贪心 & 模拟)
- codeforces 3B Lorry 贪心
- Codeforces 424 B Megacity【贪心】
- Codeforces 353C Find Maximum【贪心】
- codeforces 679B Bear and Tower of Cubes(贪心+dfs)
- codeforces 349C Mafia [贪心]/[二分答案]
- Codeforces 788A Functions again - 贪心
- codeforces 709C C. Letters Cyclic Shift(贪心)
- Codeforces 635E Package Delivery【贪心】
- CodeForces 486C Palindrome Transformation(贪心)
- CodeForces 810B Summer sell-off 【贪心】【排序】
- CodeForces - 853A Planning(贪心)
- Codeforces 551C - GukiZ hates Boxes(二分加贪心)
- Codeforces 659C Tanya and Toys 【贪心】
- 【Codeforces 735 C Tennis Championship】+ 贪心
- codeforces 797C - Minimal string 贪心