結果

問題 No.1097 Remainder Operation
ユーザー uwiuwi
提出日時 2020-06-26 21:29:19
言語 Java21
(openjdk 21)
結果
AC  
実行時間 259 ms / 2,000 ms
コード長 4,060 bytes
コンパイル時間 5,020 ms
コンパイル使用メモリ 83,088 KB
実行使用メモリ 57,160 KB
最終ジャッジ日時 2023-09-18 03:05:19
合計ジャッジ時間 9,830 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 43 ms
49,340 KB
testcase_01 AC 43 ms
49,552 KB
testcase_02 AC 44 ms
49,688 KB
testcase_03 AC 46 ms
49,368 KB
testcase_04 AC 47 ms
49,244 KB
testcase_05 AC 44 ms
49,424 KB
testcase_06 AC 45 ms
49,348 KB
testcase_07 AC 106 ms
52,312 KB
testcase_08 AC 104 ms
52,472 KB
testcase_09 AC 107 ms
52,320 KB
testcase_10 AC 107 ms
52,572 KB
testcase_11 AC 107 ms
52,624 KB
testcase_12 AC 237 ms
56,860 KB
testcase_13 AC 253 ms
57,060 KB
testcase_14 AC 250 ms
56,560 KB
testcase_15 AC 250 ms
56,404 KB
testcase_16 AC 250 ms
57,060 KB
testcase_17 AC 257 ms
56,488 KB
testcase_18 AC 234 ms
56,664 KB
testcase_19 AC 256 ms
57,160 KB
testcase_20 AC 259 ms
56,820 KB
testcase_21 AC 257 ms
56,676 KB
testcase_22 AC 253 ms
56,960 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package contest200626;
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 C {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int[] a = na(n);
		int[] f = new int[n];
		for(int i = 0;i < n;i++){
			f[i] = (i + a[i % n]) % n;
		}
		int[] tp = tailAndPeriod(f, 0);
		long[] vals = new long[n+1];
		for(int i = 0;i < n;i++){
			vals[i+1] = vals[i] + a[(int)(vals[i]%n)];
		}
		long plus = vals[tp[1]+tp[0]] - vals[tp[0]];
		for(int Q = ni();Q > 0;Q--){
			long K = nl();
			if(K <= n){
				out.println(vals[(int)K]);
			}else{
				long ans = plus * ((K-tp[0]) / tp[1]) + vals[(int)((K-tp[0]) % tp[1] + tp[0])];
				out.println(ans);
			}
		}
	}
	
	public static int[] tailAndPeriod(int[] f, int x0)
	{
		int power = 1;
		int lambda = 1;
		int t = x0, h = f[x0];
		while(t != h){
			if(power == lambda){
				t = h;
				power *= 2;
				lambda = 0;
			}
			h = f[h];
			lambda++;
		}
		
		// lambda = cycle period
		// 
		// min mu which satisfies
		// f^(mu)(x0)=f^(mu+lambda)(x0)
		// is tail length
		int mu = 0;
		t = h = x0;
		for(int i = 0;i < lambda;i++)h = f[h];
		while(t != h){
			t = f[t];
			h = f[h];
			mu++;
		}
		return new int[]{mu, lambda};
	}
	
	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 C().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