結果

問題 No.1266 7 Colors
ユーザー tenten
提出日時 2023-03-22 15:47:04
言語 Java
(openjdk 23)
結果
AC  
実行時間 1,118 ms / 3,000 ms
コード長 4,376 bytes
コンパイル時間 4,920 ms
コンパイル使用メモリ 91,868 KB
実行使用メモリ 93,448 KB
最終ジャッジ日時 2024-09-18 14:55:17
合計ジャッジ時間 20,497 ms
ジャッジサーバーID
（参考情報） 		judge2 / 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();
        boolean[][] enables = new boolean[n][7];
        UnionFindTree uft = new UnionFindTree(n * 7);
        ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
        for (int i = 0; i < n; i++) {
            char[] input = sc.next().toCharArray();
            for (int j = 0; j < 7; j++) {
                enables[i][j] = (input[j] == '1');
                if (input[j] == '1' && input[(j + 1) % 7] == '1') {
                    uft.unite(i * 7 + j, i * 7 + (j + 1) % 7);
                }
            }
            graph.add(new ArrayList<>());
        }
        for (int i = 0; i < m; i++) {
            int a = sc.nextInt() - 1;
            int b = sc.nextInt() - 1;
            for (int j = 0; j < 7; j++) {
                if (enables[a][j] && enables[b][j]) {
                    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 idx = sc.nextInt() - 1;
                int color = sc.nextInt() - 1;
                enables[idx][color] = true;
                if (enables[idx][(color - 1 + 7) % 7]) {
                    uft.unite(idx * 7 + color, idx * 7 + (color - 1 + 7) % 7);
                }
                if (enables[idx][(color + 1) % 7]) {
                    uft.unite(idx * 7 + color, idx * 7 + (color + 1) % 7);
                }
                for (int x : graph.get(idx)) {
                    if (enables[x][color]) {
                        uft.unite(idx * 7 + color, x * 7 + color);
                    }
                }
            } else {
                int idx = sc.nextInt() - 1;
                sc.nextInt();
                sb.append(uft.getCount(idx * 7)).append("\n");
            }
        }
        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 (x == parents[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) {
                parents[yy] = xx;
                counts[xx] += counts[yy];
            }
        }
        
        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