#1022515 (Rust) No.2946 Puyo

提出ソース

結果

問題	No.2946 Puyo
ユーザー	Moss_Local
提出日時	2024-10-25 21:47:42
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	77 ms / 2,000 ms
コード長	6,209 bytes
コンパイル時間	16,261 ms
コンパイル使用メモリ	399,936 KB
実行使用メモリ	9,784 KB
最終ジャッジ日時	2024-10-25 21:48:40
合計ジャッジ時間	17,622 ms
ジャッジサーバーID （参考情報）	judge2 / judge1

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 6,812 KB
testcase_01	AC	1 ms 6,816 KB
testcase_02	AC	1 ms 6,820 KB
testcase_03	AC	76 ms 9,732 KB
testcase_04	AC	77 ms 9,740 KB
testcase_05	AC	76 ms 9,784 KB
testcase_06	AC	76 ms 9,756 KB
testcase_07	AC	75 ms 9,728 KB
testcase_08	AC	7 ms 6,820 KB
testcase_09	AC	27 ms 6,816 KB
testcase_10	AC	6 ms 6,816 KB
testcase_11	AC	41 ms 6,816 KB
testcase_12	AC	7 ms 6,816 KB
testcase_13	AC	1 ms 6,816 KB
testcase_14	AC	10 ms 6,820 KB
testcase_15	AC	5 ms 6,820 KB
testcase_16	AC	15 ms 6,816 KB
testcase_17	AC	48 ms 6,820 KB
testcase_18	AC	2 ms 6,824 KB
testcase_19	AC	23 ms 6,816 KB
testcase_20	AC	30 ms 6,816 KB
testcase_21	AC	50 ms 6,816 KB
testcase_22	AC	7 ms 6,820 KB
testcase_23	AC	29 ms 6,816 KB
testcase_24	AC	65 ms 6,820 KB
testcase_25	AC	58 ms 6,816 KB
testcase_26	AC	64 ms 6,816 KB
testcase_27	AC	2 ms 6,820 KB
testcase_28	AC	47 ms 6,824 KB
testcase_29	AC	69 ms 7,296 KB
testcase_30	AC	37 ms 6,820 KB
testcase_31	AC	55 ms 6,820 KB
testcase_32	AC	56 ms 6,816 KB
testcase_33	AC	48 ms 6,820 KB
testcase_34	AC	70 ms 7,552 KB
testcase_35	AC	56 ms 6,820 KB
testcase_36	AC	59 ms 6,912 KB
testcase_37	AC	62 ms 7,276 KB
testcase_38	AC	44 ms 6,816 KB
testcase_39	AC	41 ms 6,820 KB
testcase_40	AC	26 ms 6,820 KB
testcase_41	AC	55 ms 6,904 KB
testcase_42	AC	50 ms 6,816 KB
testcase_43	AC	47 ms 6,820 KB
testcase_44	AC	56 ms 6,820 KB
testcase_45	AC	46 ms 6,816 KB
testcase_46	AC	29 ms 6,820 KB
testcase_47	AC	44 ms 6,820 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: variable does not need to be mutable
   --> src/main.rs:119:9
    |
119 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`
    |
    = note: `#[warn(unused_mut)]` on by default

warning: variable does not need to be mutable
   --> src/main.rs:125:9
    |
125 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:130:9
    |
130 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:136:9
    |
136 |     let mut vec: Vec<f64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:141:9
    |
141 |     let mut vec: Vec<char> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:146:9
    |
146 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:151:9
    |
151 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

warning: variable does not need to be mutable
   --> src/main.rs:157:9
    |
157 |     let mut vec: Vec<usize> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

ソースコード

raw source code

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::io::BufRead;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

// use proconio::input;
// const MOD: i64 = INF;

use cmp::Ordering::*;
use std::collections::*;

use std::io::stdin;
use std::io::stdout;
use std::io::Write;

macro_rules! p {
    ($x:expr) => {
        //if expr
        println!("{}", $x);
    };
}

macro_rules! vp {
    // vector print separate with space
    ($x:expr) => {
        println!(
            "{}",
            $x.iter()
                .map(|x| x.to_string())
                .collect::<Vec<_>>()
                .join(" ")
        );
    };
}

macro_rules! d {
    ($x:expr) => {
        eprintln!("{:?}", $x);
    };
}
macro_rules! yn {
    ($val:expr) => {
        if $val {
            println!("Yes");
        } else {
            println!("No");
        }
    };
}

macro_rules! map{
    // declear btreemap
    ($($key:expr => $val:expr),*) => {
        {
            let mut map = ::std::collections::BTreeMap::new();
            $(
                map.insert($key, $val);
            )*
            map
        }
    };
}

macro_rules! set{
    // declear btreemap
    ($($key:expr),*) => {
        {
            let mut set = ::std::collections::BTreeSet::new();
            $(
                set.insert($key);
            )*
            set
        }
    };
}

//input output
#[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 read_vec<T: std::str::FromStr>() -> Vec<T> {
    read::<String>()
        .split_whitespace()
        .map(|e| e.parse().ok().unwrap())
        .collect()
}

#[allow(dead_code)]
fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
    (0..n).map(|_| read_vec()).collect()
}

#[allow(dead_code)]
fn readii() -> (i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1])
}

#[allow(dead_code)]
fn readff() -> (f64, f64) {
    let mut vec: Vec<f64> = read_vec();
    (vec[0], vec[1])
}

fn readcc() -> (char, char) {
    let mut vec: Vec<char> = read_vec();
    (vec[0], vec[1])
}

fn readuuu() -> (usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
    let mut vec: Vec<i64> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
    let mut vec: Vec<usize> = read_vec();
    (vec[0], vec[1], vec[2], vec[3])
}

pub struct Dsu {
    n: usize,
    // root node: -1 * component size
    // otherwise: parent
    parent_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 main() {
    let (h, w) = readuu();
    let mut vv: Vec<Vec<char>> = vec![vec!['0' as char; (0) as usize]; (h) as usize];
    for i in 0..h {
        let s: String = read();
        let vvv = s.chars().collect();
        vv[i] = vvv;
    }
    let mut dsu = Dsu::new(h * w);
    for i in 0..h {
        for j in 0..w {
            if i > 0 && vv[i][j] == vv[i - 1][j] {
                dsu.merge(i * w + j, (i - 1) * w + j);
            }
            if j > 0 && vv[i][j] == vv[i][j - 1] {
                dsu.merge(i * w + j, i * w + j - 1);
            }
        }
    }
    for i in 0..h {
        for j in 0..w {
            if dsu.size(i * w + j) >= 4 {
                vv[i][j] = '.';
            }
        }
    }
    for i in 0..h {
        for j in 0..w {
            print!("{}", vv[i][j]);
        }
        println!();
    }
    return;
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード