結果

問題 No.238 Mr. K's Another Gift
ユーザー uwiuwi
提出日時 2015-07-05 23:35:26
言語 Java21
(openjdk 21)
結果
WA  
実行時間 -
コード長 4,057 bytes
コンパイル時間 4,876 ms
コンパイル使用メモリ 83,088 KB
実行使用メモリ 55,864 KB
最終ジャッジ日時 2024-07-08 00:31:29
合計ジャッジ時間 12,327 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 59 ms
36,760 KB
testcase_01 AC 102 ms
40,316 KB
testcase_02 AC 110 ms
40,432 KB
testcase_03 AC 110 ms
40,320 KB
testcase_04 AC 66 ms
37,480 KB
testcase_05 WA -
testcase_06 AC 130 ms
39,960 KB
testcase_07 AC 187 ms
42,388 KB
testcase_08 AC 179 ms
42,536 KB
testcase_09 AC 180 ms
42,236 KB
testcase_10 AC 97 ms
40,344 KB
testcase_11 AC 110 ms
40,164 KB
testcase_12 AC 99 ms
39,960 KB
testcase_13 AC 103 ms
40,072 KB
testcase_14 AC 157 ms
41,596 KB
testcase_15 AC 168 ms
42,360 KB
testcase_16 AC 169 ms
42,332 KB
testcase_17 AC 171 ms
42,224 KB
testcase_18 AC 169 ms
42,136 KB
testcase_19 AC 166 ms
42,400 KB
testcase_20 AC 109 ms
40,048 KB
testcase_21 AC 110 ms
40,432 KB
testcase_22 AC 58 ms
37,024 KB
testcase_23 AC 113 ms
40,608 KB
testcase_24 AC 108 ms
40,344 KB
testcase_25 AC 120 ms
40,648 KB
testcase_26 AC 128 ms
39,928 KB
testcase_27 AC 177 ms
42,340 KB
testcase_28 AC 126 ms
40,176 KB
testcase_29 AC 178 ms
42,408 KB
testcase_30 AC 99 ms
40,216 KB
testcase_31 AC 105 ms
40,220 KB
testcase_32 AC 104 ms
40,544 KB
testcase_33 AC 117 ms
40,600 KB
testcase_34 AC 168 ms
42,096 KB
testcase_35 AC 174 ms
42,360 KB
testcase_36 AC 170 ms
42,224 KB
testcase_37 AC 169 ms
42,360 KB
testcase_38 AC 171 ms
42,360 KB
testcase_39 AC 167 ms
42,400 KB
testcase_40 AC 108 ms
40,096 KB
testcase_41 AC 57 ms
36,732 KB
testcase_42 AC 98 ms
40,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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_2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	void solve()
	{
		char[] s = ns().toCharArray();
		int n = s.length;
		char[] rs = new StringBuilder(new String(s)).reverse().toString().toCharArray();
		for(int i = 0;i < n-1;i++){
			if(s[i] != rs[i]){
				if(i+1 < n && s[i] != rs[i+1]){
					char[] t = (new String(rs, 0, i) + s[i] + new String(rs, i, n-i)).toCharArray();
					if(ispali(t)){
						out.println(new String(t));
					}else{
						out.println("NA");
					}
				}else{
					char[] t = (new String(s, 0, i) + rs[i] + new String(s, i, n-i)).toCharArray();
					if(ispali(t)){
						out.println(new String(t));
					}else{
						out.println("NA");
					}
				}
				return;
			}
		}
		out.println(new String(s, 0, n/2+1) + new String(s, n/2, n-n/2));
	}
	
	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_2().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)); }
}
0