Merge branch 'feature/segtree' into feature/lazysegtree

Author: TonalidadeHidrica

examples/practice2_d_maxflow.rs

@@ -0,0 +1,64 @@
+use ac_library_rs::MfGraph;
+use std::io::Read;
+
+#[allow(clippy::many_single_char_names)]
+#[allow(clippy::needless_range_loop)]
+fn main() {
+    const N: usize = 128;
+
+    let mut buf = String::new();
+    std::io::stdin().read_to_string(&mut buf).unwrap();
+    let mut input = buf.split_whitespace();
+
+    let n: usize = input.next().unwrap().parse().unwrap();
+    let m: usize = input.next().unwrap().parse().unwrap();
+    let mut s = vec![vec![false; N]; N];
+    for i in 1..=n {
+        for (j, c) in (1..=m).zip(input.next().unwrap().chars()) {
+            s[i][j] = c == '.';
+        }
+    }
+
+    let dy = [1, 0, -1, 0];
+    let dx = [0, 1, 0, -1];
+    let c = "v>^<".chars().collect::<Vec<_>>();
+    let mut graph = MfGraph::<i32>::new(128 * 128);
+
+    for i in 1..=n {
+        for j in 1..=m {
+            if (i + j) % 2 == 0 {
+                graph.add_edge(0, i * N + j, 1);
+                for (dy, dx) in dy.iter().zip(dx.iter()) {
+                    let k = (i as i32 + dy) as usize;
+                    let l = (j as i32 + dx) as usize;
+                    if s[i][j] && s[k][l] {
+                        graph.add_edge(i * N + j, k * N + l, 1);
+                    }
+                }
+            } else {
+                graph.add_edge(i * N + j, 1, 1);
+            }
+        }
+    }
+    println!("{}", graph.flow(0, 1));
+    let mut res: Vec<Vec<_>> = (1..=n)
+        .map(|i| (1..=m).map(|j| if s[i][j] { '.' } else { '#' }).collect())
+        .collect();
+    for e in graph.edges() {
+        let i = e.from / N;
+        let j = e.from % N;
+        let k = e.to / N;
+        let l = e.to % N;
+        if e.flow == 1 {
+            for h in 0..4 {
+                if i as i32 + dy[h] == k as i32 && j as i32 + dx[h] == l as i32 {
+                    res[i - 1][j - 1] = c[h];
+                    res[k - 1][l - 1] = c[h ^ 2];
+                }
+            }
+        }
+    }
+    for s in res {
+        println!("{}", s.iter().collect::<String>());
+    }
+}

src/lib.rs

@@ -22,6 +22,7 @@ pub use dsu::Dsu;
 pub use fenwicktree::FenwickTree;
 pub use lazysegtree::{LazySegtree, MapMonoid};
 pub use math::{crt, floor_sum, inv_mod, pow_mod};
