結果

問題 No.2684 折々の色
ユーザー Moss_LocalMoss_Local
提出日時 2024-03-20 22:41:24
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 1,029 ms / 2,000 ms
コード長 4,953 bytes
コンパイル時間 16,110 ms
コンパイル使用メモリ 388,168 KB
実行使用メモリ 111,104 KB
最終ジャッジ日時 2024-09-30 08:48:10
合計ジャッジ時間 40,384 ms
ジャッジサーバーID
(参考情報)
judge1 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,816 KB
testcase_01 AC 1 ms
6,816 KB
testcase_02 AC 1 ms
6,816 KB
testcase_03 AC 1 ms
6,820 KB
testcase_04 AC 1 ms
6,820 KB
testcase_05 AC 1 ms
6,820 KB
testcase_06 AC 1 ms
6,820 KB
testcase_07 AC 1 ms
6,816 KB
testcase_08 AC 1 ms
6,816 KB
testcase_09 AC 1 ms
6,820 KB
testcase_10 AC 1 ms
6,816 KB
testcase_11 AC 367 ms
46,832 KB
testcase_12 AC 207 ms
32,180 KB
testcase_13 AC 296 ms
53,780 KB
testcase_14 AC 123 ms
28,328 KB
testcase_15 AC 288 ms
38,056 KB
testcase_16 AC 47 ms
10,368 KB
testcase_17 AC 179 ms
29,224 KB
testcase_18 AC 358 ms
49,252 KB
testcase_19 AC 347 ms
56,240 KB
testcase_20 AC 209 ms
46,784 KB
testcase_21 AC 100 ms
14,592 KB
testcase_22 AC 540 ms
50,436 KB
testcase_23 AC 319 ms
43,640 KB
testcase_24 AC 148 ms
18,944 KB
testcase_25 AC 223 ms
28,996 KB
testcase_26 AC 455 ms
55,548 KB
testcase_27 AC 268 ms
35,520 KB
testcase_28 AC 335 ms
42,588 KB
testcase_29 AC 783 ms
108,940 KB
testcase_30 AC 733 ms
100,804 KB
testcase_31 AC 572 ms
102,660 KB
testcase_32 AC 914 ms
109,184 KB
testcase_33 AC 686 ms
110,336 KB
testcase_34 AC 802 ms
100,352 KB
testcase_35 AC 799 ms
101,120 KB
testcase_36 AC 585 ms
100,480 KB
testcase_37 AC 685 ms
101,376 KB
testcase_38 AC 988 ms
111,104 KB
testcase_39 AC 1,013 ms
111,104 KB
testcase_40 AC 1,003 ms
110,848 KB
testcase_41 AC 996 ms
110,976 KB
testcase_42 AC 979 ms
111,104 KB
testcase_43 AC 990 ms
111,104 KB
testcase_44 AC 1,012 ms
110,976 KB
testcase_45 AC 1,029 ms
111,104 KB
testcase_46 AC 995 ms
111,104 KB
testcase_47 AC 1 ms
5,248 KB
testcase_48 AC 1 ms
5,248 KB
testcase_49 AC 1 ms
5,248 KB
testcase_50 AC 1 ms
5,248 KB
testcase_51 AC 0 ms
5,248 KB
testcase_52 AC 1 ms
5,248 KB
testcase_53 AC 1 ms
5,248 KB
testcase_54 AC 1 ms
5,248 KB
testcase_55 AC 1 ms
5,248 KB
testcase_56 AC 1 ms
5,248 KB
testcase_57 AC 1 ms
5,248 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unnecessary parentheses around method argument
   --> src/main.rs:182:25
    |
182 |             tc_vec.push((c[j] * t));
    |                         ^        ^
    |
    = note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
    |
182 -             tc_vec.push((c[j] * t));
182 +             tc_vec.push(c[j] * t);
    |

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

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

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

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

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

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

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

ソースコード

diff #

// -*- 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
        }
    };
}

fn main() {
    solve();
}

// use str::Chars;
#[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 read_imat(h: usize) -> Vec<Vec<i64>> {
    (0..h).map(|_| read_vec()).collect()
}
fn read_cmat(h: usize) -> Vec<Vec<char>> {
    (0..h).map(|_| read::<String>().chars().collect()).collect()
}

fn solve() {
    let (n, m) = readuu();
    let mut map = map![];
    let mut x: Vec<i64> = read_vec();
    let mut data = vec![];
    for i in 0..n {
        let mut vec: Vec<i64> = read_vec();
        let t = vec[m];
        let c = vec[0..m].to_vec();
        let mut tc_vec = vec![];
        for j in 0..m {
            tc_vec.push((c[j] * t));
        }
        data.push((tc_vec.clone(), c, t, x.clone()));
        *map.entry(tc_vec.clone()).or_insert(0) += 1;
    }
    for i in 0..n {
        let (tc_vec, c, t, xvec) = data[i].clone();
        if t == 100 {
            if c == x {
                p!("Yes");
                return;
            } else {
                continue;
            }
        }
        let mut targ_vec = vec![];
        for j in 0..m {
            let targ_nume = x[j] * 10000 - 100 * t * c[j];
            let targ_deno = 100 - t;
            targ_vec.push(if targ_nume % targ_deno == 0 && targ_nume >= 0 {
                targ_nume / targ_deno
            } else {
                INF
            });
        }
        *map.entry(tc_vec.clone()).or_insert(0) -= 1;
        // if num == 0 remove
        if map[&tc_vec] == 0 {
            map.remove(&tc_vec);
        }
        if map.contains_key(&targ_vec) {
            p!("Yes");
            return;
        }
        *map.entry(tc_vec.clone()).or_insert(0) += 1;
    }
    p!("No");

    return;
}
0