結果

問題 No.1097 Remainder Operation
ユーザー ziitaziita
提出日時 2020-06-26 22:35:34
言語 Rust
(1.77.0 + proconio)
結果
AC  
実行時間 151 ms / 2,000 ms
コード長 4,188 bytes
コンパイル時間 12,148 ms
コンパイル使用メモリ 388,008 KB
実行使用メモリ 11,040 KB
最終ジャッジ日時 2024-07-04 22:21:16
合計ジャッジ時間 16,029 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
6,812 KB
testcase_01 AC 1 ms
6,940 KB
testcase_02 AC 1 ms
6,940 KB
testcase_03 AC 1 ms
6,940 KB
testcase_04 AC 1 ms
6,940 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 1 ms
6,944 KB
testcase_07 AC 15 ms
6,940 KB
testcase_08 AC 15 ms
6,940 KB
testcase_09 AC 15 ms
6,944 KB
testcase_10 AC 16 ms
6,940 KB
testcase_11 AC 15 ms
6,944 KB
testcase_12 AC 146 ms
6,940 KB
testcase_13 AC 151 ms
6,944 KB
testcase_14 AC 143 ms
7,084 KB
testcase_15 AC 148 ms
7,208 KB
testcase_16 AC 144 ms
6,944 KB
testcase_17 AC 141 ms
6,940 KB
testcase_18 AC 148 ms
9,088 KB
testcase_19 AC 148 ms
9,216 KB
testcase_20 AC 145 ms
10,512 KB
testcase_21 AC 148 ms
11,040 KB
testcase_22 AC 148 ms
9,784 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#![allow(unused_imports)]
#![allow(non_snake_case, unused)]

use std::cmp::*;
use std::collections::*;
use std::ops::*;

// https://atcoder.jp/contests/hokudai-hitachi2019-1/submissions/10518254

macro_rules! eprint {
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = write!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! eprintln {
    () => { eprintln!(""); };
    ($($t:tt)*) => {{
        use ::std::io::Write;
        let _ = writeln!(::std::io::stderr(), $($t)*);
    }};
}
macro_rules! dbg {
    ($v:expr) => {{
        let val = $v;
        eprintln!("[{}:{}] {} = {:?}", file!(), line!(), stringify!($v), val);
        val
    }}
}

macro_rules! mat {
    ($($e:expr),*) => { Vec::from(vec![$($e),*]) };
    ($($e:expr,)*) => { Vec::from(vec![$($e),*]) };
    ($e:expr; $d:expr) => { Vec::from(vec![$e; $d]) };
    ($e:expr; $d:expr $(; $ds:expr)+) => { Vec::from(vec![mat![$e $(; $ds)*]; $d]) };
}

macro_rules! ok {
    ($a:ident$([$i:expr])*.$f:ident()$(@$t:ident)*) => {
        $a$([$i])*.$f($($t),*)
    };
    ($a:ident$([$i:expr])*.$f:ident($e:expr$(,$es:expr)*)$(@$t:ident)*) => { {
        let t = $e;
        ok!($a$([$i])*.$f($($es),*)$(@$t)*@t)
    } };
}

pub fn readln() -> String {
    let mut line = String::new();
    ::std::io::stdin().read_line(&mut line).unwrap_or_else(|e| panic!("{}", e));
    line
}

macro_rules! read {
    ($($t:tt),*; $n:expr) => {{
        let stdin = ::std::io::stdin();
        let ret = ::std::io::BufRead::lines(stdin.lock()).take($n).map(|line| {
            let line = line.unwrap();
            let mut it = line.split_whitespace();
            _read!(it; $($t),*)
        }).collect::<Vec<_>>();
        ret
    }};
    ($($t:tt),*) => {{
        let line = readln();
        let mut it = line.split_whitespace();
        _read!(it; $($t),*)
    }};
}

macro_rules! _read {
    ($it:ident; [char]) => {
        _read!($it; String).chars().collect::<Vec<_>>()
    };
    ($it:ident; [u8]) => {
        Vec::from(_read!($it; String).into_bytes())
    };
    ($it:ident; usize1) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1
    };
    ($it:ident; [usize1]) => {
        $it.map(|s| s.parse::<usize>().unwrap_or_else(|e| panic!("{}", e)) - 1).collect::<Vec<_>>()
    };
    ($it:ident; [$t:ty]) => {
        $it.map(|s| s.parse::<$t>().unwrap_or_else(|e| panic!("{}", e))).collect::<Vec<_>>()
    };
    ($it:ident; $t:ty) => {
        $it.next().unwrap_or_else(|| panic!("input mismatch")).parse::<$t>().unwrap_or_else(|e| panic!("{}", e))
    };
    ($it:ident; $($t:tt),+) => {
        ($(_read!($it; $t)),*)
    };
}


pub fn main() {
    let _ = ::std::thread::Builder::new().name("run".to_string()).stack_size(32 * 1024 * 1024).spawn(run).unwrap().join();
}

const MOD: usize = 998244353;
const INF: i64 = std::i64::MAX/3;

use std::ops::Bound::Included;

fn solve() {
    let n = read!(usize);
    let a = read!([i128]);
    let q = read!(usize);
    let k = read!(i128;q);
    let mut val = 0;
    let mut list = vec![n;n+1];
    let mut vlist = vec![0;n+1];
    let mut vidxlist = vec![0;10*n+1];
    let mut base: i128 = 0;
    let mut baseval: i128 = 0;
    let mut dist: i128 = 0;
    let mut distval: i128 = 0;
    for i in 0..10*n {
        let idx = (val%n as i128) as usize;
        val += a[idx];
        let mo = val%n as i128;
        if list[mo as usize] != n {
            base = list[mo as usize] as i128;
            baseval = vlist[mo as usize] as i128;
            dist = i as i128 - base;
            distval = val - vlist[mo as usize];
            break;
        }
        list[mo as usize] = i;
        vlist[mo as usize] = val;
        vidxlist[i] = val;
    }
    for c in k {
        let x = c-1;
        let t = (x-base)/dist;
        let mut val = baseval + distval*t;
        let mut res = x - base - dist*t;
        // println!("{} {} {}",x,base,res);
        if x<base {
            val = vidxlist[x as usize];
        }
        else {
            val = val + vidxlist[(base+res) as usize] - vidxlist[base as usize];
        }
        println!("{}",val);
    }
}

fn run() {
    solve();
}
0