結果
問題 | No.1097 Remainder Operation |
ユーザー | kaki |
提出日時 | 2020-06-28 09:13:01 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 422 ms / 2,000 ms |
コード長 | 3,072 bytes |
コンパイル時間 | 1,144 ms |
コンパイル使用メモリ | 153,628 KB |
実行使用メモリ | 66,916 KB |
最終ジャッジ日時 | 2023-09-21 09:09:08 |
合計ジャッジ時間 | 7,170 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,376 KB |
testcase_04 | AC | 1 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 27 ms
8,196 KB |
testcase_08 | AC | 28 ms
8,204 KB |
testcase_09 | AC | 27 ms
8,244 KB |
testcase_10 | AC | 27 ms
8,508 KB |
testcase_11 | AC | 27 ms
8,508 KB |
testcase_12 | AC | 317 ms
66,912 KB |
testcase_13 | AC | 341 ms
66,912 KB |
testcase_14 | AC | 349 ms
66,908 KB |
testcase_15 | AC | 356 ms
66,904 KB |
testcase_16 | AC | 328 ms
66,832 KB |
testcase_17 | AC | 263 ms
66,916 KB |
testcase_18 | AC | 248 ms
66,860 KB |
testcase_19 | AC | 282 ms
66,864 KB |
testcase_20 | AC | 288 ms
66,908 KB |
testcase_21 | AC | 416 ms
66,912 KB |
testcase_22 | AC | 422 ms
66,908 KB |
ソースコード
#![allow(non_snake_case)] #![allow(dead_code)] #![allow(unused_macros)] #![allow(unused_imports)] use std::str::FromStr; use std::io::*; use std::collections::*; use std::cmp::*; struct Scanner<I: Iterator<Item = char>> { iter: std::iter::Peekable<I>, } macro_rules! exit { () => {{ exit!(0) }}; ($code:expr) => {{ if cfg!(local) { writeln!(std::io::stderr(), "===== Terminated =====") .expect("failed printing to stderr"); } std::process::exit($code); }} } impl<I: Iterator<Item = char>> Scanner<I> { pub fn new(iter: I) -> Scanner<I> { Scanner { iter: iter.peekable(), } } pub fn safe_get_token(&mut self) -> Option<String> { let token = self.iter .by_ref() .skip_while(|c| c.is_whitespace()) .take_while(|c| !c.is_whitespace()) .collect::<String>(); if token.is_empty() { None } else { Some(token) } } pub fn token(&mut self) -> String { self.safe_get_token().unwrap_or_else(|| exit!()) } pub fn get<T: FromStr>(&mut self) -> T { self.token().parse::<T>().unwrap_or_else(|_| exit!()) } pub fn vec<T: FromStr>(&mut self, len: usize) -> Vec<T> { (0..len).map(|_| self.get()).collect() } pub fn mat<T: FromStr>(&mut self, row: usize, col: usize) -> Vec<Vec<T>> { (0..row).map(|_| self.vec(col)).collect() } pub fn char(&mut self) -> char { self.iter.next().unwrap_or_else(|| exit!()) } pub fn chars(&mut self) -> Vec<char> { self.get::<String>().chars().collect() } pub fn mat_chars(&mut self, row: usize) -> Vec<Vec<char>> { (0..row).map(|_| self.chars()).collect() } pub fn line(&mut self) -> String { if self.peek().is_some() { self.iter .by_ref() .take_while(|&c| !(c == '\n' || c == '\r')) .collect::<String>() } else { exit!(); } } pub fn peek(&mut self) -> Option<&char> { self.iter.peek() } } const MAX: usize = 40; fn main() { let cin = stdin(); let cin = cin.lock(); let mut sc = Scanner::new(cin.bytes().map(|c| c.unwrap() as char)); let N: usize = sc.get(); let A: Vec<usize> = sc.vec(N); let mut to = vec![vec![0; N]; MAX+1]; let mut sum = vec![vec![0; N]; MAX+1]; for i in 0..N { let nx = (i + A[i]) % N; to[0][i] = nx; sum[0][i] = A[i]; } for k in 0..MAX { for i in 0..N { to[k+1][i] = to[k][to[k][i]]; sum[k+1][i] = sum[k][i] + sum[k][to[k][i]]; } } let Q: usize = sc.get(); for _ in 0..Q { let K: usize = sc.get(); let mut now = 0; let mut ans = 0; for i in 0..MAX { if (K>>i) & 1 != 0 { ans += sum[i][now]; now = to[i][now]; } } println!("{}", ans); } }