結果
問題 | No.1749 ラムドスウイルスの感染拡大 |
ユーザー |
![]() |
提出日時 | 2021-11-19 21:36:06 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 13 ms / 2,000 ms |
コード長 | 6,027 bytes |
コンパイル時間 | 13,097 ms |
コンパイル使用メモリ | 399,840 KB |
実行使用メモリ | 9,856 KB |
最終ジャッジ日時 | 2024-12-31 21:56:16 |
合計ジャッジ時間 | 14,372 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 26 |
コンパイルメッセージ
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:214:9 | 214 | 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:222:21 | 222 | 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:215:14 | 215 | 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:215:21 | 215 | let (mut a, mut b) = readuu(); | ----^ | | | help: remove this `mut` warning: comparison is useless due to type limits --> src/main.rs:181:8 | 181 | if n >= 0 { | ^^^^^^ | = note: `#[warn(unused_comparisons)]` on by default
ソースコード
// -*- 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(),)}fn prime_table(n: usize) -> Vec<bool> {let mut is_prime = vec![true; n + 1];let mut res = vec![0 as usize; 0];if n >= 0 {is_prime[0] = false;}if n >= 1 {is_prime[1] = false;}let mut i = 2 as usize;while i * i <= n {if !is_prime[i] {i += 1;continue;}// println!("{:?}", "call");let mut j = i + i as usize;while j <= n {is_prime[j] = false;j += i;}i += 1;}for i in 0..n {if is_prime[i] == true {res.push(i);}}return is_prime;}fn solve() {let (n, m, t) = readuuu();let mut data = vec![vec![0 as usize; (n) as usize]; (t + 1) as usize];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));}data[0][0] = 1;for i in 0..t {for v in 0..n {for (u, w) in &graph[v] {data[i + 1][v] += data[i][*u];}// data[i + 1][v] += data[i][v];data[i + 1][v] %= UMOD;}}println!("{}", data[t][0]);return;}fn main() {solve();}