結果
問題 | No.2445 奇行列式 |
ユーザー |
|
提出日時 | 2023-08-25 21:37:46 |
言語 | Rust (1.83.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,873 bytes |
コンパイル時間 | 16,467 ms |
コンパイル使用メモリ | 379,284 KB |
実行使用メモリ | 34,828 KB |
最終ジャッジ日時 | 2024-12-24 08:09:11 |
合計ジャッジ時間 | 41,052 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 11 WA * 3 TLE * 6 |
コンパイルメッセージ
warning: unused macro definition: `puts` --> src/main.rs:64:18 | 64 | macro_rules! puts {(format:tt)*) => (let _ = write!(out,format)*););} | ^^^^ | = note: `#[warn(unused_macros)]` on by default warning: unused import: `Write` --> src/main.rs:5:15 | 5 | use std::io::{Write, BufWriter}; | ^^^^^ | = note: `#[warn(unused_imports)]` on by default warning: unused variable: `out` --> src/main.rs:63:13 | 63 | let mut out = BufWriter::new(out.lock()); | ^^^ help: if this is intentional, prefix it with an underscore: `_out` | = note: `#[warn(unused_variables)]` on by default warning: variable does not need to be mutable --> src/main.rs:63:9 | 63 | let mut out = BufWriter::new(out.lock()); | ----^^^ | | | help: remove this `mut` | = note: `#[warn(unused_mut)]` on by default
ソースコード
#[allow(unused_imports)]use std::cmp::*;#[allow(unused_imports)]use std::collections::*;use std::io::{Write, BufWriter};// https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8macro_rules! input {($($r:tt)*) => {let stdin = std::io::stdin();let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));let mut next = move || -> String{bytes.by_ref().map(|r|r.unwrap() as char).skip_while(|c|c.is_whitespace()).take_while(|c|!c.is_whitespace()).collect()};input_inner!{next, $($r)*}};}macro_rules! input_inner {($next:expr) => {};($next:expr,) => {};($next:expr, $var:ident : $t:tt $($r:tt)*) => {let $var = read_value!($next, $t);input_inner!{$next $($r)*}};}macro_rules! read_value {($next:expr, ( $($t:tt),* )) => { ($(read_value!($next, $t)),*) };($next:expr, [ $t:tt ; $len:expr ]) => {(0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()};($next:expr, chars) => {read_value!($next, String).chars().collect::<Vec<char>>()};($next:expr, usize1) => (read_value!($next, usize) - 1);($next:expr, [ $t:tt ]) => {{let len = read_value!($next, usize);read_value!($next, [$t; len])}};($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error"));}trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); }impl<T: PartialOrd> Change for T {fn chmax(&mut self, x: T) { if *self < x { *self = x; } }fn chmin(&mut self, x: T) { if *self > x { *self = x; } }}#[inline]fn madd(a: &mut i64, b: i64, m: i64) {let mut r = *a + b;if r >= m {r -= m;}*a = r}fn main() {let out = std::io::stdout();let mut out = BufWriter::new(out.lock());macro_rules! puts {($($format:tt)*) => (let _ = write!(out,$($format)*););}#[allow(unused)]macro_rules! putvec {($v:expr) => {for i in 0..$v.len() {puts!("{}{}", $v[i], if i + 1 == $v.len() {"\n"} else {" "});}}}input! {n: usize, b: i64,a: [[i64; n]; n],}let mut dp = vec![[0; 2]; 1 << n];dp[0][0] += 1;for i in 0..n {let mut ep = vec![[0; 2]; 1 << n];for j in 0..n {for bits in 0usize..1 << n {if (bits & 1 << j) != 0 { continue; }let flip = (bits & ((1 << n) - (1 << (j + 1)))).count_ones() % 2;let flip = flip as usize;for c in 0..2 {let val = dp[bits][c] * a[i][j] % b;madd(&mut ep[bits | 1 << j][c ^ flip], val, b);}}}dp = ep;}println!("{}", dp[(1 << n) - 1][1]);}