結果

問題 No.1266 7 Colors
ユーザー phsplsphspls
提出日時 2022-11-13 21:43:59
言語 Rust
(1.77.0)
結果
AC  
実行時間 344 ms / 3,000 ms
コード長 3,946 bytes
コンパイル時間 1,434 ms
コンパイル使用メモリ 154,420 KB
実行使用メモリ 38,532 KB
最終ジャッジ日時 2023-10-13 05:47:44
合計ジャッジ時間 10,070 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,352 KB
testcase_01 AC 1 ms
4,348 KB
testcase_02 AC 1 ms
4,352 KB
testcase_03 AC 213 ms
10,736 KB
testcase_04 AC 310 ms
28,328 KB
testcase_05 AC 223 ms
12,324 KB
testcase_06 AC 332 ms
31,376 KB
testcase_07 AC 338 ms
35,348 KB
testcase_08 AC 323 ms
29,164 KB
testcase_09 AC 300 ms
22,980 KB
testcase_10 AC 283 ms
21,004 KB
testcase_11 AC 243 ms
14,600 KB
testcase_12 AC 264 ms
16,504 KB
testcase_13 AC 263 ms
18,560 KB
testcase_14 AC 224 ms
12,060 KB
testcase_15 AC 344 ms
36,000 KB
testcase_16 AC 254 ms
17,004 KB
testcase_17 AC 339 ms
34,448 KB
testcase_18 AC 240 ms
38,532 KB
testcase_19 AC 123 ms
37,808 KB
testcase_20 AC 122 ms
37,940 KB
testcase_21 AC 159 ms
6,156 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `std::collections::HashSet`
 --> Main.rs:1:5
  |
1 | use std::collections::HashSet;
  |     ^^^^^^^^^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: field `n` is never read
 --> Main.rs:5:5
  |
4 | struct UnionFind {
  |        --------- field in this struct
5 |     n: usize,
  |     ^
  |
  = note: `#[warn(dead_code)]` on by default

warning: associated function `chain_cnt` is never used
  --> Main.rs:48:8
   |
48 |     fn chain_cnt(&mut self, i: usize) -> usize {
   |        ^^^^^^^^^

warning: 3 warnings emitted

ソースコード

diff # 

use std::collections::HashSet;


struct UnionFind {
    n: usize,
    parents: Vec<usize>,
    depths: Vec<usize>,
    chains: Vec<usize>,
}

impl UnionFind {
    fn new(n: usize) -> Self {
        UnionFind {
            n: n,
            parents: (0..n).collect(),
            depths: vec![0; n],
            chains: vec![1; n],
        }
    }

    fn equiv(&mut self, a: usize, b: usize) -> bool {
        self.find(a) == self.find(b)
    }
    
    fn unite(&mut self, a: usize, b: usize) {
        if self.equiv(a, b) { return; }
        let x = self.parents[a];
        let y = self.parents[b];
        if self.depths[x] > self.depths[y] {
            self.parents[x] = self.parents[y];
            self.chains[y] += self.chains[x];
        } else {
            self.parents[y] = self.parents[x];
            self.chains[x] += self.chains[y];
            if self.depths[x] == self.depths[y] {
                self.depths[x] += 1;
            }
        }
    }

    fn find(&mut self, a: usize) -> usize {
        if self.parents[a] == a { return a; }
        let p = self.find(self.parents[a]);
        self.parents[a] = p;
        p
    }

    fn chain_cnt(&mut self, i: usize) -> usize {
        let idx = self.find(i);
        self.chains[idx]
    }
}

fn main() {
    let mut nmq = String::new();
    std::io::stdin().read_line(&mut nmq).ok();
    let nmq: Vec<usize> = nmq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nmq[0];
    let m = nmq[1];
    let q = nmq[2];
    let mut uf = UnionFind::new(7*n);
    let mut size = vec![1usize; 7*n];
    let mut colors = vec![vec![false; 7]; n];
    let mut paths = vec![vec![]; n];
    let merge = |left: usize, right: usize, uf: &mut UnionFind, size: &mut Vec<usize>| {
        let pu = uf.find(left);
        let pv = uf.find(right);
        if pu == pv { return; }
        uf.unite(pu, pv);
        if pu == uf.find(pu) {
            size[pu] += size[pv];
            size[pv] = 0;
        } else {
            size[pv] += size[pu];
            size[pu] = 0;
        }
    };
    for i in 0..n {
        let mut s = String::new();
        std::io::stdin().read_line(&mut s).ok();
        let s = s.trim().chars().map(|c| c as usize - '0' as usize).collect::<Vec<_>>();
        for j in 0..7 {
            let idx = (j+1) % 7;
            colors[i][j] = s[j] == 1;
            if s[j] == 1 && s[idx] == 1 {
                merge(i+j*n, i+idx*n, &mut uf, &mut size);
            }
        }
    }
    for _ in 0..m {
        let mut uv = String::new();
        std::io::stdin().read_line(&mut uv).ok();
        let uv: Vec<usize> = uv.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
        let u = uv[0]-1;
        let v = uv[1]-1;
        paths[u].push(v);
        paths[v].push(u);
        for i in 0..7 {
            if colors[u][i] && colors[v][i] {
                merge(u+i*n, v+i*n, &mut uf, &mut size);
            }
        }
    }
    let queries = (0..q).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
            (temp[0], temp[1], temp[2])
        })
        .collect::<Vec<_>>();

    for &(t, x, y) in queries.iter() {
        if t == 1 {
            let x = x-1;
            let y = y-1;
            colors[x][y] = true;
            let pidx = (7+y-1) % 7;
            let nidx = (y+1) % 7;
            if colors[x][pidx] {
                merge(x+y*n, x+pidx*n, &mut uf, &mut size);
            }
            if colors[x][nidx] {
                merge(x+y*n, x+nidx*n, &mut uf, &mut size);
            }
            for &v in paths[x].iter() {
                if colors[v][y] {
                    merge(x + y*n, v + y*n, &mut uf, &mut size);
                }
            }
        } else {
            println!("{}", size[uf.find(x-1)]);
        }
    }
}
0