結果
| 問題 | No.1013 〇マス進む |
| ユーザー |
 akiradeveloper
|
| 提出日時 | 2020-03-21 16:06:21 |
| 言語 | Rust (1.77.0 + proconio) |
| 結果 |
AC
|
| 実行時間 | 88 ms / 2,000 ms |
| コード長 | 7,468 bytes |
| コンパイル時間 | 20,139 ms |
| コンパイル使用メモリ | 394,672 KB |
| 実行使用メモリ | 29,492 KB |
| 最終ジャッジ日時 | 2024-06-02 06:43:36 |
| 合計ジャッジ時間 | 22,463 ms |
|
ジャッジサーバーID （参考情報） |
judge5 / judge2 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
6,816 KB |
| testcase_01 | AC | 1 ms
6,816 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 | 2 ms
6,940 KB |
| testcase_07 | AC | 2 ms
6,940 KB |
| testcase_08 | AC | 1 ms
5,376 KB |
| testcase_09 | AC | 2 ms
5,376 KB |
| testcase_10 | AC | 2 ms
5,376 KB |
| testcase_11 | AC | 2 ms
5,376 KB |
| testcase_12 | AC | 2 ms
5,376 KB |
| testcase_13 | AC | 4 ms
5,376 KB |
| testcase_14 | AC | 35 ms
15,208 KB |
| testcase_15 | AC | 56 ms
23,240 KB |
| testcase_16 | AC | 52 ms
21,312 KB |
| testcase_17 | AC | 31 ms
13,292 KB |
| testcase_18 | AC | 37 ms
15,932 KB |
| testcase_19 | AC | 22 ms
10,244 KB |
| testcase_20 | AC | 88 ms
27,908 KB |
| testcase_21 | AC | 29 ms
12,496 KB |
| testcase_22 | AC | 41 ms
16,468 KB |
| testcase_23 | AC | 14 ms
6,528 KB |
| testcase_24 | AC | 85 ms
28,872 KB |
| testcase_25 | AC | 68 ms
28,228 KB |
| testcase_26 | AC | 14 ms
6,656 KB |
| testcase_27 | AC | 26 ms
11,832 KB |
| testcase_28 | AC | 13 ms
6,656 KB |
| testcase_29 | AC | 67 ms
27,444 KB |
| testcase_30 | AC | 24 ms
10,720 KB |
| testcase_31 | AC | 44 ms
18,840 KB |
| testcase_32 | AC | 33 ms
14,468 KB |
| testcase_33 | AC | 35 ms
14,484 KB |
| testcase_34 | AC | 59 ms
22,056 KB |
| testcase_35 | AC | 57 ms
20,964 KB |
| testcase_36 | AC | 4 ms
5,376 KB |
| testcase_37 | AC | 5 ms
5,376 KB |
| testcase_38 | AC | 63 ms
24,016 KB |
| testcase_39 | AC | 21 ms
8,948 KB |
| testcase_40 | AC | 60 ms
21,864 KB |
| testcase_41 | AC | 15 ms
6,784 KB |
| testcase_42 | AC | 36 ms
14,016 KB |
| testcase_43 | AC | 23 ms
9,668 KB |
| testcase_44 | AC | 38 ms
14,656 KB |
| testcase_45 | AC | 32 ms
13,196 KB |
| testcase_46 | AC | 16 ms
7,168 KB |
| testcase_47 | AC | 35 ms
13,952 KB |
| testcase_48 | AC | 40 ms
16,084 KB |
| testcase_49 | AC | 61 ms
21,868 KB |
| testcase_50 | AC | 49 ms
18,820 KB |
| testcase_51 | AC | 44 ms
17,128 KB |
| testcase_52 | AC | 9 ms
5,376 KB |
| testcase_53 | AC | 12 ms
6,272 KB |
| testcase_54 | AC | 55 ms
20,720 KB |
| testcase_55 | AC | 17 ms
7,524 KB |
| testcase_56 | AC | 74 ms
25,768 KB |
| testcase_57 | AC | 50 ms
18,064 KB |
| testcase_58 | AC | 82 ms
29,492 KB |
| testcase_59 | AC | 84 ms
29,408 KB |
| testcase_60 | AC | 82 ms
29,468 KB |
| testcase_61 | AC | 72 ms
29,468 KB |
| testcase_62 | AC | 71 ms
29,376 KB |
| testcase_63 | AC | 1 ms
5,376 KB |
| testcase_64 | AC | 1 ms
5,376 KB |
コンパイルメッセージ
warning: unnecessary trailing semicolon
--> src/main.rs:121:6
|
121 | };
| ^ help: remove this semicolon
|
= note: `#[warn(redundant_semicolons)]` on by default
warning: unused `Result` that must be used
--> src/main.rs:150:9
|
150 | writeln!(out,"{}",ans[i]+1);
| ^^^^^^^^^^^^^^^^^^^^^^^^^^^
|
= note: this `Result` may be an `Err` variant, which should be handled
= note: `#[warn(unused_must_use)]` on by default
= note: this warning originates in the macro `writeln` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
#[doc = " https://github.com/akiradeveloper/rust-comp-snippets"]
#[allow(unused_imports)]
use std::cmp::{max, min, Ordering};
#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
#[allow(unused_imports)]
use std::iter::FromIterator;
#[macro_export]
macro_rules ! chmax { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: max ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! chmin { ( $ x : expr , $ ( $ v : expr ) ,+ ) => { $ ( $ x = std :: cmp :: min ( $ x ,$ v ) ; ) + } ; }
#[macro_export]
macro_rules ! max { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: max ( $ x , max ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! min { ( $ x : expr ) => ( $ x ) ; ( $ x : expr , $ ( $ xs : expr ) ,+ ) => { std :: cmp :: min ( $ x , min ! ( $ ( $ xs ) ,+ ) ) } ; }
#[macro_export]
macro_rules ! dvec { ( $ t : expr ; $ len : expr ) => { vec ! [ $ t ; $ len ] } ; ( $ t : expr ; $ len : expr , $ ( $ rest : expr ) ,* ) => { vec ! [ dvec ! ( $ t ; $ ( $ rest ) ,* ) ; $ len ] } ; }
#[macro_export]
macro_rules ! cfor { ( ; $ ( $ rest : tt ) * ) => { cfor ! ( ( ) ; $ ( $ rest ) * ) } ; ( $ ( $ init : stmt ) ,+; ; $ ( $ rest : tt ) * ) => { cfor ! ( $ ( $ init ) ,+; ! false ; $ ( $ rest ) * ) } ; ( $ ( $ init : stmt ) ,+; $ cond : expr ; ; $ body : block ) => { cfor ! { $ ( $ init ) ,+; $ cond ; ( ) ; $ body } } ; ( $ ( $ init : stmt ) ,+; $ cond : expr ; $ ( $ step : expr ) ,+; $ body : block ) => { { $ ( $ init ; ) + while $ cond { let mut _first = true ; let mut _continue = false ; loop { if ! _first { _continue = true ; break } _first = false ; $ body } if ! _continue { break } $ ( $ step ; ) + } } } ; }
#[doc = " main"]
#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};
#[macro_export]
macro_rules ! input { ( source = $ s : expr , $ ( $ r : tt ) * ) => { let mut parser = Parser :: from_str ( $ s ) ; input_inner ! { parser , $ ( $ r ) * } } ; ( parser = $ parser : ident , $ ( $ r : tt ) * ) => { input_inner ! { $ parser , $ ( $ r ) * } } ; ( new_stdin_parser = $ parser : ident , $ ( $ r : tt ) * ) => { let stdin = std :: io :: stdin ( ) ; let reader = std :: io :: BufReader :: new ( stdin . lock ( ) ) ; let mut $ parser = Parser :: new ( reader ) ; input_inner ! { $ parser , $ ( $ r ) * } } ; ( $ ( $ r : tt ) * ) => { input ! { new_stdin_parser = parser , $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! input_inner { ( $ parser : ident ) => { } ; ( $ parser : ident , ) => { } ; ( $ parser : ident , $ var : ident : $ t : tt $ ( $ r : tt ) * ) => { let $ var = read_value ! ( $ parser , $ t ) ; input_inner ! { $ parser $ ( $ r ) * } } ; }
#[macro_export]
macro_rules ! read_value { ( $ parser : ident , ( $ ( $ t : tt ) ,* ) ) => { ( $ ( read_value ! ( $ parser , $ t ) ) ,* ) } ; ( $ parser : ident , [ $ t : tt ; $ len : expr ] ) => { ( 0 ..$ len ) . map ( | _ | read_value ! ( $ parser , $ t ) ) . collect ::< Vec < _ >> ( ) } ; ( $ parser : ident , chars ) => { read_value ! ( $ parser , String ) . chars ( ) . collect ::< Vec < char >> ( ) } ; ( $ parser : ident , usize1 ) => { read_value ! ( $ parser , usize ) - 1 } ; ( $ parser : ident , $ t : ty ) => { $ parser . next ::<$ t > ( ) . expect ( "Parse error" ) } ; }
use std::io;
use std::io::BufRead;
use std::str;
pub struct Parser<R> {
reader: R,
buf: Vec<u8>,
pos: usize,
}
impl Parser<io::Empty> {
pub fn from_str(s: &str) -> Parser<io::Empty> {
Parser {
reader: io::empty(),
buf: s.as_bytes().to_vec(),
pos: 0,
}
}
}
impl<R: BufRead> Parser<R> {
pub fn new(reader: R) -> Parser<R> {
Parser {
reader: reader,
buf: vec![],
pos: 0,
}
}
pub fn update_buf(&mut self) {
self.buf.clear();
self.pos = 0;
loop {
let (len, complete) = {
let buf2 = self.reader.fill_buf().unwrap();
self.buf.extend_from_slice(buf2);
let len = buf2.len();
if len == 0 {
break;
}
(len, buf2[len - 1] <= 0x20)
};
self.reader.consume(len);
if complete {
break;
}
}
}
pub fn next<T: str::FromStr>(&mut self) -> Result<T, T::Err> {
loop {
let mut begin = self.pos;
while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
begin += 1;
}
let mut end = begin;
while end < self.buf.len() && (self.buf[end] > 0x20) {
end += 1;
}
if begin != self.buf.len() {
self.pos = end;
return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
} else {
self.update_buf();
}
}
}
}
#[allow(unused_macros)]
macro_rules ! debug { ( $ ( $ a : expr ) ,* ) => { eprintln ! ( concat ! ( $ ( stringify ! ( $ a ) , " = {:?}, " ) ,* ) , $ ( $ a ) ,* ) ; } }
#[doc = " https://github.com/hatoo/competitive-rust-snippets"]
const BIG_STACK_SIZE: bool = true;
#[allow(dead_code)]
fn main() {
use std::thread;
if BIG_STACK_SIZE {
thread::Builder::new()
.stack_size(32 * 1024 * 1024)
.name("solve".into())
.spawn(solve)
.unwrap()
.join()
.unwrap();
} else {
solve();
}
}
fn solve() {
let out = stdout();
let mut out = BufWriter::new(out.lock());
input!{
n: usize, k: i64,
p: [usize; n]
}
struct D {
n: usize,
p: Vec<usize>,
};
impl Doublable for D {
type T = Vec<usize>;
fn x0(&self) -> Self::T {
let mut x = vec![];
for i in 0..self.n { x.push(i) }
x
}
fn f(&self) -> Self::T {
self.p.clone()
}
fn ap(&self, f: &Self::T, x: &Self::T) -> Self::T {
let mut y = vec![0; self.n];
for i in 0..self.n {
y[i] = x[i] + f[x[i] % self.n];
}
y
}
fn inv(&self, x: &Self::T) -> Self::T {
let mut y = vec![0; self.n];
for i in 0..self.n {
y[i] = x[i] - i;
}
y
}
}
let dbl = Doubling::new(D { n: n, p: p }, 30);
let ans = dbl.pow(k);
for i in 0..n {
writeln!(out,"{}",ans[i]+1);
}
}
trait Doublable {
type T: std::fmt::Debug;
fn x0(&self) -> Self::T;
fn f(&self) -> Self::T;
fn ap(&self, f: &Self::T, x: &Self::T) -> Self::T;
fn inv(&self, x: &Self::T) -> Self::T;
}
struct Doubling<D: Doublable> {
d: D,
f_table: Vec<D::T>,
}
impl<D: Doublable> Doubling<D> {
pub fn new(d: D, maxbit: usize) -> Self {
let mut f = vec![d.f()];
for i in 1..=maxbit {
let fx = d.ap(&f[i - 1], &d.x0());
let ffx = d.ap(&f[i - 1], &fx);
f.push(d.inv(&ffx));
}
Doubling { d: d, f_table: f }
}
pub fn pow(&self, k: i64) -> D::T {
let mut k = k;
let mut res = self.d.x0();
let mut i = 0;
while k > 0 {
if k & 1 == 1 {
res = self.d.ap(&self.f_table[i], &res);
}
k >>= 1;
i += 1;
}
res
}
}