結果

問題 No.1013 〇マス進む
ユーザー OlandOland
提出日時 2020-03-21 10:12:39
言語 Java21
(openjdk 21)
結果
AC  
実行時間 465 ms / 2,000 ms
コード長 7,198 bytes
コンパイル時間 2,799 ms
コンパイル使用メモリ 84,124 KB
実行使用メモリ 76,548 KB
最終ジャッジ日時 2024-05-10 03:27:46
合計ジャッジ時間 21,955 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 51 ms
36,816 KB
testcase_01 AC 53 ms
37,376 KB
testcase_02 AC 53 ms
36,936 KB
testcase_03 AC 59 ms
37,120 KB
testcase_04 AC 56 ms
37,252 KB
testcase_05 AC 55 ms
37,072 KB
testcase_06 AC 55 ms
37,100 KB
testcase_07 AC 58 ms
37,092 KB
testcase_08 AC 55 ms
37,168 KB
testcase_09 AC 58 ms
37,072 KB
testcase_10 AC 58 ms
37,056 KB
testcase_11 AC 54 ms
36,744 KB
testcase_12 AC 59 ms
37,016 KB
testcase_13 AC 100 ms
39,200 KB
testcase_14 AC 229 ms
48,012 KB
testcase_15 AC 284 ms
51,236 KB
testcase_16 AC 257 ms
51,728 KB
testcase_17 AC 216 ms
48,952 KB
testcase_18 AC 243 ms
48,084 KB
testcase_19 AC 182 ms
43,844 KB
testcase_20 AC 318 ms
54,132 KB
testcase_21 AC 211 ms
49,056 KB
testcase_22 AC 255 ms
49,992 KB
testcase_23 AC 141 ms
42,288 KB
testcase_24 AC 328 ms
56,664 KB
testcase_25 AC 319 ms
55,920 KB
testcase_26 AC 153 ms
42,280 KB
testcase_27 AC 195 ms
47,904 KB
testcase_28 AC 145 ms
42,116 KB
testcase_29 AC 307 ms
54,288 KB
testcase_30 AC 200 ms
47,884 KB
testcase_31 AC 259 ms
51,676 KB
testcase_32 AC 220 ms
47,736 KB
testcase_33 AC 280 ms
56,460 KB
testcase_34 AC 369 ms
66,768 KB
testcase_35 AC 379 ms
68,932 KB
testcase_36 AC 121 ms
40,576 KB
testcase_37 AC 120 ms
41,332 KB
testcase_38 AC 380 ms
68,492 KB
testcase_39 AC 193 ms
47,992 KB
testcase_40 AC 403 ms
68,992 KB
testcase_41 AC 172 ms
47,920 KB
testcase_42 AC 266 ms
55,536 KB
testcase_43 AC 213 ms
50,860 KB
testcase_44 AC 264 ms
56,124 KB
testcase_45 AC 256 ms
55,840 KB
testcase_46 AC 183 ms
48,948 KB
testcase_47 AC 238 ms
53,692 KB
testcase_48 AC 272 ms
56,252 KB
testcase_49 AC 402 ms
68,300 KB
testcase_50 AC 339 ms
67,336 KB
testcase_51 AC 285 ms
57,300 KB
testcase_52 AC 144 ms
43,504 KB
testcase_53 AC 161 ms
47,908 KB
testcase_54 AC 323 ms
66,896 KB
testcase_55 AC 176 ms
48,144 KB
testcase_56 AC 382 ms
69,716 KB
testcase_57 AC 337 ms
58,300 KB
testcase_58 AC 465 ms
74,280 KB
testcase_59 AC 443 ms
76,548 KB
testcase_60 AC 403 ms
75,024 KB
testcase_61 AC 298 ms
53,208 KB
testcase_62 AC 247 ms
45,488 KB
testcase_63 AC 51 ms
37,360 KB
testcase_64 AC 53 ms
37,104 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.util.*;

@SuppressWarnings("unused")
public class Main {
    FastScanner in;
    PrintWriter out;
    final static int MOD = (int)1e9+7;
    final static long INF = Long.MAX_VALUE / 2;
    
