Submission #20970738


Source Code Expand

Copy
#[allow(unused_imports)]
#[cfg(feature = "dbg")]
use dbg::lg;
use std::{cmp::Reverse, collections::BinaryHeap};

fn main() {
    let mut buf = ngtio::with_stdin();
    let n = buf.usize();
    let mut adj = [[false; 26]; 26];
    for _ in 0..n {
        let a = buf.string();
        let b = buf.string();
        match a.chars().zip(b.chars()).find(|&(x, y)| x != y) {
            None => match a.len() < b.len() {
                true => (),
                false => {
                    println!("-1");
                    return;
                }
            },
            Some((x, y)) => adj[((x as u8) - b'a') as usize][((y as u8) - b'a') as usize] = true,
        }
    }
    let mut tail = [0; 26];
    for i in 0..26 {
        for j in 0..26 {
            if adj[i][j] {
                tail[j] += 1;
            }
        }
    }
    let mut heap = BinaryHeap::new();
    for i in 0..26 {
        if tail[i] == 0 {
            heap.push(Reverse(i));
        }
    }
    let mut ans = Vec::new();
    while let Some(Reverse(x)) = heap.pop() {
        ans.push(x);
        for y in 0..26 {
            if adj[x][y] {
                tail[y] -= 1;
                if tail[y] == 0 {
                    heap.push(Reverse(y));
                }
            }
        }
    }
    if ans.len() != 26 {
        println!("-1");
        return;
    }
    println!(
        "{}",
        ans.iter()
            .map(|&x| ((x as u8) + b'a') as char)
            .collect::<String>()
    );
}

// template {{{
#[cfg(not(feature = "dbg"))]
#[allow(unused_macros)]
#[macro_export]
macro_rules! lg {
    ($($expr:expr),*) => {};
}

#[allow(dead_code)]
mod ngtio {

    mod i {
        use std::{
            io::{self, BufRead},
            iter,
        };

        pub use self::{
            multi_token::{Leaf, Parser, ParserTuple, RawTuple, Tuple, VecLen},
            token::{Token, Usize1},
        };

        pub fn with_stdin() -> Tokenizer<io::BufReader<io::Stdin>> {
            io::BufReader::new(io::stdin()).tokenizer()
        }

        pub fn with_str(src: &str) -> Tokenizer<&[u8]> {
            src.as_bytes().tokenizer()
        }

        pub struct Tokenizer<S: BufRead> {
            queue: Vec<String>, // FIXME: String のみにすると速そうです。
            scanner: S,
        }
        macro_rules! prim_method {
            ($name:ident: $T:ty) => {
                pub fn $name(&mut self) -> $T {
                    <$T>::leaf().parse(self)
                }
            };
            ($name:ident) => {
                prim_method!($name: $name);
            };
        }
        macro_rules! prim_methods {
            ($name:ident: $T:ty; $($rest:tt)*) => {
                prim_method!($name:$T);
                prim_methods!($($rest)*);
            };
            ($name:ident; $($rest:tt)*) => {
                prim_method!($name);
                prim_methods!($($rest)*);
            };
            () => ()
        }
        impl<S: BufRead> Tokenizer<S> {
            pub fn token(&mut self) -> String {
                self.load();
                self.queue.pop().expect("入力が終了したのですが。")
            }
            pub fn new(scanner: S) -> Self {
                Self {
                    queue: Vec::new(),
                    scanner,
                }
            }
            fn load(&mut self) {
                while self.queue.is_empty() {
                    let mut s = String::new();
                    let length = self.scanner.read_line(&mut s).unwrap(); // 入力が UTF-8 でないときにエラーだそうです。
                    if length == 0 {
                        break;
                    }
                    self.queue = s.split_whitespace().rev().map(str::to_owned).collect();
                }
            }

            pub fn skip_line(&mut self) {
                assert!(
                    self.queue.is_empty(),
                    "行の途中で呼ばないでいただきたいです。現在のトークンキュー: {:?}",
                    &self.queue
                );
                self.load();
            }

            pub fn end(&mut self) {
                self.load();
                assert!(self.queue.is_empty(), "入力はまだあります!");
            }

            pub fn parse<T: Token>(&mut self) -> T::Output {
                T::parse(&self.token())
            }

            pub fn parse_collect<T: Token, B>(&mut self, n: usize) -> B
            where
                B: iter::FromIterator<T::Output>,
            {
                iter::repeat_with(|| self.parse::<T>()).take(n).collect()
            }

            pub fn tuple<T: RawTuple>(&mut self) -> <T::LeafTuple as Parser>::Output {
                T::leaf_tuple().parse(self)
            }

