結果
問題 | No.2319 Friends+ |
ユーザー | akakimidori |
提出日時 | 2023-05-26 23:04:03 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 567 ms / 3,000 ms |
コード長 | 3,186 bytes |
コンパイル時間 | 1,400 ms |
コンパイル使用メモリ | 163,232 KB |
実行使用メモリ | 87,488 KB |
最終ジャッジ日時 | 2023-08-26 13:26:24 |
合計ジャッジ時間 | 11,696 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 0 ms
4,376 KB |
testcase_02 | AC | 509 ms
61,864 KB |
testcase_03 | AC | 492 ms
61,844 KB |
testcase_04 | AC | 473 ms
61,856 KB |
testcase_05 | AC | 501 ms
61,812 KB |
testcase_06 | AC | 516 ms
61,860 KB |
testcase_07 | AC | 69 ms
22,888 KB |
testcase_08 | AC | 68 ms
22,832 KB |
testcase_09 | AC | 71 ms
23,152 KB |
testcase_10 | AC | 72 ms
23,060 KB |
testcase_11 | AC | 73 ms
22,900 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,384 KB |
testcase_15 | AC | 1 ms
4,380 KB |
testcase_16 | AC | 1 ms
4,380 KB |
testcase_17 | AC | 1 ms
4,376 KB |
testcase_18 | AC | 52 ms
19,008 KB |
testcase_19 | AC | 51 ms
19,020 KB |
testcase_20 | AC | 66 ms
18,860 KB |
testcase_21 | AC | 58 ms
18,852 KB |
testcase_22 | AC | 82 ms
18,800 KB |
testcase_23 | AC | 51 ms
18,856 KB |
testcase_24 | AC | 52 ms
18,804 KB |
testcase_25 | AC | 48 ms
18,880 KB |
testcase_26 | AC | 49 ms
19,076 KB |
testcase_27 | AC | 50 ms
18,732 KB |
testcase_28 | AC | 48 ms
18,776 KB |
testcase_29 | AC | 49 ms
18,876 KB |
testcase_30 | AC | 83 ms
18,768 KB |
testcase_31 | AC | 71 ms
18,708 KB |
testcase_32 | AC | 59 ms
18,804 KB |
testcase_33 | AC | 54 ms
18,844 KB |
testcase_34 | AC | 51 ms
18,876 KB |
testcase_35 | AC | 50 ms
18,848 KB |
testcase_36 | AC | 51 ms
22,828 KB |
testcase_37 | AC | 248 ms
79,084 KB |
testcase_38 | AC | 52 ms
18,872 KB |
testcase_39 | AC | 52 ms
18,872 KB |
testcase_40 | AC | 55 ms
18,800 KB |
testcase_41 | AC | 58 ms
18,704 KB |
testcase_42 | AC | 63 ms
18,768 KB |
testcase_43 | AC | 73 ms
18,852 KB |
testcase_44 | AC | 139 ms
28,892 KB |
testcase_45 | AC | 238 ms
55,300 KB |
testcase_46 | AC | 567 ms
87,488 KB |
コンパイルメッセージ
warning: type alias `Map` is never used --> Main.rs:4:6 | 4 | type Map<K, V> = BTreeMap<K, V>; | ^^^ | = note: `#[warn(dead_code)]` on by default warning: type alias `Set` is never used --> Main.rs:5:6 | 5 | type Set<T> = BTreeSet<T>; | ^^^ warning: type alias `Deque` is never used --> Main.rs:6:6 | 6 | type Deque<T> = VecDeque<T>; | ^^^^^ warning: 3 warnings emitted
ソースコード
use std::io::Write; use std::collections::*; type Map<K, V> = BTreeMap<K, V>; type Set<T> = BTreeSet<T>; type Deque<T> = VecDeque<T>; fn run() { input! { n: usize, m: usize, p: [usize1; n], e: [(usize1, usize1); m], q: usize, ask: [(usize1, usize1); q], } let mut e = e; e.retain(|e| e.0 != e.1); let batch = 150; let mut g = vec![vec![]; n]; let mut deg = vec![0; n]; for &(a, b) in e.iter() { g[a].push(b); g[b].push(a); deg[a] += 1; deg[b] += 1; } let mut set = vec![vec![]; n]; for (i, set) in set.iter_mut().enumerate() { if deg[i] > batch { *set = vec![0u32; n]; g[i].retain(|v| deg[*v] > batch); } } for i in 0..n { for &v in g[i].iter() { if !set[v].is_empty() { set[v][p[i]] += 1; } } } let mut p = p; let out = std::io::stdout(); let mut out = std::io::BufWriter::new(out.lock()); for (x, y) in ask { let ans = if p[x] != p[y] { let u = p[y]; let mut ok = false; ok |= g[x].iter().any(|v| p[*v] == u); ok |= set[x].get(u).cloned().map_or(false, |c| c > 0); if ok { for &v in g[x].iter() { if !set[v].is_empty() { set[v][p[x]] -= 1; set[v][u] += 1; } } p[x] = u; "Yes" } else { "No" } } else { "No" }; writeln!(out, "{}", ans).ok(); } } fn main() { 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 ----------