#471717 (Rust) No.654 Air E869120

• 問題: No.654 Air E869120
• ユーザー: cotton_fn_
• 提出日時: 2020-04-27 16:18:12
• 言語: Rust (1.77.0)
• 結果: AC
• 実行時間: 13 ms / 2,000 ms
• コード長: 6,757 bytes
• コンパイル時間: 19,589 ms
• コンパイル使用メモリ: 378,480 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-01 16:15:20
• 合計ジャッジ時間: 15,327 ms
• ジャッジサーバーID （参考情報）: judge2 / judge4

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,816 KB
testcase_01	AC	1 ms; 6,816 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	2 ms; 6,940 KB
testcase_04	AC	1 ms; 6,944 KB
testcase_05	AC	1 ms; 6,940 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	1 ms; 6,940 KB
testcase_08	AC	1 ms; 6,944 KB
testcase_09	AC	1 ms; 6,944 KB
testcase_10	AC	9 ms; 6,944 KB
testcase_11	AC	6 ms; 6,940 KB
testcase_12	AC	6 ms; 6,944 KB
testcase_13	AC	8 ms; 6,944 KB
testcase_14	AC	6 ms; 6,944 KB
testcase_15	AC	7 ms; 6,940 KB
testcase_16	AC	10 ms; 6,940 KB
testcase_17	AC	13 ms; 6,940 KB
testcase_18	AC	11 ms; 6,940 KB
testcase_19	AC	11 ms; 6,940 KB
testcase_20	AC	4 ms; 6,944 KB
testcase_21	AC	5 ms; 6,944 KB
testcase_22	AC	3 ms; 6,940 KB
testcase_23	AC	4 ms; 6,944 KB
testcase_24	AC	4 ms; 6,940 KB
testcase_25	AC	2 ms; 6,944 KB
testcase_26	AC	3 ms; 6,944 KB
testcase_27	AC	2 ms; 6,940 KB
testcase_28	AC	2 ms; 6,940 KB
testcase_29	AC	2 ms; 6,940 KB
testcase_30	AC	3 ms; 6,944 KB
testcase_31	AC	2 ms; 6,940 KB
testcase_32	AC	2 ms; 6,944 KB
testcase_33	AC	3 ms; 6,944 KB
testcase_34	AC	2 ms; 6,944 KB
testcase_35	AC	1 ms; 6,940 KB
testcase_36	AC	1 ms; 6,944 KB
testcase_37	AC	1 ms; 6,940 KB
testcase_38	AC	1 ms; 6,940 KB
testcase_39	AC	1 ms; 6,944 KB

ソースコード

#![allow(unused_imports, unused_macros)]

use kyoproio::*;
use std::{
    collections::*,
    io::{self, prelude::*},
    iter,
    mem::{replace, swap},
};

fn main() -> io::Result<()> {
    std::thread::Builder::new()
        .stack_size(64 * 1024 * 1024)
        .spawn(solve)?
        .join()
        .unwrap();
    Ok(())
}

fn solve() {
    let stdin = io::stdin();
    let mut kin = KInput::new(stdin.lock());
    let stdout = io::stdout();
    let mut out = io::BufWriter::new(stdout.lock());
    macro_rules! output { ($($args:expr),+) => { write!(&mut out, $($args),+).unwrap(); }; }
    macro_rules! outputln {
        ($($args:expr),+) => { output!($($args),+); outputln!(); };
        () => { output!("\n"); if cfg!(debug_assertions) { out.flush().unwrap(); } }
    }

    let (n, m, d): (usize, usize, i64) = kin.input();
    let mut map = vec![BTreeMap::new(); n + 1];
    let mut g = vec![Vec::new(); n + 1];
    for _ in 0..m {
        let (u, v, p, q, w): (usize, usize, i64, i64, i64) = kin.input();
        map[u].insert(p, 0);
        map[v].insert(q + d, 0);
        g[u].push((v, p, q + d, w));
    }
    let mut ofs = vec![0; n + 2];
    for u in 1..=n {
        ofs[u + 1] = ofs[u];
        for (i, v) in map[u].values_mut().enumerate() {
            *v = i;
            ofs[u + 1] += 1;
        }
    }
    let mut dinic = Dinic::new(ofs[n + 1]);
    for u in 1..=n {
        for i in ofs[u]..ofs[u + 1] - 1 {
            dinic.add_edge(i, i + 1, 1e15 as i64);
        }
        for &(v, p, q, w) in &g[u] {
            let i = ofs[u] + map[u].get(&p).unwrap();
            let j = ofs[v] + map[v].get(&q).unwrap();
            dinic.add_edge(i, j, w);
        }
    }
    let ans = dinic.run(0, ofs[n + 1] - 1).0;
    outputln!("{}", ans);
}

