#472774 (Rust) No.119 旅行のツアーの問題

• 問題: No.119 旅行のツアーの問題
• ユーザー: cotton_fn_
• 提出日時: 2020-04-30 05:27:08
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 2 ms / 5,000 ms
• コード長: 6,749 bytes
• コンパイル時間: 18,731 ms
• コンパイル使用メモリ: 387,560 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-05-08 04:08:29
• 合計ジャッジ時間: 19,895 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,812 KB
testcase_02	AC	1 ms; 6,816 KB
testcase_03	AC	1 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,944 KB
testcase_08	AC	1 ms; 6,940 KB
testcase_09	AC	1 ms; 6,940 KB
testcase_10	AC	1 ms; 6,944 KB
testcase_11	AC	1 ms; 6,940 KB
testcase_12	AC	2 ms; 6,944 KB
testcase_13	AC	1 ms; 6,940 KB
testcase_14	AC	1 ms; 6,944 KB
testcase_15	AC	1 ms; 6,944 KB
testcase_16	AC	1 ms; 6,940 KB
testcase_17	AC	1 ms; 6,940 KB
testcase_18	AC	1 ms; 6,940 KB
testcase_19	AC	1 ms; 6,940 KB
testcase_20	AC	1 ms; 6,944 KB
testcase_21	AC	1 ms; 6,944 KB
testcase_22	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: usize = kin.input();
    let mut mf = Dinic::new(2 * n + 2);
    let mut ofs = 0;
    let mut w = vec![0; n];
    for (i, (b, c)) in kin.iter::<(i64, i64)>().take(n).enumerate() {
        w[i] = b.max(c);
        ofs += w[i];
        if b < c {
            mf.add_edge(2 * n, i, c - b);
        } else if b > c {
            mf.add_edge(i, 2 * n + 1, b - c);
            w[i] -= b - c;
        }
    }
    let m: usize = kin.input();
    for (d, e) in kin.iter::<(usize, usize)>().take(m) {
        mf.add_edge(n + e, d, w[e]);
    }
    for u in 0..n {
        mf.add_edge(u, n + u, w[u]);
    }
    let ans = ofs - mf.run(2 * n, 2 * n + 1).0;
    outputln!("{}", ans);
}
pub struct Dinic {
    g: Vec<Vec<(usize, bool)>>,
    es: Vec<(usize, 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(), true));
        self.g[v].push((self.es.len(), false));
        self.es.push((u, v, cap));
    }
    fn edge(&self, flow: &[i64], i: usize, fw: bool) -> (usize, i64) {
        let (u, v, c) = self.es[i];
        if fw {
            (v, c - flow[i])
        } else {
            (u, flow[i])
        }
    }
    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 (v, r) in self.g[u].iter().map(|&(i, fw)| self.edge(&flow, i, fw)) {
                    if dist[v] == !0 && r > 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, fw) in &self.g[u] {
            let (v, r) = self.edge(&flow, i, fw);
            if dist[v] == dist[u] + 1 && r > 0 {
                let a = self.dfs(flow, dist, v, t, (cap - add).min(r));
                if a > 0 {
                    if fw {
                        flow[i] += a;
                    } else {
                        flow[i] -= 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);
}