結果
問題 | No.1370 置換門松列 |
ユーザー | ziita |
提出日時 | 2021-02-21 01:39:38 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 59 ms / 2,000 ms |
コード長 | 4,997 bytes |
コンパイル時間 | 13,744 ms |
コンパイル使用メモリ | 385,644 KB |
実行使用メモリ | 15,040 KB |
最終ジャッジ日時 | 2024-09-14 19:25:45 |
合計ジャッジ時間 | 15,200 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 2 ms
6,816 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 2 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,948 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,940 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,944 KB |
testcase_15 | AC | 2 ms
6,944 KB |
testcase_16 | AC | 1 ms
6,940 KB |
testcase_17 | AC | 1 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,944 KB |
testcase_20 | AC | 1 ms
6,940 KB |
testcase_21 | AC | 35 ms
15,040 KB |
testcase_22 | AC | 19 ms
11,980 KB |
testcase_23 | AC | 31 ms
12,884 KB |
testcase_24 | AC | 15 ms
6,940 KB |
testcase_25 | AC | 57 ms
15,000 KB |
testcase_26 | AC | 59 ms
15,000 KB |
testcase_27 | AC | 26 ms
12,868 KB |
testcase_28 | AC | 27 ms
12,856 KB |
testcase_29 | AC | 18 ms
6,940 KB |
ソースコード
#![allow(unused_imports)] #![allow(non_snake_case, unused)] use std::cmp::*; use std::collections::*; use std::ops::*; // https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254 より macro_rules! eprint { ($($t:tt)*) => {{ use ::std::io::Write; let _ = write!(::std::io::stderr(), $($t)*); }}; } macro_rules! eprintln { () => { eprintln!(""); }; ($($t:tt)*) => {{ use ::std::io::Write; let _ = writeln!(::std::io::stderr(), $($t)*); }}; } macro_rules! dbg { ($v:expr) => {{ let val = $v; eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val); val }} } macro_rules! mat { ($($e:expr),*) => { Vec::from(vec![$($e),*]) }; ($($e:expr,)*) => { Vec::from(vec![$($e),*]) }; ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) }; ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) }; } macro_rules! ok { ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => { $a$([$i])*.$f($($t),*) }; ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { { let t = $e; ok!($a$([$i])*.$f($($es),*)$(@$t)*@t) } }; } pub fn readln() -> String { let mut line = String::new(); ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e)); line } macro_rules! read { ($($t:tt),*; $n:expr) => {{ let stdin = ::std::io::stdin(); let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| { let line = line.unwrap(); let mut it = line.split_whitespace(); _read!(it; $($t),*) }).collect::<Vec<_>>(); ret }}; ($($t:tt),*) => {{ let line = readln(); let mut it = line.split_whitespace(); _read!(it; $($t),*) }}; } macro_rules! _read { ($it:ident; [char]) => { _read!($it; String).chars().collect::<Vec<_>>() }; ($it:ident; [u8]) => { Vec::from(_read!($it; String).into_bytes()) }; ($it:ident; usize1) => { $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1 }; ($it:ident; [usize1]) => { $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>() }; ($it:ident; [$t:ty]) => { $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>() }; ($it:ident; $t:ty) => { $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e)) }; ($it:ident; $($t:tt),+) => { ($(_read!($it; $t)),*) }; } pub fn main() { let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join(); } const MOD: usize = 998244353; // const MOD: usize = 1_000_000_007; const INF: i64 = std::i64::MAX; // const INF: i128 = std::i128::MAX/100; fn solve() { let (n,m) = read!(usize,usize); let a = read!([usize]); let mut edge = vec![vec![];m]; let mut edge2 = vec![vec![];m]; let mut flag = true; for i in 0..n-1 { if a[i]==a[i+1] { flag = false; } if i<n-2 && a[i]==a[i+2] { flag = false; } if i%2==0 { edge[a[i]-1].push(a[i+1]-1); edge2[a[i+1]-1].push(a[i]-1); } else { edge[a[i+1]-1].push(a[i]-1); edge2[a[i]-1].push(a[i+1]-1); } } if !flag { println!("No"); return; } for i in 0..m { edge[i].sort(); edge[i].dedup(); edge2[i].sort(); edge2[i].dedup(); } let ret = topo(&edge); let ret2 = topo(&edge2); if ret.len()==m { let mut ans = vec![0;m]; for i in 0..m { ans[ret[i]] = i+1; } println!("Yes"); for &a in &ans { print!("{} ",a); } println!(); return; } if ret2.len()==m { let mut ans = vec![0;m]; for i in 0..m { ans[ret2[i]] = i+1; } println!("Yes"); for &a in &ans { print!("{} ",a); } println!(); return; } println!("No"); } fn topo(edge: &Vec<Vec<usize>>) -> Vec<usize> { let n = edge.len(); let mut inner = vec![0;n]; for i in 0..n { for &j in &edge[i] { inner[j] += 1; } } let mut q = VecDeque::new(); for i in 0..n { if inner[i]==0 { q.push_back(i); } } let mut ans = vec![]; while let Some(c) = q.pop_front() { ans.push(c); for &e in &edge[c] { inner[e] -= 1; if inner[e]==0 { q.push_back(e); } } } ans } fn run() { let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); solve(); }