結果
問題 | No.1013 〇マス進む |
ユーザー | ひばち |
提出日時 | 2020-03-20 22:32:39 |
言語 | C#(csc) (csc 3.9.0) |
結果 |
AC
|
実行時間 | 292 ms / 2,000 ms |
コード長 | 5,639 bytes |
コンパイル時間 | 3,353 ms |
コンパイル使用メモリ | 117,176 KB |
実行使用メモリ | 63,280 KB |
最終ジャッジ日時 | 2023-08-21 17:19:14 |
合計ジャッジ時間 | 16,384 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 63 ms
23,804 KB |
testcase_01 | AC | 62 ms
21,716 KB |
testcase_02 | AC | 63 ms
21,792 KB |
testcase_03 | AC | 72 ms
19,832 KB |
testcase_04 | AC | 71 ms
23,884 KB |
testcase_05 | AC | 72 ms
21,864 KB |
testcase_06 | AC | 73 ms
21,928 KB |
testcase_07 | AC | 72 ms
21,948 KB |
testcase_08 | AC | 72 ms
23,876 KB |
testcase_09 | AC | 73 ms
23,988 KB |
testcase_10 | AC | 72 ms
21,992 KB |
testcase_11 | AC | 72 ms
21,828 KB |
testcase_12 | AC | 72 ms
21,852 KB |
testcase_13 | AC | 77 ms
22,620 KB |
testcase_14 | AC | 145 ms
38,848 KB |
testcase_15 | AC | 205 ms
55,364 KB |
testcase_16 | AC | 190 ms
51,100 KB |
testcase_17 | AC | 136 ms
38,940 KB |
testcase_18 | AC | 154 ms
39,984 KB |
testcase_19 | AC | 121 ms
33,212 KB |
testcase_20 | AC | 237 ms
59,288 KB |
testcase_21 | AC | 131 ms
37,960 KB |
testcase_22 | AC | 163 ms
44,112 KB |
testcase_23 | AC | 97 ms
27,048 KB |
testcase_24 | AC | 233 ms
62,360 KB |
testcase_25 | AC | 234 ms
61,572 KB |
testcase_26 | AC | 99 ms
26,996 KB |
testcase_27 | AC | 124 ms
35,280 KB |
testcase_28 | AC | 98 ms
26,960 KB |
testcase_29 | AC | 222 ms
58,728 KB |
testcase_30 | AC | 123 ms
33,668 KB |
testcase_31 | AC | 172 ms
49,356 KB |
testcase_32 | AC | 140 ms
38,320 KB |
testcase_33 | AC | 152 ms
38,224 KB |
testcase_34 | AC | 207 ms
51,764 KB |
testcase_35 | AC | 214 ms
50,536 KB |
testcase_36 | AC | 81 ms
25,044 KB |
testcase_37 | AC | 80 ms
22,808 KB |
testcase_38 | AC | 224 ms
56,448 KB |
testcase_39 | AC | 123 ms
31,664 KB |
testcase_40 | AC | 231 ms
53,700 KB |
testcase_41 | AC | 104 ms
27,112 KB |
testcase_42 | AC | 152 ms
37,668 KB |
testcase_43 | AC | 122 ms
32,372 KB |
testcase_44 | AC | 155 ms
40,444 KB |
testcase_45 | AC | 144 ms
38,736 KB |
testcase_46 | AC | 108 ms
29,632 KB |
testcase_47 | AC | 149 ms
39,704 KB |
testcase_48 | AC | 166 ms
43,820 KB |
testcase_49 | AC | 229 ms
51,672 KB |
testcase_50 | AC | 191 ms
49,264 KB |
testcase_51 | AC | 179 ms
44,716 KB |
testcase_52 | AC | 92 ms
24,888 KB |
testcase_53 | AC | 100 ms
28,396 KB |
testcase_54 | AC | 201 ms
52,264 KB |
testcase_55 | AC | 112 ms
32,028 KB |
testcase_56 | AC | 251 ms
56,520 KB |
testcase_57 | AC | 200 ms
46,528 KB |
testcase_58 | AC | 292 ms
63,200 KB |
testcase_59 | AC | 282 ms
61,172 KB |
testcase_60 | AC | 273 ms
63,280 KB |
testcase_61 | AC | 234 ms
63,148 KB |
testcase_62 | AC | 225 ms
63,068 KB |
testcase_63 | AC | 63 ms
21,752 KB |
testcase_64 | AC | 65 ms
23,868 KB |
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc) Copyright (C) Microsoft Corporation. All rights reserved.
ソースコード
using System; using System.Collections.Generic; using System.Linq; using System.IO; using System.Runtime.CompilerServices; using System.Text; using System.Diagnostics; using System.Numerics; using static System.Console; using static System.Convert; using static System.Math; using static Template; using Pi = Pair<int, int>; class Solver { public void Solve(Scanner sc) { int N, K; sc.Make(out N, out K); var nx = Create(35, () => new long[N]); var P = sc.ArrInt; for(int i = 0; i < N; i++) { nx[0][i] = P[i]; } for (var j = 1; j < 35; j++) for (int i = 0; i < N; i++) nx[j][i] = nx[j - 1][i] + nx[j - 1][(nx[j - 1][i]+i) % N]; for (int i = 0; i < N; i++) { long res = i; for (int j = 31; j >= 0; j--) if ((1 & K >> j) == 1) res += nx[j][res % N]; WriteLine(res + 1); } } } #region Template public static class Template { static void Main(string[] args) { Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false }); new Solver().Solve(new Scanner()); Console.Out.Flush(); } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == 1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) == -1) { a = b; return true; } return false; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; } public static T[] Shuffle<T>(this IList<T> A) { T[] rt = A.ToArray(); Random rnd = new Random(); for (int i = rt.Length - 1; i >= 1; i--) swap(ref rt[i], ref rt[rnd.Next(i + 1)]); return rt; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; } public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); } } public class Scanner { public string Str => Console.ReadLine().Trim(); public int Int => int.Parse(Str); public long Long => long.Parse(Str); public double Double => double.Parse(Str); public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray(); public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray(); public char[][] Grid(int n) => Create(n, () => Str.ToCharArray()); public int[] ArrInt1D(int n) => Create(n, () => Int); public long[] ArrLong1D(int n) => Create(n, () => Long); public int[][] ArrInt2D(int n) => Create(n, () => ArrInt); public long[][] ArrLong2D(int n) => Create(n, () => ArrLong); private Queue<string> q = new Queue<string>(); [MethodImpl(MethodImplOptions.AggressiveInlining)] public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); } public void Make<T1>(out T1 v1) => v1 = Next<T1>(); public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); } public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); } public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); } public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); } public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); } //public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); } //public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); } //public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); } } public class Pair<T1, T2> : IComparable<Pair<T1, T2>> { public T1 v1; public T2 v2; public Pair() { } public Pair(T1 v1, T2 v2) { this.v1 = v1; this.v2 = v2; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2> p) { var c = Comparer<T1>.Default.Compare(v1, p.v1); if (c == 0) c = Comparer<T2>.Default.Compare(v2, p.v2); return c; } public override string ToString() => $"{v1.ToString()} {v2.ToString()}"; public void Deconstruct(out T1 a, out T2 b) { a = v1; b = v2; } } public class Pair<T1, T2, T3> : Pair<T1, T2>, IComparable<Pair<T1, T2, T3>> { public T3 v3; public Pair() : base() { } public Pair(T1 v1, T2 v2, T3 v3) : base(v1, v2) { this.v3 = v3; } [MethodImpl(MethodImplOptions.AggressiveInlining)] public int CompareTo(Pair<T1, T2, T3> p) { var c = base.CompareTo(p); if (c == 0) c = Comparer<T3>.Default.Compare(v3, p.v3); return c; } public override string ToString() => $"{base.ToString()} {v3.ToString()}"; public void Deconstruct(out T1 a, out T2 b, out T3 c) { Deconstruct(out a, out b); c = v3; } } #endregion