結果

問題 No.1266 7 Colors
ユーザー tenten
提出日時 2023-01-11 18:16:16
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,014 ms / 3,000 ms
コード長 4,570 bytes
コンパイル時間 2,992 ms
コンパイル使用メモリ 85,016 KB
実行使用メモリ 95,480 KB
最終ジャッジ日時 2024-12-22 11:55:34
合計ジャッジ時間 19,849 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 19
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

import java.io.*;
import java.util.*;
import java.util.stream.*;
public class Main {
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int m = sc.nextInt();
        int q = sc.nextInt();
        UnionFindTree uft = new UnionFindTree(n * 7);
        ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
        int[] colors = new int[n];
        for (int i = 0; i < n; i++) {
            char[] inputs = sc.next().toCharArray();
            int prev = -10;
            for (int j = 0; j < 7; j++) {
                if (inputs[j] == '1') {
                    if (prev == j - 1) {
                        uft.unite(i * 7 + prev, i * 7 + j);
                    }
                    prev = j;
                    colors[i] |= (1 << j);
                }
                if (inputs[0] == '1' && inputs[6] == '1') {
                    uft.unite(i * 7, i * 7 + 6);
                }
            }
            graph.add(new ArrayList<>());
        }
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            int mask = (colors[a] & colors[b]);
            for (int j = 0; j < 7; j++) {
                if ((mask & (1 << j)) > 0) {
                    uft.unite(a * 7 + j, b * 7 + j);
                }
            }
            graph.get(a).add(b);
            graph.get(b).add(a);
        }
        StringBuilder sb = new StringBuilder();
        while (q-- > 0) {
            if (sc.nextInt() == 1) {
                int city = sc.nextInt() - 1;
                int add = sc.nextInt() - 1;
                for (int i = 0; i < 7; i++) {
                    if ((colors[city] & (1 << i)) > 0 && (Math.abs(i - add) == 1 || Math.abs(i - add) == 6)) {
                        uft.unite(city * 7 + i, city * 7 + add);
                    }
                }
                colors[city] |= (1 << add);
                for (int x : graph.get(city)) {
                    if ((colors[x] & (1 << add)) > 0) {
                        uft.unite(city * 7 + add, x * 7 + add);
                    }
                }
            } else {
                sb.append(uft.getCount((sc.nextInt() - 1) * 7)).append("\n");
                sc.nextInt();
            }
        }
        System.out.print(sb);
    }
    
    static class UnionFindTree {
        int[] parents;
        int[] counts;
        
        public UnionFindTree(int size) {
            parents = new int[size];
            counts = new int[size];
            for (int i = 0; i < size; i++) {
                parents[i] = i;
                counts[i] = 1;
            }
        }
        
        public int find(int x) {
            if (parents[x] == x) {
                return x;
            } else {
                return parents[x] = find(parents[x]);
            }
        }
        
        public boolean same(int x, int y) {
            return find(x) == find(y);
        }
        
        public void unite(int x, int y) {
            int xx = find(x);
            int yy = find(y);
            if (xx == yy) {
                return;
            }
            parents[xx] = yy;
            counts[yy] += counts[xx];
        }
        
        public int getCount(int x) {
            return counts[find(x)];
        }
    }
}
class Utilities {
    static String arrayToLineString(Object[] arr) {
        return Arrays.stream(arr).map(x -> x.toString()).collect(Collectors.joining("\n"));
    }
    
    static String arrayToLineString(int[] arr) {
        return String.join("\n", Arrays.stream(arr).mapToObj(String::valueOf).toArray(String[]::new));
    }
}
class Scanner {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() throws Exception {
        
    }
    
    public int nextInt() throws Exception {
        return Integer.parseInt(next());
    }
    
    public long nextLong() throws Exception {
        return Long.parseLong(next());
    }
    
    public double nextDouble() throws Exception {
        return Double.parseDouble(next());
    }
    
    public int[] nextIntArray() throws Exception {
        return Stream.of(br.readLine().split(" ")).mapToInt(Integer::parseInt).toArray();
    }
    
    public String next() throws Exception {
        while (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }
    
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0