結果
問題 | No.1293 2種類の道路 |
ユーザー |
|
提出日時 | 2020-11-20 21:28:10 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 50 ms / 2,000 ms |
コード長 | 4,529 bytes |
コンパイル時間 | 14,218 ms |
コンパイル使用メモリ | 387,824 KB |
実行使用メモリ | 13,696 KB |
最終ジャッジ日時 | 2024-07-23 12:39:13 |
合計ジャッジ時間 | 15,464 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 22 |
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_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, d: usize, w: usize,ab: [(usize1, usize1); d],cd: [(usize1, usize1); w],}let mut ufd = UnionFind::new(n);let mut ufw = UnionFind::new(n);for &(a, b) in &ab {ufd.unite(a, b);}for &(c, d) in &cd {ufw.unite(c, d);}let mut tot = 0;let mut rep = vec![vec![]; n];for i in 0..n {rep[ufd.root(i)].push(i);}for i in 0..n {let mut seen = HashSet::new();if rep[i].is_empty() {continue;}let mut loc: i64 = 0;for &v in &rep[i] {let r = ufw.root(v);if seen.contains(&r) {continue;}seen.insert(r);loc += ufw.size(r) as i64;}tot += loc * ufd.size(i) as i64;}puts!("{}\n", tot - n as i64);}fn main() {// In order to avoid potential stack overflow, spawn a new thread.let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);thd.spawn(|| solve()).unwrap().join().unwrap();}