結果
問題 | No.812 Change of Class |
ユーザー | phspls |
提出日時 | 2023-01-17 01:53:56 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 205 ms / 4,000 ms |
コード長 | 2,667 bytes |
コンパイル時間 | 1,224 ms |
コンパイル使用メモリ | 157,264 KB |
実行使用メモリ | 12,228 KB |
最終ジャッジ日時 | 2023-08-30 06:57:07 |
合計ジャッジ時間 | 9,778 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 52 ms
9,916 KB |
testcase_01 | AC | 8 ms
4,376 KB |
testcase_02 | AC | 28 ms
6,504 KB |
testcase_03 | AC | 60 ms
11,124 KB |
testcase_04 | AC | 53 ms
10,192 KB |
testcase_05 | AC | 205 ms
10,312 KB |
testcase_06 | AC | 160 ms
8,804 KB |
testcase_07 | AC | 4 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,376 KB |
testcase_09 | AC | 197 ms
11,324 KB |
testcase_10 | AC | 188 ms
11,296 KB |
testcase_11 | AC | 15 ms
8,128 KB |
testcase_12 | AC | 125 ms
10,948 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | AC | 112 ms
8,460 KB |
testcase_16 | AC | 7 ms
4,376 KB |
testcase_17 | AC | 116 ms
8,872 KB |
testcase_18 | AC | 78 ms
6,948 KB |
testcase_19 | AC | 86 ms
7,968 KB |
testcase_20 | AC | 200 ms
11,200 KB |
testcase_21 | AC | 69 ms
6,988 KB |
testcase_22 | AC | 30 ms
4,492 KB |
testcase_23 | AC | 6 ms
4,380 KB |
testcase_24 | AC | 8 ms
4,380 KB |
testcase_25 | AC | 23 ms
4,376 KB |
testcase_26 | AC | 139 ms
9,864 KB |
testcase_27 | AC | 121 ms
9,096 KB |
testcase_28 | AC | 86 ms
7,972 KB |
testcase_29 | AC | 18 ms
4,376 KB |
testcase_30 | AC | 101 ms
8,796 KB |
testcase_31 | AC | 83 ms
7,604 KB |
testcase_32 | AC | 36 ms
5,124 KB |
testcase_33 | AC | 109 ms
9,564 KB |
testcase_34 | AC | 8 ms
4,380 KB |
testcase_35 | AC | 19 ms
4,380 KB |
testcase_36 | AC | 6 ms
4,380 KB |
testcase_37 | AC | 46 ms
5,612 KB |
testcase_38 | AC | 6 ms
4,776 KB |
testcase_39 | AC | 48 ms
5,688 KB |
testcase_40 | AC | 12 ms
4,376 KB |
testcase_41 | AC | 5 ms
4,504 KB |
testcase_42 | AC | 103 ms
8,432 KB |
testcase_43 | AC | 24 ms
6,996 KB |
testcase_44 | AC | 68 ms
6,880 KB |
testcase_45 | AC | 7 ms
4,380 KB |
testcase_46 | AC | 23 ms
6,908 KB |
testcase_47 | AC | 72 ms
6,840 KB |
testcase_48 | AC | 81 ms
7,864 KB |
testcase_49 | AC | 19 ms
4,376 KB |
testcase_50 | AC | 2 ms
4,380 KB |
testcase_51 | AC | 22 ms
4,532 KB |
testcase_52 | AC | 46 ms
7,280 KB |
testcase_53 | AC | 12 ms
4,380 KB |
testcase_54 | AC | 10 ms
4,380 KB |
testcase_55 | AC | 40 ms
9,388 KB |
testcase_56 | AC | 61 ms
10,764 KB |
testcase_57 | AC | 64 ms
11,220 KB |
testcase_58 | AC | 26 ms
7,016 KB |
testcase_59 | AC | 74 ms
12,228 KB |
testcase_60 | AC | 1 ms
4,376 KB |
testcase_61 | AC | 1 ms
4,380 KB |
testcase_62 | AC | 1 ms
4,380 KB |
コンパイルメッセージ
warning: field `n` is never read --> Main.rs:7:5 | 6 | struct UnionFind { | --------- field in this struct 7 | n: usize, | ^ | = note: `#[warn(dead_code)]` on by default warning: 1 warning emitted
ソースコード
use std::collections::VecDeque; const INF: usize = 1usize << 60; struct UnionFind { n: usize, parents: Vec<usize>, } impl UnionFind { fn new(n: usize) -> Self { UnionFind { n: n, parents: (0..n).collect(), } } 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 (a, b) = (a.min(b), a.max(b)); let x = self.parents[a]; let y = self.parents[b]; self.parents[y] = self.parents[x]; } 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 main() { let mut nm = String::new(); std::io::stdin().read_line(&mut nm).ok(); let nm: Vec<usize> = nm.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let n = nm[0]; let m = nm[1]; let mut paths = vec![vec![]; n]; let mut uf = UnionFind::new(n); let mut size = vec![1usize; n]; for _ in 0..m { 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(); let p = temp[0]-1; let q = temp[1]-1; paths[p].push(q); paths[q].push(p); let pp = uf.find(p); let pq = uf.find(q); if pp == pq { continue; } uf.unite(pp, pq); let p = uf.find(pp); if p == pp { size[pp] += size[pq]; size[pq] = 0; } else { size[pq] += size[pp]; size[pp] = 0; } } let mut q = String::new(); std::io::stdin().read_line(&mut q).ok(); let q: usize = q.trim().parse().unwrap(); let a = (0..q).map(|_| { let mut temp = String::new(); std::io::stdin().read_line(&mut temp).ok(); let temp: usize = temp.trim().parse().unwrap(); temp-1 }) .collect::<Vec<_>>(); for &a in a.iter() { let mut dists = vec![INF; n]; dists[a] = 0; let mut deque = VecDeque::new(); deque.push_back(a); while let Some(u) = deque.pop_front() { for &v in paths[u].iter() { if dists[v] < INF { continue; } dists[v] = dists[u] + 1; deque.push_back(v); } } println!("{} {}", size[uf.find(a)]-1, (*dists.iter().filter(|&&v| v < INF).max().unwrap() as f64).log2().ceil() as usize); } }