結果
問題 | No.1211 円環はお断り |
ユーザー | koba-e964 |
提出日時 | 2020-08-30 14:44:44 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 1,399 ms / 2,000 ms |
コード長 | 4,387 bytes |
コンパイル時間 | 2,397 ms |
コンパイル使用メモリ | 166,196 KB |
実行使用メモリ | 30,004 KB |
最終ジャッジ日時 | 2023-08-15 09:58:18 |
合計ジャッジ時間 | 20,596 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,388 KB |
testcase_01 | AC | 1 ms
4,384 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,384 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,384 KB |
testcase_08 | AC | 1 ms
4,384 KB |
testcase_09 | AC | 1 ms
4,384 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 1 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,384 KB |
testcase_13 | AC | 437 ms
16,076 KB |
testcase_14 | AC | 764 ms
21,068 KB |
testcase_15 | AC | 604 ms
20,460 KB |
testcase_16 | AC | 907 ms
29,404 KB |
testcase_17 | AC | 65 ms
4,380 KB |
testcase_18 | AC | 561 ms
18,400 KB |
testcase_19 | AC | 67 ms
4,384 KB |
testcase_20 | AC | 91 ms
4,380 KB |
testcase_21 | AC | 86 ms
4,432 KB |
testcase_22 | AC | 471 ms
16,640 KB |
testcase_23 | AC | 549 ms
19,332 KB |
testcase_24 | AC | 295 ms
11,404 KB |
testcase_25 | AC | 16 ms
4,384 KB |
testcase_26 | AC | 662 ms
22,132 KB |
testcase_27 | AC | 296 ms
11,572 KB |
testcase_28 | AC | 682 ms
22,628 KB |
testcase_29 | AC | 509 ms
18,168 KB |
testcase_30 | AC | 678 ms
23,596 KB |
testcase_31 | AC | 258 ms
10,384 KB |
testcase_32 | AC | 804 ms
27,296 KB |
testcase_33 | AC | 909 ms
30,004 KB |
testcase_34 | AC | 901 ms
29,912 KB |
testcase_35 | AC | 897 ms
29,988 KB |
testcase_36 | AC | 902 ms
29,944 KB |
testcase_37 | AC | 874 ms
29,912 KB |
testcase_38 | AC | 895 ms
29,960 KB |
testcase_39 | AC | 901 ms
29,908 KB |
testcase_40 | AC | 1,399 ms
29,956 KB |
testcase_41 | AC | 1 ms
4,380 KB |
testcase_42 | 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, [graph1; $len:expr]) => {{ let mut g = vec![vec![]; $len]; let ab = read_value!($next, [(usize1, usize1)]); for (a, b) in ab { g[a].push(b); g[b].push(a); } g }}; ($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")); } #[allow(unused)] macro_rules! debug { ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap()); } #[allow(unused)] macro_rules! debugln { ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).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 } } const B: usize = 17; fn check(x: i64, a: &[i64], acc: &[i64], k: usize) -> bool { let n = a.len(); let mut dp = vec![vec![0; 2 * n + 1]; B]; for i in 0..n { let idx = acc.lower_bound(&(acc[i] + x)); dp[0][i] = idx; dp[0][i + n] = min(idx + n, 2 * n); } dp[0][2 * n] = 2 * n; for i in 0..B - 1 { for j in 0..2 * n + 1 { dp[i + 1][j] = dp[i][dp[i][j]]; } } for i in 0..n { let mut to = i; for j in 0..B { if (k & 1 << j) != 0 { to = dp[j][to]; } } if to <= i + n { return true; } } false } 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, a: [i64; n], } let sum: i64 = a.iter().sum(); let mut pass = 0; let mut fail = sum / k as i64 + 1; let mut acc = vec![0; 2 * n + 1]; for i in 0..2 * n { acc[i + 1] = acc[i] + a[i % n]; } while fail - pass > 1 { let mid = (fail + pass) / 2; if check(mid, &a, &acc, k) { pass = mid; } else { fail = mid; } } puts!("{}\n", pass); } 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(); }