#35220 (Java21) No.238 Mr. K's Another Gift

提出ソース

結果

問題	No.238 Mr. K's Another Gift
ユーザー	uwi
提出日時	2015-07-05 22:46:17
言語	Java21 (openjdk 21)
結果	AC
実行時間	142 ms / 2,000 ms
コード長	5,394 bytes
コンパイル時間	3,691 ms
コンパイル使用メモリ	93,436 KB
実行使用メモリ	53,740 KB
最終ジャッジ日時	2024-07-07 23:31:05
合計ジャッジ時間	8,600 ms
ジャッジサーバーID （参考情報）	judge3 / judge1

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

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	50 ms 49,968 KB
testcase_01	AC	80 ms 52,972 KB
testcase_02	AC	90 ms 53,104 KB
testcase_03	AC	97 ms 52,924 KB
testcase_04	AC	57 ms 50,564 KB
testcase_05	AC	134 ms 53,640 KB
testcase_06	AC	100 ms 51,716 KB
testcase_07	AC	137 ms 53,328 KB
testcase_08	AC	137 ms 53,740 KB
testcase_09	AC	135 ms 41,496 KB
testcase_10	AC	45 ms 36,620 KB
testcase_11	AC	46 ms 36,884 KB
testcase_12	AC	47 ms 36,844 KB
testcase_13	AC	47 ms 36,504 KB
testcase_14	AC	73 ms 37,920 KB
testcase_15	AC	80 ms 38,380 KB
testcase_16	AC	69 ms 38,408 KB
testcase_17	AC	78 ms 38,552 KB
testcase_18	AC	84 ms 38,360 KB
testcase_19	AC	81 ms 38,292 KB
testcase_20	AC	93 ms 40,256 KB
testcase_21	AC	79 ms 40,468 KB
testcase_22	AC	51 ms 36,888 KB
testcase_23	AC	96 ms 40,592 KB
testcase_24	AC	91 ms 40,412 KB
testcase_25	AC	100 ms 40,664 KB
testcase_26	AC	90 ms 39,200 KB
testcase_27	AC	142 ms 41,624 KB
testcase_28	AC	89 ms 39,268 KB
testcase_29	AC	137 ms 41,500 KB
testcase_30	AC	48 ms 36,896 KB
testcase_31	AC	46 ms 36,356 KB
testcase_32	AC	48 ms 36,860 KB
testcase_33	AC	50 ms 36,960 KB
testcase_34	AC	81 ms 38,104 KB
testcase_35	AC	81 ms 38,048 KB
testcase_36	AC	81 ms 38,144 KB
testcase_37	AC	81 ms 38,388 KB
testcase_38	AC	81 ms 38,364 KB
testcase_39	AC	70 ms 38,272 KB
testcase_40	AC	81 ms 40,300 KB
testcase_41	AC	50 ms 37,280 KB
testcase_42	AC	47 ms 37,012 KB

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

ソースコード

raw source code

package contest;

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 Q591 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		int n = s.length;
		if(ispali(s)){
			out.println(new String(s, 0, n/2+1) + new String(s, n/2, n-n/2));
			return;
		}else{
			if(n % 2 == 1){
				inner:
				while(true){
					int j = n/2;
					char lock = 0;
					int pos = -1;
					for(int i = n/2+1;i < n;i++){
						if(s[i] == s[j]){
							j--;
						}else{
							if(lock != 0){
								break inner;
							}
							pos = i;
							lock = s[j];
							j--;
							i--;
						}
					}
					if(lock == 0){
						pos = n;
						lock = s[0];
					}
					out.println(new String(s, 0, pos) + lock + new String(s, pos, n-pos));
					return;
				}
				inner:
				while(true){
					int j = n/2;
					char lock = 0;
					int pos = -1;
					for(int i = n/2-1;i >= 0;i--){
						if(s[i] == s[j]){
							j++;
						}else{
							if(lock != 0){
								break inner;
							}
							pos = i+1;
							lock = s[j];
							j++;
							i++;
						}
					}
					if(lock == 0){
						pos = 0;
						lock = s[n-1];
					}
					out.println(new String(s, 0, pos) + lock + new String(s, pos, n-pos));
					return;
				}
			}else{
				inner:
				while(true){
					int j = n/2-1;
					char lock = 0;
					int pos = -1;
					for(int i = n/2+1;i < n;i++){
						if(s[i] == s[j]){
							j--;
						}else{
							if(lock != 0){
								break inner;
							}
							pos = i;
							lock = s[j];
							j--;
							i--;
						}
					}
					if(lock == 0){
						pos = n;
						lock = s[0];
					}
					out.println(new String(s, 0, pos) + lock + new String(s, pos, n-pos));
					return;
				}
				inner:
				while(true){
					int j = n/2;
					char lock = 0;
					int pos = -1;
					for(int i = n/2-2;i >= 0;i--){
						if(s[i] == s[j]){
							j++;
						}else{
							if(lock != 0){
								break inner;
							}
							pos = i+1;
							lock = s[j];
							j++;
							i++;
						}
					}
					if(lock == 0){
						pos = 0;
						lock = s[n-1];
					}
					out.println(new String(s, 0, pos) + lock + new String(s, pos, n-pos));
					return;
				}
			}
		}
		out.println("NA");
	}
	
	static boolean ispali(char[] s)
	{
		for(int i = 0, j = s.length-1;i < j;i++,j--){
			if(s[i] != s[j])return false;
		}
		return true;
	}
	
	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");
	}
	
	public static void main(String[] args) throws Exception { new Q591().run(); }
	
	private byte[] inbuf = new byte[1024];
	private 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 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[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, 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 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

結果

テストケース

ソースコード