B. New Year Permutation

http://codeforces.com/contest/500/problem/B

并查集

import java.util.Scanner;

public class Main {
    static final int MAX = Integer.MAX_VALUE;
    static int[] f = new int[1000];

    public static void main(String[] args) {
        Scanner io = new Scanner(System.in);
        int n = io.nextInt();

        int[] a = new int[n];
        for (int i = 0; i < n; i++, f[i] = i) a[i] = io.nextInt();

        for (int i = 0, fx, fy; i < n; i++) {
            String s = io.nextLine();
            while (s.length() == 0) s = io.nextLine();
            for (int j = 0; j < s.length(); j++)
                if (s.charAt(j) == '1') {
                    fx = find(i);
                    fy = find(j);
                    f[fx] = fy;
                }
        }

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

        for (int i = 0; i < n; i++) System.out.print(a[i] + " ");
    }

    static int find(int x) {
        return f[x] == x ? x : (f[x] = find(f[x]));
    }

}