結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | phspls |
提出日時 | 2023-01-23 03:21:04 |
言語 | Rust (1.77.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,499 bytes |
コンパイル時間 | 4,683 ms |
コンパイル使用メモリ | 137,752 KB |
実行使用メモリ | 89,976 KB |
最終ジャッジ日時 | 2023-09-07 09:17:21 |
合計ジャッジ時間 | 22,376 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 332 ms
88,272 KB |
testcase_01 | AC | 253 ms
85,816 KB |
testcase_02 | AC | 314 ms
89,976 KB |
testcase_03 | AC | 54 ms
38,000 KB |
testcase_04 | AC | 95 ms
77,304 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 92 ms
40,264 KB |
testcase_08 | AC | 82 ms
39,216 KB |
testcase_09 | AC | 350 ms
83,996 KB |
testcase_10 | AC | 332 ms
85,096 KB |
testcase_11 | AC | 357 ms
84,140 KB |
testcase_12 | AC | 334 ms
83,200 KB |
testcase_13 | AC | 485 ms
87,992 KB |
testcase_14 | AC | 497 ms
88,096 KB |
testcase_15 | AC | 463 ms
87,492 KB |
testcase_16 | AC | 466 ms
87,088 KB |
testcase_17 | AC | 481 ms
87,492 KB |
testcase_18 | AC | 1 ms
4,388 KB |
testcase_19 | AC | 2 ms
4,380 KB |
testcase_20 | AC | 3 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 460 ms
87,160 KB |
testcase_23 | AC | 354 ms
83,356 KB |
testcase_24 | AC | 477 ms
87,408 KB |
testcase_25 | AC | 436 ms
86,080 KB |
testcase_26 | AC | 450 ms
86,720 KB |
testcase_27 | AC | 1 ms
4,376 KB |
testcase_28 | AC | 1 ms
4,380 KB |
testcase_29 | AC | 1 ms
4,376 KB |
testcase_30 | AC | 1 ms
4,376 KB |
testcase_31 | AC | 1 ms
4,376 KB |
testcase_32 | AC | 1 ms
4,376 KB |
testcase_33 | AC | 1 ms
4,380 KB |
testcase_34 | AC | 1 ms
4,380 KB |
testcase_35 | AC | 1 ms
4,380 KB |
testcase_36 | AC | 1 ms
4,380 KB |
testcase_37 | AC | 1 ms
4,376 KB |
testcase_38 | AC | 310 ms
88,608 KB |
testcase_39 | AC | 309 ms
88,536 KB |
testcase_40 | AC | 353 ms
83,612 KB |
testcase_41 | AC | 1,774 ms
88,532 KB |
testcase_42 | AC | 1,664 ms
88,576 KB |
testcase_43 | AC | 1,913 ms
88,692 KB |
testcase_44 | TLE | - |
コンパイルメッセージ
warning: associated function `find_closed` is never used --> Main.rs:40:8 | 40 | fn find_closed(&self, l: usize, r: usize) -> T { | ^^^^^^^^^^^ | = note: `#[warn(dead_code)]` on by default warning: 1 warning emitted
ソースコード
#[derive(Debug, Clone)] struct SparseTable<T, F> { vals: Vec<Vec<T>>, operator: F, usize_bit_cnt: u32, } impl<T, F> SparseTable<T, F> where T: std::fmt::Debug + Copy, F: Fn(T, T) -> T, { fn new(v: &Vec<T>, unit: T, operator: F) -> Self { let size = usize::max_value().count_ones() - v.len().leading_zeros(); let size = size as usize; let limit = 1usize << size; let mut vals = Vec::with_capacity(size+1); vals.push(vec![unit; limit]); for i in 0..v.len() { vals[0][i] = v[i]; } for i in 1..=size { let length = 1usize << i; let jsize = limit+1-length; vals.push(vec![unit; jsize]); for start in 0..jsize { let left = start; let right = start + (1usize << (i-1)); vals[i][start] = operator(vals[i - 1][left], vals[i - 1][right]); } } Self { vals, operator, usize_bit_cnt: usize::max_value().count_ones() } } fn find_closed(&self, l: usize, r: usize) -> T { self.find(l, r+1) } fn find(&self, l: usize, r: usize) -> T { let length = r - l; if length == 1 { return self.vals[0][l]; } let idx = self.usize_bit_cnt - length.leading_zeros() - 1; let idx = idx as usize; let left = self.vals[idx][l]; let right = self.vals[idx][r - (1usize << idx)]; (self.operator)(left, right) } } fn gcd(a: usize, b: usize) -> usize { if b == 0 { return a; } gcd(b, a%b) } fn main() { let mut n = String::new(); std::io::stdin().read_line(&mut n).ok(); let n: usize = n.trim().parse().unwrap(); let mut a = String::new(); std::io::stdin().read_line(&mut a).ok(); let a: Vec<usize> = a.trim().split_whitespace().map(|s| s.parse().unwrap()).collect(); let sparse_table = SparseTable::new(&a, 0usize, |x, y| gcd(x, y)); let mut result = 0usize; for i in 0..n { if a[i] == 1 { result += n - i; continue; } let mut lower = i+1; let mut upper = n; while upper > lower { let middle = (upper + lower + 1) / 2; if sparse_table.find(i, middle) > 1 { lower = middle; } else { upper = middle - 1; } } result += n - upper; } println!("{}", result);}