結果
問題 | No.1092 modular arithmetic |
ユーザー | koba-e964 |
提出日時 | 2020-06-27 00:16:33 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 36 ms / 2,000 ms |
コード長 | 3,062 bytes |
コンパイル時間 | 14,370 ms |
コンパイル使用メモリ | 380,300 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-07-05 01:37:36 |
合計ジャッジ時間 | 14,884 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 15 ms
6,812 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 20 ms
6,940 KB |
testcase_04 | AC | 17 ms
6,944 KB |
testcase_05 | AC | 18 ms
6,944 KB |
testcase_06 | AC | 12 ms
6,944 KB |
testcase_07 | AC | 17 ms
6,940 KB |
testcase_08 | AC | 18 ms
6,940 KB |
testcase_09 | AC | 16 ms
6,940 KB |
testcase_10 | AC | 14 ms
6,940 KB |
testcase_11 | AC | 16 ms
6,944 KB |
testcase_12 | AC | 12 ms
6,944 KB |
testcase_13 | AC | 7 ms
6,940 KB |
testcase_14 | AC | 9 ms
6,940 KB |
testcase_15 | AC | 3 ms
6,940 KB |
testcase_16 | AC | 7 ms
6,944 KB |
testcase_17 | AC | 8 ms
6,944 KB |
testcase_18 | AC | 20 ms
6,940 KB |
testcase_19 | AC | 13 ms
6,940 KB |
testcase_20 | AC | 21 ms
6,940 KB |
testcase_21 | AC | 16 ms
6,944 KB |
testcase_22 | AC | 20 ms
6,944 KB |
testcase_23 | AC | 30 ms
6,944 KB |
testcase_24 | AC | 10 ms
6,940 KB |
testcase_25 | AC | 24 ms
6,940 KB |
testcase_26 | AC | 30 ms
6,940 KB |
testcase_27 | AC | 5 ms
6,944 KB |
testcase_28 | AC | 24 ms
6,944 KB |
testcase_29 | AC | 36 ms
6,944 KB |
testcase_30 | AC | 24 ms
6,944 KB |
testcase_31 | AC | 4 ms
6,940 KB |
testcase_32 | AC | 22 ms
6,940 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_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, [graph1; $len:expr]) => {{ let mut g = vec![vec![]; $len]; let ab = read_value!($next, [(usize1, usize1)]); for (a, b) in ab { g[a].push(b); g[b].push(a); } g }}; ($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")); } #[allow(unused)] macro_rules! debug { ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap()); } #[allow(unused)] macro_rules! debugln { ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap()); } fn extgcd(x: i64, y: i64) -> (i64, i64, i64) { if y == 0 { return (x, 1, 0); } let q = x / y; let (g, a, b) = extgcd(y, x - q * y); (g, b, a - q * b) } fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts { ($($format:tt)*) => (let _ = write!(out,$($format)*);); } input! { p: i64, n: usize, a: [i64; n], s: chars, } let mut x = a[0]; for i in 0..n - 1 { match s[i] { '+' => x = (x + a[i + 1]) % p, '-' => x = (x + p - a[i + 1]) % p, '*' => x = x * a[i + 1] % p, '/' => { let (_, inv, _) = extgcd(a[i + 1], p); x = x * ((inv % p + p) % p) % p; }, _ => panic!(), } } puts!("{}\n", x); } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); }