#1022701 (Rust) No.2948 move move rotti

• 問題: No.2948 move move rotti
• ユーザー: Moss_Local
• 提出日時: 2024-10-25 22:30:08
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 1,383 ms / 4,000 ms
• コード長: 4,901 bytes
• コンパイル時間: 14,269 ms
• コンパイル使用メモリ: 401,608 KB
• 実行使用メモリ: 433,024 KB
• 最終ジャッジ日時: 2024-10-25 22:30:44
• 合計ジャッジ時間: 33,241 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 6,812 KB
testcase_01	AC	1 ms; 6,812 KB
testcase_02	AC	1 ms; 6,812 KB
testcase_03	AC	457 ms; 174,208 KB
testcase_04	AC	1,383 ms; 433,024 KB
testcase_05	AC	2 ms; 6,940 KB
testcase_06	AC	2 ms; 6,944 KB
testcase_07	AC	1,382 ms; 432,896 KB
testcase_08	AC	1,203 ms; 432,896 KB
testcase_09	AC	1,215 ms; 432,896 KB
testcase_10	AC	1 ms; 6,940 KB
testcase_11	AC	1 ms; 6,944 KB
testcase_12	AC	24 ms; 10,752 KB
testcase_13	AC	537 ms; 203,008 KB
testcase_14	AC	476 ms; 174,464 KB
testcase_15	AC	151 ms; 59,392 KB
testcase_16	AC	970 ms; 346,752 KB
testcase_17	AC	484 ms; 174,336 KB
testcase_18	AC	1,224 ms; 432,896 KB
testcase_19	AC	1,116 ms; 432,896 KB
testcase_20	AC	1,133 ms; 433,024 KB
testcase_21	AC	1,214 ms; 432,896 KB
testcase_22	AC	1,164 ms; 432,896 KB
testcase_23	AC	1,208 ms; 432,896 KB
testcase_24	AC	1,206 ms; 432,896 KB
testcase_25	AC	1,110 ms; 433,024 KB
testcase_26	AC	3 ms; 6,944 KB
testcase_27	AC	1 ms; 6,944 KB
testcase_28	AC	13 ms; 7,424 KB
testcase_29	AC	1 ms; 6,948 KB
testcase_30	AC	7 ms; 6,940 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`

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

warning: unused variable: `cost`
   --> src/main.rs:186:31
    |
186 |                     for &(to, cost) in 

ソースコード

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

fn main() {
    let (n, m, kk) = readuuu();
    let mut x: Vec<usize> = read_vec();
    x.iter_mut().for_each(|x| *x -= 1);
    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 mut dp = vec![vec![vec![vec![false; n]; 1 << n]; n + 1]; kk];
    // last pos ,visited ,j回目に,人kが
    for k in 0..kk {
        dp[k][0][1 << x[k]][x[k]] = true;
        //dp
        for i in 1..=n {
            //bit dp
            for bit in 0..1 << n {
                for j in 0..n {
                    if !dp[k][i - 1][bit][j] {
                        continue;
                    }
                    for &(to, cost) in &graph[j] {
                        if bit >> to & 1 == 1 {
                            continue;
                        }
                        dp[k][i][bit | 1 << to][to] = true;
                    }
                }
            }
        }
    }

    let mut res = false;
    for i in 0..=n {
        for j in 0..n {
            let mut cnt = 0;
            for k in 0..kk {
                for bit in 0..1 << n {
                    if dp[k][i][bit][j] {
                        cnt += 1;
                        break;
                    }
                }
            }
            if cnt == kk {
                // d!((i, j));
                res = true;
            }
        }
    }
    yn!(res);

    return;
}