#410828 (Java21) No.958 たぷりすたべる (回文)

提出ソース

結果

問題	No.958 たぷりすたべる (回文)
ユーザー	uwi
提出日時	2019-12-21 00:10:07
言語	Java21 (openjdk 21)
結果	AC
実行時間	523 ms / 2,000 ms
コード長	4,206 bytes
コンパイル時間	4,739 ms
コンパイル使用メモリ	79,424 KB
実行使用メモリ	53,552 KB
最終ジャッジ日時	2023-09-25 04:30:17
合計ジャッジ時間	16,636 ms
ジャッジサーバーID （参考情報）	judge12 / judge14

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	38 ms 33,456 KB
testcase_01	AC	39 ms 33,628 KB
testcase_02	AC	38 ms 33,316 KB
testcase_03	AC	41 ms 33,752 KB
testcase_04	AC	40 ms 33,500 KB
testcase_05	AC	38 ms 33,324 KB
testcase_06	AC	39 ms 33,384 KB
testcase_07	AC	39 ms 33,636 KB
testcase_08	AC	38 ms 33,312 KB
testcase_09	AC	39 ms 33,712 KB
testcase_10	AC	40 ms 33,388 KB
testcase_11	AC	40 ms 33,456 KB
testcase_12	AC	39 ms 33,396 KB
testcase_13	AC	38 ms 33,384 KB
testcase_14	AC	38 ms 33,628 KB
testcase_15	AC	39 ms 33,316 KB
testcase_16	AC	38 ms 33,460 KB
testcase_17	AC	38 ms 33,392 KB
testcase_18	AC	39 ms 33,804 KB
testcase_19	AC	40 ms 33,648 KB
testcase_20	AC	41 ms 33,324 KB
testcase_21	AC	41 ms 33,724 KB
testcase_22	AC	42 ms 33,748 KB
testcase_23	AC	47 ms 33,500 KB
testcase_24	AC	42 ms 33,496 KB
testcase_25	AC	42 ms 33,752 KB
testcase_26	AC	41 ms 33,524 KB
testcase_27	AC	188 ms 40,064 KB
testcase_28	AC	168 ms 41,480 KB
testcase_29	AC	169 ms 41,580 KB
testcase_30	AC	170 ms 41,928 KB
testcase_31	AC	169 ms 39,804 KB
testcase_32	AC	168 ms 41,772 KB
testcase_33	AC	167 ms 41,820 KB
testcase_34	AC	170 ms 41,248 KB
testcase_35	AC	161 ms 39,924 KB
testcase_36	AC	166 ms 41,224 KB
testcase_37	AC	182 ms 41,468 KB
testcase_38	AC	186 ms 41,488 KB
testcase_39	AC	181 ms 41,888 KB
testcase_40	AC	193 ms 39,772 KB
testcase_41	AC	190 ms 40,312 KB
testcase_42	AC	179 ms 40,196 KB
testcase_43	AC	160 ms 39,948 KB
testcase_44	AC	183 ms 40,400 KB
testcase_45	AC	170 ms 40,444 KB
testcase_46	AC	189 ms 39,944 KB
testcase_47	AC	388 ms 46,668 KB
testcase_48	AC	430 ms 48,472 KB
testcase_49	AC	421 ms 48,424 KB
testcase_50	AC	522 ms 53,552 KB
testcase_51	AC	345 ms 52,088 KB
testcase_52	AC	523 ms 49,300 KB
testcase_53	AC	456 ms 47,888 KB
testcase_54	AC	352 ms 51,876 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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);
		
		if(K == 1) {
			int[] rads = palindrome(s);
			for(int i = 0;i < Q;i++) {
				int a = ni()-1;
				out.println(rads[2*a]);
			}
			return;
		}
		
		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)); }
}

yukicoder

結果

テストケース

ソースコード