結果

問題 No.957 植林
ユーザー akakimidoriakakimidori
提出日時 2021-11-24 14:47:24
言語 Rust
(1.77.0)
結果
AC  
実行時間 690 ms / 2,000 ms
コード長 6,341 bytes
コンパイル時間 4,249 ms
コンパイル使用メモリ 152,376 KB
実行使用メモリ 10,944 KB
最終ジャッジ日時 2023-09-09 06:56:40
合計ジャッジ時間 23,425 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 27 ms
9,228 KB
testcase_04 AC 26 ms
8,900 KB
testcase_05 AC 27 ms
9,508 KB
testcase_06 AC 31 ms
10,016 KB
testcase_07 AC 28 ms
9,316 KB
testcase_08 AC 18 ms
9,444 KB
testcase_09 AC 18 ms
9,524 KB
testcase_10 AC 20 ms
9,772 KB
testcase_11 AC 18 ms
9,560 KB
testcase_12 AC 18 ms
9,436 KB
testcase_13 AC 15 ms
7,856 KB
testcase_14 AC 20 ms
10,280 KB
testcase_15 AC 17 ms
9,468 KB
testcase_16 AC 15 ms
7,848 KB
testcase_17 AC 16 ms
8,888 KB
testcase_18 AC 508 ms
9,476 KB
testcase_19 AC 539 ms
9,624 KB
testcase_20 AC 542 ms
9,792 KB
testcase_21 AC 573 ms
10,216 KB
testcase_22 AC 602 ms
10,084 KB
testcase_23 AC 633 ms
10,400 KB
testcase_24 AC 635 ms
10,864 KB
testcase_25 AC 684 ms
10,404 KB
testcase_26 AC 686 ms
10,652 KB
testcase_27 AC 690 ms
10,400 KB
testcase_28 AC 684 ms
10,648 KB
testcase_29 AC 687 ms
10,660 KB
testcase_30 AC 690 ms
10,396 KB
testcase_31 AC 510 ms
9,500 KB
testcase_32 AC 536 ms
9,628 KB
testcase_33 AC 552 ms
9,812 KB
testcase_34 AC 578 ms
10,176 KB
testcase_35 AC 608 ms
10,004 KB
testcase_36 AC 626 ms
10,412 KB
testcase_37 AC 637 ms
10,880 KB
testcase_38 AC 684 ms
10,536 KB
testcase_39 AC 686 ms
10,628 KB
testcase_40 AC 687 ms
10,584 KB
testcase_41 AC 12 ms
10,916 KB
testcase_42 AC 13 ms
10,944 KB
testcase_43 AC 15 ms
10,648 KB
testcase_44 AC 19 ms
10,652 KB
testcase_45 AC 1 ms
4,384 KB
testcase_46 AC 1 ms
4,376 KB
testcase_47 AC 1 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// ---------- begin max flow (Dinic) ----------
mod maxflow {
    pub trait MaxFlowCapacity:
        Copy + Ord + std::ops::Add<Output = Self> + std::ops::Sub<Output = Self>
    {
        fn zero() -> Self;
        fn inf() -> Self;
    }

    macro_rules! impl_primitive_integer_capacity {
        ($x:ty, $y:expr) => {
            impl MaxFlowCapacity for $x {
                fn zero() -> Self {
                    0
                }
                fn inf() -> Self {
                    $y
                }
            }
        };
    }

    impl_primitive_integer_capacity!(u32, std::u32::MAX);
    impl_primitive_integer_capacity!(u64, std::u64::MAX);
    impl_primitive_integer_capacity!(i32, std::i32::MAX);
    impl_primitive_integer_capacity!(i64, std::i64::MAX);

    #[derive(Clone)]
    struct Edge<Cap> {
        to_: u32,
        inv_: u32,
        cap_: Cap,
    }

    impl<Cap> Edge<Cap> {
        fn new(to: usize, inv: usize, cap: Cap) -> Self {
            Edge {
                to_: to as u32,
                inv_: inv as u32,
                cap_: cap,
            }
        }
        fn to(&self) -> usize {
            self.to_ as usize
        }
        fn inv(&self) -> usize {
            self.inv_ as usize
        }
    }

    impl<Cap: MaxFlowCapacity> Edge<Cap> {
        fn add(&mut self, cap: Cap) {
            self.cap_ = self.cap_ + cap;
        }
        fn sub(&mut self, cap: Cap) {
            self.cap_ = self.cap_ - cap;
        }
        fn cap(&self) -> Cap {
            self.cap_
        }
    }

    pub struct Graph<Cap> {
        graph: Vec<Vec<Edge<Cap>>>,
    }

