結果
問題 | No.317 辺の追加 |
ユーザー | akakimidori |
提出日時 | 2023-11-07 07:48:19 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 4,260 bytes |
コンパイル時間 | 14,539 ms |
コンパイル使用メモリ | 379,236 KB |
実行使用メモリ | 7,552 KB |
最終ジャッジ日時 | 2024-09-25 23:16:12 |
合計ジャッジ時間 | 17,183 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 16 ms
5,376 KB |
testcase_03 | AC | 19 ms
5,888 KB |
testcase_04 | AC | 15 ms
5,376 KB |
testcase_05 | AC | 20 ms
6,400 KB |
testcase_06 | AC | 24 ms
6,988 KB |
testcase_07 | AC | 9 ms
5,376 KB |
testcase_08 | AC | 20 ms
5,376 KB |
testcase_09 | AC | 20 ms
5,376 KB |
testcase_10 | AC | 27 ms
7,296 KB |
testcase_11 | AC | 17 ms
5,376 KB |
testcase_12 | AC | 26 ms
7,324 KB |
testcase_13 | AC | 22 ms
5,376 KB |
testcase_14 | AC | 21 ms
6,144 KB |
testcase_15 | AC | 25 ms
6,912 KB |
testcase_16 | AC | 17 ms
5,376 KB |
testcase_17 | AC | 23 ms
6,528 KB |
testcase_18 | AC | 27 ms
7,296 KB |
testcase_19 | AC | 27 ms
7,552 KB |
testcase_20 | AC | 16 ms
5,376 KB |
testcase_21 | AC | 8 ms
5,376 KB |
testcase_22 | AC | 4 ms
5,376 KB |
testcase_23 | AC | 4 ms
5,376 KB |
testcase_24 | AC | 13 ms
5,376 KB |
testcase_25 | AC | 9 ms
5,376 KB |
testcase_26 | AC | 9 ms
5,376 KB |
testcase_27 | AC | 8 ms
5,376 KB |
testcase_28 | AC | 5 ms
5,376 KB |
testcase_29 | AC | 2 ms
5,376 KB |
testcase_30 | AC | 19 ms
5,376 KB |
testcase_31 | AC | 18 ms
5,376 KB |
testcase_32 | AC | 18 ms
5,376 KB |
testcase_33 | AC | 17 ms
5,376 KB |
testcase_34 | AC | 18 ms
5,376 KB |
testcase_35 | AC | 18 ms
5,376 KB |
testcase_36 | AC | 17 ms
5,376 KB |
testcase_37 | AC | 18 ms
5,376 KB |
testcase_38 | AC | 19 ms
5,376 KB |
testcase_39 | AC | 18 ms
5,376 KB |
ソースコード
use std::io::Write; #[target_feature(enable = "avx2")] unsafe fn run() { input! { n: usize, m: usize, e: [(usize1, usize1); m], } let mut dsu = DSU::new(n); for (a, b) in e { dsu.unite(a, b); } let mut cnt = vec![0; n + 1]; for i in 0..n { if i == dsu.root(i) { cnt[dsu.size(i)] += 1; } } let mut dp = vec![0]; let inf = 1000000i32; for (i, c) in cnt.iter().enumerate() { let mut c = *c; while c > 0 { let k = (c + 1) / 2; c -= k; let mut next = vec![inf; dp.len() + k * i]; next[..dp.len()].copy_from_slice(&dp); for (next, dp) in next[(k * i)..].iter_mut().zip(dp.iter()) { *next = std::cmp::min(*next, *dp + k as i32); } dp = next; } } let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); for v in dp[1..].iter() { let ans = if *v != inf { *v - 1 } else { -1 }; writeln!(out, "{}", ans).ok(); } } fn main() { unsafe { run(); } } // ---------- begin input macro ---------- // reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 #[macro_export] macro_rules! input { (source = $s:expr, $($r:tt)*) => { let mut iter = $s.split_whitespace(); input_inner!{iter, $($r)*} }; ($($r:tt)*) => { let s = { use std::io::Read; let mut s = String::new(); std::io::stdin().read_to_string(&mut s).unwrap(); s }; let mut iter = s.split_whitespace(); input_inner!{iter, $($r)*} }; } #[macro_export] macro_rules! input_inner { ($iter:expr) => {}; ($iter:expr, ) => {}; ($iter:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($iter, $t); input_inner!{$iter $($r)*} }; } #[macro_export] macro_rules! read_value { ($iter:expr, ( $($t:tt),* )) => { ( $(read_value!($iter, $t)),* ) }; ($iter:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>() }; ($iter:expr, chars) => { read_value!($iter, String).chars().collect::<Vec<char>>() }; ($iter:expr, bytes) => { read_value!($iter, String).bytes().collect::<Vec<u8>>() }; ($iter:expr, usize1) => { read_value!($iter, usize) - 1 }; ($iter:expr, $t:ty) => { $iter.next().unwrap().parse::<$t>().expect("Parse error") }; } // ---------- end input macro ---------- //---------- begin union_find ---------- pub struct DSU { p: Vec<i32>, } impl DSU { pub fn new(n: usize) -> DSU { assert!(n < std::i32::MAX as usize); DSU { p: vec![-1; n] } } pub fn init(&mut self) { self.p.iter_mut().for_each(|p| *p = -1); } pub fn root(&self, mut x: usize) -> usize { assert!(x < self.p.len()); while self.p[x] >= 0 { x = self.p[x] as usize; } x } pub fn same(&self, x: usize, y: usize) -> bool { assert!(x < self.p.len() && y < self.p.len()); self.root(x) == self.root(y) } pub fn unite(&mut self, x: usize, y: usize) -> Option<(usize, usize)> { assert!(x < self.p.len() && y < self.p.len()); let mut x = self.root(x); let mut y = self.root(y); if x == y { return None; } if self.p[x] > self.p[y] { std::mem::swap(&mut x, &mut y); } self.p[x] += self.p[y]; self.p[y] = x as i32; Some((x, y)) } pub fn parent(&self, x: usize) -> Option<usize> { assert!(x < self.p.len()); let p = self.p[x]; if p >= 0 { Some(p as usize) } else { None } } pub fn sum<F>(&self, mut x: usize, mut f: F) -> usize where F: FnMut(usize), { while let Some(p) = self.parent(x) { f(x); x = p; } x } pub fn size(&self, x: usize) -> usize { assert!(x < self.p.len()); let r = self.root(x); (-self.p[r]) as usize } } //---------- end union_find ----------