            pub fn vec<T: Token>(&mut self, len: usize) -> Vec<T::Output> {
                T::leaf().vec(len).parse(self)
            }

            pub fn vec_tuple<T: RawTuple>(
                &mut self,
                len: usize,
            ) -> Vec<<T::LeafTuple as Parser>::Output> {
                T::leaf_tuple().vec(len).parse(self)
            }

            pub fn vec2<T: Token>(&mut self, height: usize, width: usize) -> Vec<Vec<T::Output>> {
                T::leaf().vec(width).vec(height).parse(self)
            }

            pub fn vec2_tuple<T>(
                &mut self,
                height: usize,
                width: usize,
            ) -> Vec<Vec<<T::LeafTuple as Parser>::Output>>
            where
                T: RawTuple,
            {
                T::leaf_tuple().vec(width).vec(height).parse(self)
            }
            prim_methods! {
                u8; u16; u32; u64; u128; usize;
                i8; i16; i32; i64; i128; isize;
                f32; f64;
                char; string: String;
            }
        }

        mod token {
            use super::multi_token::Leaf;
            use std::{any, fmt, marker, str};

            pub trait Token: Sized {
                type Output;
                fn parse(s: &str) -> Self::Output;
                fn leaf() -> Leaf<Self> {
                    Leaf(marker::PhantomData)
                }
            }

            impl<T> Token for T
            where
                T: str::FromStr,
                <T as str::FromStr>::Err: fmt::Debug,
            {
                type Output = T;
                fn parse(s: &str) -> Self::Output {
                    s.parse().unwrap_or_else(|_| {
                        panic!("Parse error!: ({}: {})", s, any::type_name::<T>(),)
                    })
                }
            }

            pub struct Usize1 {}
            impl Token for Usize1 {
                type Output = usize;
                fn parse(s: &str) -> Self::Output {
                    usize::parse(s)
                        .checked_sub(1)
                        .expect("Parse error! (Zero substruction error of Usize1)")
                }
            }
        }

        mod multi_token {
            use super::{Token, Tokenizer};
            use std::{io::BufRead, iter, marker};

            pub trait Parser: Sized {
                type Output;
                fn parse<S: BufRead>(&self, server: &mut Tokenizer<S>) -> Self::Output;
                fn vec(self, len: usize) -> VecLen<Self> {
                    VecLen { len, elem: self }
                }
            }
            pub struct Leaf<T>(pub(super) marker::PhantomData<T>);
            impl<T: Token> Parser for Leaf<T> {
                type Output = T::Output;
                fn parse<S: BufRead>(&self, server: &mut Tokenizer<S>) -> T::Output {
                    server.parse::<T>()
                }
            }

            pub struct VecLen<T> {
                pub len: usize,
                pub elem: T,
            }
            impl<T: Parser> Parser for VecLen<T> {
                type Output = Vec<T::Output>;
                fn parse<S: BufRead>(&self, server: &mut Tokenizer<S>) -> Self::Output {
                    iter::repeat_with(|| self.elem.parse(server))
                        .take(self.len)
                        .collect()
                }
            }

            pub trait RawTuple {
                type LeafTuple: Parser;
                fn leaf_tuple() -> Self::LeafTuple;
            }
            pub trait ParserTuple {
                type Tuple: Parser;
                fn tuple(self) -> Self::Tuple;
            }
            pub struct Tuple<T>(pub T);
            macro_rules! impl_tuple {
                ($($t:ident: $T:ident),*) => {
                    impl<$($T),*> Parser for Tuple<($($T,)*)>
                        where
                            $($T: Parser,)*
                            {
                                type Output = ($($T::Output,)*);
#[allow(unused_variables)]
                                fn parse<S: BufRead >(&self, server: &mut Tokenizer<S>) -> Self::Output {
                                    match self {
                                        Tuple(($($t,)*)) => {
                                            ($($t.parse(server),)*)
                                        }
                                    }
                                }
                            }
                    impl<$($T: Token),*> RawTuple for ($($T,)*) {
                        type LeafTuple = Tuple<($(Leaf<$T>,)*)>;
                        fn leaf_tuple() -> Self::LeafTuple {
                            Tuple(($($T::leaf(),)*))
                        }
                    }
                    impl<$($T: Parser),*> ParserTuple for ($($T,)*) {
                        type Tuple = Tuple<($($T,)*)>;
                        fn tuple(self) -> Self::Tuple {
                            Tuple(self)
                        }
                    }
                };
            }
            impl_tuple!();
            impl_tuple!(t1: T1);
            impl_tuple!(t1: T1, t2: T2);
            impl_tuple!(t1: T1, t2: T2, t3: T3);
            impl_tuple!(t1: T1, t2: T2, t3: T3, t4: T4);
            impl_tuple!(t1: T1, t2: T2, t3: T3, t4: T4, t5: T5);
            impl_tuple!(t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6);
            impl_tuple!(t1: T1, t2: T2, t3: T3, t4: T4, t5: T5, t6: T6, t7: T7);
            impl_tuple!(
                t1: T1,
                t2: T2,
                t3: T3,
                t4: T4,
                t5: T5,
                t6: T6,
                t7: T7,
                t8: T8
            );
        }

