結果
問題 | No.1361 [Zelkova 4th Tune *] QUADRUPLE-SEQUENCEの詩 |
ユーザー | koba-e964 |
提出日時 | 2021-10-21 13:57:19 |
言語 | Rust (1.77.0 + proconio) |
結果 |
TLE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 3,726 bytes |
コンパイル時間 | 16,055 ms |
コンパイル使用メモリ | 379,280 KB |
実行使用メモリ | 22,408 KB |
最終ジャッジ日時 | 2024-09-21 09:21:19 |
合計ジャッジ時間 | 56,307 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,248 KB |
testcase_02 | AC | 1 ms
5,376 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 1 ms
5,376 KB |
testcase_05 | AC | 1 ms
5,376 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 1 ms
5,376 KB |
testcase_08 | AC | 3 ms
5,376 KB |
testcase_09 | AC | 2 ms
5,376 KB |
testcase_10 | AC | 6 ms
5,376 KB |
testcase_11 | AC | 5 ms
5,376 KB |
testcase_12 | AC | 2 ms
5,376 KB |
testcase_13 | AC | 8 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 9 ms
5,376 KB |
testcase_16 | AC | 4 ms
5,376 KB |
testcase_17 | AC | 6 ms
5,376 KB |
testcase_18 | AC | 114 ms
5,376 KB |
testcase_19 | AC | 40 ms
5,376 KB |
testcase_20 | AC | 117 ms
5,376 KB |
testcase_21 | AC | 27 ms
5,376 KB |
testcase_22 | AC | 48 ms
5,376 KB |
testcase_23 | AC | 80 ms
5,376 KB |
testcase_24 | AC | 60 ms
5,376 KB |
testcase_25 | AC | 72 ms
5,376 KB |
testcase_26 | AC | 95 ms
5,376 KB |
testcase_27 | AC | 60 ms
5,376 KB |
testcase_28 | AC | 759 ms
8,960 KB |
testcase_29 | AC | 682 ms
7,680 KB |
testcase_30 | AC | 643 ms
6,656 KB |
testcase_31 | AC | 900 ms
9,472 KB |
testcase_32 | AC | 576 ms
11,648 KB |
testcase_33 | AC | 601 ms
6,656 KB |
testcase_34 | AC | 858 ms
11,264 KB |
testcase_35 | AC | 1,140 ms
9,984 KB |
testcase_36 | AC | 1,611 ms
15,232 KB |
testcase_37 | AC | 283 ms
6,016 KB |
testcase_38 | AC | 887 ms
8,192 KB |
testcase_39 | AC | 521 ms
6,016 KB |
testcase_40 | AC | 633 ms
7,424 KB |
testcase_41 | AC | 827 ms
9,600 KB |
testcase_42 | AC | 1,666 ms
13,056 KB |
testcase_43 | AC | 844 ms
8,832 KB |
testcase_44 | AC | 1,243 ms
10,752 KB |
testcase_45 | AC | 1,002 ms
8,960 KB |
testcase_46 | AC | 873 ms
12,032 KB |
testcase_47 | AC | 446 ms
6,656 KB |
testcase_48 | TLE | - |
testcase_49 | AC | 1,871 ms
18,944 KB |
testcase_50 | TLE | - |
testcase_51 | TLE | - |
testcase_52 | AC | 1,852 ms
18,944 KB |
testcase_53 | TLE | - |
testcase_54 | TLE | - |
testcase_55 | TLE | - |
testcase_56 | TLE | - |
testcase_57 | AC | 1,987 ms
18,944 KB |
testcase_58 | AC | 1,785 ms
19,072 KB |
testcase_59 | AC | 1,801 ms
19,072 KB |
testcase_60 | AC | 1,716 ms
19,072 KB |
testcase_61 | AC | 1,720 ms
19,072 KB |
testcase_62 | AC | 1,719 ms
19,072 KB |
testcase_63 | AC | 44 ms
18,944 KB |
testcase_64 | AC | 44 ms
19,072 KB |
testcase_65 | AC | 44 ms
19,072 KB |
testcase_66 | AC | 47 ms
19,072 KB |
testcase_67 | AC | 46 ms
18,944 KB |
testcase_68 | AC | 1 ms
5,376 KB |
testcase_69 | AC | 1 ms
5,376 KB |
testcase_70 | AC | 1 ms
5,376 KB |
testcase_71 | AC | 1 ms
5,376 KB |
testcase_72 | AC | 1 ms
5,376 KB |
testcase_73 | AC | 1 ms
5,376 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")); } trait Bisect<T> { fn lower_bound(&self, val: &T) -> usize; fn upper_bound(&self, val: &T) -> usize; } impl<T: Ord> Bisect<T> for [T] { fn lower_bound(&self, val: &T) -> usize { let mut pass = self.len() + 1; let mut fail = 0; while pass - fail > 1 { let mid = (pass + fail) / 2; if &self[mid - 1] >= val { pass = mid; } else { fail = mid; } } pass - 1 } fn upper_bound(&self, val: &T) -> usize { let mut pass = self.len() + 1; let mut fail = 0; while pass - fail > 1 { let mid = (pass + fail) / 2; if &self[mid - 1] > val { pass = mid; } else { fail = mid; } } pass - 1 } } 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 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.binary_search(&(quo(mid, f), INF, INF)).unwrap_err(); count += idx as i64; } else { let idx = snd.binary_search(&(quo(-mid - f - 1, -f), -INF, -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.lower_bound(&(q, -INF, -INF)); let hi = snd.upper_bound(&(q, INF, INF)); if lo < hi { let (_, s1, s2) = snd[lo]; println!("{} {} {} {}", f1, f2, s1, s2); return; } } }