結果

問題 No.3171 Color Restoration
コンテスト
ユーザー Moss_Local
提出日時 2025-06-06 22:21:28
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 4,288 bytes
記録
記録タグの例:
初AC ショートコード 純ショートコード 純主流ショートコード 最速実行時間
コンパイル時間 12,975 ms
コンパイル使用メモリ 386,848 KB
実行使用メモリ 7,844 KB
最終ジャッジ日時 2025-06-06 22:21:43
合計ジャッジ時間 12,120 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 18 WA * 8
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: variable does not need to be mutable
   --> src/main.rs:109:9
    |
109 |     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:115:9
    |
115 |     let mut vec: Vec<i64> = read_vec();
    |         ----^^^
    |         |
    |         help: remove this `mut`

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

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

ソースコード

diff #
raw source code 

// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]

use std::cmp::*;
use std::collections::*;
use std::fmt::*;
use std::hash::*;
use std::io::BufRead;
use std::iter::FromIterator;
use std::*;

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 UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;

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

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

// slice_permutations: returns all permutations of a slice of length 3
fn slice_permutations<T: Clone>(slice: &[T]) -> Vec<Vec<T>> {
    let n = slice.len();
    let mut res = Vec::new();
    if n == 3 {
        for &i in &[0, 1, 2] {
            for &j in &[0, 1, 2] {
                if j == i {
                    continue;
                }
                for &k in &[0, 1, 2] {
                    if k == i || k == j {
                        continue;
                    }
                    res.push(vec![slice[i].clone(), slice[j].clone(), slice[k].clone()]);
                }
            }
        }
    }
    res
}

fn main() {
    let colors: Vec<String> = read_vec();
    let one = vec![
        "gray", "brown", "green", "cyan", "blue", "yellow", "orange", "red",
    ];
    let two = vec!["gray", "green", "blue", "yellow", "red"];
    let three = vec!["gray", "green", "cyan", "blue", "violet", "orange", "red"];
    let sites = vec![&one, &two, &three];
    let f_same_color = colors.iter().all(|c| c == &colors[0]);
    let mut cnt = 0;
    let cp = colors;
    let perm = slice_permutations(&sites);
    // d!(perm.clone());
    for sp in perm {
        let mut ok = true;
        for i in 0..3 {
            if !sp[i].contains(&cp[i].as_str()) {
                ok = false;
                break;
            }
        }
        // d!((ok, cp.clone()));
        if ok {
            cnt += 1;
        }
    }
    // let f_same_color = colors.clone().iter().all(|c| c == &colors[0]);
    println!(
        "{}",
        if cnt == 1 || (cnt == 6 && f_same_color) {
            "Yes"
        } else {
            "No"
        }
    );
}
0