#540724 (Rust) No.1194 Replace

• 問題: No.1194 Replace
• ユーザー: ziita
• 提出日時: 2020-08-26 22:18:17
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 327 ms / 2,000 ms
• コード長: 4,904 bytes
• コンパイル時間: 14,838 ms
• コンパイル使用メモリ: 379,336 KB
• 実行使用メモリ: 38,792 KB
• 最終ジャッジ日時: 2024-11-07 14:17:50
• 合計ジャッジ時間: 21,425 ms
• ジャッジサーバーID （参考情報）: judge4 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	232 ms; 30,032 KB
testcase_01	AC	246 ms; 31,580 KB
testcase_02	AC	166 ms; 22,840 KB
testcase_03	AC	134 ms; 20,224 KB
testcase_04	AC	248 ms; 31,440 KB
testcase_05	AC	225 ms; 29,856 KB
testcase_06	AC	197 ms; 24,124 KB
testcase_07	AC	327 ms; 38,668 KB
testcase_08	AC	323 ms; 38,672 KB
testcase_09	AC	316 ms; 38,668 KB
testcase_10	AC	312 ms; 38,660 KB
testcase_11	AC	321 ms; 38,660 KB
testcase_12	AC	311 ms; 38,792 KB
testcase_13	AC	207 ms; 22,204 KB
testcase_14	AC	162 ms; 17,976 KB
testcase_15	AC	136 ms; 18,016 KB
testcase_16	AC	192 ms; 21,620 KB
testcase_17	AC	109 ms; 14,992 KB
testcase_18	AC	122 ms; 14,940 KB
testcase_19	AC	199 ms; 21,600 KB
testcase_20	AC	1 ms; 5,248 KB
testcase_21	AC	1 ms; 5,248 KB
testcase_22	AC	1 ms; 5,248 KB
testcase_23	AC	43 ms; 8,216 KB
testcase_24	AC	14 ms; 5,248 KB
testcase_25	AC	7 ms; 5,248 KB
testcase_26	AC	64 ms; 9,324 KB
testcase_27	AC	11 ms; 5,248 KB
testcase_28	AC	26 ms; 5,560 KB
testcase_29	AC	3 ms; 5,248 KB

ソースコード

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

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 998244353;
const INF: i64 = std::i64::MAX/2;

pub struct UnionFind {
    data: Vec<i32>,
}

impl UnionFind {
    pub fn new(n: usize) -> Self{
        UnionFind {
            data: vec![-1;n]
        }
    }
    pub fn root(&mut self, x: usize) -> usize{
        if self.data[x]<0 {
            x
        }
        else {
            let p = self.data[x] as usize;
            self.data[x] = self.root(p) as i32;
            self.data[x] as usize
        }
    }
    pub fn unite(&mut self, x: usize, y: usize){
        let rx = self.root(x);
        let ry = self.root(y);
        if rx!=ry {
            let (rx,ry) = if self.data[rx]<=self.data[ry] {
                (rx,ry)
            }
            else{
                (ry,rx)
            };
            self.data[rx] += self.data[ry];
            self.data[ry] = rx as i32;
        }
    }
    pub fn same(&mut self, x: usize, y: usize) ->  bool{
        self.root(x) == self.root(y)
    }
    pub fn size(&mut self, x: usize) -> i32 {
        let r = self.root(x);
        - self.data[r]
    }
}

fn solve() {
    let (n,m) = read!(i64,usize);
    let bc = read!(usize,usize;m);
    let mut a = vec![];
    for (b,c) in &bc {
        a.push(b);
        a.push(c);
    }
    a.sort();
    a.dedup();
    let mut map = HashMap::new();
    for i in 0..a.len() {
        map.insert(a[i],i);
    }
    let mut edge = vec![vec![];a.len()];
    for (b,c) in &bc {
        let s = *map.get(&b).unwrap();
        let t = *map.get(&c).unwrap();
        edge[t].push(s);
    }
    let mut ma = vec![0;a.len()];
    for i in (0..a.len()).rev() {
        dfs(i,&mut ma,&edge,i);
    }
    let mut sum = (n+1)*n/2;
    for i in 0..a.len() {
        sum += (a[ma[i]] - a[i]) as i64;
    }
    println!("{}",sum);
}

fn dfs(cur: usize, mut ma: &mut Vec<usize>, edge: &Vec<Vec<usize>>, val: usize) {
    ma[cur] = max(ma[cur],val);
    ma[cur] = max(ma[cur],cur);
    for &e in &edge[cur] {
        if ma[e]>=val {
            continue;
        }
        dfs(e,&mut ma,&edge,val);
    }
}

fn run() {
    solve();
}