#621042 (Rust) No.1340 おーじ君をさがせ

• 問題: No.1340 おーじ君をさがせ
• ユーザー: ziita
• 提出日時: 2021-02-22 01:57:00
• 言語: Rust (1.77.0 + proconio)
• 結果: AC
• 実行時間: 245 ms / 2,000 ms
• コード長: 4,724 bytes
• コンパイル時間: 13,001 ms
• コンパイル使用メモリ: 402,068 KB
• 実行使用メモリ: 5,376 KB
• 最終ジャッジ日時: 2024-09-19 21:59:11
• 合計ジャッジ時間: 17,743 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	1 ms; 5,376 KB
testcase_03	AC	1 ms; 5,376 KB
testcase_04	AC	1 ms; 5,376 KB
testcase_05	AC	1 ms; 5,376 KB
testcase_06	AC	1 ms; 5,376 KB
testcase_07	AC	1 ms; 5,376 KB
testcase_08	AC	1 ms; 5,376 KB
testcase_09	AC	1 ms; 5,376 KB
testcase_10	AC	10 ms; 5,376 KB
testcase_11	AC	2 ms; 5,376 KB
testcase_12	AC	21 ms; 5,376 KB
testcase_13	AC	2 ms; 5,376 KB
testcase_14	AC	2 ms; 5,376 KB
testcase_15	AC	2 ms; 5,376 KB
testcase_16	AC	15 ms; 5,376 KB
testcase_17	AC	2 ms; 5,376 KB
testcase_18	AC	2 ms; 5,376 KB
testcase_19	AC	2 ms; 5,376 KB
testcase_20	AC	10 ms; 5,376 KB
testcase_21	AC	187 ms; 5,376 KB
testcase_22	AC	163 ms; 5,376 KB
testcase_23	AC	195 ms; 5,376 KB
testcase_24	AC	125 ms; 5,376 KB
testcase_25	AC	166 ms; 5,376 KB
testcase_26	AC	109 ms; 5,376 KB
testcase_27	AC	84 ms; 5,376 KB
testcase_28	AC	161 ms; 5,376 KB
testcase_29	AC	96 ms; 5,376 KB
testcase_30	AC	193 ms; 5,376 KB
testcase_31	AC	245 ms; 5,376 KB
testcase_32	AC	6 ms; 5,376 KB
testcase_33	AC	5 ms; 5,376 KB
testcase_34	AC	5 ms; 5,376 KB
testcase_35	AC	121 ms; 5,376 KB
testcase_36	AC	1 ms; 5,376 KB
testcase_37	AC	154 ms; 5,376 KB
testcase_38	AC	155 ms; 5,376 KB
testcase_39	AC	89 ms; 5,376 KB
testcase_40	AC	92 ms; 5,376 KB
testcase_41	AC	92 ms; 5,376 KB
testcase_42	AC	1 ms; 5,376 KB
testcase_43	AC	1 ms; 5,376 KB
testcase_44	AC	1 ms; 5,376 KB
testcase_45	AC	1 ms; 5,376 KB
testcase_46	AC	54 ms; 5,376 KB
testcase_47	AC	53 ms; 5,376 KB
testcase_48	AC	54 ms; 5,376 KB
testcase_49	AC	7 ms; 5,376 KB
testcase_50	AC	7 ms; 5,376 KB
testcase_51	AC	7 ms; 5,376 KB
testcase_52	AC	4 ms; 5,376 KB
testcase_53	AC	4 ms; 5,376 KB
testcase_54	AC	4 ms; 5,376 KB
testcase_55	AC	56 ms; 5,376 KB
testcase_56	AC	4 ms; 5,376 KB
testcase_57	AC	3 ms; 5,376 KB
testcase_58	AC	2 ms; 5,376 KB
testcase_59	AC	13 ms; 5,376 KB
testcase_60	AC	1 ms; 5,376 KB
testcase_61	AC	13 ms; 5,376 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: usize = std::usize::MAX;
// const INF: i128 = std::i128::MAX/100;

fn solve() {
    let (n,m,t) = read!(usize,usize,i64);
    let ab = read!(usize,usize;m);
    let mut edge = vec![vec![];n];
    for &(a,b) in &ab {
        edge[a].push(b);
    }
    let mut mt = 10000;
    let mut list = vec![vec![false;mt+1];n];
    let mut q = VecDeque::new();
    q.push_back((0,0));
    while let Some((cur,t)) = q.pop_front() {
        list[cur][t] = true;
        if t==mt {
            continue;
        }
        for &e in &edge[cur] {
            if list[e][t+1] {
                continue;
            }
            q.push_back((e,t+1));
            list[e][t+1] = true;
        }
    }
    let mut ans = 0;
    for i in 0..n {
        if t <= mt as i64{
            if list[i][t as usize] {
                ans += 1;
            }
            continue;
        }
        let mut exist = false;
        for j in 0..=100 {
            if !list[i][j] {
                continue;
            }
            for s in 1..=100 {
                let mut idx = j;
                let mut flag = true;
                loop {
                    idx += s;
                    if !list[i][idx] {
                        flag = false;
                        break;
                    }
                    if idx>=1000 {
                        break;
                    }
                }
                if flag {
                    if j%s == (t%s as i64) as usize{
                        exist = true;
                    }
                }
            }
        }
        if exist {
            ans += 1;
        }
    }
    println!("{}",ans);
}

fn run() {
    let stack_size = 104_857_600; // 100 MB
    let thd = std::thread::Builder::new().stack_size(stack_size);
    solve();
}