#631262 (Rust) No.629 グラフの中に眠る門松列

提出ソース

結果

問題	No.629 グラフの中に眠る門松列
ユーザー	manta1130
提出日時	2021-03-18 21:56:35
言語	Rust (1.77.0 + proconio)
結果	AC
実行時間	306 ms / 4,000 ms
コード長	5,621 bytes
コンパイル時間	15,280 ms
コンパイル使用メモリ	379,384 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-11-17 04:05:19
合計ジャッジ時間	17,265 ms
ジャッジサーバーID （参考情報）	judge3 / judge4

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	1 ms 5,248 KB
testcase_01	AC	1 ms 5,248 KB
testcase_02	AC	1 ms 5,248 KB
testcase_03	AC	1 ms 5,248 KB
testcase_04	AC	1 ms 5,248 KB
testcase_05	AC	1 ms 5,248 KB
testcase_06	AC	1 ms 5,248 KB
testcase_07	AC	1 ms 5,248 KB
testcase_08	AC	1 ms 5,248 KB
testcase_09	AC	1 ms 5,248 KB
testcase_10	AC	1 ms 5,248 KB
testcase_11	AC	1 ms 5,248 KB
testcase_12	AC	1 ms 5,248 KB
testcase_13	AC	1 ms 5,248 KB
testcase_14	AC	1 ms 5,248 KB
testcase_15	AC	1 ms 5,248 KB
testcase_16	AC	1 ms 5,248 KB
testcase_17	AC	1 ms 5,248 KB
testcase_18	AC	1 ms 5,248 KB
testcase_19	AC	1 ms 5,248 KB
testcase_20	AC	1 ms 5,248 KB
testcase_21	AC	16 ms 5,248 KB
testcase_22	AC	1 ms 5,248 KB
testcase_23	AC	10 ms 5,248 KB
testcase_24	AC	3 ms 5,248 KB
testcase_25	AC	299 ms 5,248 KB
testcase_26	AC	290 ms 5,248 KB
testcase_27	AC	170 ms 5,248 KB
testcase_28	AC	4 ms 5,248 KB
testcase_29	AC	10 ms 5,248 KB
testcase_30	AC	49 ms 5,248 KB
testcase_31	AC	19 ms 5,248 KB
testcase_32	AC	12 ms 5,248 KB
testcase_33	AC	306 ms 5,248 KB
testcase_34	AC	22 ms 5,248 KB
testcase_35	AC	5 ms 5,248 KB
testcase_36	AC	144 ms 5,248 KB
testcase_37	AC	147 ms 5,248 KB
testcase_38	AC	191 ms 5,248 KB
testcase_39	AC	30 ms 5,248 KB
testcase_40	AC	49 ms 5,248 KB
testcase_41	AC	3 ms 5,248 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

warning: unused import: `std::cmp::Reverse`
 --> src/main.rs:4:5
  |
4 | use std::cmp::Reverse;
  |     ^^^^^^^^^^^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused import: `std::collections::BTreeMap`
 --> src/main.rs:5:5
  |
5 | use std::collections::BTreeMap;
  |     ^^^^^^^^^^^^^^^^^^^^^^^^^^

warning: unused attribute `macro_export`
  --> src/main.rs:63:5
   |
63 |     #[macro_export]
   |     ^^^^^^^^^^^^^^^
   |
note: the built-in attribute `macro_export` will be ignored, since it's applied to the macro invocation `thread_local`
  --> src/main.rs:64:5
   |
