結果
問題 | No.238 Mr. K's Another Gift |
ユーザー | suigingin |
提出日時 | 2015-07-05 23:52:50 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 3,734 bytes |
コンパイル時間 | 6,662 ms |
コンパイル使用メモリ | 76,308 KB |
実行使用メモリ | 56,044 KB |
最終ジャッジ日時 | 2023-09-22 08:52:38 |
合計ジャッジ時間 | 13,518 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 118 ms
55,684 KB |
testcase_01 | AC | 115 ms
55,432 KB |
testcase_02 | AC | 114 ms
55,452 KB |
testcase_03 | AC | 123 ms
55,840 KB |
testcase_04 | AC | 149 ms
55,708 KB |
testcase_05 | WA | - |
testcase_06 | AC | 161 ms
55,652 KB |
testcase_07 | AC | 172 ms
56,044 KB |
testcase_08 | AC | 167 ms
55,532 KB |
testcase_09 | AC | 172 ms
55,756 KB |
testcase_10 | AC | 118 ms
55,828 KB |
testcase_11 | AC | 114 ms
55,748 KB |
testcase_12 | AC | 118 ms
55,748 KB |
testcase_13 | AC | 123 ms
55,908 KB |
testcase_14 | AC | 148 ms
55,760 KB |
testcase_15 | AC | 162 ms
53,836 KB |
testcase_16 | AC | 158 ms
55,924 KB |
testcase_17 | AC | 151 ms
55,480 KB |
testcase_18 | AC | 159 ms
55,860 KB |
testcase_19 | AC | 147 ms
55,728 KB |
testcase_20 | AC | 119 ms
55,648 KB |
testcase_21 | AC | 115 ms
55,940 KB |
testcase_22 | AC | 115 ms
55,380 KB |
testcase_23 | AC | 121 ms
55,864 KB |
testcase_24 | AC | 148 ms
55,464 KB |
testcase_25 | AC | 152 ms
55,920 KB |
testcase_26 | AC | 168 ms
55,692 KB |
testcase_27 | AC | 164 ms
55,644 KB |
testcase_28 | AC | 170 ms
55,600 KB |
testcase_29 | AC | 166 ms
55,552 KB |
testcase_30 | AC | 118 ms
55,644 KB |
testcase_31 | AC | 120 ms
55,708 KB |
testcase_32 | AC | 125 ms
55,796 KB |
testcase_33 | AC | 150 ms
55,696 KB |
testcase_34 | AC | 156 ms
55,640 KB |
testcase_35 | AC | 159 ms
55,708 KB |
testcase_36 | AC | 169 ms
55,644 KB |
testcase_37 | AC | 166 ms
55,924 KB |
testcase_38 | AC | 158 ms
55,708 KB |
testcase_39 | AC | 157 ms
55,788 KB |
testcase_40 | AC | 119 ms
55,664 KB |
testcase_41 | AC | 119 ms
55,908 KB |
testcase_42 | AC | 122 ms
55,436 KB |
ソースコード
import java.util.Arrays; import java.util.Scanner; public class Main_origin { MyScanner sc = new MyScanner(); Scanner sc2 = new Scanner(System.in); final int M = 1000000000; int[] dx = { 1, 0, 0, -1 }; int[] dy = { 0, 1, -1, 0 }; void run() { StringBuilder s = new StringBuilder(sc.next()); if (palindrome(s.toString())) { if (s.length() % 2 == 0) s.insert(s.length() / 2, "y"); else s.insert(s.length() / 2, s.charAt(s.length() / 2)); System.out.println(s); return; } int l = 0; int r = s.length() - 1; boolean add = false; while (l <= r) { if (s.charAt(l) != s.charAt(r)) { if (add) { System.out.println("NA"); return; } if ((r - l) <= 1) { s.insert(r + 1, s.charAt(l)); } else { if (s.charAt(l) == s.charAt(r - 1)) { s.insert(l, s.charAt(r)); l++; } else if (s.charAt(l + 1) == s.charAt(r)) { s.insert(r + 1, s.charAt(l)); r++; } else { System.out.println("NA"); return; } } add = true; } l++; r--; } System.out.println(s); } public static void main(String[] args) { new Main_origin().run(); } void debug(Object... o) { System.out.println(Arrays.deepToString(o)); } void debug2(char[][] array) { for (int i = 0; i < array.length; i++) { for (int j = 0; j < array[i].length; j++) { System.out.print(array[i][j]); } System.out.println(); } } boolean inner(int h, int w, int limH, int limW) { return 0 <= h && h < limH && 0 <= w && w < limW; } void swap(int[] x, int a, int b) { int tmp = x[a]; x[a] = x[b]; x[b] = tmp; } // find minimum i (a[i] >= border) int lower_bound(int a[], int border) { int l = -1; int r = a.length; while (r - l > 1) { int mid = (l + r) / 2; if (border <= a[mid]) { r = mid; } else { l = mid; } } // r = l + 1 return r; } boolean palindrome(String s) { for (int i = 0; i < s.length() / 2; i++) { if (s.charAt(i) != s.charAt(s.length() - 1 - i)) { return false; } } return true; } class MyScanner { int nextInt() { try { int c = System.in.read(); while (c != '-' && (c < '0' || '9' < c)) c = System.in.read(); if (c == '-') return -nextInt(); int res = 0; do { res *= 10; res += c - '0'; c = System.in.read(); } while ('0' <= c && c <= '9'); return res; } catch (Exception e) { return -1; } } double nextDouble() { return Double.parseDouble(next()); } long nextLong() { return Long.parseLong(next()); } String next() { try { StringBuilder res = new StringBuilder(""); int c = System.in.read(); while (Character.isWhitespace(c)) c = System.in.read(); do { res.append((char) c); } while (!Character.isWhitespace(c = System.in.read())); return res.toString(); } catch (Exception e) { return null; } } int[] nextIntArray(int n) { int[] in = new int[n]; for (int i = 0; i < n; i++) { in[i] = nextInt(); } return in; } int[][] nextInt2dArray(int n, int m) { int[][] in = new int[n][m]; for (int i = 0; i < n; i++) { in[i] = nextIntArray(m); } return in; } double[] nextDoubleArray(int n) { double[] in = new double[n]; for (int i = 0; i < n; i++) { in[i] = nextDouble(); } return in; } long[] nextLongArray(int n) { long[] in = new long[n]; for (int i = 0; i < n; i++) { in[i] = nextLong(); } return in; } char[][] nextCharField(int n, int m) { char[][] in = new char[n][m]; for (int i = 0; i < n; i++) { String s = sc.next(); for (int j = 0; j < m; j++) { in[i][j] = s.charAt(j); } } return in; } } }