Submission #1866550
Source Code Expand
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{HashMap, HashSet, BinaryHeap, VecDeque, BTreeSet, BTreeMap};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[allow(unused_imports)]
use std::io::stdin;
mod util {
use std::io::stdin;
use std::str::FromStr;
use std::fmt::Debug;
#[allow(dead_code)]
pub fn line() -> String {
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.trim().to_string()
}
#[allow(dead_code)]
pub fn gets<T: FromStr>() -> Vec<T>
where
<T as FromStr>::Err: Debug,
{
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.split_whitespace()
.map(|t| t.parse().unwrap())
.collect()
}
}
#[allow(unused_macros)]
macro_rules! get {
($t:ty) => {
{
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.trim().parse::<$t>().unwrap()
}
};
($($t:ty),*) => {
{
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
let mut iter = line.split_whitespace();
(
$(iter.next().unwrap().parse::<$t>().unwrap(),)*
)
}
};
($t:ty; $n:expr) => {
(0..$n).map(|_|
get!($t)
).collect::<Vec<_>>()
};
($($t:ty),*; $n:expr) => {
(0..$n).map(|_|
get!($($t),*)
).collect::<Vec<_>>()
};
($t:ty ;;) => {
{
let mut line: String = String::new();
stdin().read_line(&mut line).unwrap();
line.split_whitespace()
.map(|t| t.parse::<$t>().unwrap())
.collect::<Vec<_>>()
}
};
}
#[allow(unused_macros)]
macro_rules! debug {
($($a:expr),*) => {
println!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
}
}
struct UFT {
pub par: Vec<usize>,
pub rank: Vec<usize>,
}
impl UFT {
fn new(n: usize) -> Self {
UFT {
par: (0..n).collect(),
rank: vec![0; n],
}
}
fn find(&mut self, x: usize) -> usize {
if self.par[x] == x {
x
} else {
let p = self.par[x];
let pp = self.find(p);
self.par[x] = pp;
pp
}
}
fn unite(&mut self, x: usize, y: usize) {
let x = self.find(x);
let y = self.find(y);
if x == y {
return;
}
if self.rank[x] < self.rank[y] {
self.par[x] = y;
} else {
self.par[y] = x;
if self.rank[x] == self.rank[y] {
self.rank[x] += 1;
}
}
}
}
fn main() {
let (n, k, l) = get!(usize, usize, usize);
let road = get!(usize, usize; k);
let train = get!(usize, usize; l);
let mut uft_road = UFT::new(n);
let mut uft_train = UFT::new(n);
for &(a, b) in &road {
uft_road.unite(a - 1, b - 1);
}
for &(a, b) in &train {
uft_train.unite(a - 1, b - 1);
}
let mut counts = HashMap::new();
for i in 0..n {
*counts
.entry((uft_road.find(i), uft_train.find(i)))
.or_insert(0) += 1;
}
println!(
"{}",
(0..n)
.map(|i| {
counts.get(&(uft_road.find(i), uft_train.find(i))).unwrap()
})
.map(|n| n.to_string())
.collect::<Vec<_>>()
.join(" ")
);
}
Submission Info
Submission Time |
|
Task |
D - Connectivity |
User |
hatoo |
Language |
Rust (1.15.1) |
Score |
400 |
Code Size |
3846 Byte |
Status |
AC |
Exec Time |
118 ms |
Memory |
31016 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 400 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_0.txt |
AC |
2 ms |
4352 KB |
subtask0_1.txt |
AC |
2 ms |
4352 KB |
subtask0_2.txt |
AC |
2 ms |
4352 KB |
subtask1_0.txt |
AC |
37 ms |
6396 KB |
subtask1_1.txt |
AC |
102 ms |
30240 KB |
subtask1_10.txt |
AC |
39 ms |
6396 KB |
subtask1_11.txt |
AC |
97 ms |
28960 KB |
subtask1_12.txt |
AC |
100 ms |
30368 KB |
subtask1_13.txt |
AC |
103 ms |
30368 KB |
subtask1_14.txt |
AC |
97 ms |
23928 KB |
subtask1_2.txt |
AC |
85 ms |
24060 KB |
subtask1_3.txt |
AC |
107 ms |
30368 KB |
subtask1_4.txt |
AC |
100 ms |
28960 KB |
subtask1_5.txt |
AC |
39 ms |
6396 KB |
subtask1_6.txt |
AC |
92 ms |
28960 KB |
subtask1_7.txt |
AC |
102 ms |
30368 KB |
subtask1_8.txt |
AC |
118 ms |
31016 KB |
subtask1_9.txt |
AC |
86 ms |
23964 KB |