結果

問題 No.1675 Strange Minimum Query
ユーザー ziitaziita
提出日時 2021-09-10 21:51:40
言語 Rust
(1.77.0)
結果
AC  
実行時間 764 ms / 2,000 ms
コード長 6,406 bytes
コンパイル時間 1,324 ms
コンパイル使用メモリ 162,372 KB
実行使用メモリ 30,200 KB
最終ジャッジ日時 2023-09-02 16:57:53
合計ジャッジ時間 18,997 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,384 KB
testcase_03 AC 295 ms
13,772 KB
testcase_04 AC 325 ms
18,000 KB
testcase_05 AC 97 ms
10,756 KB
testcase_06 AC 343 ms
15,304 KB
testcase_07 AC 415 ms
21,956 KB
testcase_08 AC 1 ms
4,380 KB
testcase_09 AC 4 ms
4,380 KB
testcase_10 AC 386 ms
22,536 KB
testcase_11 AC 172 ms
18,724 KB
testcase_12 AC 428 ms
22,880 KB
testcase_13 AC 563 ms
27,864 KB
testcase_14 AC 586 ms
27,912 KB
testcase_15 AC 587 ms
27,936 KB
testcase_16 AC 1 ms
4,380 KB
testcase_17 AC 121 ms
7,532 KB
testcase_18 AC 159 ms
8,540 KB
testcase_19 AC 318 ms
20,700 KB
testcase_20 AC 507 ms
25,492 KB
testcase_21 AC 489 ms
24,064 KB
testcase_22 AC 600 ms
28,612 KB
testcase_23 AC 368 ms
13,772 KB
testcase_24 AC 393 ms
16,188 KB
testcase_25 AC 242 ms
11,156 KB
testcase_26 AC 171 ms
12,068 KB
testcase_27 AC 457 ms
23,416 KB
testcase_28 AC 268 ms
20,756 KB
testcase_29 AC 251 ms
19,340 KB
testcase_30 AC 175 ms
11,968 KB
testcase_31 AC 482 ms
20,500 KB
testcase_32 AC 755 ms
30,172 KB
testcase_33 AC 764 ms
29,672 KB
testcase_34 AC 741 ms
29,724 KB
testcase_35 AC 689 ms
30,200 KB
testcase_36 AC 687 ms
29,728 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

