結果
問題 | No.1340 おーじ君をさがせ |
ユーザー | Moss_Local |
提出日時 | 2021-01-15 22:47:53 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 8,666 bytes |
コンパイル時間 | 11,997 ms |
コンパイル使用メモリ | 380,096 KB |
実行使用メモリ | 5,248 KB |
最終ジャッジ日時 | 2024-11-26 20:04:52 |
合計ジャッジ時間 | 30,685 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 | 1 ms
5,248 KB |
testcase_10 | WA | - |
testcase_11 | AC | 210 ms
5,248 KB |
testcase_12 | WA | - |
testcase_13 | AC | 177 ms
5,248 KB |
testcase_14 | AC | 532 ms
5,248 KB |
testcase_15 | AC | 406 ms
5,248 KB |
testcase_16 | WA | - |
testcase_17 | AC | 125 ms
5,248 KB |
testcase_18 | AC | 236 ms
5,248 KB |
testcase_19 | AC | 10 ms
5,248 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | AC | 22 ms
5,248 KB |
testcase_26 | AC | 15 ms
5,248 KB |
testcase_27 | AC | 9 ms
5,248 KB |
testcase_28 | WA | - |
testcase_29 | AC | 3 ms
5,248 KB |
testcase_30 | WA | - |
testcase_31 | AC | 1,322 ms
5,248 KB |
testcase_32 | AC | 1,183 ms
5,248 KB |
testcase_33 | AC | 1,170 ms
5,248 KB |
testcase_34 | AC | 1,115 ms
5,248 KB |
testcase_35 | WA | - |
testcase_36 | AC | 1 ms
5,248 KB |
testcase_37 | AC | 2 ms
5,248 KB |
testcase_38 | AC | 1,321 ms
5,248 KB |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | AC | 1 ms
5,248 KB |
testcase_43 | AC | 1 ms
5,248 KB |
testcase_44 | AC | 1 ms
5,248 KB |
testcase_45 | AC | 1 ms
5,248 KB |
testcase_46 | WA | - |
testcase_47 | AC | 248 ms
5,248 KB |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | AC | 594 ms
5,248 KB |
testcase_53 | AC | 589 ms
5,248 KB |
testcase_54 | AC | 594 ms
5,248 KB |
testcase_55 | AC | 410 ms
5,248 KB |
testcase_56 | WA | - |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | AC | 139 ms
5,248 KB |
testcase_60 | AC | 1 ms
5,248 KB |
testcase_61 | WA | - |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:43:15 | 43 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 43 - fn readi() -> (i64) { 43 + fn readi() -> i64 { | warning: unused variable: `i` --> src/main.rs:294:9 | 294 | for i in 0..m { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default warning: variable does not need to be mutable --> src/main.rs:301:9 | 301 | let mut r = x.pow(t as u64, INF); | ----^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default warning: variable `K` should have a snake case name --> src/main.rs:183:17 | 183 | 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:184:17 | 184 | let M = self.m(); | ^ help: convert the identifier to snake case: `m` warning: variable `N` should have a snake case name --> src/main.rs:185:17 | 185 | let N = other.n(); | ^ help: convert the identifier to snake case: `n` warning: variable `K` should have a snake case name --> src/main.rs:247:17 | 247 | let K = self.n(); | ^ help: convert the identifier to snake case (notice the capitalization): `k` warning: variable `M` should have a snake case name --> src/main.rs:248:17 | 248 | let M = self.m(); | ^ help: convert the identifier to snake case: `m` warning: variable `N` should have a snake case name --> src/main.rs:249:17 | 249 | let N = other.n(); | ^ help: convert the ide
ソースコード
// -*- coding:utf-8-unix -*- #![allow(dead_code)] #![allow(unused_imports)] use std::collections::*; use std::convert::*; use std::convert::{From, Into}; use std::fmt::Debug; use std::fs::File; use std::io::prelude::*; use std::io::*; use std::marker::Copy; use std::mem::*; use std::ops::Bound::*; use std::ops::{Add, Mul, Neg, Sub}; use std::str; use std::vec; use std::{cmp, process::Output}; use std::{cmp::Ordering, env::consts::DLL_PREFIX}; use std::{cmp::Ordering::*, f32::consts::PI}; const INF: i64 = 1223372036854775807; // const INF: i64 = 2147483647; const MEM_SIZE: usize = 202020; const MOD: i64 = 1000000007; // const MOD: i64 = 998244353; use std::cmp::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; use btree_map::{Keys, Values}; // 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_vec2<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(), ) } fn readin() -> (usize, char) { 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::<char>().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.clone() * x; 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 (mut a, mut b, mut c) = readuuu(); // a += 100;[] let (n, m, t) = readuuu(); let mut vv = vec![vec![0 as i64; (n) as usize]; (n) as usize]; for i in 0..m { let (a, b) = readuu(); vv[a][b] = 1; } let x = Matrix { v: vv }; // let x3 = x.clone() * x.clone() * x.clone(); // assert_eq!(x.pow(3, std::i64::MAX).v, x3.v); let mut r = x.pow(t as u64, INF); let mut res = 0 as usize; for i in 0..1 { for j in 0..n { if r.v[i][j] >= 1 { res += 1; } } } // let mut y = Matrix { v: vv }; // println!("{:?}", r.v); println!("{:?}", res); return; } fn main() { solve() }