結果
問題 | No.1730 GCD on Blackboard in yukicoder |
ユーザー | koba-e964 |
提出日時 | 2021-11-05 21:30:46 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 102 ms / 2,000 ms |
コード長 | 2,669 bytes |
コンパイル時間 | 1,337 ms |
コンパイル使用メモリ | 158,216 KB |
実行使用メモリ | 19,800 KB |
最終ジャッジ日時 | 2023-08-07 22:57:40 |
合計ジャッジ時間 | 5,082 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 80 ms
12,000 KB |
testcase_01 | AC | 38 ms
8,684 KB |
testcase_02 | AC | 39 ms
8,688 KB |
testcase_03 | AC | 52 ms
14,904 KB |
testcase_04 | AC | 54 ms
14,988 KB |
testcase_05 | AC | 52 ms
14,864 KB |
testcase_06 | AC | 51 ms
14,904 KB |
testcase_07 | AC | 50 ms
13,088 KB |
testcase_08 | AC | 39 ms
8,668 KB |
testcase_09 | AC | 44 ms
12,832 KB |
testcase_10 | AC | 52 ms
15,100 KB |
testcase_11 | AC | 39 ms
8,772 KB |
testcase_12 | AC | 40 ms
8,676 KB |
testcase_13 | AC | 99 ms
19,772 KB |
testcase_14 | AC | 98 ms
19,800 KB |
testcase_15 | AC | 102 ms
19,752 KB |
testcase_16 | AC | 98 ms
19,800 KB |
testcase_17 | AC | 100 ms
19,748 KB |
testcase_18 | AC | 81 ms
14,252 KB |
testcase_19 | AC | 85 ms
13,632 KB |
testcase_20 | AC | 85 ms
18,348 KB |
testcase_21 | AC | 79 ms
16,268 KB |
testcase_22 | AC | 81 ms
13,992 KB |
testcase_23 | AC | 63 ms
11,956 KB |
testcase_24 | AC | 63 ms
11,956 KB |
testcase_25 | AC | 81 ms
13,600 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(); } 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, a: [usize; n], } const W: usize = 1_000_001; let mut f = vec![0; W]; for &a in &a { f[a] += 1; } let mut div = vec![0; W]; for i in 1..W { for j in 1..(W - 1) / i + 1 { div[i] += f[i * j]; } } let mut ans = vec![0; n]; for i in 1..W { let idx = n - div[i]; if idx < n { ans[idx] = max(ans[idx], i); } } for i in 1..n { ans[i] = max(ans[i], ans[i - 1]); } for i in 0..n { puts!("{}\n", ans[i]); } }