Submission #3621695
Source Code Expand
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[allow(unused_imports)]
use std::iter::FromIterator;
mod util {
use std::fmt::Debug;
use std::io::{stdin, stdout, BufWriter, StdoutLock};
use std::str::FromStr;
#[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 chars() -> Vec<char> {
line().chars().collect()
}
#[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(dead_code)]
pub fn with_bufwriter<F: FnOnce(BufWriter<StdoutLock>) -> ()>(f: F) {
let out = stdout();
let writer = BufWriter::new(out.lock());
f(writer)
}
}
#[allow(unused_macros)]
macro_rules ! get { ( [ $ 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 < _ >> ( ) } } ; ( [ $ 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 . 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 < _ >> ( ) } ; }
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
use std::thread;
if BIG_STACK_SIZE {
thread::Builder::new()
.stack_size(32 * 1024 * 1024)
.name("solve".into())
.spawn(solve)
.unwrap()
.join()
.unwrap();
} else {
solve();
}
}
#[allow(dead_code)]
fn read<T>() -> Vec<T>
where T:
std::str::FromStr,
T::Err: std::fmt::Debug {
let mut buf = String::new();
stdin().read_line(&mut buf).unwrap();
buf.split_whitespace()
.map(|s| s.trim().parse().unwrap())
.collect()
}
#[derive(Clone)]
struct Node {
id: usize,
nodes: Vec<usize>,
}
#[derive(Clone)]
struct Graph {
nodes: Vec<Node>
}
impl Graph {
fn new(ab: Vec<(usize, usize)>) -> Self {
let mut new = Graph{ nodes: Vec::new() };
for (a, b) in ab {
if let Some(index) = new.nodes.iter().position(|t| t.id == a) {
new.nodes[index].nodes.push(b);
} else {
new.nodes.push(Node{ id: a, nodes: vec![b] });
}
if let Some(index) = new.nodes.iter().position(|t| t.id == b) {
new.nodes[index].nodes.push(a);
} else {
new.nodes.push(Node{ id: b, nodes: vec![a] });
}
}
new
}
fn get(&self, id: usize) -> Option<&Node> {
self.nodes.iter().find(|a| a.id == id)
}
fn get_mut<'a>(&'a mut self, id: usize) -> Option<&'a mut Node> {
for i in 0..self.nodes.len() {
if self.nodes[i].id == id {
return Some(&mut self.nodes[i]);
}
}
None
}
fn cut(&mut self, lid: usize, rid: usize) {
{
let lnode = self.get_mut(lid).unwrap();
let li = lnode.nodes.iter().position(|a| *a == rid).unwrap();
lnode.nodes.remove(li);
}
{
let rnode = self.get_mut(rid).unwrap();
let ri = rnode.nodes.iter().position(|a| *a == lid).unwrap();
rnode.nodes.remove(ri);
}
}
fn is_connected(&self) -> bool {
let first = &self.nodes[0];
let mut queue = VecDeque::new();
let mut exist = BTreeSet::new();
queue.push_back(first.id);
exist.insert(first.id);
while !queue.is_empty() {
let node = self.get(queue.pop_front().unwrap()).unwrap();
for new in &node.nodes {
if !exist.contains(&new) {
exist.insert(*new);
queue.push_back(*new);
}
}
}
exist.len() == self.nodes.len()
}
}
fn solve() {
let (_n, m) = get!(usize, usize);
let ab = get!(usize, usize; m);
let graph = Graph::new(ab.clone());
let mut count = 0;
for (a, b) in ab {
let mut tmp = graph.clone();
tmp.cut(a, b);
if !tmp.is_connected() {
count += 1;
}
}
println!("{}", count);
}
Submission Info
Submission Time |
|
Task |
C - Bridge |
User |
ikazuya0201 |
Language |
Rust (1.15.1) |
Score |
300 |
Code Size |
5640 Byte |
Status |
AC |
Exec Time |
3 ms |
Memory |
8572 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
300 / 300 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
All |
sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
3 ms |
8572 KB |
sample_02.txt |
AC |
3 ms |
8572 KB |
sample_03.txt |
AC |
3 ms |
8572 KB |
subtask_1_1.txt |
AC |
3 ms |
8572 KB |
subtask_1_10.txt |
AC |
3 ms |
8572 KB |
subtask_1_11.txt |
AC |
3 ms |
8572 KB |
subtask_1_12.txt |
AC |
3 ms |
8572 KB |
subtask_1_13.txt |
AC |
3 ms |
8572 KB |
subtask_1_14.txt |
AC |
3 ms |
8572 KB |
subtask_1_15.txt |
AC |
3 ms |
8572 KB |
subtask_1_16.txt |
AC |
3 ms |
8572 KB |
subtask_1_17.txt |
AC |
3 ms |
8572 KB |
subtask_1_2.txt |
AC |
3 ms |
8572 KB |
subtask_1_3.txt |
AC |
3 ms |
8572 KB |
subtask_1_4.txt |
AC |
3 ms |
8572 KB |
subtask_1_5.txt |
AC |
3 ms |
8572 KB |
subtask_1_6.txt |
AC |
3 ms |
8572 KB |
subtask_1_7.txt |
AC |
3 ms |
8572 KB |
subtask_1_8.txt |
AC |
3 ms |
8572 KB |
subtask_1_9.txt |
AC |
3 ms |
8572 KB |