結果

問題 No.1675 Strange Minimum Query
ユーザー phsplsphspls
提出日時 2022-10-20 22:55:35
言語 Rust
(1.77.0 + proconio)
結果
WA  
実行時間 -
コード長 4,149 bytes
コンパイル時間 12,699 ms
コンパイル使用メモリ 377,756 KB
実行使用メモリ 27,648 KB
最終ジャッジ日時 2024-06-30 13:38:33
合計ジャッジ時間 24,457 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 1 ms
5,376 KB
testcase_03 AC 240 ms
7,672 KB
testcase_04 AC 240 ms
9,292 KB
testcase_05 AC 21 ms
6,400 KB
testcase_06 AC 284 ms
8,368 KB
testcase_07 AC 325 ms
10,716 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 138 ms
21,260 KB
testcase_11 AC 63 ms
18,920 KB
testcase_12 AC 150 ms
22,752 KB
testcase_13 AC 189 ms
27,648 KB
testcase_14 AC 283 ms
27,392 KB
testcase_15 WA -
testcase_16 AC 1 ms
5,376 KB
testcase_17 AC 61 ms
7,936 KB
testcase_18 AC 86 ms
8,548 KB
testcase_19 AC 147 ms
22,048 KB
testcase_20 AC 295 ms
21,772 KB
testcase_21 AC 268 ms
24,044 KB
testcase_22 AC 345 ms
25,468 KB
testcase_23 AC 227 ms
11,132 KB
testcase_24 AC 231 ms
15,992 KB
testcase_25 AC 152 ms
9,600 KB
testcase_26 AC 82 ms
11,980 KB
testcase_27 AC 250 ms
24,304 KB
testcase_28 AC 122 ms
19,880 KB
testcase_29 AC 106 ms
21,176 KB
testcase_30 AC 86 ms
12,372 KB
testcase_31 AC 323 ms
14,804 KB
testcase_32 AC 466 ms
27,192 KB
testcase_33 AC 464 ms
27,212 KB
testcase_34 AC 451 ms
27,228 KB
testcase_35 AC 357 ms
27,472 KB
testcase_36 AC 351 ms
27,480 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused imports: `cmp::Reverse`, `collections::BinaryHeap`
 --> src/main.rs:1:11
  |
1 | use std::{collections::BinaryHeap, cmp::Reverse};
  |           ^^^^^^^^^^^^^^^^^^^^^^^  ^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused variable: `x`
   --> src/main.rs:119:93
    |
119 |     let mut segtree = LazySegmentTree::new(n, 1e9 as usize, 1e9 as usize, |x, y| x.min(y), |x, y| y, |x, y| y);
    |                                                                                             ^ help: if this is intentional, prefix it with an underscore: `_x`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `x`
   --> src/main.rs:119:103
    |
119 |     let mut segtree = LazySegmentTree::new(n, 1e9 as usize, 1e9 as usize, |x, y| x.min(y), |x, y| y, |x, y| y);
    |                                                                                                       ^ help: if this is intentional, prefix it with an underscore: `_x`

warning: field `orgn` is never read
 --> src/main.rs:6:5
  |
4 | struct LazySegmentTree<F, G, H, T, U> {
  |        --------------- field in this struct
5 |     n: usize,
6 |     orgn: usize,
  |     ^^^^
  |
  = note: `LazySegmentTree` 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

ソースコード

diff # 

use std::{collections::BinaryHeap, cmp::Reverse};

#[derive(Debug, Clone)]
struct LazySegmentTree<F, G, H, T, U> {
    n: usize,
    orgn: usize,
    unit: T,
    mem: Vec<T>,
    lazy_unit: U,
    lazy: Vec<U>,
    operator: F,
    mapper: G,
    composer: H,
}

impl<F, G, H, T, U> LazySegmentTree<F, G, H, T, U> where
T: std::fmt::Debug + Copy,
U: std::fmt::Debug + std::cmp::PartialEq + Copy,
F: Fn(T, T) -> T,
G: Fn(T, U) -> T,
H: Fn(U, U) -> U,
{
    fn new(n: usize, unit: T, lazy_unit: U, operator: F, mapper: G, composer: H) -> Self {
        let mut size = 1usize;
        while size < n { size *= 2; }
        Self {
            n: size,
            orgn: n,
            unit: unit,
            mem: vec![unit; size*2-1],
            lazy_unit: lazy_unit,
            lazy: vec![lazy_unit; size*2-1],
            operator: operator,
            mapper: mapper,
            composer: composer,
        }
    }

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

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

    fn update_closed(&mut self, left: usize, right: usize, val: U) {
        self.update(left, right+1, val);
    }

    fn update(&mut self, left: usize, right: usize, val: U) {
        self._update(left, right, val, 0, 0, self.n);
    }

    fn get(&mut self, pos: usize) -> T {
        self.find_closed(pos, pos)
    }

    fn _evaluate(&mut self, k: usize) {
        if self.lazy[k] == self.lazy_unit { return; }
        if k < self.n-1 {
            let left = self._left(k);
            let right = self._right(k);
            self.lazy[left] = (self.composer)(self.lazy[left], self.lazy[k]);
            self.lazy[right] = (self.composer)(self.lazy[right], self.lazy[k]);
        }
        self.mem[k] = (self.mapper)(self.mem[k], self.lazy[k]);
        self.lazy[k] = self.lazy_unit;
    }
    fn _find(&mut self, a: usize, b: usize, nodenum: usize, l: usize, r: usize) -> T {
        self._evaluate(nodenum);
        if r <= a || b <= l {
            self.unit
        } else if a <= l && r <= b {
            self.mem[nodenum]
        } else {
            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 _update(&mut self, a: usize, b: usize, x: U, nodenum: usize, l: usize, r: usize) {
        self._evaluate(nodenum);
        if a <= l && r <= b {
            self.lazy[nodenum] = (self.composer)(self.lazy[nodenum], x);
            self._evaluate(nodenum);
        } else if a < r && l < b {
            self._update(a, b, x, self._left(nodenum), l, (l + r) / 2);
            self._update(a, b, x, self._right(nodenum), (l + r) / 2, r);
            self.mem[nodenum] = (self.operator)(self.mem[self._left(nodenum)], self.mem[self._right(nodenum)]);
        }
    }
    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 main() {
    let mut nq = String::new();
    std::io::stdin().read_line(&mut nq).ok();
    let nq: Vec<usize> = nq.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let n = nq[0];
    let q = nq[1];
    let mut queries = (0..q).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp: Vec<usize> = temp.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
            (temp[0]-1, temp[1]-1, temp[2])
        })
        .collect::<Vec<_>>();

    queries.sort_by_key(|&(_, _, b)| b);
    let mut segtree = LazySegmentTree::new(n, 1e9 as usize, 1e9 as usize, |x, y| x.min(y), |x, y| y, |x, y| y);
    for &(l, r, b) in queries.iter() {
        segtree.update_closed(l, r, b);
    }
    if queries.iter().filter(|&&(l, r, b)| b != segtree.find_closed(l, r)).count() == 0 {
        println!("{}", (0..n).map(|i| segtree.get(i).to_string()).collect::<Vec<_>>().join(" "));
    } else {
        println!("-1");
    }
}
0