#669763 (Rust) No.1557 Binary Variable

• 問題: No.1557 Binary Variable
• ユーザー: Moss_Local
• 提出日時: 2021-06-25 22:34:19
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 305 ms / 2,000 ms
• コード長: 8,152 bytes
• コンパイル時間: 13,087 ms
• コンパイル使用メモリ: 402,140 KB
• 実行使用メモリ: 24,284 KB
• 最終ジャッジ日時: 2024-06-25 08:38:48
• 合計ジャッジ時間: 21,739 ms
• ジャッジサーバーID （参考情報）: judge5 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	126 ms; 20,180 KB
testcase_01	AC	107 ms; 20,484 KB
testcase_02	AC	3 ms; 7,972 KB
testcase_03	AC	3 ms; 8,264 KB
testcase_04	AC	98 ms; 17,600 KB
testcase_05	AC	95 ms; 17,628 KB
testcase_06	AC	91 ms; 17,576 KB
testcase_07	AC	94 ms; 17,580 KB
testcase_08	AC	119 ms; 17,716 KB
testcase_09	AC	123 ms; 17,836 KB
testcase_10	AC	159 ms; 18,472 KB
testcase_11	AC	159 ms; 18,572 KB
testcase_12	AC	116 ms; 17,664 KB
testcase_13	AC	163 ms; 18,628 KB
testcase_14	AC	269 ms; 22,300 KB
testcase_15	AC	167 ms; 18,820 KB
testcase_16	AC	258 ms; 21,700 KB
testcase_17	AC	238 ms; 19,908 KB
testcase_18	AC	220 ms; 22,132 KB
testcase_19	AC	288 ms; 24,132 KB
testcase_20	AC	285 ms; 23,748 KB
testcase_21	AC	287 ms; 23,604 KB
testcase_22	AC	287 ms; 23,904 KB
testcase_23	AC	285 ms; 23,572 KB
testcase_24	AC	293 ms; 24,168 KB
testcase_25	AC	296 ms; 24,044 KB
testcase_26	AC	292 ms; 24,072 KB
testcase_27	AC	292 ms; 24,120 KB
testcase_28	AC	305 ms; 24,188 KB
testcase_29	AC	294 ms; 24,284 KB
testcase_30	AC	292 ms; 24,140 KB
testcase_31	AC	296 ms; 24,024 KB
testcase_32	AC	293 ms; 24,192 KB
testcase_33	AC	285 ms; 23,408 KB
testcase_34	AC	4 ms; 8,116 KB
testcase_35	AC	3 ms; 8,180 KB
testcase_36	AC	3 ms; 8,120 KB

コンパイルメッセージ

warning: unnecessary parentheses around type
  --> src/main.rs:67:15
   |
67 | fn readi() -> (i64) {
   |               ^   ^
   |
   = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
   |
67 - fn readi() -> (i64) {
67 + fn readi() -> i64 {
   |

warning: unnecessary parentheses around match arm expression
   --> src/main.rs:229:46
    |
229 |             std::ops::Bound::Included(&x) => (x + 1),
    |                                              ^     ^
    |
help: remove these parentheses
    |
229 -             std::ops::Bound::Included(&x) => (x + 1),
229 +             std::ops::Bound::Included(&x) => x + 1,
    |

warning: unused variable: `i`
   --> src/main.rs:300:9
    |
300 |     for i in 0..m {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

ソースコード

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::fmt::Debug;
use std::fs::File;
use std::io::prelude::*;
use std::io::*;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::{Add, Mul, Neg, Sub};
use std::str;
use std::thread::park_timeout;
use std::vec;
use std::{cmp, process::Output};
use std::{cmp::Ordering, env::consts::DLL_PREFIX};
use std::{cmp::Ordering::*, f32::consts::PI};

const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const FINF: f64 = 122337203685.0;
const INF128: i128 = 1223372036854775807000000000000;
const LINF: i64 = 2147483647;
const MOD: i64 = 1000000007;
// const MOD: i64 = 998244353;
// const MOD: i64 = INF;

const UMOD: usize = MOD as usize;
use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        println!("{}", $x);
    };
}
macro_rules! d {
    ($x:expr) => {
        println!("{:?}", $x);
    };
}
macro_rules! dd {
    (x:expr) => {
        dbg!(x);
    };
}

// use str::Chars;

// use str::Chars;
#[allow(dead_code)]
fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

#[allow(dead_code)]
fn readi() -> (i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    iter.next().unwrap().parse::<i64>().unwrap()
}

#[allow(dead_code)]
fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}
#[allow(dead_code)]
fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

fn readff() -> (f64, f64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<f64>().unwrap(),
        iter.next().unwrap().parse::<f64>().unwrap(),
    )
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readcc() -> (char, char) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<char>().unwrap(),
        iter.next().unwrap().parse::<char>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuu() -> (usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
        iter.next().unwrap().parse::<usize>().unwrap(),
    )
}

