結果
問題 | No.1597 Matrix Sort |
ユーザー |
|
提出日時 | 2021-07-09 21:51:03 |
言語 | Rust (1.68.1) |
結果 |
AC
|
実行時間 | 326 ms / 1,500 ms |
コード長 | 3,709 bytes |
コンパイル時間 | 1,673 ms |
コンパイル使用メモリ | 165,648 KB |
実行使用メモリ | 4,380 KB |
最終ジャッジ日時 | 2023-09-14 08:35:24 |
合計ジャッジ時間 | 8,184 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 291 ms
4,380 KB |
testcase_04 | AC | 306 ms
4,380 KB |
testcase_05 | AC | 323 ms
4,380 KB |
testcase_06 | AC | 315 ms
4,380 KB |
testcase_07 | AC | 326 ms
4,380 KB |
testcase_08 | AC | 233 ms
4,380 KB |
testcase_09 | AC | 253 ms
4,376 KB |
testcase_10 | AC | 121 ms
4,376 KB |
testcase_11 | AC | 128 ms
4,376 KB |
testcase_12 | AC | 125 ms
4,380 KB |
testcase_13 | AC | 240 ms
4,380 KB |
testcase_14 | AC | 274 ms
4,376 KB |
testcase_15 | AC | 93 ms
4,376 KB |
testcase_16 | AC | 131 ms
4,376 KB |
testcase_17 | AC | 149 ms
4,380 KB |
testcase_18 | AC | 299 ms
4,376 KB |
testcase_19 | AC | 202 ms
4,380 KB |
testcase_20 | AC | 150 ms
4,380 KB |
testcase_21 | AC | 143 ms
4,376 KB |
testcase_22 | AC | 143 ms
4,376 KB |
testcase_23 | AC | 143 ms
4,376 KB |
testcase_24 | AC | 36 ms
4,376 KB |
testcase_25 | AC | 25 ms
4,376 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 1 ms
4,376 KB |
testcase_28 | AC | 1 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,380 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // 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),* )) => { ($(read_value!($next, $t)),*) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::<Vec<char>>() }; ($next:expr, usize1) => (read_value!($next, usize) - 1); ($next:expr, [ $t:tt ]) => {{ let len = read_value!($next, usize); read_value!($next, [$t; len]) }}; ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); } impl<T: PartialOrd> Change for T { fn chmax(&mut self, x: T) { if *self < x { *self = x; } } fn chmin(&mut self, x: T) { if *self > x { *self = x; } } } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); } 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 calc(a: &[i64], b: &[i64], p: i64, x: i64) -> usize { let n = a.len(); let mut ans = 0; for i in 0..n { let diff = x - a[i]; if diff >= 0 { ans += b.upper_bound(&diff) + n - b.lower_bound(&(p - a[i])); } else { ans += b.upper_bound(&(p + diff)) - b.lower_bound(&(p - a[i])); } } ans } fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););} input! { n: usize, k: usize, p: i64, a: [i64; n], b: [i64; n], } let mut a = a; let mut b = b; a.sort(); b.sort(); let mut pass = p; let mut fail = -1; while pass - fail > 1 { let mid = (pass + fail) / 2; if calc(&a, &b, p, mid) >= k { pass = mid; } else { fail = mid; } } puts!("{}\n", pass); }