結果

問題 No.1013 〇マス進む
ユーザー uwiuwi
提出日時 2020-03-20 21:48:49
言語 Java19
(openjdk 21)
結果
AC  
実行時間 369 ms / 2,000 ms
コード長 4,094 bytes
コンパイル時間 6,582 ms
コンパイル使用メモリ 80,264 KB
実行使用メモリ 84,964 KB
最終ジャッジ日時 2023-08-21 16:08:19
合計ジャッジ時間 22,557 ms
ジャッジサーバーID
(参考情報)
judge15 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
49,440 KB
testcase_01 AC 44 ms
49,328 KB
testcase_02 AC 45 ms
49,504 KB
testcase_03 AC 51 ms
49,652 KB
testcase_04 AC 46 ms
49,344 KB
testcase_05 AC 49 ms
49,512 KB
testcase_06 AC 49 ms
47,684 KB
testcase_07 AC 55 ms
48,136 KB
testcase_08 AC 50 ms
49,180 KB
testcase_09 AC 56 ms
49,784 KB
testcase_10 AC 54 ms
49,788 KB
testcase_11 AC 48 ms
47,652 KB
testcase_12 AC 56 ms
50,180 KB
testcase_13 AC 89 ms
52,276 KB
testcase_14 AC 223 ms
68,492 KB
testcase_15 AC 290 ms
78,872 KB
testcase_16 AC 299 ms
79,252 KB
testcase_17 AC 205 ms
68,432 KB
testcase_18 AC 234 ms
69,048 KB
testcase_19 AC 177 ms
63,640 KB
testcase_20 AC 298 ms
82,012 KB
testcase_21 AC 201 ms
66,840 KB
testcase_22 AC 238 ms
70,404 KB
testcase_23 AC 138 ms
58,236 KB
testcase_24 AC 295 ms
80,680 KB
testcase_25 AC 292 ms
81,740 KB
testcase_26 AC 138 ms
58,984 KB
testcase_27 AC 187 ms
63,772 KB
testcase_28 AC 136 ms
58,100 KB
testcase_29 AC 290 ms
81,912 KB
testcase_30 AC 184 ms
63,620 KB
testcase_31 AC 270 ms
78,180 KB
testcase_32 AC 217 ms
68,140 KB
testcase_33 AC 227 ms
68,980 KB
testcase_34 AC 305 ms
80,432 KB
testcase_35 AC 337 ms
80,280 KB
testcase_36 AC 102 ms
52,184 KB
testcase_37 AC 106 ms
52,400 KB
testcase_38 AC 312 ms
78,720 KB
testcase_39 AC 179 ms
63,488 KB
testcase_40 AC 358 ms
80,308 KB
testcase_41 AC 152 ms
58,776 KB
testcase_42 AC 225 ms
68,848 KB
testcase_43 AC 189 ms
63,936 KB
testcase_44 AC 231 ms
69,140 KB
testcase_45 AC 217 ms
68,344 KB
testcase_46 AC 156 ms
56,924 KB
testcase_47 AC 220 ms
68,240 KB
testcase_48 AC 251 ms
70,192 KB
testcase_49 AC 333 ms
80,148 KB
testcase_50 AC 303 ms
79,552 KB
testcase_51 AC 266 ms
73,384 KB
testcase_52 AC 123 ms
54,784 KB
testcase_53 AC 144 ms
58,256 KB
testcase_54 AC 268 ms
75,912 KB
testcase_55 AC 156 ms
58,716 KB
testcase_56 AC 369 ms
84,964 KB
testcase_57 AC 300 ms
74,140 KB
testcase_58 AC 368 ms
82,944 KB
testcase_59 AC 346 ms
82,928 KB
testcase_60 AC 349 ms
82,956 KB
testcase_61 AC 297 ms
79,156 KB
testcase_62 AC 285 ms
80,644 KB
testcase_63 AC 42 ms
49,292 KB
testcase_64 AC 43 ms
49,360 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

package contest200320;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class E2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni(), K = ni();
		int[] a = na(n);
		int[] f = new int[n];
		int[] plus = new int[n];
		for(int i = 0;i < n;i++){
			f[i] = (i+a[i])%n;
			if(i+a[i] >= n)plus[i]++;
		}
		
		int[][] sn = sparseNext(f);
		int[][] sr = sparseRound(sn);
		for(int i = 0;i < n;i++){
			int cur = i;
			long nr = 0;
			for(int d = 29;d >= 0;d--){
				if(K<<~d<0){
					nr += sr[d][cur];
					cur = sn[d][cur];
				}
			}
			out.println(nr*n + cur + 1);
		}
	}

	public static int[][] sparseNext(int[] f)
	{
		int n = f.length;
		final int m = 31; // 
		int[][] sf = new int[m][n];
		sf[0] = Arrays.copyOf(f, n);
		for(int i = 1;i < m;i++){
			for(int j = 0;j < n;j++){
				sf[i][j] = sf[i-1][j] == -1 ? -1 : sf[i-1][sf[i-1][j]];
			}
		}
		return sf;
	}

	public static int[][] sparseRound(int[][] sf)
	{
		int n = sf[0].length;
		final int m = 31; // 
		int[][] sr = new int[m][n];
		for(int i = 0;i < n;i++){
			if(sf[0][i] <= i){
				sr[0][i] = 1;
			}
		}
		for(int i = 1;i < m;i++){
			for(int j = 0;j < n;j++){
				sr[i][j] = sr[i-1][j] + sr[i-1][sf[i-1][j]];
			}
		}
		return sr;
	}

	
	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//		Thread t = new Thread(null, null, "~", Runtime.getRuntime().maxMemory()){
//			@Override
//			public void run() {
//				long s = System.currentTimeMillis();
//				solve();
//				out.flush();
//				if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
//			}
//		};
//		t.start();
//		t.join();
	}
	
	public static void main(String[] args) throws Exception { new E2().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private long[] nal(int n)
	{
		long[] a = new long[n];
		for(int i = 0;i < n;i++)a[i] = nl();
		return a;
	}
	
	private char[][] nm(int n, int m) {
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[][] nmi(int n, int m) {
		int[][] map = new int[n][];
		for(int i = 0;i < n;i++)map[i] = na(m);
		return map;
	}
	
	private int ni() { return (int)nl(); }
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}
0