結果
| 問題 | No.1390 Get together |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2021-02-12 21:53:19 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 111 ms / 2,000 ms |
| コード長 | 7,458 bytes |
| コンパイル時間 | 21,976 ms |
| コンパイル使用メモリ | 379,292 KB |
| 実行使用メモリ | 17,408 KB |
| 最終ジャッジ日時 | 2024-07-19 21:08:40 |
| 合計ジャッジ時間 | 18,723 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 29 |
コンパイルメッセージ
warning: unnecessary parentheses around type
--> src/main.rs:46:15
|
46 | fn readi() -> (i64) {
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
46 - fn readi() -> (i64) {
46 + fn readi() -> i64 {
|
warning: unused variable: `i`
--> src/main.rs:239:9
|
239 | for i in 0..n {
| ^ help: if this is intentional, prefix it with an underscore: `_i`
|
= note: `#[warn(unused_variables)]` on by default
warning: variable does not need to be mutable
--> src/main.rs:241:13
|
241 | let mut c = c - 1;
| ----^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: variable does not need to be mutable
--> src/main.rs:242:13
|
242 | let mut b = b - 1;
| ----^
| |
| help: remove this `mut`
ソースコード
// -*- coding:utf-8-unix -*-#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]use std::collections::*;use std::convert::*;use std::convert::{From, Into};use std::fmt::Debug;use std::fs::File;use std::io::prelude::*;use std::io::*;use std::marker::Copy;use std::mem::*;use std::ops::Bound::*;use std::ops::{Add, Mul, Neg, Sub};use std::str;use std::vec;use std::{cmp, process::Output};use std::{cmp::Ordering, env::consts::DLL_PREFIX};use std::{cmp::Ordering::*, f32::consts::PI};const INF: i64 = 1223372036854775807;const FINF: f64 = 122337203685.0;const LINF: i64 = 2147483647;const UINF: usize = INF as usize;const MEM_SIZE: usize = 202020;const MOD: i64 = 1000000007;// const MOD: i64 = 998244353;const UMOD: usize = MOD as usize;use std::cmp::*;use std::collections::*;use std::io::stdin;use std::io::stdout;use std::io::Write;// use str::Chars;#[allow(dead_code)]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()}#[allow(dead_code)]fn readi() -> (i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();iter.next().unwrap().parse::<i64>().unwrap()}#[allow(dead_code)]fn read_vec<T: std::str::FromStr>() -> Vec<T> {read::<String>().split_whitespace().map(|e| e.parse().ok().unwrap()).collect()}#[allow(dead_code)]fn read_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {(0..n).map(|_| read_vec()).collect()}#[allow(dead_code)]fn readii() -> (i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}fn readff() -> (f64, f64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<f64>().unwrap(),iter.next().unwrap().parse::<f64>().unwrap(),)}#[allow(dead_code)]fn readiii() -> (i64, i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}#[allow(dead_code)]fn readuu() -> (usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}fn readcc() -> (char, char) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<char>().unwrap(),iter.next().unwrap().parse::<char>().unwrap(),)}#[allow(dead_code)]fn readuuu() -> (usize, usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}#[allow(dead_code)]fn readuuuu() -> (usize, usize, usize, usize) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),)}fn readiiii() -> (i64, i64, i64, i64) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),iter.next().unwrap().parse::<i64>().unwrap(),)}fn readin() -> (usize, usize, char) {let mut str = String::new();let _ = stdin().read_line(&mut str).unwrap();let mut iter = str.split_whitespace();(iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<usize>().unwrap(),iter.next().unwrap().parse::<char>().unwrap(),)}pub struct Dsu {n: usize,// root node: -1 * component size// otherwise: parentparent_or_size: Vec<i32>,}impl Dsu {// 0 <= size <= 10^8 is constrained.pub fn new(size: usize) -> Self {Self {n: size,parent_or_size: vec![-1; size],}}pub fn merge(&mut self, a: usize, b: usize) -> usize {assert!(a < self.n);assert!(b < self.n);let (mut x, mut y) = (self.leader(a), self.leader(b));if x == y {return x;}if -self.parent_or_size[x] < -self.parent_or_size[y] {std::mem::swap(&mut x, &mut y);}self.parent_or_size[x] += self.parent_or_size[y];self.parent_or_size[y] = x as i32;x}pub fn same(&mut self, a: usize, b: usize) -> bool {assert!(a < self.n);assert!(b < self.n);self.leader(a) == self.leader(b)}pub fn leader(&mut self, a: usize) -> usize {assert!(a < self.n);if self.parent_or_size[a] < 0 {return a;}self.parent_or_size[a] = self.leader(self.parent_or_size[a] as usize) as i32;self.parent_or_size[a] as usize}pub fn size(&mut self, a: usize) -> usize {assert!(a < self.n);let x = self.leader(a);-self.parent_or_size[x] as usize}pub fn groups(&mut self) -> Vec<Vec<usize>> {let mut leader_buf = vec![0; self.n];let mut group_size = vec![0; self.n];for i in 0..self.n {leader_buf[i] = self.leader(i);group_size[leader_buf[i]] += 1;}let mut result = vec![Vec::new(); self.n];for i in 0..self.n {result[i].reserve(group_size[i]);}for i in 0..self.n {result[leader_buf[i]].push(i);}result.into_iter().filter(|x| !x.is_empty()).collect::<Vec<Vec<usize>>>()}}fn solve() {let (n, m) = readuu();// let mut vec = vec![BTreeMap::new(); n];let mut vv = vec![vec![0 as usize; (0) as usize]; (n) as usize];for i in 0..n {let (b, c) = readuu();let mut c = c - 1;let mut b = b - 1;vv[c].push(b);}let mut uf = Dsu::new(m);for i in 0..n {if vv[i].len() == 0 {continue;}for j in 0..vv[i].len() - 1 {uf.merge(vv[i][j], vv[i][j + 1]);}}let mut res = 0 as usize;let mut st = BTreeSet::new();for i in 0..m {if st.contains(&uf.leader(i)) {continue;}st.insert(uf.leader(i));res += uf.size(i) - 1;}println!("{:?}", res);return;}fn main() {solve()}