Submission #2207095
Source Code Expand
/**
* _ _ __ _ _ _ _ _ _ _
* | | | | / / | | (_) | (_) | | (_) | |
* | |__ __ _| |_ ___ ___ / /__ ___ _ __ ___ _ __ ___| |_ _| |_ ___ _____ ______ _ __ _ _ ___| |_ ______ ___ _ __ _ _ __ _ __ ___| |_ ___
* | '_ \ / _` | __/ _ \ / _ \ / / __/ _ \| '_ ` _ \| '_ \ / _ \ __| | __| \ \ / / _ \______| '__| | | / __| __|______/ __| '_ \| | '_ \| '_ \ / _ \ __/ __|
* | | | | (_| | || (_) | (_) / / (_| (_) | | | | | | |_) | __/ |_| | |_| |\ V / __/ | | | |_| \__ \ |_ \__ \ | | | | |_) | |_) | __/ |_\__ \
* |_| |_|\__,_|\__\___/ \___/_/ \___\___/|_| |_| |_| .__/ \___|\__|_|\__|_| \_/ \___| |_| \__,_|___/\__| |___/_| |_|_| .__/| .__/ \___|\__|___/
* | | | | | |
* |_| |_| |_|
*
* https://github.com/hatoo/competitive-rust-snippets
*/
#[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::iter::FromIterator;
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
mod util {
use std::io::{stdin, stdout, BufWriter, StdoutLock};
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 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 . 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 < _ >> ( ) } } ; ( $ 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 adjacent4(x: usize, y: usize, sx: usize, sy: usize) -> Box<Iterator<Item = (usize, usize)>> {
static DXDY: [(isize, isize); 4] = [(-1, 0), (1, 0), (0, -1), (0, 1)];
Box::new(DXDY.iter().filter_map(move |&(dx, dy)| {
let nx = x as isize + dx;
let ny = y as isize + dy;
if nx >= 0 && nx < sx as isize && ny >= 0 && ny < sy as isize {
Some((nx as usize, ny as usize))
} else {
None
}
}))
}
#[allow(dead_code)]
/// Union Find Tree
pub struct UFT {
pub par: Vec<usize>,
pub rank: Vec<usize>,
}
impl UFT {
#[allow(dead_code)]
pub fn new(n: usize) -> Self {
UFT {
par: (0..n).collect(),
rank: vec![0; n],
}
}
#[allow(dead_code)]
pub fn root(&mut self, x: usize) -> usize {
if self.par[x] == x {
x
} else {
let p = self.par[x];
let pp = self.root(p);
self.par[x] = pp;
pp
}
}
#[allow(dead_code)]
pub fn merge(&mut self, x: usize, y: usize) {
let x = self.root(x);
let y = self.root(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;
}
}
}
}
#[derive(Eq, PartialEq, Clone, Debug)]
/// Equivalent to std::cmp::Reverse
pub struct Rev<T>(pub T);
impl<T: PartialOrd> PartialOrd for Rev<T> {
fn partial_cmp(&self, other: &Rev<T>) -> Option<Ordering> {
other.0.partial_cmp(&self.0)
}
}
impl<T: Ord> Ord for Rev<T> {
fn cmp(&self, other: &Rev<T>) -> Ordering {
other.0.cmp(&self.0)
}
}
fn solve() {
let (h, w) = get!(usize, usize);
let _s = get!(usize, usize);
let _g = get!(usize, usize);
let p: Vec<Vec<u64>> = (0..h).map(|_| util::gets()).collect();
let mut edges = Vec::new();
for i in 0..h {
for j in 0..w {
let from = i * w + j;
for (y, x) in adjacent4(i, j, h, w) {
let to = y * w + x;
edges.push(((from, to), p[i][j] * p[y][x]));
}
}
}
let mut uft = UFT::new(h * w);
let mut ans = p.iter().map(|v| v.iter().sum::<u64>()).sum::<u64>();
edges.sort_by_key(|t| Rev(t.1));
for ((f, t), d) in edges {
if uft.root(f) != uft.root(t) {
ans += d;
uft.merge(f, t);
}
}
println!("{}", ans);
}
Submission Info
Submission Time |
|
Task |
D - Game on a Grid |
User |
hatoo |
Language |
Rust (1.15.1) |
Score |
100 |
Code Size |
6800 Byte |
Status |
AC |
Exec Time |
8 ms |
Memory |
10492 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt |
All |
subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_sample_01.txt |
AC |
3 ms |
8572 KB |
subtask0_sample_02.txt |
AC |
3 ms |
8572 KB |
subtask0_sample_03.txt |
AC |
3 ms |
8572 KB |
subtask1_01.txt |
AC |
3 ms |
8572 KB |
subtask1_02.txt |
AC |
3 ms |
8572 KB |
subtask1_03.txt |
AC |
3 ms |
8572 KB |
subtask1_04.txt |
AC |
3 ms |
8572 KB |
subtask1_05.txt |
AC |
3 ms |
8572 KB |
subtask1_06.txt |
AC |
3 ms |
8572 KB |
subtask1_07.txt |
AC |
7 ms |
10492 KB |
subtask1_08.txt |
AC |
7 ms |
10492 KB |
subtask1_09.txt |
AC |
8 ms |
10492 KB |
subtask1_10.txt |
AC |
7 ms |
10492 KB |
subtask1_11.txt |
AC |
8 ms |
10492 KB |
subtask1_12.txt |
AC |
8 ms |
10492 KB |
subtask1_13.txt |
AC |
8 ms |
10492 KB |
subtask1_14.txt |
AC |
8 ms |
10492 KB |
subtask1_15.txt |
AC |
8 ms |
10492 KB |
subtask1_16.txt |
AC |
5 ms |
10492 KB |
subtask1_17.txt |
AC |
3 ms |
8572 KB |
subtask1_18.txt |
AC |
3 ms |
8572 KB |
subtask1_19.txt |
AC |
3 ms |
8572 KB |
subtask1_20.txt |
AC |
5 ms |
10492 KB |
subtask1_21.txt |
AC |
7 ms |
10492 KB |
subtask1_22.txt |
AC |
7 ms |
10492 KB |
subtask1_23.txt |
AC |
7 ms |
10492 KB |
subtask1_24.txt |
AC |
3 ms |
8572 KB |
subtask1_25.txt |
AC |
3 ms |
8572 KB |
subtask1_26.txt |
AC |
3 ms |
8572 KB |
subtask1_27.txt |
AC |
3 ms |
8572 KB |
subtask1_28.txt |
AC |
3 ms |
8572 KB |
subtask1_29.txt |
AC |
3 ms |
8572 KB |