    void solve(){
        int N = in.nextInt(), K = in.nextInt();
        int[] P = in.nextIntArray(N);
        
        int len = Integer.toBinaryString(K).length();
        int[][] to = new int[len][N], num = new int[len][N];
        for(int i = 0; i < N; i++){
            to[0][i] = (i + P[i]) % N;
            num[0][i] = (i + P[i] < N) ? 0 : 1;
        }
        
        for(int i = 1; i < len; i++){
            for(int j = 0; j < N; j++){
                to[i][j] = to[i-1][to[i-1][j]];
                num[i][j] = num[i-1][j] + num[i-1][to[i-1][j]];
            }
        }
        
        for(int i = 0; i < N; i++){
            int idx = i;
            long cnt = 0;
            for(int j = 0; j < len; j++){
                if(((K >> j) & 1) == 1){
                    cnt += num[j][idx];
                    idx = to[j][idx];
                }
            }
            long ans = ((idx + N * cnt) + 1);
            out.println(ans);
        }
    }
    
    public static void main(String[] args) {
        new Main().m();
    }
    
    private void m() {
        in = new FastScanner(System.in);
        out = new PrintWriter(System.out);
        /*
        try {
            String path = "input.txt";
            out = new PrintWriter(new BufferedWriter(new FileWriter(new File(path))));
        }catch (IOException e){
            e.printStackTrace();
        }
        */
        solve();
        out.flush();
        in.close();
        out.close();
    }
    
    static class FastScanner {
        private Reader input;
        
        public FastScanner() {this(System.in);}
        public FastScanner(InputStream stream) {this.input = new BufferedReader(new InputStreamReader(stream));}
        public void close() {
            try {
                this.input.close();
            } catch (IOException e) {
                e.printStackTrace();
            }
        }
        
        public int nextInt() {return (int) nextLong();}
        
        public long nextLong() {
            try {
                int sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                long ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) return ret * sign;
                    ret *= 10;
                    ret += b - '0';
                }
            } catch (IOException e) {
                e.printStackTrace();
                return -1;
            }
        }
        
        public double nextDouble() {
            try {
                double sign = 1;
                int b = input.read();
                while ((b < '0' || '9' < b) && b != '-' && b != '+') {
                    b = input.read();
                }
                if (b == '-') {
                    sign = -1;
                    b = input.read();
                } else if (b == '+') {
                    b = input.read();
                }
                double ret = b - '0';
                while (true) {
                    b = input.read();
                    if (b < '0' || '9' < b) break;
                    ret *= 10;
                    ret += b - '0';
                }
                if (b != '.') return sign * ret;
                double div = 1;
                b = input.read();
                while ('0' <= b && b <= '9') {
                    ret *= 10;
                    ret += b - '0';
                    div *= 10;
                    b = input.read();
                }
                return sign * ret / div;
            } catch (IOException e) {
                e.printStackTrace();
                return Double.NaN;
            }
        }
        
        public char nextChar() {
            try {
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                return (char) b;
            } catch (IOException e) {
                e.printStackTrace();
                return 0;
            }
        }
        
        public String nextStr() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (Character.isWhitespace(b)) {
                    b = input.read();
                }
                while (b != -1 && !Character.isWhitespace(b)) {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public String nextLine() {
            try {
                StringBuilder sb = new StringBuilder();
                int b = input.read();
                while (b != -1 && b != '\n') {
                    sb.append((char) b);
                    b = input.read();
                }
                return sb.toString();
            } catch (IOException e) {
                e.printStackTrace();
                return "";
            }
        }
        
        public int[] nextIntArray(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt();
            }
            return res;
        }
        
        public int[] nextIntArrayDec(int n) {
            int[] res = new int[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextInt() - 1;
            }
            return res;
        }
        
        public int[] nextIntArray1Index(int n) {
            int[] res = new int[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextInt();
            }
            return res;
        }
        
        public long[] nextLongArray(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong();
            }
            return res;
        }
        
        public long[] nextLongArrayDec(int n) {
            long[] res = new long[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextLong() - 1;
            }
            return res;
        }
        
        public long[] nextLongArray1Index(int n) {
            long[] res = new long[n + 1];
            for (int i = 0; i < n; i++) {
                res[i + 1] = nextLong();
            }
            return res;
        }
        
        public double[] nextDoubleArray(int n) {
            double[] res = new double[n];
            for (int i = 0; i < n; i++) {
                res[i] = nextDouble();
            }
            return res;
        }
    }
}
0