結果

問題 No.922 東北きりきざむたん
ユーザー fukafukatani
提出日時 2019-11-09 11:22:50
言語 Rust
(1.37.0)
結果
WA   .
実行時間 -
コード長 5,023 Byte
コンパイル時間 2,759 ms
使用メモリ 14,556 KB
最終ジャッジ日時 2019-11-09 11:22:57
コンパイルメッセージ
warning: unused variable: `weights`
  --> Main.rs:41:13
   |
41 |     let mut weights = vec![0; n];
   |             ^^^^^^^ help: consider prefixing with an underscore: `_weights`
   |
   = note: #[warn(unused_variables)] on by default

warning: unused variable: `accum_num`
  --> Main.rs:42:13
   |
42 |     let mut accum_num = vec![0; n];
   |             ^^^^^^^^^ help: consider prefixing with an underscore: `_accum_num`

warning: unused variable: `root`
  --> Main.rs:44:9
   |
44 |     for root in roots {
   |         ^^^^ help: consider prefixing with an underscore: `_root`

warning: unused variable: `tree`
  --> Main.rs:45:17
   |
45 |         let mut tree: Vec<Vec<usize>> = vec![Vec::new(); n];
   |                 ^^^^ help: consider prefixing with an underscore: `_tree`

warning: variable does not need to be mutable
  --> Main.rs:41:9
   |
41 |     let mut weights = vec![0; n];
   |         ----^^^^^^^
   |         |
   |         help: remove this `mut`
   |
   = note: #[warn(unused_mut)] on by default

warning: variable does not need to be mutable
  --> Main.rs:42:9
   |
42 |     let mut accum_num = vec![0; n];
   |         ----^^^^^^^^^
   |         |
   |         help: remove this `mut`

warning: variable does not need to be mutable
  --> Main.rs:45:13
   |
45 |         let mut tree: Vec<Vec<usize>> = vec![Vec::new(); n];
   |             ----^^^^
   |             |
   |             help: remove this `mut`

warning: function is never used: `make_tree`
   --> Main.rs:107:1
    |
107 | / fn make_tree(
108 | |     cur_idx: usize,
109 | |     parent_idx: usize,
110 | |     edges: &Vec<Vec<usize>>,
...   |
119 | |     }
120 | | }
    | |_^
    |
    = note: #[warn(dead_code)] on by default

warning: function is never used: `topological_dfs`
   --> Main.rs:122:1
    |
122 | fn topological_dfs(cur_idx: usize, tree: &Vec<Vec<usize>>, result: &mut Vec<usize>) {
    | ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

warning: meth

ソースコード

diff #
#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::cmp::*;
use std::collections::*;
use std::io::Write;

#[allow(unused_macros)]
macro_rules! debug {
    ($($e:expr),*) => {
        #[cfg(debug_assertions)]
        $({
            let (e, mut err) = (stringify!($e), std::io::stderr());
            writeln!(err, "{} = {:?}", e, $e).unwrap()
        })*
    };
}

fn main() {
    let v = read_vec::<usize>();
    let (n, m, q) = (v[0], v[1], v[2]);
    let mut edges = vec![vec![]; n];
    let mut uft = UnionFindTree::new(n);
    for _ in 0..m {
        let v = read_vec::<usize>();
        let (a, b) = (v[0] - 1, v[1] - 1);
        edges[a].push(b);
        edges[b].push(a);
        uft.unite(a, b);
    }
    let mut used = vec![0; n];
    for _ in 0..q {
        let v = read_vec::<usize>();
        used[v[0] - 1] += 1;
        used[v[1] - 1] += 1;
    }

    let mut roots = HashSet::new();
    for i in 0..n {
        roots.insert(uft.find(i));
    }
    let mut weights = vec![0; n];
    let mut accum_num = vec![0; n];
    let mut ans = 0;
    for root in roots {
        let mut tree: Vec<Vec<usize>> = vec![Vec::new(); n];
        let cost = 0;
        /*
        make_tree(root, n, &edges, &mut tree);
        let mut topological_sorted_indexes = vec![root];
        topological_dfs(root, &tree, &mut topological_sorted_indexes);
        for &ti in topological_sorted_indexes.iter().rev() {
            for &ci in tree[ti].iter() {
                accum_num[ti] += accum_num[ci];
                weights[ti] += weights[ci];
            }
            accum_num[ti] += used[ti];
            weights[ti] += accum_num[ti];
        }

        let mut cost = tree[root].iter().map(|&x| weights[x]).sum::<i64>();
        let mut cur = root;
        let mut parent_gain = 0;

        loop {
            if tree[cur].is_empty() {
                break;
            }

            let mut max_idx = root;
            let mut max_gain = 0;
            for &ci in tree[cur].iter() {
                if accum_num[ci] > max_gain {
                    max_idx = ci;
                    max_gain = accum_num[ci];
                    break;
                }
            }
            let focused_accum_nums_sum = tree[cur].iter().map(|&ci| accum_num[ci]).sum::<i64>();
            let other_weight = focused_accum_nums_sum - max_gain + parent_gain;
            let lost_weight = other_weight + used[cur];
            if lost_weight >= max_gain {
                break;
            }
            cost -= max_gain - lost_weight;
            parent_gain += lost_weight;
            cur = max_idx;
        }
        */
        ans += cost;
    }
    println!("{}", ans);
}

fn read<T: std::str::FromStr>() -> T {
    let mut s = String::new();
    std::io::stdin().read_line(&mut s).ok();
    s.trim().parse().ok().unwrap()
}

fn read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

fn make_tree(
    cur_idx: usize,
    parent_idx: usize,
    edges: &Vec<Vec<usize>>,
    tree: &mut Vec<Vec<usize>>,
) {
    for child_idx in edges[cur_idx].iter() {
        if *child_idx == parent_idx {
            continue;
        }
        tree[cur_idx].push(*child_idx);
        make_tree(*child_idx, cur_idx, edges, tree);
    }
}

fn topological_dfs(cur_idx: usize, tree: &Vec<Vec<usize>>, result: &mut Vec<usize>) {
    for child_idx in tree[cur_idx].iter() {
        result.push(*child_idx);
        topological_dfs(*child_idx, tree, result);
    }
}

#[derive(Debug, Clone)]
struct UnionFindTree {
    parent: Vec<isize>,
    size: Vec<usize>,
    height: Vec<u64>,
}

impl UnionFindTree {
    fn new(n: usize) -> UnionFindTree {
        UnionFindTree {
            parent: vec![-1; n],
            size: vec![1usize; n],
            height: vec![0u64; n],
        }
    }

    fn find(&mut self, index: usize) -> usize {
        if self.parent[index] == -1 {
            return index;
        }
        let idx = self.parent[index] as usize;
        let ret = self.find(idx);
        self.parent[index] = ret as isize;
        ret
    }

    fn same(&mut self, x: usize, y: usize) -> bool {
        self.find(x) == self.find(y)
    }

    fn get_size(&mut self, x: usize) -> usize {
        let idx = self.find(x);
        self.size[idx]
    }

    fn unite(&mut self, index0: usize, index1: usize) -> bool {
        let a = self.find(index0);
        let b = self.find(index1);
        if a == b {
            false
        } else {
            if self.height[a] > self.height[b] {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
            } else if self.height[a] < self.height[b] {
                self.parent[a] = b as isize;
                self.size[b] += self.size[a];
            } else {
                self.parent[b] = a as isize;
                self.size[a] += self.size[b];
                self.height[a] += 1;
            }
            true
        }
    }
}
0