+pub use maxflow::{Edge, MfGraph};
 pub use mincostflow::MinCostFlowGraph;
 pub use modint::{
     Barrett, DefaultId, DynamicModInt, Id, Mod1000000007, Mod998244353, ModInt, ModInt1000000007,

src/maxflow.rs

@@ -1 +1,325 @@
+#![allow(dead_code)]
+use crate::internal_queue::SimpleQueue;
+use crate::internal_type_traits::Integral;
+use std::cmp::min;
+use std::iter;
 
+impl<Cap> MfGraph<Cap>
+where
+    Cap: Integral,
+{
+    pub fn new(n: usize) -> MfGraph<Cap> {
+        MfGraph {
+            _n: n,
+            pos: Vec::new(),
+            g: iter::repeat_with(Vec::new).take(n).collect(),
+        }
+    }
+
+    pub fn add_edge(&mut self, from: usize, to: usize, cap: Cap) -> usize {
+        assert!(from < self._n);
+        assert!(to < self._n);
+        assert!(Cap::zero() <= cap);
+        let m = self.pos.len();
+        self.pos.push((from, self.g[from].len()));
+        let rev = self.g[to].len() + if from == to { 1 } else { 0 };
+        self.g[from].push(_Edge { to, rev, cap });
+        let rev = self.g[from].len() - 1;
+        self.g[to].push(_Edge {
+            to: from,
+            rev,
+            cap: Cap::zero(),
+        });
+        m
+    }
+}
+
+#[derive(Debug, PartialEq, Eq)]
+pub struct Edge<Cap: Integral> {
+    pub from: usize,
+    pub to: usize,
+    pub cap: Cap,
+    pub flow: Cap,
+}
+
+impl<Cap> MfGraph<Cap>
+where
+    Cap: Integral,
+{
+    pub fn get_edge(&self, i: usize) -> Edge<Cap> {
+        let m = self.pos.len();
+        assert!(i < m);
+        let _e = &self.g[self.pos[i].0][self.pos[i].1];
+        let _re = &self.g[_e.to][_e.rev];
+        Edge {
+            from: self.pos[i].0,
+            to: _e.to,
+            cap: _e.cap + _re.cap,
+            flow: _re.cap,
+        }
+    }
+    pub fn edges(&self) -> Vec<Edge<Cap>> {
+        let m = self.pos.len();
+        (0..m).map(|i| self.get_edge(i)).collect()
+    }
+    pub fn change_edge(&mut self, i: usize, new_cap: Cap, new_flow: Cap) {
+        let m = self.pos.len();
+        assert!(i < m);
+        assert!(Cap::zero() <= new_flow && new_flow <= new_cap);
+        let (to, rev) = {
+            let _e = &mut self.g[self.pos[i].0][self.pos[i].1];
+            _e.cap = new_cap - new_flow;
+            (_e.to, _e.rev)
+        };
+        let _re = &mut self.g[to][rev];
+        _re.cap = new_flow;
+    }
+
+    /// `s != t` must hold, otherwise it panics.
+    pub fn flow(&mut self, s: usize, t: usize) -> Cap {
+        self.flow_with_capacity(s, t, Cap::max_value())
+    }
+    /// # Parameters
+    /// * `s != t` must hold, otherwise it panics.
+    /// * `flow_limit >= 0`
+    pub fn flow_with_capacity(&mut self, s: usize, t: usize, flow_limit: Cap) -> Cap {
+        let n_ = self._n;
+        assert!(s < n_);
+        assert!(t < n_);
+        // By the definition of max flow in appendix.html, this function should return 0
+        // when the same vertices are provided.  On the other hand, it is reasonable to
+        // return infinity-like value too, which is what the original implementation
+        // (and this implementation without the following assertion) does.
+        // Since either return value is confusing, we'd rather deny the parameters
+        // of the two same vertices.
+        // For more details, see https://github.com/rust-lang-ja/ac-library-rs/pull/24#discussion_r485343451
+        // and https://github.com/atcoder/ac-library/issues/5 .
+        assert_ne!(s, t);
+        // Additional constraint
+        assert!(Cap::zero() <= flow_limit);
+
+        let mut calc = FlowCalculator {
+            graph: self,
+            s,
+            t,
+            flow_limit,
+            level: vec![0; n_],
+            iter: vec![0; n_],
+            que: SimpleQueue::default(),
+        };
+
+        let mut flow = Cap::zero();
+        while flow < flow_limit {
+            calc.bfs();
+            if calc.level[t] == -1 {
+                break;
+            }
+            calc.iter.iter_mut().for_each(|e| *e = 0);
+            while flow < flow_limit {
+                let f = calc.dfs(t, flow_limit - flow);
+                if f == Cap::zero() {
+                    break;
+                }
+                flow += f;
+            }
+        }
+        flow
+    }
+
+    pub fn min_cut(&self, s: usize) -> Vec<bool> {
+        let mut visited = vec![false; self._n];
+        let mut que = SimpleQueue::default();
+        que.push(s);
+        while !que.empty() {
+            let &p = que.front().unwrap();
+            que.pop();
+            visited[p] = true;
+            for e in &self.g[p] {
+                if e.cap != Cap::zero() && !visited[e.to] {
+                    visited[e.to] = true;
+                    que.push(e.to);
+                }
+            }
+        }
+        visited
+    }
+}
+
+struct FlowCalculator<'a, Cap> {
+    graph: &'a mut MfGraph<Cap>,
+    s: usize,
+    t: usize,
+    flow_limit: Cap,
+    level: Vec<i32>,
+    iter: Vec<usize>,
+    que: SimpleQueue<usize>,
+}
+
+impl<Cap> FlowCalculator<'_, Cap>
+where
+    Cap: Integral,
+{
+    fn bfs(&mut self) {
+        self.level.iter_mut().for_each(|e| *e = -1);
+        self.level[self.s] = 0;
+        self.que.clear();
+        self.que.push(self.s);
+        while !self.que.empty() {
+            let v = *self.que.front().unwrap();
+            self.que.pop();
+            for e in &self.graph.g[v] {
+                if e.cap == Cap::zero() || self.level[e.to] >= 0 {
+                    continue;
+                }
+                self.level[e.to] = self.level[v] + 1;
+                if e.to == self.t {
+                    return;
+                }
+                self.que.push(e.to);
+            }
+        }
+    }
+    fn dfs(&mut self, v: usize, up: Cap) -> Cap {
+        if v == self.s {
+            return up;
+        }
+        let mut res = Cap::zero();
+        let level_v = self.level[v];
+        for i in self.iter[v]..self.graph.g[v].len() {
+            self.iter[v] = i;
+            let &_Edge {
+                to: e_to,
+                rev: e_rev,
+                ..
+            } = &self.graph.g[v][i];
+            if level_v <= self.level[e_to] || self.graph.g[e_to][e_rev].cap == Cap::zero() {
+                continue;
+            }
+            let d = self.dfs(e_to, min(up - res, self.graph.g[e_to][e_rev].cap));
+            if d <= Cap::zero() {
+                continue;
+            }
+            self.graph.g[v][i].cap += d;
+            self.graph.g[e_to][e_rev].cap -= d;
+            res += d;
+            if res == up {
+                break;
+            }
+        }
+        self.iter[v] = self.graph.g[v].len();
+        res
+    }
+}
+
+#[derive(Default)]
+pub struct MfGraph<Cap> {
+    _n: usize,
+    pos: Vec<(usize, usize)>,
+    g: Vec<Vec<_Edge<Cap>>>,
+}
+
+struct _Edge<Cap> {
+    to: usize,
+    rev: usize,
+    cap: Cap,
+}
+
+#[cfg(test)]
+mod test {
+    use crate::{Edge, MfGraph};
+
+    #[test]
+    fn test_max_flow_wikipedia() {
+        // From https://commons.wikimedia.org/wiki/File:Min_cut.png
+        // Under CC BY-SA 3.0 https://creativecommons.org/licenses/by-sa/3.0/deed.en
+        let mut graph = MfGraph::new(6);
+        assert_eq!(graph.add_edge(0, 1, 3), 0);
+        assert_eq!(graph.add_edge(0, 2, 3), 1);
+        assert_eq!(graph.add_edge(1, 2, 2), 2);
+        assert_eq!(graph.add_edge(1, 3, 3), 3);
+        assert_eq!(graph.add_edge(2, 4, 2), 4);
+        assert_eq!(graph.add_edge(3, 4, 4), 5);
+        assert_eq!(graph.add_edge(3, 5, 2), 6);
+        assert_eq!(graph.add_edge(4, 5, 3), 7);
+
+        assert_eq!(graph.flow(0, 5), 5);
+
+        let edges = graph.edges();
+        {
+            #[rustfmt::skip]
+            assert_eq!(
+                edges,
+                vec![
+                    Edge { from: 0, to: 1, cap: 3, flow: 3 },
+                    Edge { from: 0, to: 2, cap: 3, flow: 2 },
+                    Edge { from: 1, to: 2, cap: 2, flow: 0 },
+                    Edge { from: 1, to: 3, cap: 3, flow: 3 },
+                    Edge { from: 2, to: 4, cap: 2, flow: 2 },
+                    Edge { from: 3, to: 4, cap: 4, flow: 1 },
+                    Edge { from: 3, to: 5, cap: 2, flow: 2 },
+                    Edge { from: 4, to: 5, cap: 3, flow: 3 },
+                ]
+            );
+        }
+        assert_eq!(
+            graph.min_cut(0),
+            vec![true, false, true, false, false, false]
+        );
+    }
+
+    #[test]
+    fn test_max_flow_wikipedia_multiple_edges() {
+        // From https://commons.wikimedia.org/wiki/File:Min_cut.png
+        // Under CC BY-SA 3.0 https://creativecommons.org/licenses/by-sa/3.0/deed.en
+        let mut graph = MfGraph::new(6);
+        for &(u, v, c) in &[
+            (0, 1, 3),
+            (0, 2, 3),
+            (1, 2, 2),
+            (1, 3, 3),
+            (2, 4, 2),
+            (3, 4, 4),
+            (3, 5, 2),
+            (4, 5, 3),
+        ] {
+            for _ in 0..c {
+                graph.add_edge(u, v, 1);
+            }
+        }
+
+        assert_eq!(graph.flow(0, 5), 5);
+        assert_eq!(
+            graph.min_cut(0),
+            vec![true, false, true, false, false, false]
+        );
+    }
+
+    #[test]
+    #[allow(clippy::many_single_char_names)]
+    fn test_max_flow_misawa() {
+        // Originally by @MiSawa
+        // From https://gist.github.com/MiSawa/47b1d99c372daffb6891662db1a2b686
+        let n = 100;
+
+        let mut graph = MfGraph::new((n + 1) * 2 + 5);
+        let (s, a, b, c, t) = (0, 1, 2, 3, 4);
+        graph.add_edge(s, a, 1);
+        graph.add_edge(s, b, 2);
+        graph.add_edge(b, a, 2);
+        graph.add_edge(c, t, 2);
+        for i in 0..n {
+            let i = 2 * i + 5;
+            for j in 0..2 {
+                for k in 2..4 {
+                    graph.add_edge(i + j, i + k, 3);
+                }
+            }
+        }
+        for j in 0..2 {
+            graph.add_edge(a, 5 + j, 3);
+            graph.add_edge(2 * n + 5 + j, c, 3);
+        }
+
+        assert_eq!(graph.flow(s, t), 2);
+    }
+}