結果

問題 No.958 たぷりすたべる (回文)
ユーザー uwiuwi
提出日時 2019-12-21 00:06:58
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,059 bytes
コンパイル時間 4,118 ms
コンパイル使用メモリ 84,564 KB
実行使用メモリ 57,832 KB
最終ジャッジ日時 2024-07-18 04:57:00
合計ジャッジ時間 13,603 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 45 ms
36,776 KB
testcase_01 AC 44 ms
36,660 KB
testcase_02 AC 45 ms
37,128 KB
testcase_03 AC 46 ms
36,940 KB
testcase_04 AC 46 ms
37,008 KB
testcase_05 AC 46 ms
37,116 KB
testcase_06 AC 47 ms
46,688 KB
testcase_07 AC 45 ms
37,148 KB
testcase_08 AC 44 ms
36,660 KB
testcase_09 AC 47 ms
36,876 KB
testcase_10 AC 46 ms
36,660 KB
testcase_11 AC 45 ms
36,876 KB
testcase_12 AC 44 ms
37,056 KB
testcase_13 AC 43 ms
36,660 KB
testcase_14 WA -
testcase_15 AC 47 ms
37,044 KB
testcase_16 AC 47 ms
37,124 KB
testcase_17 AC 48 ms
36,876 KB
testcase_18 AC 47 ms
37,168 KB
testcase_19 AC 46 ms
36,704 KB
testcase_20 AC 47 ms
37,016 KB
testcase_21 AC 48 ms
36,964 KB
testcase_22 AC 47 ms
37,104 KB
testcase_23 AC 47 ms
37,028 KB
testcase_24 AC 45 ms
36,956 KB
testcase_25 AC 46 ms
36,856 KB
testcase_26 AC 46 ms
37,152 KB
testcase_27 AC 177 ms
43,540 KB
testcase_28 AC 173 ms
44,048 KB
testcase_29 AC 164 ms
45,548 KB
testcase_30 AC 167 ms
44,496 KB
testcase_31 AC 170 ms
44,072 KB
testcase_32 AC 171 ms
43,792 KB
testcase_33 AC 156 ms
44,172 KB
testcase_34 AC 163 ms
43,604 KB
testcase_35 AC 170 ms
44,000 KB
testcase_36 AC 168 ms
44,080 KB
testcase_37 AC 174 ms
44,488 KB
testcase_38 AC 188 ms
44,792 KB
testcase_39 AC 175 ms
44,996 KB
testcase_40 AC 169 ms
45,052 KB
testcase_41 AC 180 ms
43,976 KB
testcase_42 AC 168 ms
43,808 KB
testcase_43 AC 163 ms
44,064 KB
testcase_44 AC 169 ms
44,020 KB
testcase_45 AC 164 ms
43,784 KB
testcase_46 AC 170 ms
43,672 KB
testcase_47 AC 308 ms
50,356 KB
testcase_48 AC 390 ms
53,220 KB
testcase_49 AC 369 ms
52,540 KB
testcase_50 AC 393 ms
52,892 KB
testcase_51 AC 386 ms
52,896 KB
testcase_52 AC 353 ms
53,368 KB
testcase_53 AC 398 ms
52,624 KB
testcase_54 AC 448 ms
57,832 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

package adv2019;
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 D21 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		int n = ni();
		int K = ni();
		int Q = ni();
		char[] s = ns(n);
		
		char[] ss = Arrays.copyOf(s, 2*n);
		for(int i = 0;i < n;i++) {
			ss[n+i] = ss[i];
		}
		
		// ABCD EABCD E
		
		
		int[] rads = palindrome(ss);
		
		for(int i = 0;i < Q;i++) {
			long a = nl()-1;
			int pos = (int)(a%n);
			if(Math.max(rads[pos*2], rads[(pos+n)*2]) >= n) {
				out.println(Math.min(a+1, (long)K*n-a)*2-1);
			}else {
				if(a < n) {
					out.println(rads[pos*2]);
				}else if(a >= (long)(K-1)*n) {
					out.println(rads[(pos+n)*2]);
				}else {
					out.println(Math.max(rads[pos*2], rads[(pos+n)*2]));
				}
			}
		}
	}
	
	public static int[] palindrome(char[] str)
	{
		int n = str.length;
		int[] r = new int[2*n];
		int k = 0;
		for(int i = 0, j = 0;i < 2*n;i += k, j = Math.max(j-k, 0)){
			// normally
			while(i-j >= 0 && i+j+1 < 2*n && str[(i-j)/2] == str[(i+j+1)/2])j++;
			r[i] = j;
			
			// skip based on the theorem
			for(k = 1;i-k >= 0 && r[i]-k >= 0 && r[i-k] != r[i]-k;k++){
				r[i+k] = Math.min(r[i-k], r[i]-k);
			}
		}
		return r;
	}

	
	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 D21().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