#1009816 (Rust) No.2888 Mamehinata

• 問題: No.2888 Mamehinata
• ユーザー: Moss_Local
• 提出日時: 2024-09-13 21:34:15
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 455 ms / 2,000 ms
• コード長: 4,642 bytes
• コンパイル時間: 23,529 ms
• コンパイル使用メモリ: 377,856 KB
• 実行使用メモリ: 28,928 KB
• 最終ジャッジ日時: 2024-09-13 21:34:53
• 合計ジャッジ時間: 28,016 ms
• ジャッジサーバーID （参考情報）: judge1 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,248 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	2 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	1 ms; 5,376 KB
testcase_11	AC	1 ms; 5,376 KB
testcase_12	AC	1 ms; 5,376 KB
testcase_13	AC	35 ms; 7,040 KB
testcase_14	AC	128 ms; 8,192 KB
testcase_15	AC	258 ms; 15,872 KB
testcase_16	AC	351 ms; 19,480 KB
testcase_17	AC	191 ms; 9,088 KB
testcase_18	AC	80 ms; 10,112 KB
testcase_19	AC	366 ms; 19,432 KB
testcase_20	AC	299 ms; 16,640 KB
testcase_21	AC	294 ms; 16,512 KB
testcase_22	AC	231 ms; 13,312 KB
testcase_23	AC	301 ms; 17,408 KB
testcase_24	AC	398 ms; 20,992 KB
testcase_25	AC	343 ms; 20,096 KB
testcase_26	AC	374 ms; 19,456 KB
testcase_27	AC	287 ms; 14,464 KB
testcase_28	AC	53 ms; 5,376 KB
testcase_29	AC	138 ms; 9,984 KB
testcase_30	AC	395 ms; 21,888 KB
testcase_31	AC	320 ms; 18,688 KB
testcase_32	AC	212 ms; 13,696 KB
testcase_33	AC	306 ms; 17,408 KB
testcase_34	AC	245 ms; 15,104 KB
testcase_35	AC	199 ms; 13,184 KB
testcase_36	AC	433 ms; 23,680 KB
testcase_37	AC	444 ms; 24,320 KB
testcase_38	AC	106 ms; 8,320 KB
testcase_39	AC	356 ms; 19,712 KB
testcase_40	AC	455 ms; 23,808 KB
testcase_41	AC	65 ms; 5,888 KB
testcase_42	AC	349 ms; 20,736 KB
testcase_43	AC	318 ms; 23,296 KB
testcase_44	AC	366 ms; 25,728 KB
testcase_45	AC	410 ms; 28,928 KB
testcase_46	AC	47 ms; 5,632 KB
testcase_47	AC	349 ms; 25,216 KB
testcase_48	AC	239 ms; 17,664 KB
testcase_49	AC	13 ms; 5,376 KB
testcase_50	AC	46 ms; 11,264 KB
testcase_51	AC	3 ms; 5,376 KB
testcase_52	AC	1 ms; 5,376 KB
testcase_53	AC	7 ms; 5,376 KB
testcase_54	AC	1 ms; 5,376 KB

コンパイルメッセージ

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

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

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

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

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

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

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

warning: unused variable: `i`
   --> src/main.rs:185:9
    |
185 |     for i in 0..m {
    |         ^ help: if this is intentional, prefix it with an underscore: `_i`
    |
    = note: `#[warn(unused_variables)]` on by default

ソースコード

// -*- 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::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])
}

fn dijkstra(graph: &Vec<Vec<(usize, usize)>>, start: usize) -> Vec<usize> {
    let mut dist = vec![INF as usize; graph.len()];
    let mut heap = BinaryHeap::new();
    heap.push(Reverse((0 as usize, start)));
    dist[start] = 0;
    while let Some(Reverse(x)) = heap.pop() {
        let cost = x.0;
        let v = x.1;
        if cost > dist[v] {
            continue;
        }
        for edge in &graph[v] {
            let nc = cost + edge.1;
            let nv = edge.0;
            if nc < dist[nv] {
                heap.push(Reverse((nc, nv)));
                dist[nv] = nc;
            }
        }
    }
    return dist;
}
fn main() {
    let (n, m) = readuu();
    let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize];
    for i in 0..m {
        let (mut a, mut b) = readuu();
        a -= 1;
        b -= 1;
        graph[a].push((b, 1));
        graph[b].push((a, 1));
    }
    let dist = dijkstra(&graph, 0);
    let mut res = vec![0; n];
    // d!(dist);

    for i in 1..n {
        if dist[i] == UINF {
            continue;
        }
        res[dist[i] - 1] += 1;
    }
    if graph[0].len() != 0 {
        res[1] += 1;
    }
    for i in 2..n {
        res[i] += res[i - 2];
    }
    for i in 0..n {
        println!("{}", res[i]);
    }
    return;
}