結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | koba-e964 |
提出日時 | 2021-12-25 11:34:54 |
言語 | Rust (1.77.0) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,992 bytes |
コンパイル時間 | 5,062 ms |
コンパイル使用メモリ | 183,900 KB |
実行使用メモリ | 25,840 KB |
最終ジャッジ日時 | 2023-10-21 12:18:48 |
合計ジャッジ時間 | 63,188 ms |
ジャッジサーバーID (参考情報) |
judge9 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,348 KB |
testcase_01 | AC | 1 ms
4,348 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 1 ms
4,348 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 1 ms
4,348 KB |
testcase_06 | AC | 1 ms
4,348 KB |
testcase_07 | AC | 1 ms
4,348 KB |
testcase_08 | AC | 4 ms
4,348 KB |
testcase_09 | AC | 2 ms
4,348 KB |
testcase_10 | AC | 6 ms
4,348 KB |
testcase_11 | AC | 5 ms
4,348 KB |
testcase_12 | AC | 3 ms
4,348 KB |
testcase_13 | AC | 8 ms
4,348 KB |
testcase_14 | AC | 2 ms
4,348 KB |
testcase_15 | AC | 10 ms
4,348 KB |
testcase_16 | AC | 4 ms
4,348 KB |
testcase_17 | AC | 7 ms
4,348 KB |
testcase_18 | AC | 122 ms
4,348 KB |
testcase_19 | AC | 44 ms
4,348 KB |
testcase_20 | AC | 129 ms
4,348 KB |
testcase_21 | AC | 33 ms
4,348 KB |
testcase_22 | AC | 53 ms
4,348 KB |
testcase_23 | AC | 86 ms
4,348 KB |
testcase_24 | AC | 66 ms
4,348 KB |
testcase_25 | AC | 76 ms
4,348 KB |
testcase_26 | AC | 102 ms
4,348 KB |
testcase_27 | AC | 66 ms
4,348 KB |
testcase_28 | AC | 871 ms
14,992 KB |
testcase_29 | AC | 758 ms
9,244 KB |
testcase_30 | AC | 704 ms
7,892 KB |
testcase_31 | AC | 1,021 ms
12,156 KB |
testcase_32 | AC | 633 ms
17,424 KB |
testcase_33 | AC | 665 ms
8,084 KB |
testcase_34 | AC | 990 ms
16,248 KB |
testcase_35 | AC | 1,270 ms
14,468 KB |
testcase_36 | AC | 1,718 ms
19,772 KB |
testcase_37 | AC | 332 ms
7,964 KB |
testcase_38 | AC | 1,006 ms
10,884 KB |
testcase_39 | AC | 578 ms
6,912 KB |
testcase_40 | AC | 726 ms
9,296 KB |
testcase_41 | AC | 895 ms
12,604 KB |
testcase_42 | AC | 1,816 ms
16,792 KB |
testcase_43 | AC | 913 ms
14,728 KB |
testcase_44 | AC | 1,346 ms
14,536 KB |
testcase_45 | AC | 1,129 ms
11,412 KB |
testcase_46 | AC | 998 ms
16,512 KB |
testcase_47 | AC | 488 ms
8,384 KB |
testcase_48 | TLE | - |
testcase_49 | TLE | - |
testcase_50 | TLE | - |
testcase_51 | TLE | - |
testcase_52 | AC | 1,898 ms
25,832 KB |
testcase_53 | TLE | - |
testcase_54 | TLE | - |
testcase_55 | TLE | - |
testcase_56 | TLE | - |
testcase_57 | TLE | - |
testcase_58 | AC | 1,939 ms
25,832 KB |
testcase_59 | AC | 1,935 ms
25,832 KB |
testcase_60 | AC | 1,818 ms
25,832 KB |
testcase_61 | AC | 1,825 ms
25,832 KB |
testcase_62 | AC | 1,822 ms
25,832 KB |
testcase_63 | AC | 46 ms
25,832 KB |
testcase_64 | AC | 47 ms
25,832 KB |
testcase_65 | AC | 48 ms
25,832 KB |
testcase_66 | AC | 49 ms
25,832 KB |
testcase_67 | AC | 48 ms
25,832 KB |
testcase_68 | AC | 1 ms
4,348 KB |
testcase_69 | AC | 1 ms
4,348 KB |
testcase_70 | AC | 1 ms
4,348 KB |
testcase_71 | AC | 1 ms
4,348 KB |
testcase_72 | AC | 1 ms
4,348 KB |
testcase_73 | AC | 1 ms
4,348 KB |
ソースコード
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_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, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }; ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } fn two(a: &[i64], b: &[i64]) -> Vec<(i64, i64, i64)> { let mut ans = vec![]; for &a in a { for &b in b { ans.push((a * b, a, b)); } } ans.sort_unstable(); ans } fn quo(a: i64, b: i64) -> i64 { assert!(b > 0); let mut r = a % b; if r < 0 { r += b; } (a - r) / b } const INF: i64 = 1 << 60; fn main() { input! { k: usize, l: usize, m: usize, n: usize, s: i64, a: [i64; k], b: [i64; l], c: [i64; m], d: [i64; n], } let fst = two(&a, &b); let snd = two(&c, &d); let snd_light: Vec<_> = snd.iter().map(|&(a, b, _)| (a, b)).collect(); let mut pass = INF; let mut fail = -INF; while pass - fail > 1 { let mid = fail + (pass - fail) / 2; let mut count = 0; for &(f, _, _) in &fst { if f == 0 { if mid >= 0 { count += snd.len() as i64; } } else if f > 0 { let idx = snd_light.binary_search(&(quo(mid, f), INF)).unwrap_err(); count += idx as i64; } else { let idx = snd_light.binary_search(&(quo(-mid - f - 1, -f), -INF)).unwrap_err(); count += (snd.len() - idx) as i64; } } if count >= s { pass = mid; } else { fail = mid; } } println!("{}", pass); for &(f, f1, f2) in &fst { if f == 0 { if pass != 0 { continue; } let (_, s1, s2) = snd[0]; println!("{} {} {} {}", f1, f2, s1, s2); return; } if pass % f != 0 { continue; } let q = pass / f; let lo = snd.binary_search(&(q, -INF, -INF)).unwrap_err(); let hi = snd.binary_search(&(q, INF, INF)).unwrap_err(); if lo < hi { let (_, s1, s2) = snd[lo]; println!("{} {} {} {}", f1, f2, s1, s2); return; } } }