#699845 (Rust) No.1640 簡単な色塗り

• 問題: No.1640 簡単な色塗り
• ユーザー: akakimidori
• 提出日時: 2021-09-16 06:44:59
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 1,560 ms / 2,000 ms
• コード長: 7,536 bytes
• コンパイル時間: 12,457 ms
• コンパイル使用メモリ: 404,856 KB
• 実行使用メモリ: 48,336 KB
• 最終ジャッジ日時: 2024-06-29 17:11:13
• 合計ジャッジ時間: 35,211 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,820 KB
testcase_02	AC	1 ms; 6,940 KB
testcase_03	AC	0 ms; 6,940 KB
testcase_04	AC	53 ms; 34,240 KB
testcase_05	AC	53 ms; 34,904 KB
testcase_06	AC	1 ms; 6,940 KB
testcase_07	AC	1 ms; 6,944 KB
testcase_08	AC	1 ms; 6,944 KB
testcase_09	AC	1 ms; 6,940 KB
testcase_10	AC	113 ms; 21,480 KB
testcase_11	AC	80 ms; 17,664 KB
testcase_12	AC	69 ms; 15,872 KB
testcase_13	AC	184 ms; 31,308 KB
testcase_14	AC	185 ms; 31,416 KB
testcase_15	AC	43 ms; 12,288 KB
testcase_16	AC	52 ms; 14,320 KB
testcase_17	AC	142 ms; 26,368 KB
testcase_18	AC	7 ms; 6,940 KB
testcase_19	AC	61 ms; 15,744 KB
testcase_20	AC	103 ms; 20,704 KB
testcase_21	AC	77 ms; 17,152 KB
testcase_22	AC	5 ms; 6,944 KB
testcase_23	AC	109 ms; 22,400 KB
testcase_24	AC	20 ms; 7,676 KB
testcase_25	AC	66 ms; 16,076 KB
testcase_26	AC	135 ms; 24,264 KB
testcase_27	AC	40 ms; 11,776 KB
testcase_28	AC	187 ms; 29,768 KB
testcase_29	AC	127 ms; 24,084 KB
testcase_30	AC	34 ms; 7,552 KB
testcase_31	AC	1,170 ms; 41,768 KB
testcase_32	AC	735 ms; 32,932 KB
testcase_33	AC	317 ms; 22,340 KB
testcase_34	AC	571 ms; 26,528 KB
testcase_35	AC	345 ms; 24,496 KB
testcase_36	AC	36 ms; 7,168 KB
testcase_37	AC	58 ms; 9,592 KB
testcase_38	AC	830 ms; 33,908 KB
testcase_39	AC	155 ms; 15,232 KB
testcase_40	AC	175 ms; 15,616 KB
testcase_41	AC	505 ms; 28,852 KB
testcase_42	AC	218 ms; 18,796 KB
testcase_43	AC	228 ms; 21,244 KB
testcase_44	AC	216 ms; 19,564 KB
testcase_45	AC	139 ms; 16,320 KB
testcase_46	AC	44 ms; 8,532 KB
testcase_47	AC	22 ms; 6,940 KB
testcase_48	AC	1,111 ms; 34,340 KB
testcase_49	AC	6 ms; 6,940 KB
testcase_50	AC	1 ms; 6,944 KB
testcase_51	AC	1 ms; 6,940 KB
testcase_52	AC	1,396 ms; 40,596 KB
testcase_53	AC	1,560 ms; 48,336 KB
07_evil_01.txt	AC	696 ms; 67,568 KB
07_evil_02.txt	AC	1,291 ms; 102,380 KB

ソースコード

// ---------- 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) ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

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

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        e: [(usize1, usize1); n],
    }
    let mut g = maxflow::Graph::new(2 * n + 2);
    let mut edge = vec![];
    let src = 2 * n;
    let dst = 2 * n + 1;
    for (i, &(a, b)) in e.iter().enumerate() {
        let x = g.add_edge(i, a + n, 1);
        let y = g.add_edge(i, b + n, 1);
        edge.push((x, y));
    }
    for i in 0..n {
        g.add_edge(src, i, 1);
        g.add_edge(i + n, dst, 1);
    }
    let f = g.flow(src, dst);
    if f != n as u32 {
        println!("No");
        return;
    }
    use std::io::Write;
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    writeln!(out, "Yes").ok();
    for (x, y) in edge {
        for x in [x, y].iter() {
            let e = g.get_edge(x);
            if e.2 == 1 {
                writeln!(out, "{}", e.1 - n + 1).ok();
            }
        }
    }
}

fn main() {
    run();
}