結果
問題 | No.1521 Playing Musical Chairs Alone |
ユーザー |
![]() |
提出日時 | 2021-05-28 22:16:53 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 337 ms / 2,000 ms |
コード長 | 8,914 bytes |
コンパイル時間 | 20,949 ms |
コンパイル使用メモリ | 387,976 KB |
実行使用メモリ | 6,820 KB |
最終ジャッジ日時 | 2024-11-07 09:44:43 |
合計ジャッジ時間 | 18,611 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 23 |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:66:15 | 66 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 66 - fn readi() -> (i64) { 66 + fn readi() -> i64 { | warning: variable `K` should have a snake case name --> src/main.rs:196:17 | 196 | 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:197:17 | 197 | let M = self.m(); | ^ help: convert the identifier to snake case: `m` warning: variable `N` should have a snake case name --> src/main.rs:198:17 | 198 | let N = other.n(); | ^ help: convert the identifier to snake case: `n` warning: variable `K` should have a snake case name --> src/main.rs:260:17 | 260 | 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:261:17 | 261 | let M = self.m(); | ^ help: convert the identifier to snake case: `m` warning: variable `N` should have a snake case name --> src/main.rs:262:17 | 262 | let N = other.n(); | ^ help: convert the identifier to snake case: `n`
ソースコード
// -*- coding:utf-8-unix -*-// #![feature(map_first_last)]#![allow(dead_code)]#![allow(unused_imports)]#![allow(unused_macros)]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 UINF: usize = INF as usize;const FINF: f64 = 122337203685.0;const INF128: i128 = 1223372036854775807000000000000;const LINF: i64 = 2147483647;const MOD: i64 = 1000000007;// const MOD: i64 = 998244353;// 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);};}macro_rules! dd {(x:expr) => {dbg!(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_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(),)}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];v %= 1000000007;}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;}}}}}// #[snippet("Matrix")]// #[test]// fn test_matrix_pow() {// let x = Matrix {// v: vec![// vec![1,2],// vec![3,4]// ]// };// let x3 = x.clone() * x.clone() * x.clone();// assert_eq!(x.pow(3, std::i64::MAX).v, x3.v);// }pub type Matrix = matrix::Matrix;fn solve() {let (n, k, l) = readuuu();let mut mat = vec![vec![0; (n) as usize]; (n) as usize];for i in 0..n {for j in 1..=l {let ni = (i + j) % n;mat[ni][i] += 1;}}let mut v = vec![vec![0; (1) as usize]; (n) as usize];v[0][0] = 1 as i64;let mv = Matrix { v: v };let mm = Matrix { v: mat };let mmm = mm.pow(k as u64, MOD);let r = mmm * mv;for i in 0..n {p!(r.v[i][0]);}return;}fn main() {solve();}