結果
| 問題 | No.1369 交換門松列・竹 |
| ユーザー |
 ziita
|
| 提出日時 | 2021-02-21 02:14:02 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 6,030 bytes |
| コンパイル時間 | 16,077 ms |
| コンパイル使用メモリ | 393,200 KB |
| 実行使用メモリ | 6,944 KB |
| 最終ジャッジ日時 | 2024-09-19 00:42:09 |
| 合計ジャッジ時間 | 14,929 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge3 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 30 WA * 3 |
ソースコード
#![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 t = read!(usize);for i in 0..t {let n = read!(usize);let a = read!([usize]);let mut v = vec![];for j in 1..n-1 {if a[j]==a[j-1] {v.push(j-1);v.push(j);}if a[j]==a[j+1] {v.push(j);v.push(j+1);}if a[j-1]==a[j+1] {v.push(j-1);v.push(j+1);}if a[j-1]<a[j] && a[j]<a[j+1] {v.push(j-1);v.push(j);v.push(j+1);}if a[j-1]>a[j] && a[j]>a[j+1] {v.push(j-1);v.push(j);v.push(j+1);}}v.sort();v.dedup();if v.len()>=10 {println!("No");continue;}let s = v.len();let mut total = 1<<s;let mut z = a.clone();let mut ans = false;for k in 0..total {let mut x = vec![];for m in 0..s {if (k>>m)%2==1 {x.push(v[m]);}}if x.len()!=2 {continue;}z.swap(x[0],x[1]);let mut flag = true;for y in 1..n-1 {if z[y]==z[y-1] || z[y]==z[y+1] || z[y-1]==z[y+1]{flag = false;}if z[y-1]<z[y] && z[y]<z[y+1] {flag = false;}if z[y-1]>z[y] && z[y]>z[y+1] {flag = false;}}z.swap(x[0],x[1]);if flag {ans = true;break;}}if ans {println!("Yes");continue;}ans = false;if v.len()<=4 {for &t in &v {for k in 0..n {if k==t {continue;}z.swap(k,t);let mut flag = true;for y in 1..n-1 {if z[y]==z[y-1] || z[y]==z[y+1] || z[y-1]==z[y+1]{flag = false;}if z[y-1]<z[y] && z[y]<z[y+1] {flag = false;}if z[y-1]>z[y] && z[y]>z[y+1] {flag = false;}}z.swap(k,t);if flag {ans = true;break;}}}}if ans {println!("Yes");continue;}println!("No");}}fn run() {let stack_size = 104_857_600; // 100 MBlet thd = std::thread::Builder::new().stack_size(stack_size);solve();}