64 |     thread_local! {
   |     ^^^^^^^^^^^^
   = note: `#[warn(unused_attributes)]` on by default

warning: unused variable: `n`
  --> src/main.rs:11:9
   |
11 |         n:usize,m:usize,
   |         ^
   |
help: `n` is captured in macro and introduced a unused variable
  --> src/main.rs:83:17
   |
10 | /     inputv! {
11 | |         n:usize,m:usize,
12 | |     }
   | |_____- in this macro invocation
...
83 |               let $x: $t = buf_split_result.parse().unwrap();
   |                   ^^
   = note: `#[warn(unused_variables)]` on by default
   = note: this warning originates in the macro `input_internal` which comes from the expansion of the macro `inputv` (in Nightly builds, run with -Z macro-backtrace for more info)

ソースコード

raw source code

#[allow(unused_imports)]
use std::io::{stdout, BufWriter, Write};

use std::cmp::Reverse;
use std::collections::BTreeMap;
fn main() {
    let out = stdout();
    let mut out = BufWriter::new(out.lock());

    inputv! {
        n:usize,m:usize,
    }
    let edge = input_vector::<usize>();
    let mut graph = vec![];
    for _ in 0..m {
        inputv! {
            a:usize,b:usize,
        }
        graph.push((a - 1, b - 1));
    }
    for i in 0..graph.len() {
        for j in i + 1..graph.len() {
            let mut buf = vec![graph[i].0, graph[i].1, graph[j].0, graph[j].1];
            buf.sort_unstable();
            let (p0, p1, p2);
            if buf[0] == buf[1] {
                p0 = buf[3];
                p1 = buf[0];
                p2 = buf[2];
            } else if buf[1] == buf[2] {
                p0 = buf[0];
                p1 = buf[1];
                p2 = buf[3];
            } else if buf[2] == buf[3] {
                p0 = buf[0];
                p1 = buf[2];
                p2 = buf[1];
            } else {
                continue;
            }
            if edge[p0] != edge[p2]
                && (edge[p0] < edge[p1] && edge[p1] > edge[p2]
                    || edge[p0] > edge[p1] && edge[p1] < edge[p2])
            {
                writeln!(out, "YES").unwrap();
                return;
            }
        }
    }
    writeln!(out, "NO").unwrap();
}

//https://github.com/manta1130/competitive-template-rs

use input::*;

pub mod input {
    use std::cell::RefCell;
    use std::io;
    pub const SPLIT_DELIMITER: char = ' ';
    pub use std::io::prelude::*;

    #[macro_export]
    thread_local! {
        pub static INPUT_BUFFER:RefCell<std::collections::VecDeque<String>>=RefCell::new(std::collections::VecDeque::new());
    }

    #[macro_export]
    macro_rules! input_internal {
        ($x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                if p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let $x: $t = buf_split_result.parse().unwrap();
        };
        (mut $x:ident : $t:ty) => {
            INPUT_BUFFER.with(|p| {
                if p.borrow().len() == 0 {
                    let temp_str = input_line_str();
                    let mut split_result_iter = temp_str
                        .split(SPLIT_DELIMITER)
                        .map(|q| q.to_string())
                        .collect::<std::collections::VecDeque<_>>();
                    p.borrow_mut().append(&mut split_result_iter)
                }
            });
            let mut buf_split_result = String::new();
            INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
            let mut $x: $t = buf_split_result.parse().unwrap();
        };
    }

    #[macro_export]
    macro_rules! inputv {
    ($i:ident : $t:ty) => {
        input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty) => {
        input_internal!{mut $i : $t}
    };
    ($i:ident : $t:ty $(,)*) => {
            input_internal!{$i : $t}
    };
    (mut $i:ident : $t:ty $(,)*) => {
            input_internal!{mut $i : $t}
    };
    (mut $i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{mut $i : $t}
            inputv!{$($q)*}
    };
    ($i:ident : $t:ty,$($q:tt)*) => {
            input_internal!{$i : $t}
            inputv!{$($q)*}
    };
}

    pub fn input_all() {
        INPUT_BUFFER.with(|p| {
            if p.borrow().len() == 0 {
                let mut temp_str = String::new();
                std::io::stdin().read_to_string(&mut temp_str).unwrap();
                let mut split_result_iter = temp_str
                    .split_whitespace()
                    .map(|q| q.to_string())
                    .collect::<std::collections::VecDeque<_>>();
                p.borrow_mut().append(&mut split_result_iter)
            }
        });
    }

    pub fn input_line_str() -> String {
        let mut s = String::new();
        io::stdin().read_line(&mut s).unwrap();
        s.trim().to_string()
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector<T>() -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v: Vec<T> = Vec::new();

        let s = input_line_str();
        let split_result = s.split(SPLIT_DELIMITER);
        for z in split_result {
            let buf = match z.parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    #[allow(clippy::match_wild_err_arm)]
    pub fn input_vector_row<T>(n: usize) -> Vec<T>
    where
        T: std::str::FromStr,
    {
        let mut v = Vec::with_capacity(n);
        for _ in 0..n {
            let buf = match input_line_str().parse() {
                Ok(r) => r,
                Err(_) => panic!("Parse Error",),
            };
            v.push(buf);
        }
        v
    }

    pub trait ToCharVec {
        fn to_charvec(&self) -> Vec<char>;
    }

    impl ToCharVec for String {
        fn to_charvec(&self) -> Vec<char> {
            self.to_string().chars().collect::<Vec<_>>()
        }
    }
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード