codeforces #500B# New Year Permutation-CSDN博客

本文链接：https://blog.csdn.net/u012762625/article/details/42615459

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

$\text{[math]}$

A permutation p is a sequence of integers p1, p2, ..., pn, consisting of n distinct positive integers, each of them doesn't exceed n. Thei-th element of the permutation p is denoted as pi. The size of the permutation p is denoted as n.

解题报告：题目给出交换的矩阵，a[i][j] = 1表示可以i可以交换和j交换。让交换后的序列的“字典序”最小，求出这个序列。这题就是并查集求出某个位置的数字都可以和哪些位置交换，当然数据比较小，用floyed也是很好的方法。后面交换就是把小的交换到前边即可。

/********************************/
/*Problem:		codeforces500B  */
/*User: 	    shinelin	    */
/*Memory: 	    400 KB		    */
/*Time: 	     46 ms		    */
/*Language: 	 GNU C++        */
/********************************/
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <cstring>
#include <string>
#include <list>
#include <map>
#include <queue>
#include <deque>
#include <stack>
#include <vector>
#include <set>
#include <algorithm>
#include <cmath>
using namespace std;

#define INF 0x7fffffff
#define LL long long

int matrix[305][305];
int a[305];

int main()
{
    int n;
    char c;
    scanf("%d", &n);
    for (int i = 0; i < n; i ++)
    {
        scanf("%d", a + i);
    }
    getchar();
    for (int i = 0; i < n; i ++)
    {
        for (int j = 0; j < n; j ++)
        {
            scanf("%c", &c);
            matrix[i][j] = c - '0';
        }
        getchar();
    }
    for (int k = 0; k < n; k ++)
    {
        for (int i = 0; i < n; i ++)
        {
            for (int j = 0; j < n; j ++)
            {
                matrix[i][j] = (matrix[i][k] && matrix[k][j]) == 1 ? 1 : matrix[i][j];
            }
        }
    }
    for (int i = 0; i < n; i ++)
    {
        int Min = a[i];
        int u = i;
        for (int j = i + 1; j < n; j ++)
        {
            if(Min > a[j] && matrix[i][j])
            {
                Min = a[j];
                u = j;
            }
        }
        swap(a[i], a[u]);
    }
    for (int i = 0; i < n - 1; i ++)
    {
        printf("%d ", a[i]);
    }
    printf("%d\n", a[n-1]);
    return 0;
}

另外附上别人的代码，好的地方还是要学习的。

//HUST
#include<cstdio>
#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
using namespace std;
const int N = 310;
string s;
int a[N], n;
bool sta[N][N] = {0};

int main(){
    scanf("%d", &n);
    for(int i = 0; i < n; ++i){
        scanf("%d", &a[i]);
    }

    for(int i = 0; i < n; ++i){
        cin >> s;
        for(int j = 0; j < n; ++j){
            sta[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){
                sta[i][j] |= sta[i][k] & sta[k][j];
            }
        }
    }

    for(int i = 0; i < n; ++i){
        for(int j = i + 1; j < n; ++j){
            if(sta[i][j] && (a[i] > a[j])){
                int tmp = a[i];
                a[i] = a[j];
                a[j] = tmp;
            }
        }
    }

    for(int i = 0; i < n; ++i){
        printf("%d ", a[i]);
    }
    return 0;
}