// ---------- begin input macro ----------
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 より
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        let mut next = || { iter.next().unwrap() };
        input_inner!{next, $($r)*}
    };
    ($($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:ty) => {
        $next().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------


use std::cmp::*;
use std::collections::*;
use std::ops::*;
use std::marker::*;
 
const INF: i64 = std::i64::MAX/100;
const MOD: i64 = 1_000_000_007;
// const MOD: i64 = 998_244_353;

// ---------- begin lazy segment tree ----------
// https://yukicoder.me/submissions/379658 より
pub trait TE {
    type T: Clone;
    type E: Clone;
    fn fold(l:Self::T, r:Self::T) -> Self::T;
    fn eval(p:Self::T, x:Self::E) -> Self::T;
    fn merge(f:Self::E, g:Self::E) -> Self::E;
    fn e() -> Self::T;
    fn id() -> Self::E;
}

pub struct LazySegmentTree<R: TE> {
    size: usize,
    bit: usize,
    a: Vec<(R::T, R::E)>,
}

impl <R: TE> LazySegmentTree<R> {
    pub fn new(n: usize) -> LazySegmentTree<R> {
        let mut bit = 0;
        while (1 << bit) < n {
            bit += 1;
        }
        LazySegmentTree {
            size: 1 << bit,
            bit: bit,
            a: vec![(R::e(), R::id()); 2 << bit],
        }
    }
    pub fn build_by(z: &[R::T]) -> LazySegmentTree<R> {
        let n = z.len();
        let mut bit = 0;
        while (1 << bit) < n {
            bit += 1;
        }
        let mut a = vec![(R::e(), R::id()); 2 << bit];
        for (a, z) in a[(1 << bit)..].iter_mut().zip(z.iter()) {
            a.0 = z.clone();
        }
        for i in (1..(1 << bit)).rev() {
            let l = R::eval(a[2 * i].0.clone(), a[2 * i].1.clone());
            let r = R::eval(a[2 * i + 1].0.clone(), a[2 * i + 1].1.clone());
            a[i].0 = R::fold(l, r);
        }
        LazySegmentTree {
            size: 1 << bit,
            bit : bit,
            a: a,
        }
    }
    fn eval(&self, k: usize) -> R::T {
        R::eval(self.a[k].0.clone(), self.a[k].1.clone())
    }
    fn propagate(&mut self, x: usize) {
        let x = x + self.size;
        for i in (1..(self.bit + 1)).rev() {
            let k = x >> i;
            self.a[2 * k].1 = R::merge(self.a[2 * k].1.clone(), self.a[k].1.clone());
            self.a[2 * k + 1].1 = R::merge(self.a[2 * k + 1].1.clone(), self.a[k].1.clone());
            self.a[k].1 = R::id();
            self.a[k].0 = R::fold(self.eval(2 * k), self.eval(2 * k + 1));
        }
    }
    fn save(&mut self, x: usize) {
        let x = x + self.size;
        for i in 1..(self.bit + 1) {
            let k = x >> i;
            self.a[k].0 = R::fold(self.eval(2 * k), self.eval(2 * k + 1));
        }
    }
    pub fn update(&mut self, l: usize, r: usize, op: R::E) {
        self.propagate(l);
        self.propagate(r - 1);
        let mut x = l + self.size;
        let mut y = r + self.size;
        while x < y {
            if x & 1 == 1 {
                self.a[x].1 = R::merge(self.a[x].1.clone(), op.clone());
                x += 1;
            }
            if y & 1 == 1 {
                y -= 1;
                self.a[y].1 = R::merge(self.a[y].1.clone(), op.clone());
            }
            x >>= 1;
            y >>= 1;
        }
        self.save(l);
        self.save(r - 1);
    }
    pub fn find(&mut self, l: usize, r: usize) -> R::T {
        self.propagate(l);
        self.propagate(r - 1);
        let mut x = l + self.size;
        let mut y = r + self.size;
        let mut p = R::e();
        let mut q = R::e();
        while x < y {
            if x & 1 == 1 {
                p = R::fold(p, self.eval(x));
                x += 1;
            }
            if y & 1 == 1 {
                y -= 1;
                q = R::fold(self.eval(y), q);
            }
            x >>= 1;
            y >>= 1;
        }
        R::fold(p, q)
    }
}


struct R;
impl TE for R {
    type T = (i64,usize);
    type E = (i64,usize);
    fn fold(l: Self::T, r: Self::T) -> Self::T {
        min(l,r)
    }
    fn eval(p: Self::T, x: Self::E) -> Self::T {
        if x.1>p.1 {
            x
        }
        else {
            p
        }
    }
    fn merge(f: Self::E, g: Self::E) -> Self::E {
        if f.1>g.1 {
            f
        }
        else {
            g
        }
    }
    fn e() -> Self::T {
        (1_000_000_000,0)
    }
    fn id() -> Self::E {
        (1_000_000_000,0)
    }
}
// ---------- end lazy segment tree ----------

fn main() {
    input! {
        n: usize,
        q: usize,
        lrb: [(usize,usize,i64);q],
    }
    let mut seg = LazySegmentTree::<R>::new(n);
    for i in 0..n {
        seg.update(i,i+1,(1_000_000_000,0));
    }
    let mut v = vec![];
    for &(l,r,b) in &lrb {
        v.push((b,l-1,r-1));
    }
    v.sort();
    let mut idx = 1;
    for &(b,l,r) in &v {
        seg.update(l,r+1,(b,idx));
        idx += 1;
    }
    for &(b,l,r) in &v {
        let v = seg.find(l,r+1);
        if b!=v.0 {
            println!("-1");
            return;
        }
    }
    for i in 0..n-1 {
        print!("{} ",seg.find(i,i+1).0);
    }
    println!("{}",seg.find(n-1,n).0);
}
0