結果

問題 No.1036 Make One With GCD 2
ユーザー phsplsphspls
提出日時 2023-01-22 02:52:37
言語 Rust
(1.83.0 + proconio)
結果
TLE  
実行時間 -
コード長 2,663 bytes
コンパイル時間 12,818 ms
コンパイル使用メモリ 377,984 KB
実行使用メモリ 411,008 KB
最終ジャッジ日時 2024-06-24 07:53:26
合計ジャッジ時間 22,652 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample -- * 4
other TLE * 1 -- * 40
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: field `orgn` is never read
 --> src/main.rs:5:5
  |
3 | struct SegmentTree<F, T> {
  |        ----------- field in this struct
4 |     n: usize,
5 |     orgn: usize,
  |     ^^^^
  |
  = note: `SegmentTree` has derived impls for the traits `Clone` and `Debug`, but these are intentionally ignored during dead code analysis
  = note: `#[warn(dead_code)]` on by default

warning: methods `find_closed` and `get` are never used
  --> src/main.rs:27:8
   |
11 | / impl<F, T> SegmentTree<F, T> where
12 | | T: std::fmt::Debug + Copy,
13 | | F: Fn(T, T) -> T
   | |________________- methods in this implementation
...
27 |       fn find_closed(&self, l: usize, r: usize) -> T {
   |          ^^^^^^^^^^^
...
44 |       fn get(&mut self, pos: usize) -> T {
   |          ^^^

ソースコード

diff # 

#[derive(Debug, Clone)]
struct SegmentTree<F, T> {
    n: usize,
    orgn: usize,
    unit: T,
    mem: Vec<T>,
    operator: F
}

impl<F, T> SegmentTree<F, T> where
T: std::fmt::Debug + Copy,
F: Fn(T, T) -> T
{
    fn new(n: usize, unit: T, operator: F) -> Self {
        let mut size = 1usize;
        while size < n { size *= 2; }
        Self {
            n: size,
            orgn: n,
            unit: unit,
            mem: vec![unit; size*2-1],
            operator: operator,
        }
    }

    fn find_closed(&self, l: usize, r: usize) -> T {
        self.find(l, r+1)
    }

    fn find(&self, l: usize, r: usize) -> T {
        self._find(l, r, 0, 0, self.n)
    }

    fn set(&mut self, pos: usize, val: T) {
        let mut pos = pos + self.n - 1;
        self.mem[pos] = val;
        while pos > 0 {
            pos = self._parent(pos);
            self.mem[pos] = (self.operator)(self.mem[self._left(pos)], self.mem[self._right(pos)]);
        }
    }

    fn get(&mut self, pos: usize) -> T {
        self.mem[pos + self.n - 1]
    }

    fn _find(&self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
        if r <= a || b <= l {
            return self.unit;
        } else if a <= l && r <= b {
            return self.mem[nodenum];
        }
        let left = self._find(a, b, self._left(nodenum), l, (l+r)/2);
        let right = self._find(a, b, self._right(nodenum), (l+r)/2, r);
        (self.operator)(left, right)
    }
    fn _left(&self, k: usize) -> usize {
        2*k+1
    }
    fn _right(&self, k: usize) -> usize {
        2*k+2
    }
    fn _parent(&self, k: usize) -> usize {
        (k-1)/2
    }
}

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 mut segtree = SegmentTree::new(n, 0usize, |x, y| gcd(x, y));
    for i in 0..n {
        segtree.set(i, a[i]);
    }
    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 segtree.find(i, middle) > 1 {
                lower = middle;
            } else {
                upper = middle - 1;
            }
        }
        result += n - upper;
    }
    println!("{}", result);
}
0