結果

問題 No.238 Mr. K's Another Gift
ユーザー tanzakutanzaku
提出日時 2015-07-05 23:14:42
言語 Java21
(openjdk 21)
結果
AC  
実行時間 177 ms / 2,000 ms
コード長 6,626 bytes
コンパイル時間 2,401 ms
コンパイル使用メモリ 84,472 KB
実行使用メモリ 43,792 KB
最終ジャッジ日時 2024-07-07 23:48:38
合計ジャッジ時間 9,430 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 118 ms
41,592 KB
testcase_01 AC 116 ms
41,340 KB
testcase_02 AC 92 ms
40,636 KB
testcase_03 AC 105 ms
40,488 KB
testcase_04 AC 98 ms
40,932 KB
testcase_05 AC 136 ms
43,068 KB
testcase_06 AC 136 ms
43,732 KB
testcase_07 AC 141 ms
43,680 KB
testcase_08 AC 145 ms
43,596 KB
testcase_09 AC 143 ms
43,552 KB
testcase_10 AC 107 ms
40,488 KB
testcase_11 AC 95 ms
40,264 KB
testcase_12 AC 97 ms
40,488 KB
testcase_13 AC 95 ms
40,420 KB
testcase_14 AC 129 ms
42,692 KB
testcase_15 AC 140 ms
43,776 KB
testcase_16 AC 139 ms
43,696 KB
testcase_17 AC 135 ms
43,720 KB
testcase_18 AC 137 ms
43,696 KB
testcase_19 AC 134 ms
43,720 KB
testcase_20 AC 99 ms
40,424 KB
testcase_21 AC 101 ms
40,976 KB
testcase_22 AC 94 ms
40,312 KB
testcase_23 AC 96 ms
40,616 KB
testcase_24 AC 103 ms
40,948 KB
testcase_25 AC 100 ms
40,928 KB
testcase_26 AC 142 ms
43,448 KB
testcase_27 AC 142 ms
43,748 KB
testcase_28 AC 177 ms
43,132 KB
testcase_29 AC 142 ms
43,560 KB
testcase_30 AC 102 ms
40,616 KB
testcase_31 AC 98 ms
40,628 KB
testcase_32 AC 95 ms
40,880 KB
testcase_33 AC 96 ms
40,880 KB
testcase_34 AC 132 ms
43,088 KB
testcase_35 AC 138 ms
43,560 KB
testcase_36 AC 136 ms
43,792 KB
testcase_37 AC 140 ms
43,640 KB
testcase_38 AC 136 ms
43,740 KB
testcase_39 AC 132 ms
43,772 KB
testcase_40 AC 106 ms
41,032 KB
testcase_41 AC 119 ms
41,396 KB
testcase_42 AC 105 ms
40,516 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

import java.io.*;
import java.math.*;
import java.util.*;

import static java.util.Arrays.*;

public class Main {
	private static final int mod = (int)1e9+7;

	final Random random = new Random(0);
	final IOFast io = new IOFast();

	/// MAIN CODE
	public void run() throws IOException {
//		int TEST_CASE = Integer.parseInt(new String(io.nextLine()).trim());
		int TEST_CASE = 1;
		while(TEST_CASE-- != 0) {
			char[] cs = io.next();
			int n = cs.length;
			String ans = null;
			String s = new String(cs);
			if(n % 2 == 0) {
				for(int i = n / 2 - 1; i <= n / 2; i++) {
					for(int l = i - 1, r = i + 1; l >= 0 && r < n; l--, r++) {
						if(cs[l] != cs[r]) {
							String str1 = s.substring(0, l + 1) + cs[r] + s.substring(l + 1);
							String str2 = s.substring(0, r) + cs[l] + s.substring(r);
							if(palindrome(str1.toCharArray(), 0, n)) {
								ans = str1;
							}
							else if(palindrome(str2.toCharArray(), 0, n)) {
								ans = str2;
							}
							break;
						}
					}
				}
			}
			else {
				for(int i = n / 2 - 1; i <= n / 2; i++) {
					for(int l = i, r = i + 1; l >= 0 && r < n; l--, r++) {
						if(cs[l] != cs[r]) {
							String str1 = s.substring(0, l + 1) + cs[r] + s.substring(l + 1);
							String str2 = s.substring(0, r) + cs[l] + s.substring(r);
							if(palindrome(str1.toCharArray(), 0, n)) {
								ans = str1;
							}
							else if(palindrome(str2.toCharArray(), 0, n)) {
								ans = str2;
							}
							break;
						}
					}
				}
			}
			if(palindrome(cs, 0, n-1)) {
				ans = s.substring(0, n/2) + cs[n/2] + s.substring(n/2);
			}
			if(palindrome(cs, 1, n-1)) {
				ans = s + cs[0];
			}
			if(palindrome(cs, 0, n-2)) {
				ans = cs[n-1] + s;
			}
			io.out.println(ans == null ? "NA" : ans);
		}
	}
	
