結果
問題 | No.1242 高橋君とすごろく |
ユーザー |
|
提出日時 | 2020-10-03 18:42:35 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 3,249 bytes |
コンパイル時間 | 15,199 ms |
コンパイル使用メモリ | 400,400 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-20 02:55:03 |
合計ジャッジ時間 | 16,161 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 24 |
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_rules! input {($($r:tt)*) => {let stdin = std::io::stdin();let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));let mut next = move || -> String{bytes.by_ref().map(|r|r.unwrap() as char).skip_while(|c|c.is_whitespace()).take_while(|c|!c.is_whitespace()).collect()};input_inner!{next, $($r)*}};}macro_rules! input_inner {($next:expr) => {};($next:expr, ) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($next, $t);input_inner!{$next $($r)*}};}macro_rules! read_value {($next:expr, [graph1; $len:expr]) => {{let mut g = vec![vec![]; $len];let ab = read_value!($next, [(usize1, usize1)]);for (a, b) in ab {g[a].push(b);g[b].push(a);}g}};($next:expr, ( $($t:tt),* )) => {( $(read_value!($next, $t)),* )};($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, chars) => {read_value!($next, String).chars().collect::<Vec<char>>()};($next:expr, usize1) => (read_value!($next, usize) - 1);($next:expr, [ $t:tt ]) => {{let len = read_value!($next, usize);read_value!($next, [$t; len])}};($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}#[allow(unused)]macro_rules! debug {($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap());}#[allow(unused)]macro_rules! debugln {($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap());}fn solve() {let out = std::io::stdout();let mut out = BufWriter::new(out.lock());macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}input! {n: usize, k: usize,a: [usize; k],}let mut ok = true;'outer:for i in 0..k {for j in i + 1..k {if (a[i] + a[j]) % 2 == 1 && a[i] >= 30 && a[j] - a[i] < 6 {ok = false;break 'outer;}}}let to = min(n, 40);let mut dp = vec![true; to];for &a in &a {if a < to {dp[a] = false;}}for i in (0..to).rev() {if !dp[i] {continue;}let mut ok = true;for j in 1..4 {let l = 7 - j;if (i + j < to && !dp[i + j]) && (i + l < to && !dp[i + l]) {ok = false;break;}}dp[i] = ok;}ok &= dp[1];puts!("{}\n", ["No", "Yes"][usize::from(ok)]);}fn main() {// In order to avoid potential stack overflow, spawn a new thread.let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);thd.spawn(|| solve()).unwrap().join().unwrap();}