結果
問題 | No.1194 Replace |
ユーザー | nebocco |
提出日時 | 2021-02-17 20:08:08 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 282 ms / 2,000 ms |
コード長 | 11,506 bytes |
コンパイル時間 | 13,578 ms |
コンパイル使用メモリ | 401,800 KB |
実行使用メモリ | 80,108 KB |
最終ジャッジ日時 | 2024-09-14 05:40:07 |
合計ジャッジ時間 | 19,781 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 188 ms
58,360 KB |
testcase_01 | AC | 212 ms
61,564 KB |
testcase_02 | AC | 160 ms
47,212 KB |
testcase_03 | AC | 128 ms
40,904 KB |
testcase_04 | AC | 211 ms
61,448 KB |
testcase_05 | AC | 199 ms
57,772 KB |
testcase_06 | AC | 171 ms
50,132 KB |
testcase_07 | AC | 272 ms
80,008 KB |
testcase_08 | AC | 271 ms
80,108 KB |
testcase_09 | AC | 275 ms
80,036 KB |
testcase_10 | AC | 269 ms
80,068 KB |
testcase_11 | AC | 275 ms
80,076 KB |
testcase_12 | AC | 282 ms
80,020 KB |
testcase_13 | AC | 161 ms
43,240 KB |
testcase_14 | AC | 133 ms
35,736 KB |
testcase_15 | AC | 117 ms
35,348 KB |
testcase_16 | AC | 171 ms
42,352 KB |
testcase_17 | AC | 108 ms
30,832 KB |
testcase_18 | AC | 104 ms
29,736 KB |
testcase_19 | AC | 174 ms
42,780 KB |
testcase_20 | AC | 1 ms
6,944 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 1 ms
6,940 KB |
testcase_23 | AC | 45 ms
15,904 KB |
testcase_24 | AC | 14 ms
7,296 KB |
testcase_25 | AC | 7 ms
6,940 KB |
testcase_26 | AC | 51 ms
16,908 KB |
testcase_27 | AC | 9 ms
6,940 KB |
testcase_28 | AC | 23 ms
9,280 KB |
testcase_29 | AC | 3 ms
6,940 KB |
ソースコード
fn main() { let mut io = IO::new(); input!{ from io, n: usize, m: usize, ed: [(i64, i64); m] } let mut aln = Vec::with_capacity(2*m); for &(u, v) in &ed { aln.push(u); aln.push(v); } let (_dict, aln, f) = compress(&aln, 0); let mut g = DirectedGraph::new(f.len()); for i in 0..m { g.add_edge(aln[i*2+1], aln[2*i], Void()); } let mut seen = (0..f.len()).collect::<Vec<usize>>(); let mut que = Vec::new(); for i in (0..f.len()).rev() { if seen[i] > i { continue; } que.push(i); while let Some(v) = que.pop() { for e in g.edges_from(v) { let u = e.to; if seen[u] < seen[v] { seen[u] = seen[v]; que.push(u); } } } } let mut ans = (n * (n + 1) / 2) as i64; for i in 0..f.len() { ans = ans - f[i] + f[seen[i]]; } io.println(ans); } use std::collections::HashMap; pub fn compress<T: Clone + Ord + std::hash::Hash>(l: &[T], start: usize)-> (HashMap<T, usize>, Vec<usize>, Vec<T>) { let mut f = l.to_owned(); f.sort(); f.dedup(); let dict: HashMap<T, usize> = f.iter().cloned().zip(start..f.len()+start).collect(); let res: Vec<usize> = l.iter().map(|x| *dict.get(x).unwrap()).collect(); (dict, res, f) } // ------------ algebraic traits start ------------ use std::marker::Sized; use std::ops::*; /// 元 pub trait Element: Sized + Clone + PartialEq {} impl<T: Sized + Clone + PartialEq> Element for T {} /// 結合性 pub trait Associative: Magma {} /// マグマ pub trait Magma: Element + Add<Output=Self> {} impl<T: Element + Add<Output=Self>> Magma for T {} /// 半群 pub trait SemiGroup: Magma + Associative {} impl<T: Magma + Associative> SemiGroup for T {} /// モノイド pub trait Monoid: SemiGroup + Zero {} impl<T: SemiGroup + Zero> Monoid for T {} pub trait ComMonoid: Monoid + AddAssign {} impl<T: Monoid + AddAssign> ComMonoid for T {} /// 群 pub trait Group: Monoid + Neg<Output=Self> {} impl<T: Monoid + Neg<Output=Self>> Group for T {} pub trait ComGroup: Group + ComMonoid {} impl<T: Group + ComMonoid> ComGroup for T {} /// 半環 pub trait SemiRing: ComMonoid + Mul<Output=Self> + One {} impl<T: ComMonoid + Mul<Output=Self> + One> SemiRing for T {} /// 環 pub trait Ring: ComGroup + SemiRing {} impl<T: ComGroup + SemiRing> Ring for T {} pub trait ComRing: Ring + MulAssign {} impl<T: Ring + MulAssign> ComRing for T {} /// 体 pub trait Field: ComRing + Div<Output=Self> + DivAssign {} impl<T: ComRing + Div<Output=Self> + DivAssign> Field for T {} /// 加法単元 pub trait Zero: Element { fn zero() -> Self; fn is_zero(&self) -> bool { *self == Self::zero() } } /// 乗法単元 pub trait One: Element { fn one() -> Self; fn is_one(&self) -> bool { *self == Self::one() } } macro_rules! impl_integer { ($($T:ty,)*) => { $( impl Associative for $T {} impl Zero for $T { fn zero() -> Self { 0 } fn is_zero(&self) -> bool { *self == 0 } } impl<'a> Zero for &'a $T { fn zero() -> Self { &0 } fn is_zero(&self) -> bool { *self == &0 } } impl One for $T { fn one() -> Self { 1 } fn is_one(&self) -> bool { *self == 1 } } impl<'a> One for &'a $T { fn one() -> Self { &1 } fn is_one(&self) -> bool { *self == &1 } } )* }; } impl_integer! { i8, i16, i32, i64, i128, isize, u8, u16, u32, u64, u128, usize, } // ------------ algebraic traits end ------------ // ------------ Graph impl start ------------ pub trait Cost: Element + Clone + Copy + std::fmt::Display + Eq + Ord + Zero + One + Add<Output = Self> + AddAssign + Sub<Output = Self> + Neg<Output = Self> { const MAX: Self; } #[derive(Copy, Clone)] pub struct Edge<C = Void> { // pub from: usize, pub to: usize, pub cost: C, pub id: usize } pub struct UndirectedGraph<C>(pub Vec<Vec<Edge<C>>>, pub usize); pub struct DirectedGraph<C>{ pub forward: Vec<Vec<Edge<C>>>, pub backward: Vec<Vec<Edge<C>>>, pub count: usize, } pub trait Graph<C: Element> { fn new(size: usize) -> Self; fn size(&self) -> usize; fn add_edge(&mut self, u: usize, v: usize, cost: C); fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>>; } impl<C: Element> Graph<C> for UndirectedGraph<C> { fn new(size: usize) -> Self { Self(vec![Vec::<Edge<C>>::new(); size], 0) } fn size(&self) -> usize { self.0.len() } fn add_edge(&mut self, u: usize, v: usize, cost: C) { self.0[u].push(Edge{ to: v, cost: cost.clone(), id: self.1 }); self.0[v].push(Edge{ to: u, cost: cost.clone(), id: self.1 }); self.1 += 1; } fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>> { self.0[v].iter() } } impl<C: Element> Graph<C> for DirectedGraph<C> { fn new(size: usize) -> Self { Self { forward: vec![Vec::<Edge<C>>::new(); size], backward: vec![Vec::<Edge<C>>::new(); size], count: 0 } } fn size(&self) -> usize { self.forward.len() } fn add_edge(&mut self, u: usize, v: usize, cost: C) { self.forward[u].push(Edge{ to: v, cost: cost.clone(), id: self.count }); self.backward[v].push(Edge{ to: u, cost: cost.clone(), id: self.count }); self.count += 1; } fn edges_from(&self, v: usize) -> std::slice::Iter<Edge<C>> { self.forward[v].iter() } } impl<C: Element> DirectedGraph<C> { pub fn edges_to(&self, u: usize) -> std::slice::Iter<Edge<C>> { self.backward[u].iter() } pub fn reverse(&self) -> Self { Self { forward: self.backward.clone(), backward: self.forward.clone(), count: self.count, } } } macro_rules! impl_cost { ($($T:ident,)*) => { $( impl Cost for $T { const MAX: Self = std::$T::MAX; } )* }; } impl_cost! { i8, i16, i32, i64, i128, isize, } #[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)] pub struct Void(); impl std::fmt::Display for Void { fn fmt(&self, f: &mut std::fmt::Formatter) -> std::fmt::Result { write!(f, "") } } impl Zero for Void { fn zero() -> Self { Void() } fn is_zero(&self) -> bool { true } } impl One for Void { fn one() -> Self { Void() } fn is_one(&self) -> bool { true } } impl Add for Void { type Output = Self; fn add(self, _: Self) -> Self { Void() } } impl AddAssign for Void { fn add_assign(&mut self, _: Self) {} } impl Sub for Void { type Output = Self; fn sub(self, _: Self) -> Self { Void() } } impl Neg for Void { type Output = Self; fn neg(self) -> Self { Void() } } impl Cost for Void { const MAX: Self = Void(); } // ------------ Graph impl end ------------ // ------------ io module start ------------ use std::io::{stdout, BufWriter, Read, StdoutLock, Write}; pub struct IO { iter: std::str::SplitAsciiWhitespace<'static>, buf: BufWriter<StdoutLock<'static>>, } impl IO { pub fn new() -> Self { let mut input = String::new(); std::io::stdin().read_to_string(&mut input).unwrap(); let input = Box::leak(input.into_boxed_str()); let out = Box::new(stdout()); IO { iter: input.split_ascii_whitespace(), buf: BufWriter::new(Box::leak(out).lock()), } } fn scan_str(&mut self) -> &'static str { self.iter.next().unwrap() } pub fn scan<T: Scan>(&mut self) -> <T as Scan>::Output { <T as Scan>::scan(self) } pub fn scan_vec<T: Scan>(&mut self, n: usize) -> Vec<<T as Scan>::Output> { (0..n).map(|_| self.scan::<T>()).collect() } pub fn print<T: Print>(&mut self, x: T) { <T as Print>::print(self, x); } pub fn println<T: Print>(&mut self, x: T) { self.print(x); self.print("\n"); } pub fn iterln<T: Print, I: Iterator<Item = T>>(&mut self, mut iter: I, delim: &str) { if let Some(v) = iter.next() { self.print(v); for v in iter { self.print(delim); self.print(v); } } self.print("\n"); } pub fn flush(&mut self) { self.buf.flush().unwrap(); } } impl Default for IO { fn default() -> Self { Self::new() } } pub trait Scan { type Output; fn scan(io: &mut IO) -> Self::Output; } macro_rules! impl_scan { ($($t:tt),*) => { $( impl Scan for $t { type Output = Self; fn scan(s: &mut IO) -> Self::Output { s.scan_str().parse().unwrap() } } )* }; } impl_scan!(i16, i32, i64, isize, u16, u32, u64, usize, String); pub enum Bytes {} impl Scan for Bytes { type Output = &'static [u8]; fn scan(s: &mut IO) -> Self::Output { s.scan_str().as_bytes() } } pub enum Chars {} impl Scan for Chars { type Output = Vec<char>; fn scan(s: &mut IO) -> Self::Output { s.scan_str().chars().collect() } } pub enum Usize1 {} impl Scan for Usize1 { type Output = usize; fn scan(s: &mut IO) -> Self::Output { s.scan::<usize>().wrapping_sub(1) } } impl<T: Scan, U: Scan> Scan for (T, U) { type Output = (T::Output, U::Output); fn scan(s: &mut IO) -> Self::Output { (T::scan(s), U::scan(s)) } } impl<T: Scan, U: Scan, V: Scan> Scan for (T, U, V) { type Output = (T::Output, U::Output, V::Output); fn scan(s: &mut IO) -> Self::Output { (T::scan(s), U::scan(s), V::scan(s)) } } impl<T: Scan, U: Scan, V: Scan, W: Scan> Scan for (T, U, V, W) { type Output = (T::Output, U::Output, V::Output, W::Output); fn scan(s: &mut IO) -> Self::Output { (T::scan(s), U::scan(s), V::scan(s), W::scan(s)) } } pub trait Print { fn print(w: &mut IO, x: Self); } macro_rules! impl_print_int { ($($t:ty),*) => { $( impl Print for $t { fn print(w: &mut IO, x: Self) { w.buf.write_all(x.to_string().as_bytes()).unwrap(); } } )* }; } impl_print_int!(i16, i32, i64, isize, u16, u32, u64, usize); impl Print for u8 { fn print(w: &mut IO, x: Self) { w.buf.write_all(&[x]).unwrap(); } } impl Print for &[u8] { fn print(w: &mut IO, x: Self) { w.buf.write_all(x).unwrap(); } } impl Print for &str { fn print(w: &mut IO, x: Self) { w.print(x.as_bytes()); } } impl Print for String { fn print(w: &mut IO, x: Self) { w.print(x.as_bytes()); } } impl<T: Print, U: Print> Print for (T, U) { fn print(w: &mut IO, (x, y): Self) { w.print(x); w.print(" "); w.print(y); } } impl<T: Print, U: Print, V: Print> Print for (T, U, V) { fn print(w: &mut IO, (x, y, z): Self) { w.print(x); w.print(" "); w.print(y); w.print(" "); w.print(z); } } mod neboccoio_macro { #[macro_export] macro_rules! input { (@start $io:tt @read @rest) => {}; (@start $io:tt @read @rest, $($rest: tt)*) => { input!(@start $io @read @rest $($rest)*) }; (@start $io:tt @read @rest mut $($rest:tt)*) => { input!(@start $io @read @mut [mut] @rest $($rest)*) }; (@start $io:tt @read @rest $($rest:tt)*) => { input!(@start $io @read @mut [] @rest $($rest)*) }; (@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: [$kind:tt; $len:tt] $($rest:tt)*) => { let $($mut)* $var = $io.scan_vec::<$kind>($len); input!(@start $io @read @rest $($rest)*) }; (@start $io:tt @read @mut [$($mut:tt)?] @rest $var:tt: $kind:tt $($rest:tt)*) => { let $($mut)* $var = $io.scan::<$kind>(); input!(@start $io @read @rest $($rest)*) }; (from $io:tt $($rest:tt)*) => { input!(@start $io @read @rest $($rest)*) }; } } // ------------ io module end ------------