結果

問題 No.1266 7 Colors
ユーザー koba-e964koba-e964
提出日時 2020-10-24 21:22:07
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 418 ms / 3,000 ms
コード長 4,935 bytes
コンパイル時間 14,474 ms
コンパイル使用メモリ 378,396 KB
実行使用メモリ 79,616 KB
最終ジャッジ日時 2024-07-21 15:45:43
合計ジャッジ時間 22,264 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 171 ms
31,232 KB
testcase_04 AC 327 ms
65,436 KB
testcase_05 AC 209 ms
32,896 KB
testcase_06 AC 385 ms
70,932 KB
testcase_07 AC 411 ms
78,456 KB
testcase_08 AC 376 ms
66,848 KB
testcase_09 AC 313 ms
54,784 KB
testcase_10 AC 306 ms
50,560 KB
testcase_11 AC 238 ms
37,504 KB
testcase_12 AC 285 ms
41,856 KB
testcase_13 AC 286 ms
45,440 KB
testcase_14 AC 211 ms
32,768 KB
testcase_15 AC 413 ms
79,616 KB
testcase_16 AC 281 ms
42,496 KB
testcase_17 AC 418 ms
76,544 KB
testcase_18 AC 205 ms
79,232 KB
testcase_19 AC 203 ms
73,728 KB
testcase_20 AC 203 ms
73,728 KB
testcase_21 AC 56 ms
18,688 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

/**
 * Union-Find tree.
 * Verified by https://atcoder.jp/contests/pakencamp-2019-day3/submissions/9253305
 */
struct UnionFind { disj: Vec<usize>, rank: Vec<usize> }

impl UnionFind {
    fn new(n: usize) -> Self {
        let disj = (0..n).collect();
        UnionFind { disj: disj, rank: vec![1; n] }
    }
    fn root(&mut self, x: usize) -> usize {
        if x != self.disj[x] {
            let par = self.disj[x];
            let r = self.root(par);
            self.disj[x] = r;
        }
        self.disj[x]
    }
    fn unite(&mut self, x: usize, y: usize) {
        let mut x = self.root(x);
        let mut y = self.root(y);
        if x == y { return }
        if self.rank[x] > self.rank[y] {
            std::mem::swap(&mut x, &mut y);
        }
        self.disj[x] = y;
        self.rank[y] += self.rank[x];
    }
    #[allow(unused)]
    fn is_same_set(&mut self, x: usize, y: usize) -> bool {
        self.root(x) == self.root(y)
    }
    #[allow(unused)]
    fn size(&mut self, x: usize) -> usize {
        let x = self.root(x);
        self.rank[x]
    }
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    #[allow(unused)]
    macro_rules! putvec {
        ($v:expr) => {
            for i in 0..$v.len() {
                puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});
            }
        }
    }
    input! {
        n: usize, m: usize, q: usize,
        s: [chars; n],
        uv: [(usize1, usize1); m],
        qs: [(usize1, usize1, usize); q],
    }
    let mut uf = UnionFind::new(7 * n);
    let mut avail = vec![false; 7 * n];
    for i in 0..n {
        for j in 0..7 {
            avail[i * 7 + j] = s[i][j] == '1';
        }
    }
    let mut g = vec![vec![]; 7 * n];
    for &(u, v) in &uv {
        for i in 0..7 {
            g[7 * u + i].push(7 * v + i);
            g[7 * v + i].push(7 * u + i);
        }
    }
    for i in 0..n {
        for j in 0..7 {
            let nxt = (j + 1) % 7;
            g[7 * i + j].push(7 * i + nxt);
            g[7 * i + nxt].push(7 * i + j);
        }
    }
    for i in 0..7 * n {
        if avail[i] {
            for &w in &g[i] {
                if avail[w] {
                    uf.unite(i, w);
                }
            }
        }
    }
    for (ty, x, y) in qs {
        if ty == 0 {
            let v = 7 * x + y - 1;
            assert!(!avail[v]);
            avail[v] = true;
            for &w in &g[v] {
                if avail[w] {
                    uf.unite(v, w);
                }
            }
        } else {
            assert_eq!(ty, 1);
            puts!("{}\n", uf.size(7 * x));
        }
    }
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}
0