#406139 (Rust) No.945 YKC饅頭

提出ソース

結果

問題	No.945 YKC饅頭
ユーザー	akiradeveloper
提出日時	2019-12-08 00:23:42
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	389 ms / 2,000 ms
コード長	9,636 bytes
コンパイル時間	28,966 ms
コンパイル使用メモリ	376,876 KB
実行使用メモリ	20,352 KB
最終ジャッジ日時	2024-12-26 19:22:32
合計ジャッジ時間	28,827 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	2 ms 5,248 KB
testcase_02	AC	3 ms 5,248 KB
testcase_03	AC	3 ms 5,248 KB
testcase_04	AC	2 ms 5,248 KB
testcase_05	AC	3 ms 5,248 KB
testcase_06	AC	3 ms 5,248 KB
testcase_07	AC	3 ms 5,248 KB
testcase_08	AC	2 ms 5,248 KB
testcase_09	AC	3 ms 5,248 KB
testcase_10	AC	3 ms 5,248 KB
testcase_11	AC	2 ms 5,248 KB
testcase_12	AC	3 ms 5,248 KB
testcase_13	AC	3 ms 5,248 KB
testcase_14	AC	3 ms 5,248 KB
testcase_15	AC	3 ms 5,248 KB
testcase_16	AC	2 ms 5,248 KB
testcase_17	AC	3 ms 5,248 KB
testcase_18	AC	3 ms 5,248 KB
testcase_19	AC	2 ms 5,248 KB
testcase_20	AC	2 ms 5,248 KB
testcase_21	AC	2 ms 5,248 KB
testcase_22	AC	3 ms 5,248 KB
testcase_23	AC	3 ms 5,248 KB
testcase_24	AC	4 ms 5,248 KB
testcase_25	AC	3 ms 5,248 KB
testcase_26	AC	3 ms 5,248 KB
testcase_27	AC	2 ms 5,248 KB
testcase_28	AC	2 ms 5,248 KB
testcase_29	AC	2 ms 5,248 KB
testcase_30	AC	3 ms 5,248 KB
testcase_31	AC	27 ms 5,248 KB
testcase_32	AC	54 ms 8,960 KB
testcase_33	AC	115 ms 15,488 KB
testcase_34	AC	182 ms 11,264 KB
testcase_35	AC	320 ms 19,072 KB
testcase_36	AC	156 ms 6,656 KB
testcase_37	AC	156 ms 7,168 KB
testcase_38	AC	152 ms 8,192 KB
testcase_39	AC	65 ms 9,088 KB
testcase_40	AC	98 ms 14,976 KB
testcase_41	AC	87 ms 8,832 KB
testcase_42	AC	314 ms 12,544 KB
testcase_43	AC	202 ms 6,016 KB
testcase_44	AC	256 ms 17,664 KB
testcase_45	AC	268 ms 12,672 KB
testcase_46	AC	28 ms 8,192 KB
testcase_47	AC	190 ms 11,392 KB
testcase_48	AC	32 ms 5,248 KB
testcase_49	AC	108 ms 9,728 KB
testcase_50	AC	284 ms 13,184 KB
testcase_51	AC	385 ms 20,224 KB
testcase_52	AC	385 ms 20,224 KB
testcase_53	AC	389 ms 20,224 KB
testcase_54	AC	387 ms 20,224 KB
testcase_55	AC	380 ms 20,352 KB
testcase_56	AC	74 ms 15,232 KB
testcase_57	AC	72 ms 15,232 KB
testcase_58	AC	192 ms 18,816 KB
testcase_59	AC	212 ms 19,328 KB
testcase_60	AC	129 ms 16,768 KB
testcase_61	AC	195 ms 18,816 KB
testcase_62	AC	188 ms 18,816 KB
testcase_63	AC	78 ms 15,488 KB
testcase_64	AC	130 ms 16,896 KB
testcase_65	AC	118 ms 16,896 KB
testcase_66	AC	118 ms 16,640 KB
testcase_67	AC	164 ms 17,792 KB
testcase_68	AC	130 ms 16,896 KB
testcase_69	AC	90 ms 15,872 KB
testcase_70	AC	98 ms 16,000 KB
testcase_71	AC	99 ms 16,128 KB
testcase_72	AC	145 ms 17,280 KB
testcase_73	AC	201 ms 19,200 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: type `MIN_RUQ` should have an upper camel case name
   --> src/main.rs:147:8
    |