        trait Scanner: BufRead + Sized {
            fn tokenizer(self) -> Tokenizer<Self> {
                Tokenizer::new(self)
            }
        }
        impl<R: BufRead> Scanner for R {}
    }

    pub use self::i::{with_stdin, with_str};

    pub mod prelude {
        pub use super::i::{Parser, ParserTuple, RawTuple, Token, Usize1};
    }
}
// }}}

Submission Info

Submission Time
Task C - 山田山本問題
User ngtkana
Language Rust (1.42.0)
Score 600
Code Size 11268 Byte
Status AC
Exec Time 16 ms
Memory 2196 KB

Judge Result

Set Name All
Score / Max Score 600 / 600
Status
AC × 45
Set Name Test Cases
All 00_sample_01, 00_sample_02, 00_sample_03, 00_sample_04, 01_manual_00, 01_manual_01, 01_manual_02, 01_manual_03, 01_manual_04, 01_manual_05, 01_manual_06, 01_manual_07, 10_random_00, 10_random_01, 10_random_02, 10_random_03, 10_random_04, 10_random_05, 10_random_06, 10_random_07, 10_random_08, 10_random_09, 30_random_00, 30_random_01, 30_random_02, 30_random_03, 30_random_04, 30_random_05, 30_random_06, 30_random_07, 30_random_08, 30_random_09, 50_random_00, 50_random_01, 50_random_02, 50_random_03, 50_random_04, 50_random_05, 50_random_06, 50_random_07, 50_random_08, 50_random_09, 51_random_00, 51_random_01, 51_random_02
Case Name Status Exec Time Memory
00_sample_01 AC 1 ms 2136 KB
00_sample_02 AC 1 ms 2060 KB
00_sample_03 AC 1 ms 2012 KB
00_sample_04 AC 3 ms 2128 KB
01_manual_00 AC 2 ms 2084 KB
01_manual_01 AC 1 ms 2068 KB
01_manual_02 AC 1 ms 2032 KB
01_manual_03 AC 1 ms 2116 KB
01_manual_04 AC 1 ms 1948 KB
01_manual_05 AC 1 ms 1992 KB
01_manual_06 AC 2 ms 2124 KB
01_manual_07 AC 16 ms 2132 KB
10_random_00 AC 2 ms 1976 KB
10_random_01 AC 2 ms 2196 KB
10_random_02 AC 2 ms 2088 KB
10_random_03 AC 2 ms 2068 KB
10_random_04 AC 1 ms 2084 KB
10_random_05 AC 2 ms 2136 KB
10_random_06 AC 1 ms 2048 KB
10_random_07 AC 2 ms 2124 KB
10_random_08 AC 3 ms 2068 KB
10_random_09 AC 2 ms 2084 KB
30_random_00 AC 1 ms 1992 KB
30_random_01 AC 2 ms 2120 KB
30_random_02 AC 1 ms 2112 KB
30_random_03 AC 1 ms 2100 KB
30_random_04 AC 1 ms 2052 KB
30_random_05 AC 2 ms 2012 KB
30_random_06 AC 2 ms 2052 KB
30_random_07 AC 2 ms 2052 KB
30_random_08 AC 2 ms 2084 KB
30_random_09 AC 2 ms 2032 KB
50_random_00 AC 15 ms 2056 KB
50_random_01 AC 15 ms 2072 KB
50_random_02 AC 15 ms 2112 KB
50_random_03 AC 16 ms 2088 KB
50_random_04 AC 13 ms 2064 KB
50_random_05 AC 11 ms 2132 KB
50_random_06 AC 9 ms 2128 KB
50_random_07 AC 15 ms 2144 KB
50_random_08 AC 15 ms 2112 KB
50_random_09 AC 15 ms 2052 KB
51_random_00 AC 12 ms 2064 KB
51_random_01 AC 2 ms 2020 KB
51_random_02 AC 5 ms 2056 KB