結果

問題 No.1660 Matrix Exponentiation
ユーザー akakimidoriakakimidori
提出日時 2021-08-27 21:51:13
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 49 ms / 2,000 ms
コード長 5,269 bytes
コンパイル時間 28,637 ms
コンパイル使用メモリ 401,152 KB
実行使用メモリ 15,812 KB
最終ジャッジ日時 2024-11-21 01:51:57
合計ジャッジ時間 15,395 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 7 ms
5,504 KB
testcase_10 AC 8 ms
5,632 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 24 ms
8,968 KB
testcase_20 AC 19 ms
7,540 KB
testcase_21 AC 18 ms
7,448 KB
testcase_22 AC 5 ms
5,248 KB
testcase_23 AC 12 ms
5,644 KB
testcase_24 AC 47 ms
15,720 KB
testcase_25 AC 18 ms
8,960 KB
testcase_26 AC 49 ms
15,812 KB
testcase_27 AC 8 ms
5,248 KB
testcase_28 AC 21 ms
9,344 KB
testcase_29 AC 27 ms
14,208 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused import: `std::io::Write`
   --> src/main.rs:145:5
    |
145 | use std::io::Write;
    |     ^^^^^^^^^^^^^^
    |
    = note: `#[warn(unused_imports)]` on by default

warning: type alias `Map` is never used
   --> src/main.rs:148:6
    |
148 | type Map<K, V> = BTreeMap<K, V>;
    |      ^^^
    |
    = note: `#[warn(dead_code)]` on by default

warning: type alias `Set` is never used
   --> src/main.rs:149:6
    |
149 | type Set<T> = BTreeSet<T>;
    |      ^^^

warning: type alias `Deque` is never used
   --> src/main.rs:150:6
    |
150 | type Deque<T> = VecDeque<T>;
    |      ^^^^^

ソースコード

diff # 

// ---------- begin SCC ----------
pub struct SCC {
    size: usize,
    edge: Vec<(u32, u32)>,
}

impl SCC {
    pub fn new(size: usize) -> Self {
        assert!(size <= 10usize.pow(8));
        SCC { size, edge: vec![] }
    }
    pub fn add_edge(&mut self, a: usize, b: usize) {
        assert!(a < self.size && b < self.size);
        self.edge.push((a as u32, b as u32));
    }
    pub fn build(&self) -> (usize, Vec<usize>) {
        let size = self.size;
        let mut start = vec![0u32; size + 1];
        self.edge.iter().for_each(|e| start[e.0 as usize + 1] += 1);
        for i in 1..=size {
            start[i] += start[i - 1];
        }
        let mut buf = vec![0u32; self.edge.len()];
        for &(a, b) in self.edge.iter() {
            let po = &mut start[a as usize];
            buf[*po as usize] = b;
            *po += 1;
        }
        let mut s = 0usize;
        let neighbor = start[..size].iter().map(|t| {
            let t = *t as usize;
            let it = buf[s..t].iter().map(|p| *p as usize);
            s = t;
            it
        }).collect::<Vec<_>>();
        struct Graph<I> {
            neighbor: Vec<I>,
            ord: Vec<usize>,
            assigned: Vec<bool>,
            stack_s: Vec<usize>,
            stack_p: Vec<usize>,
            cnt: usize,
            id: usize,
            res: Vec<usize>,
        }
        impl<I: Iterator<Item = usize>> Graph<I> {
            fn dfs(&mut self, v: usize) {
                self.ord[v] = self.cnt;
                self.cnt += 1;
                self.stack_s.push(v);
                self.stack_p.push(v);
                while let Some(u) = self.neighbor[v].next() {
                    if self.ord[u] == !0 {
                        self.dfs(u);
                    } else if !self.assigned[u] {
                        while self.ord[*self.stack_p.last().unwrap()] > self.ord[u] {
                            self.stack_p.pop();
                        }
                    }
                }
                if *self.stack_p.last().unwrap() == v {
                    while let Some(u) = self.stack_s.pop() {
                        self.res[u] = self.id;
                        self.assigned[u] = true;
                        if u == v {
                            break;
                        }
                    }
                    self.stack_p.pop();
                    self.id += 1;
                }
            }
        }
        let mut g = Graph {
            neighbor: neighbor,
            ord: vec![!0; size],
            assigned: vec![false; size],
            stack_s: vec![],
            stack_p: vec![],
            id: 0,
            cnt: 0,
            res: vec![0; size],
        };
        for i in 0..size {
            if g.ord[i] == !0 {
                g.dfs(i);
            }
        }
        let Graph { mut res, id, .. } = g;
        res.iter_mut().for_each(|v| *v = id - 1 - *v);
        (id, res)
    }
}
// ---------- end SCC ----------
// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

use std::io::Write;
use std::collections::*;

type Map<K, V> = BTreeMap<K, V>;
type Set<T> = BTreeSet<T>;
type Deque<T> = VecDeque<T>;

fn run() {
    input! {
        n: usize,
        m: usize,
        e: [(usize1, usize1); m],
    }
    let mut scc = SCC::new(n);
    for &(a, b) in e.iter() {
        if a == b {
            println!("-1");
            return;
        }
        scc.add_edge(a, b);
    }
    let (len, id) = scc.build();
    if len < n {
        println!("-1");
        return;
    }
    let mut g = vec![vec![]; n];
    for (a, b) in e {
        let a = id[a];
        let b = id[b];
        g[a].push(b);
    }
    let mut dp = vec![1; n];
    for i in (0..n).rev() {
        dp[i] = g[i].iter().map(|u| dp[*u]).max().unwrap_or(0) + 1;
    }
    let ans = dp.into_iter().max().unwrap();
    println!("{}", ans);
}

fn main() {
    run();
}
0