結果
問題 | No.2114 01 Matching |
ユーザー | akakimidori |
提出日時 | 2022-10-29 00:46:36 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 438 ms / 5,000 ms |
コード長 | 4,756 bytes |
コンパイル時間 | 14,546 ms |
コンパイル使用メモリ | 377,916 KB |
実行使用メモリ | 73,216 KB |
最終ジャッジ日時 | 2024-05-03 12:28:44 |
合計ジャッジ時間 | 28,305 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 318 ms
26,624 KB |
testcase_03 | AC | 80 ms
17,024 KB |
testcase_04 | AC | 103 ms
22,912 KB |
testcase_05 | AC | 56 ms
12,016 KB |
testcase_06 | AC | 245 ms
22,856 KB |
testcase_07 | AC | 244 ms
21,536 KB |
testcase_08 | AC | 180 ms
22,416 KB |
testcase_09 | AC | 125 ms
13,436 KB |
testcase_10 | AC | 223 ms
22,388 KB |
testcase_11 | AC | 391 ms
73,088 KB |
testcase_12 | AC | 405 ms
73,216 KB |
testcase_13 | AC | 137 ms
27,044 KB |
testcase_14 | AC | 142 ms
37,504 KB |
testcase_15 | AC | 107 ms
37,504 KB |
testcase_16 | AC | 262 ms
42,800 KB |
testcase_17 | AC | 263 ms
22,668 KB |
testcase_18 | AC | 110 ms
21,096 KB |
testcase_19 | AC | 183 ms
29,372 KB |
testcase_20 | AC | 413 ms
73,088 KB |
testcase_21 | AC | 213 ms
32,872 KB |
testcase_22 | AC | 121 ms
12,044 KB |
testcase_23 | AC | 140 ms
25,708 KB |
testcase_24 | AC | 30 ms
5,480 KB |
testcase_25 | AC | 29 ms
8,128 KB |
testcase_26 | AC | 419 ms
73,088 KB |
testcase_27 | AC | 429 ms
73,216 KB |
testcase_28 | AC | 189 ms
41,344 KB |
testcase_29 | AC | 438 ms
73,216 KB |
testcase_30 | AC | 247 ms
23,952 KB |
testcase_31 | AC | 403 ms
73,216 KB |
testcase_32 | AC | 168 ms
15,628 KB |
testcase_33 | AC | 243 ms
31,960 KB |
testcase_34 | AC | 118 ms
21,672 KB |
testcase_35 | AC | 134 ms
30,976 KB |
testcase_36 | AC | 378 ms
73,216 KB |
testcase_37 | AC | 127 ms
15,328 KB |
testcase_38 | AC | 232 ms
19,412 KB |
testcase_39 | AC | 57 ms
8,232 KB |
testcase_40 | AC | 132 ms
30,336 KB |
testcase_41 | AC | 137 ms
15,096 KB |
testcase_42 | AC | 116 ms
16,944 KB |
testcase_43 | AC | 217 ms
23,048 KB |
testcase_44 | AC | 230 ms
40,360 KB |
testcase_45 | AC | 242 ms
73,088 KB |
testcase_46 | AC | 37 ms
5,844 KB |
testcase_47 | AC | 376 ms
73,088 KB |
testcase_48 | AC | 383 ms
73,088 KB |
testcase_49 | AC | 139 ms
29,120 KB |
testcase_50 | AC | 54 ms
7,056 KB |
testcase_51 | AC | 213 ms
32,816 KB |
testcase_52 | AC | 87 ms
37,632 KB |
ソースコード
// https://yukicoder.me/problems/no/1467 // これっぽい感が fn run() { input! { n: usize, m: usize, k: i64, b: [i64; n], r: [i64; m], } let mut map = std::collections::BTreeMap::new(); for &b in b.iter() { map.entry(b % k).or_insert(vec![vec![]; 2])[0].push(b / k); } for &r in r.iter() { map.entry(r % k).or_insert(vec![vec![]; 2])[1].push(r / k); } let mut sum = 0; let mut cnt = 0; let inf = std::i64::MAX / 10; for (_, mut p) in map { if p[0].len() > p[1].len() { p.swap(0, 1); } let mut a = vec![]; a.extend(p[0].iter().map(|p| (*p, 0))); a.extend(p[1].iter().map(|p| (*p, 1))); a.sort(); let mut left = std::collections::BinaryHeap::new(); let mut left_add = 0; let mut right = std::collections::BinaryHeap::new(); let mut right_add = 0; left.push((0, inf)); right.push((0, inf)); if a[0].1 == 0 { left_add += 1; right_add += 1; } else { left_add -= 1; } for a in a.windows(2) { let diff = a[1].0 - a[0].0; let mut d = diff; let mut l = 0; while d > 0 && left.peek().map_or(false, |p| p.0 + left_add > 0) { let (a, b) = *left.peek().unwrap(); let a = a + left_add; let v = b.min(d); sum += a * v; d -= v; l += v; if b == v { left.pop(); } else { left.peek_mut().unwrap().1 -= v; } right.push((-(a - right_add), v)); } if d > 0 { right.push((right_add, d)); } if l > 0 { left.push((-left_add, l)); } let mut d = diff; let mut r = 0; while d > 0 && right.peek().map_or(false, |p| -p.0 + right_add < 0) { let (a, b) = *right.peek().unwrap(); let a = -a + right_add; let v = b.min(d); sum += -a * v; d -= v; r += v; if b == v { right.pop(); } else { right.peek_mut().unwrap().1 -= v; } left.push((a - left_add, v)); } if d > 0 { left.push((-left_add, d)); } if r > 0 { right.push((right_add, r)); } if a[1].1 == 0 { left_add += 1; right_add += 1; } else { left_add -= 1; } } for v in left.drain() { let pos = v.0 + left_add; let cnt = v.1; sum += cnt * std::cmp::max(pos, 0); } for v in right.drain() { let pos = -v.0 + right_add; let cnt = v.1; sum += cnt * std::cmp::max(-pos, 0); } cnt += p[0].len(); } if cnt == n.min(m) { println!("{}", sum); } else { println!("-1"); } } 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 ----------