結果

問題 No.1301 Strange Graph Shortest Path
ユーザー koba-e964koba-e964
提出日時 2020-12-08 03:14:37
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 219 ms / 3,000 ms
コード長 6,030 bytes
コンパイル時間 13,570 ms
コンパイル使用メモリ 378,672 KB
実行使用メモリ 44,004 KB
最終ジャッジ日時 2024-09-17 14:18:59
合計ジャッジ時間 21,369 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
5,248 KB
testcase_01 AC 1 ms
5,248 KB
testcase_02 AC 169 ms
42,740 KB
testcase_03 AC 139 ms
38,144 KB
testcase_04 AC 219 ms
41,216 KB
testcase_05 AC 142 ms
43,052 KB
testcase_06 AC 196 ms
38,144 KB
testcase_07 AC 180 ms
40,004 KB
testcase_08 AC 143 ms
38,648 KB
testcase_09 AC 182 ms
36,224 KB
testcase_10 AC 147 ms
38,068 KB
testcase_11 AC 196 ms
39,552 KB
testcase_12 AC 201 ms
39,344 KB
testcase_13 AC 175 ms
43,008 KB
testcase_14 AC 175 ms
36,224 KB
testcase_15 AC 174 ms
37,504 KB
testcase_16 AC 211 ms
41,216 KB
testcase_17 AC 177 ms
43,144 KB
testcase_18 AC 162 ms
39,248 KB
testcase_19 AC 193 ms
38,400 KB
testcase_20 AC 192 ms
37,504 KB
testcase_21 AC 177 ms
41,396 KB
testcase_22 AC 197 ms
38,528 KB
testcase_23 AC 178 ms
42,752 KB
testcase_24 AC 196 ms
38,044 KB
testcase_25 AC 215 ms
41,088 KB
testcase_26 AC 189 ms
39,424 KB
testcase_27 AC 194 ms
39,412 KB
testcase_28 AC 152 ms
42,392 KB
testcase_29 AC 212 ms
40,704 KB
testcase_30 AC 203 ms
40,932 KB
testcase_31 AC 205 ms
40,704 KB
testcase_32 AC 1 ms
5,376 KB
testcase_33 AC 96 ms
34,432 KB
testcase_34 AC 201 ms
44,004 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#[allow(unused_imports)]
use std::cmp::*;
#[allow(unused_imports)]
use std::collections::*;
use std::io::{Write, BufWriter};
// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        let mut next = move || -> String{
            bytes.by_ref().map(|r|r.unwrap() as char)
                .skip_while(|c|c.is_whitespace())
                .take_while(|c|!c.is_whitespace())
                .collect()
        };
        input_inner!{next, $($r)*}
    };
}

macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};
    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

macro_rules! read_value {
    ($next:expr, [graph1; $len:expr]) => {{
        let mut g = vec![vec![]; $len];
        let ab = read_value!($next, [(usize1, usize1)]);
        for (a, b) in ab {
            g[a].push(b);
            g[b].push(a);
        }
        g
    }};
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };
    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };
    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };
    ($next:expr, usize1) => (read_value!($next, usize) - 1);
    ($next:expr, [ $t:tt ]) => {{
        let len = read_value!($next, usize);
        read_value!($next, [$t; len])
    }};
    ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));
}

#[allow(unused)]
macro_rules! debug {
    ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());
}
#[allow(unused)]
macro_rules! debugln {
    ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());
}

type Cap = isize;
type Cost = i64;
#[derive(Debug, Clone, Copy)]
struct Edge {
    to: usize,
    cap: Cap,
    cost: Cost,
    rev: usize, // rev is the position of reverse edge in graph[to]
}


#[derive(Debug, Clone)]
struct MinCostFlow {
    n: usize,
    graph: Vec<Vec<Edge>>,
    h: Vec<Cost>, // potential,
    dist: Vec<Cost>, // minimum distance
    prev: Vec<(usize, usize)>, // previous vertex and edge
}

impl MinCostFlow {
    // Initializes this solver. n is the number of vertices.
    fn new(n: usize) -> Self {
        MinCostFlow {
            n: n,
            graph: vec![vec![]; n],
            h: vec![0; n],
            dist: vec![0; n],
            prev: vec![(0, 0); n],
        }
    }
    fn add_edge(&mut self, from: usize, to: usize, cap: Cap, cost: Cost) {
        let fst = Edge {
            to: to,
            cap: cap,
            cost: cost,
            rev: self.graph[to].len(),
        };
        self.graph[from].push(fst);
        let snd = Edge {
            to: from,
            cap: 0,
            cost: -cost,
            rev: self.graph[from].len() - 1,
        };
        self.graph[to].push(snd);
    }
  // Calcucates the minimum cost flow whose source is s, sink is t, and flow is f.
    fn min_cost_flow(&mut self, s: usize, t: usize, mut f: Cap) -> Cost {
        let n = self.n;
        let inf: Cost = Cost::MAX / 2;
        let mut res = 0;
        for i in 0..n {
            self.h[i] = 0;
        }
        let h = &mut self.h;
        let dist = &mut self.dist;
        while f > 0 {
            let mut que = std::collections::BinaryHeap::<(Cost, usize)>::new();
            for i in 0..n {
                dist[i] = inf;
            }
            dist[s] = 0;
            que.push((0, s));
            while let Some((d, v)) = que.pop() {
                let d = -d;
                if dist[v] < d {
                    continue;
                }
                for (i, &e) in self.graph[v].iter().enumerate() {
                    if e.cap > 0 && dist[e.to] > dist[v] + e.cost + h[v] - h[e.to] {
                        dist[e.to] = dist[v] + e.cost + h[v] - h[e.to];
                        self.prev[e.to] = (v, i);
                        que.push((-dist[e.to], e.to));
                    }
                }
            }
            if dist[t] == inf {
	        return -1; // Cannot add flow anymore
            }
            for i in 0..n {
                h[i] += dist[i];
            }
            // Add flow fully
            let mut d = f;
            let mut i = t;
            while i != s {
                let (pv, pe) = self.prev[i];
	        d = std::cmp::min(d, self.graph[pv][pe].cap);
                i = pv;
            }
            f -= d;
            res += d as Cost * h[t];
            i = t;
            while i != s {
                let (pv, pe) = self.prev[i];
                self.graph[pv][pe].cap -= d;
                let erev = self.graph[pv][pe].rev;
	        self.graph[i][erev].cap += d;
                i = pv;
            }
        }
        return res;
    }
}

fn solve() {
    let out = std::io::stdout();
    let mut out = BufWriter::new(out.lock());
    macro_rules! puts {
        ($($format:tt)*) => (let _ = write!(out,$($format)*););
    }
    #[allow(unused)]
    macro_rules! putvec {
        ($v:expr) => {
            for i in 0..$v.len() {
                puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});
            }
        }
    }
    input! {
        n: usize, m: usize,
        uvcd: [(usize1, usize1, i64, i64); m],
    }
    let mut flow = MinCostFlow::new(n);
    for &(u, v, c, d) in &uvcd {
        flow.add_edge(u, v, 1, c);
        flow.add_edge(u, v, 1, d);
        flow.add_edge(v, u, 1, c);
        flow.add_edge(v, u, 1, d);
    }
    let ans = flow.min_cost_flow(0, n - 1, 2isize);
    puts!("{}\n", ans);
}

fn main() {
    // In order to avoid potential stack overflow, spawn a new thread.
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    thd.spawn(|| solve()).unwrap().join().unwrap();
}
0