147 | struct MIN_RUQ;
    |        ^^^^^^^ help: convert the identifier to upper camel case: `MinRuq`
    |
    = note: `#[warn(non_camel_case_types)]` on by default

warning: unused variable: `out`
   --> src/main.rs:112:13
    |
112 |     let mut out = BufWriter::new(out.lock());
    |             ^^^ help: if this is intentional, prefix it with an underscore: `_out`
    |
    = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `t`
   --> src/main.rs:121:18
    |
121 |         let (l,r,t) = lrt[i];
    |                  ^ help: if this is intentional, prefix it with an underscore: `_t`

warning: variable does not need to be mutable
   --> src/main.rs:112:9
    |
112 |     let mut out = BufWriter::new(out.lock());
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: unused variable: `len`
   --> src/main.rs:160:52
    |
160 |     fn g(x: Self::Monoid, y: Self::OperatorMonoid, len: usize) -> Self::Monoid {
    |                                                    ^^^ help: if this is intentional, prefix it with an underscore: `_len`

warning: unused variable: `len`
   --> src/main.rs:216:39
    |
216 |     fn propagate(&mut self, k: usize, len: usize) {
    |                                       ^^^ help: if this is intentional, prefix it with an underscore: `_len`

warning: method `set_weight` is never used
   --> src/main.rs:213:8
    |
183 | impl<T: SEGImpl> SEG<T> {
    | ----------------------- method in this implementation
...
213 |     fn set_weight(&mut self, weight: &[usize]) {
    |        ^^^^^^^^^^
    |
    = note: `#[warn(dead_code)]` on by default

warning: variable `Y` should have a snake case name
   --> src/main.rs:127:13
    |
127 |     let mut Y = 0;
    |             ^ help: convert the identifier to snake case (notice the capitalization): `y`

ソースコード

raw source code

#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
    reader: R,
    buf: Vec<u8>,
    pos: usize,
}
impl Parser<io::Empty> {
    pub fn from_str(s: &str) -> Parser<io::Empty> {
        Parser {
            reader: io::empty(),
            buf: s.as_bytes().to_vec(),
            pos: 0,
        }
    }
}
impl<R: BufRead> Parser<R> {
    pub fn new(reader: R) -> Parser<R> {
        Parser {
            reader: reader,
            buf: vec![],
            pos: 0,
        }
    }
    pub fn update_buf(&mut self) {
        self.buf.clear();
        self.pos = 0;
        loop {
            let (len, complete) = {
                let buf2 = self.reader.fill_buf().unwrap();
                self.buf.extend_from_slice(buf2);
                let len = buf2.len();
                if len == 0 {
                    break;
                }
                (len, buf2[len - 1] <= 0x20)
            };
            self.reader.consume(len);
            if complete {
                break;
            }
        }
    }
    pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
        loop {
            let mut begin = self.pos;
            while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
                begin += 1;
            }
            let mut end = begin;
            while end < self.buf.len() && (self.buf[end] > 0x20) {
                end += 1;
            }
            if begin != self.buf.len() {
                self.pos = end;
                return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
            } else {
                self.update_buf();
            }
        }
    }
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}
fn solve() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());

    input!{
        n:usize,m:usize,
        lrt: [(usize,usize,char);m],
    }

    let mut seg: SEG<MIN_RUQ> = SEG::new(std::i64::MAX, n);
    for i in 0..m {
        let (l,r,t) = lrt[i];
        let l = l-1;
        let r = r-1;
        seg.update(l, r+1, i as i64);
    }

    let mut Y = 0;
    let mut K = 0;
    let mut C = 0;
    for i in 0..n {
        let mini = seg.query(i, i+1);
        if mini == std::i64::MAX {
            continue;
        }
        let mini = mini as usize;
        let (_,_,t) = lrt[mini];
        match t {
            'Y' => { Y+=1 },
            'K' => { K+=1 },
            'C' => { C+=1 },
            _ => unreachable!()
        }
    }

    println!("{} {} {}", Y,K,C);
}
struct MIN_RUQ;
impl SEGImpl for MIN_RUQ {
    type Monoid = i64;
    type OperatorMonoid = i64;
    fn m0() -> Self::Monoid {
        std::i64::MAX
    }
    fn om0() -> Self::OperatorMonoid {
        std::i64::MAX
    }
    fn f(x: Self::Monoid, y: Self::Monoid) -> Self::Monoid {
        std::cmp::min(x, y)
    }
    fn g(x: Self::Monoid, y: Self::OperatorMonoid, len: usize) -> Self::Monoid {
        std::cmp::min(x, y)
    }
    fn h(x: Self::OperatorMonoid, y: Self::OperatorMonoid) -> Self::OperatorMonoid {
        std::cmp::min(x, y)
    }
}
#[doc = " https://ei1333.github.io/luzhiled/snippets/structure/segment-tree.html"]
trait SEGImpl {
    type Monoid: Copy;
    type OperatorMonoid: Copy + PartialEq;
    fn m0() -> Self::Monoid;
    fn om0() -> Self::OperatorMonoid;
    fn f(x: Self::Monoid, y: Self::Monoid) -> Self::Monoid;
    fn g(x: Self::Monoid, y: Self::OperatorMonoid, len: usize) -> Self::Monoid;
    fn h(x: Self::OperatorMonoid, y: Self::OperatorMonoid) -> Self::OperatorMonoid;
}
struct SEG<T: SEGImpl> {
    n: usize,
    data: Vec<T::Monoid>,
    lazy: Vec<T::OperatorMonoid>,
    weight: Vec<usize>,
}
impl<T: SEGImpl> SEG<T> {
    fn new(init: T::Monoid, n: usize) -> SEG<T> {
        let mut m = 1;
        while m < n {
            m *= 2;
        }
        SEG {
            n: m,
            data: vec![init; m * 2],
            lazy: vec![T::om0(); m * 2],
            weight: Self::mk_weight(&vec![1; n]),
        }
    }
    fn mk_weight(xs: &[usize]) -> Vec<usize> {
        let n = xs.len();
        let mut m = 1;
        while m < n {
            m *= 2;
        }
        let mut res = vec![0; 2 * m];
        for i in 0..n {
            res[m + i] = xs[i];
        }
        for k in (1..m).rev() {
            let l = 2 * k;
            let r = 2 * k + 1;
            res[k] = res[l] + res[r];
        }
        res
    }
    fn set_weight(&mut self, weight: &[usize]) {
        self.weight = Self::mk_weight(weight);
    }
    fn propagate(&mut self, k: usize, len: usize) {
        let len = self.weight[k];
        if self.lazy[k] != T::om0() {
            if k < self.n {
                self.lazy[2 * k + 0] = T::h(self.lazy[2 * k + 0], self.lazy[k]);
                self.lazy[2 * k + 1] = T::h(self.lazy[2 * k + 1], self.lazy[k]);
            }
            self.data[k] = T::g(self.data[k], self.lazy[k], len);
            self.lazy[k] = T::om0();
        }
    }
    fn do_update(
        &mut self,
        a: usize,
        b: usize,
        x: T::OperatorMonoid,
        k: usize,
        l: usize,
        r: usize,
    ) -> T::Monoid {
        self.propagate(k, r - l);
        if r <= a || b <= l {
            self.data[k]
        } else if a <= l && r <= b {
            self.lazy[k] = T::h(self.lazy[k], x);
            self.propagate(k, r - l);
            self.data[k]
        } else {
            self.data[k] = T::f(
                self.do_update(a, b, x, 2 * k + 0, l, (l + r) >> 1),
                self.do_update(a, b, x, 2 * k + 1, (l + r) >> 1, r),
            );
            self.data[k]
        }
    }
    fn update(&mut self, a: usize, b: usize, x: T::OperatorMonoid) -> T::Monoid {
        let n = self.n;
        self.do_update(a, b, x, 1, 0, n)
    }
    fn do_query(&mut self, a: usize, b: usize, k: usize, l: usize, r: usize) -> T::Monoid {
        self.propagate(k, r - l);
        if r <= a || b <= l {
            T::m0()
        } else if a <= l && r <= b {
            self.data[k]
        } else {
            T::f(
                self.do_query(a, b, 2 * k + 0, l, (l + r) >> 1),
                self.do_query(a, b, 2 * k + 1, (l + r) >> 1, r),
            )
        }
    }
    fn query(&mut self, a: usize, b: usize) -> T::Monoid {
        let n = self.n;
        self.do_query(a, b, 1, 0, n)
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード