結果

問題 No.1013 〇マス進む
ユーザー hiromi_ayasehiromi_ayase
提出日時 2020-03-21 11:09:15
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 3,092 bytes
コンパイル時間 3,780 ms
コンパイル使用メモリ 81,252 KB
実行使用メモリ 88,788 KB
最終ジャッジ日時 2023-08-23 07:55:49
合計ジャッジ時間 27,041 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 65 ms
35,616 KB
testcase_01 AC 66 ms
35,204 KB
testcase_02 AC 66 ms
35,520 KB
testcase_03 AC 84 ms
35,788 KB
testcase_04 AC 74 ms
35,376 KB
testcase_05 AC 88 ms
36,000 KB
testcase_06 AC 85 ms
36,152 KB
testcase_07 AC 92 ms
36,128 KB
testcase_08 AC 85 ms
35,776 KB
testcase_09 AC 92 ms
36,304 KB
testcase_10 AC 90 ms
35,928 KB
testcase_11 AC 85 ms
36,140 KB
testcase_12 AC 92 ms
35,864 KB
testcase_13 AC 129 ms
38,764 KB
testcase_14 AC 330 ms
55,940 KB
testcase_15 AC 416 ms
64,704 KB
testcase_16 AC 400 ms
65,144 KB
testcase_17 AC 311 ms
54,328 KB
testcase_18 AC 343 ms
56,560 KB
testcase_19 AC 274 ms
48,588 KB
testcase_20 AC 490 ms
70,840 KB
testcase_21 AC 298 ms
53,256 KB
testcase_22 AC 356 ms
57,728 KB
testcase_23 AC 203 ms
44,868 KB
testcase_24 AC 474 ms
75,052 KB
testcase_25 AC 441 ms
68,060 KB
testcase_26 AC 205 ms
44,960 KB
testcase_27 AC 288 ms
52,472 KB
testcase_28 AC 205 ms
45,000 KB
testcase_29 AC 472 ms
69,708 KB
testcase_30 AC 278 ms
52,108 KB
testcase_31 AC 387 ms
64,420 KB
testcase_32 AC 318 ms
55,856 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 WA -
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 WA -
testcase_40 WA -
testcase_41 WA -
testcase_42 WA -
testcase_43 WA -
testcase_44 WA -
testcase_45 WA -
testcase_46 WA -
testcase_47 WA -
testcase_48 WA -
testcase_49 WA -
testcase_50 WA -
testcase_51 WA -
testcase_52 WA -
testcase_53 WA -
testcase_54 WA -
testcase_55 WA -
testcase_56 WA -
testcase_57 WA -
testcase_58 WA -
testcase_59 WA -
testcase_60 WA -
testcase_61 AC 468 ms
71,656 KB
testcase_62 AC 472 ms
74,976 KB
testcase_63 AC 72 ms
34,968 KB
testcase_64 AC 66 ms
34,780 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

public class Main {

  private static void solve() {
    int n = ni();
    int k = ni();

    int[] p = na(n);

    int m = 30;
    int[][] lp = new int[m][n];
    int[][] lq = new int[m][n];

    for (int i = 0; i < n; i++) {
      lp[0][i] = (i + p[i]) % n;
      lq[0][i] = i + p[i] >= n ? 1 : 0;
    }

    for (int i = 1; i < m; i++) {
      for (int j = 0; j < n; j++) {
        lp[i][j] = lp[i - 1][lp[i - 1][j]];
        lq[i][j] = lq[i - 1][lp[i - 1][j]] + lq[i - 1][j];
      }
    }

    for (int i = 0; i < n; i++) {
      int v = i;
      int u = 0;
      for (int j = m - 1; j >= 0; j--) {
        if (((k >> j) & 1) == 1) {
          u += lq[j][v];
          v = lp[j][v];
        }
      }
      out.println(v + u * n + 1);
    }
  }

  public static void main(String[] args) {
    new Thread(null, new Runnable() {
      @Override
      public void run() {
        long start = System.currentTimeMillis();
        String debug = args.length > 0 ? args[0] : null;
        if (debug != null) {
          try {
            is = java.nio.file.Files.newInputStream(java.nio.file.Paths.get(debug));
          } catch (Exception e) {
            throw new RuntimeException(e);
          }
        }
        reader = new java.io.BufferedReader(new java.io.InputStreamReader(is), 32768);
        solve();
        out.flush();
        tr((System.currentTimeMillis() - start) + "ms");
      }
    }, "", 64000000).start();
  }

  private static java.io.InputStream is = System.in;
  private static java.io.PrintWriter out = new java.io.PrintWriter(System.out);
  private static java.util.StringTokenizer tokenizer = null;
  private static java.io.BufferedReader reader;

  public static String next() {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      try {
        tokenizer = new java.util.StringTokenizer(reader.readLine());
      } catch (Exception e) {
        throw new RuntimeException(e);
      }
    }
    return tokenizer.nextToken();
  }

  private static double nd() {
    return Double.parseDouble(next());
  }

  private static long nl() {
    return Long.parseLong(next());
  }

  private static int[] na(int n) {
    int[] a = new int[n];
    for (int i = 0; i < n; i++)
      a[i] = ni();
    return a;
  }

  private static char[] ns() {
    return next().toCharArray();
  }

  private static long[] nal(int n) {
    long[] a = new long[n];
    for (int i = 0; i < n; i++)
      a[i] = nl();
    return a;
  }

  private static int[][] ntable(int n, int m) {
    int[][] table = new int[n][m];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[i][j] = ni();
      }
    }
    return table;
  }

  private static int[][] nlist(int n, int m) {
    int[][] table = new int[m][n];
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < m; j++) {
        table[j][i] = ni();
      }
    }
    return table;
  }

  private static int ni() {
    return Integer.parseInt(next());
  }

  private static void tr(Object... o) {
    if (is != System.in)
      System.out.println(java.util.Arrays.deepToString(o));
  }
}
0