結果
| 問題 |
No.2402 Dirty Stairs and Shoes
|
| コンテスト | |
| ユーザー |
Moss_Local
|
| 提出日時 | 2023-08-04 21:37:12 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 52 ms / 2,000 ms |
| コード長 | 6,156 bytes |
| コンパイル時間 | 17,199 ms |
| コンパイル使用メモリ | 392,100 KB |
| 実行使用メモリ | 13,728 KB |
| 最終ジャッジ日時 | 2024-12-20 02:29:54 |
| 合計ジャッジ時間 | 16,980 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 32 |
コンパイルメッセージ
warning: unused variable: `m1`
--> src/main.rs:194:9
|
194 | let m1: usize = read();
| ^^ help: if this is intentional, prefix it with an underscore: `_m1`
|
= note: `#[warn(unused_variables)]` on by default
warning: unused variable: `m2`
--> src/main.rs:196:9
|
196 | let m2: usize = read();
| ^^ help: if this is intentional, prefix it with an underscore: `_m2`
warning: variable does not need to be mutable
--> src/main.rs:195:9
|
195 | let mut a: Vec<usize> = read_vec();
| ----^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: variable does not need to be mutable
--> src/main.rs:197:9
|
197 | let mut b: Vec<usize> = read_vec();
| ----^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:198:9
|
198 | let mut set_a = a.iter().collect::<HashSet<_>>();
| ----^^^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:199:9
|
199 | let mut set_b = b.iter().collect::<HashSet<_>>();
| ----^^^^^
| |
| help: remove this `mut`
ソースコード
// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
use std::arch::x86_64::_MM_FROUND_NEARBYINT;
// 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) => {
println!("{:?}", $x);
};
}
macro_rules! yn {
($val:expr) => {
if $val {
println!("Yes");
} else {
println!("No");
}
};
}
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 readi() -> i64 {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
iter.next().unwrap().parse::<i64>().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 str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
#[allow(dead_code)]
fn readff() -> (f64, f64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<f64>().unwrap(),
iter.next().unwrap().parse::<f64>().unwrap(),
)
}
fn readcc() -> (char, char) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<char>().unwrap(),
iter.next().unwrap().parse::<char>().unwrap(),
)
}
fn readuuu() -> (usize, usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
fn solve() {
let (n, k) = readuu();
let m1: usize = read();
let mut a: Vec<usize> = read_vec();
let m2: usize = read();
let mut b: Vec<usize> = read_vec();
let mut set_a = a.iter().collect::<HashSet<_>>();
let mut set_b = b.iter().collect::<HashSet<_>>();
let mut dp = vec![vec![0 as usize; (2) as usize]; (n + 1) as usize];
dp[0][0] = 1;
// 0 clear : 1 stain
for i in 0..n {
let ni = i + 1;
if set_b.contains(&ni) {
dp[ni][0] |= dp[i][0];
dp[ni][0] |= dp[i][1];
} else if set_a.contains(&ni) {
dp[ni][1] |= dp[i][0];
dp[ni][1] |= dp[i][1];
} else {
dp[ni][0] |= dp[i][0];
dp[ni][1] |= dp[i][1];
}
let ni = i + k;
if ni <= n {
if set_b.contains(&ni) {
dp[ni][0] |= dp[i][0];
dp[ni][0] |= dp[i][1];
} else if set_a.contains(&ni) {
dp[ni][1] |= dp[i][0];
dp[ni][1] |= dp[i][1];
} else {
dp[ni][0] |= dp[i][0];
dp[ni][1] |= dp[i][0];
}
}
}
if dp[n][0] == 1 {
p!("Yes");
} else {
p!("No");
}
return;
}
Moss_Local