    #[allow(dead_code)]
    pub struct EdgeIndex {
        src: usize,
        dst: usize,
        x: usize,
        y: usize,
    }

    impl<Cap: MaxFlowCapacity> Graph<Cap> {
        pub fn new(size: usize) -> Self {
            Self {
                graph: vec![vec![]; size],
            }
        }
        pub fn add_edge(&mut self, src: usize, dst: usize, cap: Cap) -> EdgeIndex {
            assert!(src.max(dst) < self.graph.len());
            assert!(cap >= Cap::zero());
            assert!(src != dst);
            let x = self.graph[src].len();
            let y = self.graph[dst].len();
            self.graph[src].push(Edge::new(dst, y, cap));
            self.graph[dst].push(Edge::new(src, x, Cap::zero()));
            EdgeIndex { src, dst, x, y }
        }
        // src, dst, used, intial_capacity
        #[allow(dead_code)]
        pub fn get_edge(&self, e: &EdgeIndex) -> (usize, usize, Cap, Cap) {
            let max = self.graph[e.src][e.x].cap() + self.graph[e.dst][e.y].cap();
            let used = self.graph[e.dst][e.y].cap();
            (e.src, e.dst, used, max)
        }
        pub fn flow(&mut self, src: usize, dst: usize) -> Cap {
            let size = self.graph.len();
            assert!(src.max(dst) < size);
            assert!(src != dst);
            let mut queue = std::collections::VecDeque::new();
            let mut level = vec![0; size];
            let mut it = vec![0; size];
            let mut ans = Cap::zero();
            loop {
                (|| {
                    level.clear();
                    level.resize(size, 0);
                    level[src] = 1;
                    queue.clear();
                    queue.push_back(src);
                    while let Some(v) = queue.pop_front() {
                        let d = level[v] + 1;
                        for e in self.graph[v].iter() {
                            let u = e.to();
                            if e.cap() > Cap::zero() && level[u] == 0 {
                                level[u] = d;
                                if u == dst {
                                    return;
                                }
                                queue.push_back(u);
                            }
                        }
                    }
                })();
                if level[dst] == 0 {
                    break;
                }
                it.clear();
                it.resize(size, 0);
                loop {
                    let f = self.dfs(dst, src, Cap::inf(), &mut it, &level);
                    if f == Cap::zero() {
                        break;
                    }
                    ans = ans + f;
                }
            }
            ans
        }
        fn dfs(&mut self, v: usize, src: usize, cap: Cap, it: &mut [usize], level: &[u32]) -> Cap {
            if v == src {
                return cap;
            }
            while let Some((u, inv)) = self.graph[v].get(it[v]).map(|p| (p.to(), p.inv())) {
                if level[u] + 1 == level[v] && self.graph[u][inv].cap() > Cap::zero() {
                    let cap = cap.min(self.graph[u][inv].cap());
                    let c = self.dfs(u, src, cap, it, level);
                    if c > Cap::zero() {
                        self.graph[v][it[v]].add(c);
                        self.graph[u][inv].sub(c);
                        return c;
                    }
                }
                it[v] += 1;
            }
            Cap::zero()
        }
    }
}
// ---------- end max flow (Dinic) ----------

fn read() -> (usize, usize, Vec<Vec<i64>>, Vec<i64>, Vec<i64>) {
    let mut s = String::new();
    use std::io::Read;
    std::io::stdin().read_to_string(&mut s).unwrap();
    let mut it = s.trim().split_whitespace().flat_map(|s| s.parse::<i64>());
    let mut next = || it.next().unwrap();
    let h = next() as usize;
    let w = next() as usize;
    let mut g = vec![vec![0; w]; h];
    let mut r = vec![0; h];
    let mut c = vec![0; w];
    for a in g.iter_mut().flatten().chain(&mut r).chain(&mut c) {
        *a = next();
    }
    (h, w, g, r, c)
}

fn main() {
    let (h, w, g, r, c) = read();
    let mut graph = maxflow::Graph::new(h + w + 2);
    let src = h + w;
    let dst = src + 1;
    for (i, r) in r.iter().enumerate() {
        graph.add_edge(src, i, *r);
    }
    for (j, c) in c.iter().enumerate() {
        graph.add_edge(src, h + j, *c);
    }
    for (i, g) in g.iter().enumerate() {
        for (j, g) in g.iter().enumerate() {
            graph.add_edge(i, dst, *g);
            graph.add_edge(h + j, i, *g);
        }
    }
    let ans = r.iter().chain(&c).sum::<i64>() - graph.flow(src, dst);
    println!("{}", ans);
}
0