CodeForces 500B （Floyd算法）

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

Status
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.

题意：给你 n 个数，和一个 n * n 的矩阵，矩阵里面的数代表位置，（1，2）表示第一个和第二个位置的数可以交换，问你根据矩阵，让最小的数在前面，并输出
题解：先用Floyd算法把所有可以交换的数标记。然后从第一个位置开始，从小到大判断能否交换，可以则交换，依次交换每一个最小的数

#include <cstdio>
#include <cstring>
#include <vector>
#include <algorithm>
using namespace std;
#define M 530
#define MEM(a, b) memset(a, b, sizeof(a))

bool vis[M];
char mp[M][M];

int main()
{
    int n, al[M], ans[M], pos[M];
    while(scanf("%d", &n) != EOF)
    {
        for(int i=1; i<=n; i++)
        {
            scanf("%d", &al[i]);
            pos[al[i]] = i;//离散化，将数和位置的储存变一下 
            //于是我们可以根据位置找到数，根据数找到位置
        }
        for(int i=1; i<=n; i++)
        {
            scanf("%s", mp[i]+1);
            mp[i][i] = '1';//自己可以和自己交换 
        }
        for(int k=1; k<=n; k++)//Floyd算法，连接所有可以相连的点 
        {
            for(int i=1; i<=n; i++)
            {
                for(int j=1; j<=n; j++)
                {
                    if(mp[i][k] == '1' && mp[k][j] == '1')
                    {
                        mp[i][j] = '1';
                    }
                }
            }
        }
        MEM(vis, 0);
        for(int i=1; i<=n; i++)// i 表示位置 
        {
            for(int j=1; j<=n; j++)// j 表示数 , 从小到大来排序 
            {
                if(!vis[j] && mp[i][pos[j]] == '1')
                {
                    ans[i] = j;
                    vis[j] = 1;//标记的是已经排过序的数 
                    pos[al[i]] = pos[j];
                    pos[j] = i;
                    break;
                }
            }
        }
        printf("%d", ans[1]);
        for(int i=2; i<=n; i++)
        {
            printf(" %d", ans[i]);
        }
        printf("\n");

    }
    return 0;
}