結果
問題 | No.1750 ラムドスウイルスの感染拡大-hard |
ユーザー | Moss_Local |
提出日時 | 2021-11-19 21:39:46 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 1,143 ms / 2,000 ms |
コード長 | 8,881 bytes |
コンパイル時間 | 11,864 ms |
コンパイル使用メモリ | 378,644 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-10 08:15:51 |
合計ジャッジ時間 | 24,790 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,944 KB |
testcase_04 | AC | 24 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,944 KB |
testcase_08 | AC | 165 ms
6,944 KB |
testcase_09 | AC | 161 ms
6,940 KB |
testcase_10 | AC | 168 ms
6,940 KB |
testcase_11 | AC | 143 ms
6,944 KB |
testcase_12 | AC | 200 ms
6,944 KB |
testcase_13 | AC | 187 ms
6,944 KB |
testcase_14 | AC | 1,099 ms
6,940 KB |
testcase_15 | AC | 1,128 ms
6,944 KB |
testcase_16 | AC | 1,143 ms
6,940 KB |
testcase_17 | AC | 1,028 ms
6,944 KB |
testcase_18 | AC | 1,014 ms
6,940 KB |
testcase_19 | AC | 985 ms
6,944 KB |
testcase_20 | AC | 709 ms
6,944 KB |
testcase_21 | AC | 967 ms
6,944 KB |
testcase_22 | AC | 156 ms
6,940 KB |
testcase_23 | AC | 1,063 ms
6,940 KB |
testcase_24 | AC | 118 ms
6,944 KB |
testcase_25 | AC | 278 ms
6,940 KB |
testcase_26 | AC | 92 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 6 ms
6,940 KB |
testcase_29 | AC | 2 ms
6,944 KB |
testcase_30 | AC | 153 ms
6,944 KB |
testcase_31 | AC | 142 ms
6,940 KB |
testcase_32 | AC | 139 ms
6,944 KB |
testcase_33 | AC | 138 ms
6,940 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:68:15 | 68 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 68 - fn readi() -> (i64) { 68 + fn readi() -> i64 { | warning: unused variable: `i` --> src/main.rs:304:9 | 304 | for i in 0..m { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: unused variable: `w` --> src/main.rs:312:17 | 312 | for (u, w) in &graph[v] { | ^ help: if this is intentional, prefix it with an underscore: `_w` warning: variable does not need to be mutable --> src/main.rs:305:14 | 305 | let (mut a, mut b) = readuu(); | ----^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable does not need to be mutable --> src/main.rs:305:21 | 305 | let (mut a, mut b) = readuu(); | ----^ | | | help: remove this `mut` warning: variable does not need to be mutable --> src/main.rs:316:9 | 316 | let mut m = Matrix { v: vv }; | ----^ | | | help: remove this `mut` warning: variable `K` should have a snake case name --> src/main.rs:198:17 | 198 | let K = self.n(); | ^ help: convert the identifier to snake case (notice the capitalization): `k` | = note: `#[warn(non_snake_case)]` on by default warning: variable `M` should have a snake case name --> src/main.rs:199:17 | 199 | let M = self.m(); | ^ help: convert the identifier to snake case: `m` warning: variable `N` should have a snake case name --> src/main.rs:200:17 | 200 | let N = other.n(); |
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] use std::cmp::Ordering::*; use std::collections::*; use std::convert::*; use std::convert::{From, Into}; use std::error::Error; use std::f64::consts::PI; use std::fmt::Debug; use std::fmt::Display; use std::fs::File; use std::hash::Hash; use std::io::prelude::*; use std::io::*; use std::marker::Copy; use std::mem::*; use std::ops::Bound::*; use std::ops::RangeBounds; use std::ops::{Add, Mul, Neg, Sub}; use std::slice::from_raw_parts; use std::str; use std::vec; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; // const FINF: f64 = 122337203685.0; const LINF: i64 = 2147483647; const FINF: f64 = LINF as f64; const INF128: i128 = 1223372036854775807000000000000; // const MOD: i64 = 1000000007; const MOD: i64 = 998244353; const MPI: f64 = 3.14159265358979323846264338327950288f64; // const MOD: i64 = INF; const UMOD: usize = MOD as usize; use std::cmp::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; macro_rules! p { ($x:expr) => { println!("{}", $x); }; } macro_rules! d { ($x:expr) => { println!("{:?}", $x); }; } // use str::Chars; // use str::Chars; #[allow(dead_code)] fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } #[allow(dead_code)] fn readi() -> (i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); iter.next().unwrap().parse::<i64>().unwrap() } #[allow(dead_code)] fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[allow(dead_code)] fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> { (0..n).map(|_| read_vec()).collect() } #[allow(dead_code)] fn readii() -> (i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } fn readff() -> (f64, f64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<f64>().unwrap(), iter.next().unwrap().parse::<f64>().unwrap(), ) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn readcc() -> (char, char) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<char>().unwrap(), iter.next().unwrap().parse::<char>().unwrap(), ) } #[allow(dead_code)] fn readuuu() -> (usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn readiiii() -> (i64, i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } pub mod matrix { #[derive(Clone)] pub struct Matrix { pub v: Vec<Vec<i64>>, } impl Matrix { pub fn identity(n: usize) -> Self { let mut v = vec![vec![0; n]; n]; for i in 0..n { v[i][i] = 1; } Matrix { v: v } } pub fn m(&self) -> usize { self.v.len() } pub fn n(&self) -> usize { self.v[0].len() } pub fn mul_rem(&self, other: &Self, mo: i64) -> Self { assert!(self.n() == other.m()); let K = self.n(); let M = self.m(); let N = other.n(); let mut r = vec![vec![0; N]; M]; for i in 0..M { for j in 0..N { let mut v = 0; for k in 0..K { v += self.v[i][k] * other.v[k][j] % mo; v %= mo; } r[i][j] = v; } } Matrix { v: r } } pub fn pow(&self, k: u64, mo: i64) -> Self { assert!(self.m() == self.n()); let mut k = k; let mut x = Self::identity(self.m()); let mut y = self.clone(); while k > 0 { if k & 1 > 0 { x = y.mul_rem(&x, mo); x %= mo; } y = y.mul_rem(&y, mo); y %= mo; k >>= 1; } x } } use std::ops::*; impl Add for Matrix { type Output = Self; fn add(self, other: Self) -> Self { let mut r = self.v.clone(); for i in 0..self.m() { for j in 0..self.n() { r[i][j] += other.v[i][j]; } } Matrix { v: r } } } impl Sub for Matrix { type Output = Self; fn sub(self, other: Self) -> Self { let mut r = self.v.clone(); for i in 0..self.m() { for j in 0..self.n() { r[i][j] -= other.v[i][j]; } } Matrix { v: r } } } impl Mul for Matrix { type Output = Self; fn mul(self, other: Self) -> Self { assert!(self.n() == other.m()); let K = self.n(); let M = self.m(); let N = other.n(); let mut r = vec![vec![0; N]; M]; for i in 0..M { for j in 0..N { let mut v = 0; for k in 0..K { v += self.v[i][k] * other.v[k][j]; } r[i][j] = v; } } Matrix { v: r } } } impl Rem<i64> for Matrix { type Output = Self; fn rem(self, mo: i64) -> Self { let mut r = self.v.clone(); for i in 0..self.m() { for j in 0..self.n() { r[i][j] %= mo; } } Matrix { v: r } } } impl RemAssign<i64> for Matrix { fn rem_assign(&mut self, mo: i64) { for i in 0..self.m() { for j in 0..self.n() { self.v[i][j] %= mo; } } } } } pub type Matrix = matrix::Matrix; fn solve() { let (n, m, t) = readuuu(); let mut graph = vec![vec![(0 as usize, 0 as usize); (0) as usize]; (n) as usize]; for i in 0..m { let (mut a, mut b) = readuu(); graph[a].push((b, 1)); graph[b].push((a, 1)); } let mut vv = vec![vec![0 as i64; (n) as usize]; (n) as usize]; for v in 0..n { for (u, w) in &graph[v] { vv[v][*u] += 1; } } let mut m = Matrix { v: vv }; let m = m.pow(t as u64, MOD); let mut a = vec![vec![0 as i64; (1) as usize]; (n) as usize]; a[0][0] = 1; let aa = Matrix { v: a }; // println!("{:?}", m.v.clone()); let p = m * aa; println!("{:?}", p.v[0][0]); return; } fn main() { solve(); }