	boolean palindrome(char[] cs, int i, int j) {
		for(; i < j; i++, j--) {
			if(cs[i] != cs[j]) {
				return false;
			}
		}
		return true;
	}
	
	/// TEMPLATE
	static int gcd(int n, int r) { return r == 0 ? n : gcd(r, n%r); }
	static long gcd(long n, long r) { return r == 0 ? n : gcd(r, n%r); }
	
	static <T> void swap(T[] x, int i, int j) { T t = x[i]; x[i] = x[j]; x[j] = t; }
	static void swap(int[] x, int i, int j) { int t = x[i]; x[i] = x[j]; x[j] = t; }
	
	void main() throws IOException {
		//		IOFast.setFileIO("rle-size.in", "rle-size.out");
		try { run(); }
		catch (EndOfFileRuntimeException e) { }
		io.out.flush();
	}
	public static void main(String[] args) throws IOException { new Main().main(); }
	
	static class EndOfFileRuntimeException extends RuntimeException {
		private static final long serialVersionUID = -8565341110209207657L; }

	static
	public class IOFast {
		private BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		private PrintWriter out = new PrintWriter(System.out);

		void setFileIn(String ins) throws IOException { in.close(); in = new BufferedReader(new FileReader(ins)); }
		void setFileOut(String outs) throws IOException { out.flush(); out.close(); out = new PrintWriter(new FileWriter(outs)); }
		void setFileIO(String ins, String outs) throws IOException { setFileIn(ins); setFileOut(outs); }

		private static int pos, readLen;
		private static final char[] buffer = new char[1024 * 8];
		private static char[] str = new char[500*8*2];
		private static boolean[] isDigit = new boolean[256];
		private static boolean[] isSpace = new boolean[256];
		private static boolean[] isLineSep = new boolean[256];

		static { for(int i = 0; i < 10; i++) { isDigit['0' + i] = true; } isDigit['-'] = true; isSpace[' '] = isSpace['\r'] = isSpace['\n'] = isSpace['\t'] = true; isLineSep['\r'] = isLineSep['\n'] = true; }
		public int read() throws IOException { if(pos >= readLen) { pos = 0; readLen = in.read(buffer); if(readLen <= 0) { throw new EndOfFileRuntimeException(); } } return buffer[pos++]; }
		public int nextInt() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; int ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public long nextLong() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); int i = 0; long ret = 0; if(str[0] == '-') { i = 1; } for(; i < len; i++) ret = ret * 10 + str[i] - '0'; if(str[0] == '-') { ret = -ret; } return ret; }
		public char nextChar() throws IOException { while(true) { final int c = read(); if(!isSpace[c]) { return (char)c; } } }
		int reads(int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } if(str.length == len) { char[] rep = new char[str.length * 3 / 2]; System.arraycopy(str, 0, rep, 0, str.length); str = rep; } str[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		int reads(char[] cs, int len, boolean[] accept) throws IOException { try { while(true) { final int c = read(); if(accept[c]) { break; } cs[len++] = (char)c; } } catch(EndOfFileRuntimeException e) { ; } return len; }
		public char[] nextLine() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isLineSep); try { if(str[len-1] == '\r') { len--; read(); } } catch(EndOfFileRuntimeException e) { ; } return Arrays.copyOf(str, len); }
		public String nextString() throws IOException { return new String(next()); }
		public char[] next() throws IOException { int len = 0; str[len++] = nextChar(); len = reads(len, isSpace); return Arrays.copyOf(str, len); }
		public int next(char[] cs) throws IOException { int len = 0; cs[len++] = nextChar(); len = reads(cs, len, isSpace); return len; }
		public double nextDouble() throws IOException { return Double.parseDouble(nextString()); }
		public long[] nextLongArray(final int n) throws IOException { final long[] res = new long[n]; for(int i = 0; i < n; i++) { res[i] = nextLong(); } return res; }
		public int[] nextIntArray(final int n) throws IOException { final int[] res = new int[n]; for(int i = 0; i < n; i++) { res[i] = nextInt(); } return res; }
		public int[][] nextIntArray2D(final int n, final int k) throws IOException { final int[][] res = new int[n][]; for(int i = 0; i < n; i++) { res[i] = nextIntArray(k); } return res; }
		public int[][] nextIntArray2DWithIndex(final int n, final int k) throws IOException { final int[][] res = new int[n][k+1]; for(int i = 0; i < n; i++) { for(int j = 0; j < k; j++) { res[i][j] = nextInt(); } res[i][k] = i; } return res; }
		public double[] nextDoubleArray(final int n) throws IOException { final double[] res = new double[n]; for(int i = 0; i < n; i++) { res[i] = nextDouble(); } return res; }
	}
}
0