結果
| 問題 | No.922 東北きりきざむたん |
| ユーザー |
 fukafukatani
|
| 提出日時 | 2019-11-09 10:59:53 |
| 言語 | Rust (1.77.0 + proconio) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 5,277 bytes |
| コンパイル時間 | 16,467 ms |
| コンパイル使用メモリ | 387,472 KB |
| 実行使用メモリ | 8,992 KB |
| 最終ジャッジ日時 | 2024-09-15 04:18:44 |
| 合計ジャッジ時間 | 20,432 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge1 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
7,424 KB |
| testcase_01 | AC | 1 ms
5,376 KB |
| testcase_02 | AC | 1 ms
5,376 KB |
| testcase_03 | WA | - |
| testcase_04 | TLE | - |
| testcase_05 | -- | - |
| testcase_06 | -- | - |
| testcase_07 | -- | - |
| testcase_08 | -- | - |
| testcase_09 | -- | - |
| testcase_10 | -- | - |
| testcase_11 | -- | - |
| testcase_12 | -- | - |
| testcase_13 | -- | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
| testcase_27 | -- | - |
| testcase_28 | -- | - |
| testcase_29 | -- | - |
コンパイルメッセージ
warning: variable does not need to be mutable
--> src/main.rs:76:17
|
76 | let mut max_gain = *focused_accum_nums.iter().max().unwrap();
| ----^^^^^^^^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: methods `same` and `get_size` are never used
--> src/main.rs:160:8
|
141 | impl UnionFindTree {
| ------------------ methods in this implementation
...
160 | fn same(&mut self, x: usize, y: usize) -> bool {
| ^^^^
...
164 | fn get_size(&mut self, x: usize) -> usize {
| ^^^^^^^^
|
= note: `#[warn(dead_code)]` on by default
ソースコード
#![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 groups = HashMap::new();
for i in 0..n {
groups.entry(uft.find(i)).or_insert(vec![]).push(i);
}
let mut weights = vec![0; n];
let mut accum_num = vec![0; n];
let mut ans = 0;
for &root in groups.keys() {
if groups[&root].len() == 1 {
continue;
}
let mut tree: Vec<Vec<usize>> = vec![Vec::new(); n];
let mut parent_dict: HashMap<usize, usize> = HashMap::new();
make_tree(root, n, &edges, &mut tree, &mut parent_dict);
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 focused_accum_nums = tree[cur]
.iter()
.map(|&ci| accum_num[ci])
.collect::<Vec<_>>();
let mut max_gain = *focused_accum_nums.iter().max().unwrap();
let other_weight = focused_accum_nums.iter().sum::<i64>() - 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;
for &ci in tree[cur].iter() {
if weights[ci] == max_gain {
cur = ci;
break;
}
}
}
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>>,
parent_dict: &mut HashMap<usize, usize>,
) {
for child_idx in edges[cur_idx].iter() {
if *child_idx == parent_idx {
continue;
}
tree[cur_idx].push(*child_idx);
parent_dict.insert(*child_idx, cur_idx);
make_tree(*child_idx, cur_idx, edges, tree, parent_dict);
}
}
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
}
}
}