結果
| 問題 | No.635 自然門松列 |
| コンテスト | |
| ユーザー |
 aimy
|
| 提出日時 | 2018-01-19 22:33:55 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 3,984 bytes |
| コンパイル時間 | 17,470 ms |
| コンパイル使用メモリ | 379,004 KB |
| 実行使用メモリ | 5,248 KB |
| 最終ジャッジ日時 | 2024-12-24 12:38:25 |
| 合計ジャッジ時間 | 18,241 ms |
|
ジャッジサーバーID （参考情報） |
judge1 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 13 WA * 10 |
コンパイルメッセージ
warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
--> src/main.rs:56:9
|
56 | buf.trim_right().parse::<T>().ok().unwrap()
| ^^^^^^^^^^
|
= note: `#[warn(deprecated)]` on by default
help: replace the use of the deprecated method
|
56 | buf.trim_end().parse::<T>().ok().unwrap()
| ~~~~~~~~
warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
--> src/main.rs:72:22
|
72 | let mut it = buf.trim_right().split_whitespace();
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
72 | let mut it = buf.trim_end().split_whitespace();
| ~~~~~~~~
warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
--> src/main.rs:91:22
|
91 | let mut it = buf.trim_right().split_whitespace();
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
91 | let mut it = buf.trim_end().split_whitespace();
| ~~~~~~~~
warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
--> src/main.rs:111:9
|
111 | buf.trim_right().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect()
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
111 | buf.trim_end().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect()
| ~~~~~~~~
warning: use of deprecated method `core::str::<impl str>::trim_right`: superseded by `trim_end`
--> src/main.rs:127:9
|
127 | buf.trim_right().chars().collect()
| ^^^^^^^^^^
|
help: replace the use of the deprecated method
|
127 | buf.trim_end().chars().collect()
| ~~~~~~~~
ソースコード
#![allow(unused_imports, unused_macros, unknown_lints)]
use std::collections::*;
use std::cmp::Ordering::*;
macro_rules! dump {($($e:expr), +) => {print!(concat!($(stringify!($e), " = {:?}\n"), +), $($e), +)}}
macro_rules! max {($e0:expr, $($e:expr), +) => {{let mut r = $e0; $(r = std::cmp::max(r, $e);)+ r}}}
macro_rules! min {($e0:expr, $($e:expr), +) => {{let mut r = $e0; $(r = std::cmp::min(r, $e);)+ r}}}
fn main() {
let n = get::val::<usize>();
let ts = {
let mut ts = vec![];
for _ in 0 .. n {
let v = get::vec::<usize>();
let t = (v[0],v[1],v[2],v[3],v[4],v[5]);
ts.push(t)
}
ts
};
let is_kadomatsu = |a,b,c| a!=b&&b!=c&&c!=a && (b==max!(a,b,c) || b==min!(a,b,c));
for (x1,x2,x3,y1,y2,y3) in ts {
if is_kadomatsu(x1,x2,x3) || is_kadomatsu(y1,y2,y3) {
println!("YES");
continue
}
match (x1.cmp(&x2), x2.cmp(&x3), y1.cmp(&y2), y2.cmp(&y3)) {
(Less,Less,Greater,Greater) | (Greater,Greater,Less,Less)
=> {println!("YES"); continue},
_ => ()
}
if x1!=x2&&x2!=x3 && y1!=y2&&y2!=y3 &&
(x2==max!(x1,x2,x3) || x2==min!(x1,x2,x3) || y2==max!(y1,y2,y3) || y2==min!(y1,y2,y3))
&& (x1!=y1 || x3!=y3) {
println!("YES");
continue
}
println!("NO")
}
}
#[allow(dead_code)]
mod get {
use std::io::*;
use std::str::*;
use std::process::*;
pub fn val<T: FromStr>() -> T {
let mut buf = String::new();
let s = stdin();
s.lock().read_line(&mut buf).ok();
if buf.is_empty() {println!("No input"); exit(0)}
buf.trim_right().parse::<T>().ok().unwrap()
}
pub fn vals<T: FromStr>(n: usize) -> Vec<T> {
let mut vec: Vec<T> = vec![];
for _ in 0 .. n {
vec.push(val());
}
vec
}
pub fn tuple<T1: FromStr, T2: FromStr>() -> (T1, T2) {
let mut buf = String::new();
let s = stdin();
s.lock().read_line(&mut buf).ok();
if buf.is_empty() {println!("No input"); exit(0)}
let mut it = buf.trim_right().split_whitespace();
let x = it.next().unwrap().parse::<T1>().ok().unwrap();
let y = it.next().unwrap().parse::<T2>().ok().unwrap();
(x, y)
}
pub fn tuples<T1: FromStr, T2: FromStr>(n: usize) -> Vec<(T1, T2)> {
let mut vec: Vec<(T1, T2)> = vec![];
for _ in 0 .. n {
vec.push(tuple());
}
vec
}
pub fn tuple3<T1: FromStr, T2: FromStr, T3: FromStr>() -> (T1, T2, T3) {
let mut buf = String::new();
let s = stdin();
s.lock().read_line(&mut buf).ok();
if buf.is_empty() {println!("No input"); exit(0)}
let mut it = buf.trim_right().split_whitespace();
let x = it.next().unwrap().parse::<T1>().ok().unwrap();
let y = it.next().unwrap().parse::<T2>().ok().unwrap();
let z = it.next().unwrap().parse::<T3>().ok().unwrap();
(x, y, z)
}
pub fn tuple3s<T1: FromStr, T2: FromStr, T3: FromStr>(n: usize) -> Vec<(T1, T2, T3)> {
let mut vec: Vec<(T1, T2, T3)> = vec![];
for _ in 0 .. n {
vec.push(tuple3());
}
vec
}
pub fn vec<T: FromStr>() -> Vec<T> {
let mut buf = String::new();
let s = stdin();
s.lock().read_line(&mut buf).ok();
if buf.is_empty() {println!("No input"); exit(0)}
buf.trim_right().split_whitespace().map(|t| t.parse::<T>().ok().unwrap()).collect()
}
pub fn mat<T: FromStr>(h: usize) -> Vec<Vec<T>> {
let mut mat = vec![];
for _ in 0 .. h {
mat.push(vec());
}
mat
}
pub fn chars() -> Vec<char> {
let mut buf = String::new();
let s = stdin();
s.lock().read_line(&mut buf).ok();
if buf.is_empty() {println!("No input"); exit(0)}
buf.trim_right().chars().collect()
}
}
#[allow(dead_code)]
mod put {
use std::string::*;
pub fn vec<T: ToString>(vec: &Vec<T>, sep: &str) {
let out = vec.iter().map(|e| e.to_string()).collect::<Vec<_>>().as_slice().join(sep);
println!("{}", out);
}
pub fn mat<T: ToString>(mat: &Vec<Vec<T>>, sep: &str) {
for v in mat {
vec(v, sep);
}
}
}