結果
問題 | No.1013 〇マス進む |
ユーザー | daut-dlang |
提出日時 | 2020-03-20 23:20:45 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 274 ms / 2,000 ms |
コード長 | 2,540 bytes |
コンパイル時間 | 1,453 ms |
コンパイル使用メモリ | 106,348 KB |
実行使用メモリ | 48,216 KB |
最終ジャッジ日時 | 2023-09-04 06:23:15 |
合計ジャッジ時間 | 11,189 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 2 ms
4,376 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 3 ms
4,380 KB |
testcase_10 | AC | 2 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 2 ms
4,376 KB |
testcase_13 | AC | 8 ms
6,152 KB |
testcase_14 | AC | 84 ms
23,552 KB |
testcase_15 | AC | 153 ms
37,604 KB |
testcase_16 | AC | 135 ms
33,708 KB |
testcase_17 | AC | 71 ms
21,616 KB |
testcase_18 | AC | 95 ms
25,172 KB |
testcase_19 | AC | 52 ms
16,512 KB |
testcase_20 | AC | 200 ms
45,664 KB |
testcase_21 | AC | 65 ms
20,856 KB |
testcase_22 | AC | 101 ms
27,624 KB |
testcase_23 | AC | 27 ms
11,532 KB |
testcase_24 | AC | 205 ms
46,896 KB |
testcase_25 | AC | 210 ms
45,936 KB |
testcase_26 | AC | 28 ms
11,604 KB |
testcase_27 | AC | 55 ms
19,936 KB |
testcase_28 | AC | 27 ms
11,296 KB |
testcase_29 | AC | 183 ms
44,764 KB |
testcase_30 | AC | 54 ms
18,704 KB |
testcase_31 | AC | 112 ms
30,084 KB |
testcase_32 | AC | 74 ms
23,620 KB |
testcase_33 | AC | 85 ms
23,136 KB |
testcase_34 | AC | 169 ms
36,100 KB |
testcase_35 | AC | 160 ms
33,332 KB |
testcase_36 | AC | 11 ms
4,940 KB |
testcase_37 | AC | 10 ms
4,592 KB |
testcase_38 | AC | 180 ms
37,384 KB |
testcase_39 | AC | 54 ms
15,240 KB |
testcase_40 | AC | 172 ms
35,864 KB |
testcase_41 | AC | 36 ms
11,804 KB |
testcase_42 | AC | 86 ms
22,168 KB |
testcase_43 | AC | 56 ms
15,820 KB |
testcase_44 | AC | 88 ms
23,404 KB |
testcase_45 | AC | 75 ms
20,808 KB |
testcase_46 | AC | 39 ms
12,088 KB |
testcase_47 | AC | 80 ms
23,124 KB |
testcase_48 | AC | 98 ms
25,396 KB |
testcase_49 | AC | 169 ms
35,112 KB |
testcase_50 | AC | 128 ms
30,204 KB |
testcase_51 | AC | 114 ms
27,272 KB |
testcase_52 | AC | 22 ms
9,288 KB |
testcase_53 | AC | 29 ms
11,208 KB |
testcase_54 | AC | 142 ms
32,068 KB |
testcase_55 | AC | 42 ms
11,600 KB |
testcase_56 | AC | 226 ms
41,728 KB |
testcase_57 | AC | 141 ms
29,116 KB |
testcase_58 | AC | 274 ms
48,216 KB |
testcase_59 | AC | 260 ms
47,624 KB |
testcase_60 | AC | 263 ms
46,828 KB |
testcase_61 | AC | 217 ms
48,096 KB |
testcase_62 | AC | 199 ms
47,432 KB |
testcase_63 | AC | 1 ms
4,376 KB |
testcase_64 | AC | 2 ms
4,380 KB |
ソースコード
import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998244353; //long mod = 1_000_003; void moda(T)(ref T x, T y) { x = (x + y) % mod; } void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; } void modm(T)(ref T x, T y) { x = (x * y) % mod; } void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); } void main() { auto N = RD; auto K = RD; auto P = RDA; auto dst = new long[][](N, 32); foreach (i; 0..N) { auto next = i + P[i]; dst[i][0] = next; } foreach (i; 1..32) { foreach (j; 0..N) { auto mid = dst[j][i-1] % N; auto next = dst[mid][i-1]; auto d = dst[j][i-1] / N * N; dst[j][i] = next + d; } } foreach (i; 0..N) debug writeln(dst[i]); auto ans = new long[](N); foreach (i; 0..N) { auto pos = i; foreach_reverse (j; 0..32) { auto bit = 1L << j; if (K & bit) { auto k = pos % N; pos = dst[k][j]; auto d = dst[k][j] / N * N; ans[i] += d; } } ans[i] += (pos % N)+ 1; } foreach (e; ans) writeln(e); stdout.flush; debug readln; }