結果
問題 | No.1617 Palindrome Removal |
ユーザー | McGregorsh |
提出日時 | 2022-07-22 10:48:41 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,742 bytes |
コンパイル時間 | 2,168 ms |
コンパイル使用メモリ | 86,176 KB |
実行使用メモリ | 152,220 KB |
最終ジャッジ日時 | 2023-09-16 17:55:31 |
合計ジャッジ時間 | 11,063 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 339 ms
152,220 KB |
testcase_02 | AC | 338 ms
149,824 KB |
testcase_03 | AC | 331 ms
149,084 KB |
testcase_04 | AC | 344 ms
152,116 KB |
testcase_05 | AC | 321 ms
140,080 KB |
testcase_06 | AC | 281 ms
131,740 KB |
testcase_07 | AC | 269 ms
121,516 KB |
testcase_08 | AC | 236 ms
92,012 KB |
testcase_09 | AC | 236 ms
92,200 KB |
testcase_10 | AC | 339 ms
148,148 KB |
testcase_11 | AC | 324 ms
140,280 KB |
testcase_12 | AC | 345 ms
152,000 KB |
testcase_13 | AC | 344 ms
152,216 KB |
testcase_14 | AC | 240 ms
92,044 KB |
testcase_15 | AC | 235 ms
91,920 KB |
testcase_16 | AC | 236 ms
92,020 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | AC | 244 ms
91,972 KB |
testcase_21 | AC | 236 ms
92,128 KB |
testcase_22 | WA | - |
testcase_23 | AC | 236 ms
92,080 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): s = list(input()) len_s = len(s) if len_s % 2 == 0: mae = s[:len_s//2] usiro = s[len_s//2:] else: mae = s[:len_s//2] usiro = s[len_s//2+1:] if mae != usiro[::-1]: print(len_s) exit() if len(set(s)) == 1: print(0) exit() if len(s) == 1: print(-1) exit() print(len_s - 2) if __name__ == '__main__': main()