pub struct Dinic {
    g: Vec<Vec<usize>>,
    es: Vec<(usize, i64)>,
}
impl Dinic {
    pub fn new(n: usize) -> Self {
        Self {
            g: vec![Vec::new(); n],
            es: Vec::new(),
        }
    }
    pub fn add_edge(&mut self, u: usize, v: usize, cap: i64) {
        self.g[u].push(self.es.len());
        self.es.push((v, cap));
        self.g[v].push(self.es.len());
        self.es.push((u, 0));
    }
    pub fn run(&self, s: usize, t: usize) -> (i64, Vec<i64>) {
        let mut flow = vec![0; self.es.len()];
        let mut sum = 0;
        loop {
            let mut dist = vec![!0; self.g.len()];
            dist[s] = 0;
            let mut que = VecDeque::new();
            que.push_back(s);
            'bfs: while let Some(u) = que.pop_front() {
                for (f, (v, c)) in self.g[u].iter().map(|&i| (flow[i], self.es[i])) {
                    if dist[v] == !0 && c - f > 0 {
                        dist[v] = dist[u] + 1;
                        if v == t {
                            break 'bfs;
                        }
                        que.push_back(v);
                    }
                }
            }
            let add = self.dfs(&mut flow, &mut dist, s, t, i64::max_value());
            if add == 0 {
                break;
            }
            sum += add;
        }
        (sum, flow)
    }
    fn dfs(&self, flow: &mut [i64], dist: &mut [usize], u: usize, t: usize, cap: i64) -> i64 {
        if u == t {
            return cap;
        }
        let mut add = 0;
        for (i, (v, c)) in self.g[u].iter().map(|&i| (i, self.es[i])) {
            if dist[v] == dist[u] + 1 && c > flow[i] {
                let a = self.dfs(flow, dist, v, t, (cap - add).min(c - flow[i]));
                if a > 0 {
                    flow[i] += a;
                    flow[i ^ 1] -= a;
                    add += a;
                } else {
                    dist[v] = 0;
                }
            }
        }
        add
    }
}

// -----------------------------------------------------------------------------
pub mod kyoproio {
    use std::io::prelude::*;
    pub trait Input {
        fn str(&mut self) -> &str;
        fn input<T: InputParse>(&mut self) -> T {
            T::input(self)
        }
        fn iter<T: InputParse>(&mut self) -> Iter<T, Self> {
            Iter(self, std::marker::PhantomData)
        }
        fn seq<T: InputParse, B: std::iter::FromIterator<T>>(&mut self, n: usize) -> B {
            self.iter().take(n).collect()
        }
    }
    pub struct KInput<R> {
        src: R,
        buf: String,
        pos: usize,
    }
    impl<R: BufRead> KInput<R> {
        pub fn new(src: R) -> Self {
            Self {
                src,
                buf: String::with_capacity(1024),
                pos: 0,
            }
        }
    }
    impl<R: BufRead> Input for KInput<R> {
        fn str(&mut self) -> &str {
            loop {
                if self.pos >= self.buf.len() {
                    self.pos = 0;
                    self.buf.clear();
                    if self.src.read_line(&mut self.buf).expect("io error") == 0 {
                        return &self.buf;
                    }
                }
                let range = self.pos
                    ..self.buf[self.pos..]
                        .find(|c: char| c.is_ascii_whitespace())
                        .map(|i| i + self.pos)
                        .unwrap_or_else(|| self.buf.len());
                self.pos = range.end + 1;
                if range.end > range.start {
                    return &self.buf[range];
                }
            }
        }
    }
    pub struct Iter<'a, T, I: ?Sized>(&'a mut I, std::marker::PhantomData<*const T>);
    impl<'a, T: InputParse, I: Input + ?Sized> Iterator for Iter<'a, T, I> {
        type Item = T;
        fn next(&mut self) -> Option<T> {
            Some(self.0.input())
        }
    }
    pub trait InputParse: Sized {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self;
    }
    impl InputParse for Vec<u8> {
        fn input<I: Input + ?Sized>(src: &mut I) -> Self {
            src.str().as_bytes().to_owned()
        }
    }
    macro_rules! from_str_impl {
        { $($T:ty)* } => {
            $(impl InputParse for $T {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    src.str().parse::<$T>().expect("parse error")
                }
            })*
        }
    }
    from_str_impl! {
        String char bool f32 f64 isize i8 i16 i32 i64 i128 usize u8 u16 u32 u64 u128
    }
    macro_rules! tuple_impl {
        ($H:ident $($T:ident)*) => {
            impl<$H: InputParse, $($T: InputParse),*> InputParse for ($H, $($T),*) {
                fn input<I: Input + ?Sized>(src: &mut I) -> Self {
                    ($H::input(src), $($T::input(src)),*)
                }
            }
            tuple_impl!($($T)*);
        };
        () => {}
    }
    tuple_impl!(A B C D E F G);
}