結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | phspls |
提出日時 | 2023-01-23 03:27:19 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 1,850 ms / 2,000 ms |
コード長 | 2,648 bytes |
コンパイル時間 | 1,984 ms |
コンパイル使用メモリ | 147,508 KB |
実行使用メモリ | 90,632 KB |
最終ジャッジ日時 | 2023-09-07 09:22:28 |
合計ジャッジ時間 | 20,790 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 286 ms
88,144 KB |
testcase_01 | AC | 252 ms
86,076 KB |
testcase_02 | AC | 298 ms
90,632 KB |
testcase_03 | AC | 48 ms
38,020 KB |
testcase_04 | AC | 85 ms
77,340 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 86 ms
40,328 KB |
testcase_08 | AC | 73 ms
39,356 KB |
testcase_09 | AC | 322 ms
84,032 KB |
testcase_10 | AC | 302 ms
83,188 KB |
testcase_11 | AC | 323 ms
84,204 KB |
testcase_12 | AC | 304 ms
85,148 KB |
testcase_13 | AC | 450 ms
87,992 KB |
testcase_14 | AC | 453 ms
88,144 KB |
testcase_15 | AC | 438 ms
87,080 KB |
testcase_16 | AC | 432 ms
87,180 KB |
testcase_17 | AC | 439 ms
87,808 KB |
testcase_18 | AC | 1 ms
4,376 KB |
testcase_19 | AC | 1 ms
4,376 KB |
testcase_20 | AC | 2 ms
4,380 KB |
testcase_21 | AC | 1 ms
4,380 KB |
testcase_22 | AC | 421 ms
86,924 KB |
testcase_23 | AC | 324 ms
83,960 KB |
testcase_24 | AC | 431 ms
87,420 KB |
testcase_25 | AC | 407 ms
86,072 KB |
testcase_26 | AC | 406 ms
86,688 KB |
testcase_27 | AC | 1 ms
4,380 KB |
testcase_28 | AC | 1 ms
4,376 KB |
testcase_29 | AC | 0 ms
4,380 KB |
testcase_30 | AC | 1 ms
4,376 KB |
testcase_31 | AC | 1 ms
4,380 KB |
testcase_32 | AC | 1 ms
4,376 KB |
testcase_33 | AC | 0 ms
4,384 KB |
testcase_34 | AC | 1 ms
4,376 KB |
testcase_35 | AC | 1 ms
4,380 KB |
testcase_36 | AC | 1 ms
4,376 KB |
testcase_37 | AC | 1 ms
4,380 KB |
testcase_38 | AC | 295 ms
88,684 KB |
testcase_39 | AC | 298 ms
88,676 KB |
testcase_40 | AC | 321 ms
82,884 KB |
testcase_41 | AC | 1,590 ms
88,672 KB |
testcase_42 | AC | 1,496 ms
89,908 KB |
testcase_43 | AC | 1,681 ms
88,688 KB |
testcase_44 | AC | 1,850 ms
88,628 KB |
コンパイルメッセージ
warning: associated function `find_closed` is never used --> Main.rs:43:8 | 43 | 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>>, block_size: Vec<usize>, 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); let block_size = (0..=size).map(|i| 1usize << i).collect::<Vec<_>>(); 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, block_size, 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 - self.block_size[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.max(y), x.min(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);}