【codeforces 510 B + floyd】
来源:互联网 发布:php女程序员 编辑:程序博客网 时间:2024/04/29 17:26
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 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.
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: (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.
#include<cstdio>#include<cstring>using namespace std;int mapp[311][311];int ma[311];char st[311][311];int main(){ int n,i,j,kl,pl,ml; scanf("%d",&n); for(i = 1 ; i <= n ; i++) scanf("%d",&ma[i]); memset(mapp,0,sizeof(mapp)); for(i = 1 ;i <= n; i++) { scanf("%s",st[i]); for(j = 0 ; j < n ; j++) { if(st[i][j] == '1') mapp[j+1][i] = mapp[i][j+1] = 1; } } for(kl = 1 ; kl <= n ; kl++) for( i = 1 ; i <= n ; i++) { if(mapp[i][kl] ==0) continue; for(j = 1 ; j <= n ; j++) if(mapp[kl][j]) mapp[i][j] = 1; } for(i = 1 ; i <= n ; i++) for(j = i + 1 ; j <= n ; j++) if(mapp[i][j] && ma[i] > ma[j]) { kl = ma[i]; ma[i] = ma[j]; ma[j] = kl; } for(i = 1 ; i < n ; i++) printf("%d ",ma[i]); printf("%d\n",ma[n]); return 0;}
- 【codeforces 510 B + floyd】
- Codeforces 295B floyd
- CodeForces 500B (Floyd算法)
- 【codeforces 295B】Greg and Graph ( floyd )
- [Codeforces 295B]Greg and Graph(Floyd)
- codeforces 295B B. Greg and Graph(floyd+dp)
- CodeForces 295B - Greg and Graph Floyd的巧妙应用
- 【Floyd】【CF】CodeForces 301B Yaroslav and Time
- 【CodeForces】295B Greg and Graph 离线算法 Floyd
- CodeForces 500 B. New Year Permutation(贪心+Floyd)
- Codeforces 505B __Mr. Kitayuta's Colorful Graph(floyd)
- CodeForces - 295B D - Greg and Graph(floyd算法)
- Codeforces 500B New Year Permutation Floyd算法+贪心
- codeforces 510B dfs
- 【CodeForces 510B 】
- CodeForces 500B New Year Permutation (Floyd判断通路是否存在)(贪心)
- Codeforces 500B:New Year Permutation(并查集||Floyd+思维)
- 【Goodbye2014】Codeforces 500B New Year Permutation【贪心+Floyd传递闭包】
- 23种设计模式(Java)--- 持续更新
- iOS 网络请求中Json当参数
- 第四周项目3—单链表的应用 【2】连接
- gcc/g++版本转换
- 数据结构实验之链表二:逆序建立链表
- 【codeforces 510 B + floyd】
- 学点HTTP知识
- HTTP协议详解
- ajaxFileUpload上传文件
- 计算memcache中搜索次数并加以操作
- 第四周项目5-猴子选大王
- maven初识
- libev多线程使用例
- unity中为mecanim动画动态添加AnimationEvent