結果

問題 No.1266 7 Colors
ユーザー fukafukatanifukafukatani
提出日時 2020-10-23 23:45:55
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 320 ms / 3,000 ms
コード長 4,300 bytes
コンパイル時間 12,934 ms
コンパイル使用メモリ 401,696 KB
実行使用メモリ 34,008 KB
最終ジャッジ日時 2024-07-21 13:46:51
合計ジャッジ時間 19,556 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 239 ms
10,172 KB
testcase_04 AC 299 ms
24,520 KB
testcase_05 AC 243 ms
11,412 KB
testcase_06 AC 303 ms
27,056 KB
testcase_07 AC 317 ms
30,520 KB
testcase_08 AC 301 ms
25,168 KB
testcase_09 AC 282 ms
20,364 KB
testcase_10 AC 278 ms
18,768 KB
testcase_11 AC 252 ms
13,240 KB
testcase_12 AC 261 ms
15,092 KB
testcase_13 AC 262 ms
16,596 KB
testcase_14 AC 249 ms
11,448 KB
testcase_15 AC 319 ms
31,284 KB
testcase_16 AC 267 ms
15,504 KB
testcase_17 AC 320 ms
29,572 KB
testcase_18 AC 245 ms
34,008 KB
testcase_19 AC 145 ms
33,216 KB
testcase_20 AC 144 ms
33,220 KB
testcase_21 AC 171 ms
6,940 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `i`
  --> src/main.rs:26:9
   |
26 |     for i in 0..n {
   |         ^ help: if this is intentional, prefix it with an underscore: `_i`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `i`
  --> src/main.rs:40:9
   |
40 |     for i in 0..q {
   |         ^ help: if this is intentional, prefix it with an underscore: `_i`

warning: method `same` is never used
   --> src/main.rs:137:8
    |
118 | impl UnionFindTree {
    | ------------------ method in this implementation
...
137 |     fn same(&mut self, x: usize, y: usize) -> bool {
    |        ^^^^
    |
    = note: `#[warn(dead_code)]` on by default

ソースコード

diff # 

#![allow(unused_imports)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;
use std::ops::Bound::*;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn get_index(i: usize, color: usize) -> usize {
    7 * i + color
}

fn main() {
    let v = read_vec::<usize>();
    let (n, m, q) = (v[0], v[1], v[2]);
    let mut s = vec![];
    for i in 0..n {
        let ss = read::<String>();
        s.push(ss);
    }

    let mut edges = vec![vec![]; n];
    for _ in 0..m {
        let v = read_vec::<usize>();
        let (u, v) = (v[0] - 1, v[1] - 1);
        edges[u].push(v);
        edges[v].push(u);
    }

    let mut queries = vec![];
    for i in 0..q {
        let v = read_vec::<usize>();
        let (k, x, y) = (v[0], v[1], v[2]);
        queries.push((k, x, y));
    }

    let mut uft = UnionFindTree::new(n * 7);

    let mut flags = vec![vec![]; n];
    for (i, ss) in s.into_iter().enumerate() {
        let ss = ss.chars().collect::<Vec<_>>();
        flags[i] = (0..7).map(|x| ss[x] == '1').collect::<Vec<_>>();
    }

    for i in 0..n {
        for ii in 0..7 {
            if !flags[i][ii] || !flags[i][(ii + 1) % 7] {
                continue;
            }
            uft.unite(get_index(i, ii), get_index(i, (ii + 1) % 7));
        }
    }

    for i in 0..n {
        for &to in edges[i].iter() {
            for color in 0..7 {
                if flags[i][color] && flags[to][color] {
                    uft.unite(get_index(i, color), get_index(to, color));
                }
            }
        }
    }

    for (k, x, y) in queries {
        if k == 1 {
            let (x, y) = (x - 1, y - 1);
            flags[x][y] = true;
            if flags[x][(y + 1) % 7] {
                uft.unite(get_index(x, y), get_index(x, (y + 1) % 7));
            }
            if flags[x][(y + 6) % 7] {
                uft.unite(get_index(x, y), get_index(x, (y + 6) % 7));
            }

            for color in 0..7 {
                for &to in edges[x].iter() {
                    if flags[x][color] && flags[to][color] {
                        uft.unite(get_index(x, color), get_index(to, color));
                    }
                }
            }
        } else {
            let x = x - 1;
            println!("{}", uft.get_size(get_index(x, 0)));
        }
    }
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[derive(Debug, Clone)]
struct UnionFindTree {
    parent: Vec<isize>,
    size: Vec<usize>,
    height: Vec<u64>,
}

impl UnionFindTree {
    fn new(n: usize) -> UnionFindTree {
        UnionFindTree {
            parent: vec![-1; n],
            size: vec![1usize; n],
            height: vec![0u64; n],
        }
    }

    fn find(&mut self, index: usize) -> usize {
        if self.parent[index] == -1 {
            return index;
        }
        let idx = self.parent[index] as usize;
        let ret = self.find(idx);
        self.parent[index] = ret as isize;
        ret
    }

    fn same(&mut self, x: usize, y: usize) -> bool {
        self.find(x) == self.find(y)
    }

    fn get_size(&mut self, x: usize) -> usize {
        let idx = self.find(x);
        self.size[idx]
    }

    fn unite(&mut self, index0: usize, index1: usize) -> bool {
        let a = self.find(index0);
        let b = self.find(index1);
        if a == b {
            false
        } else {
            if self.height[a] > self.height[b] {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
            } else if self.height[a] < self.height[b] {
                self.parent[a] = b as isize;
                self.size[b] += self.size[a];
            } else {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
                self.height[a] += 1;
            }
            true
        }
    }
}
0