fn readiiii() -> (i64, i64, i64, i64) {
    let mut str = String::new();
    let _ = stdin().read_line(&mut str).unwrap();
    let mut iter = str.split_whitespace();
    (
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
        iter.next().unwrap().parse::<i64>().unwrap(),
    )
}

pub struct SEG<M: Monoid> {
    n: usize,
    buf: Vec<M::T>,
}

impl<M: Monoid> SEG<M> {
    #[allow(dead_code)]
    pub fn new(n: usize) -> SEG<M> {
        SEG {
            n,
            buf: vec![M::id(); 2 * n],
        }
    }

    #[allow(dead_code)]
    pub fn update(&mut self, k: usize, a: M::T) {
        let mut k = k + self.n;
        self.buf[k] = a;

        while k > 0 {
            k >>= 1;
            self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);
        }
    }

    #[allow(dead_code)]
    pub fn add(&mut self, k: usize, a: &M::T) {
        let mut k = k + self.n;
        self.buf[k] = M::op(&self.buf[k], a);

        while k > 0 {
            k >>= 1;
            self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);
        }
    }

    #[allow(dead_code)]
    pub fn get(&self, i: usize) -> M::T {
        self.query(i, i + 1)
    }

    #[allow(dead_code)]
    pub fn query_range<R: std::ops::RangeBounds<usize>>(&self, range: R) -> M::T {
        let l = match range.start_bound() {
            std::ops::Bound::Excluded(&x) => {
                assert!(x > 0);
                x - 1
            }
            std::ops::Bound::Included(&x) => x,
            std::ops::Bound::Unbounded => 0,
        };
        let r = match range.end_bound() {
            std::ops::Bound::Excluded(&x) => x,
            std::ops::Bound::Included(&x) => (x + 1),
            std::ops::Bound::Unbounded => self.n,
        };

        self.query(l, r)
    }

    #[allow(dead_code)]
    pub fn query(&self, l: usize, r: usize) -> M::T {
        let mut vl = M::id();
        let mut vr = M::id();

        let mut l = l + self.n;
        let mut r = r + self.n;

        while l < r {
            if l & 1 == 1 {
                vl = M::op(&vl, &self.buf[l]);
                l += 1;
            }
            if r & 1 == 1 {
                r -= 1;
                vr = M::op(&self.buf[r], &vr);
            }

            l >>= 1;
            r >>= 1;
        }
        M::op(&vl, &vr)
    }
}
pub trait Monoid {
    type T: Clone;
    fn id() -> Self::T;
    fn op(a: &Self::T, b: &Self::T) -> Self::T;
}

pub enum MON {}
impl Monoid for MON {
    type T = usize;
    fn id() -> Self::T {
        1
    }
    fn op(a: &Self::T, b: &Self::T) -> Self::T {
        *a * *b
    }
}
fn vector_compression(vec: &mut Vec<usize>) -> Vec<usize> {
    let n = vec.len();
    let mut res = vec![0; n];
    let mut bt = BTreeMap::new();
    for i in 0..n {
        *bt.entry(vec[i]).or_insert(1) += 1;
    }
    let mut bt2 = BTreeMap::new();
    let mut cnt: usize = 0;
    for i in bt {
        bt2.insert(i.0, cnt);
        cnt += 1;
    }
    for i in 0..n {
        // let mut xx: usize = vec[i];
        res[i] = *bt2.get(&(vec[i])).unwrap();
    }

    return res;
}
fn solve() {
    let (n, m) = readuu();
    let mut vp = vec![(0, 0); 0];
    let mut vec = vec![];
    for i in 0..m {
        let (a, b) = readuu();
        vec.push(b);
        vec.push(a);
    }
    let vec = vector_compression(&mut vec);
    for i in 0..m {
        vp.push((vec[2 * i], vec[2 * i + 1]));
    }
    vp.sort();
    // println!("{:?}", vp.clone());
    let mut seg: SEG<MON> = SEG::new(401010);
    let mut res = n;
    for i in 0..m {
        let p = vp[i].0;
        let x = seg.query(vp[i].1, vp[i].0 + 1);
        if x != 0 {
            seg.update(p, 0);
            res -= 1;
        }
    }
    println!("{:?}", res);
    return;
}

fn main() {
    solve();
}