結果
問題 | No.1617 Palindrome Removal |
ユーザー | McGregorsh |
提出日時 | 2023-05-21 22:32:07 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 349 ms / 2,000 ms |
コード長 | 1,659 bytes |
コンパイル時間 | 274 ms |
コンパイル使用メモリ | 87,252 KB |
実行使用メモリ | 148,792 KB |
最終ジャッジ日時 | 2023-08-23 15:15:57 |
合計ジャッジ時間 | 9,526 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 275 ms
119,592 KB |
testcase_01 | AC | 275 ms
120,256 KB |
testcase_02 | AC | 337 ms
146,184 KB |
testcase_03 | AC | 330 ms
145,688 KB |
testcase_04 | AC | 339 ms
148,516 KB |
testcase_05 | AC | 319 ms
137,332 KB |
testcase_06 | AC | 296 ms
128,040 KB |
testcase_07 | AC | 272 ms
119,568 KB |
testcase_08 | AC | 234 ms
92,368 KB |
testcase_09 | AC | 234 ms
92,492 KB |
testcase_10 | AC | 341 ms
144,804 KB |
testcase_11 | AC | 326 ms
137,492 KB |
testcase_12 | AC | 349 ms
148,792 KB |
testcase_13 | AC | 348 ms
148,760 KB |
testcase_14 | AC | 233 ms
92,588 KB |
testcase_15 | AC | 233 ms
92,412 KB |
testcase_16 | AC | 229 ms
92,460 KB |
testcase_17 | AC | 229 ms
92,372 KB |
testcase_18 | AC | 230 ms
92,368 KB |
testcase_19 | AC | 227 ms
92,420 KB |
testcase_20 | AC | 224 ms
92,544 KB |
testcase_21 | AC | 225 ms
92,428 KB |
testcase_22 | AC | 226 ms
92,368 KB |
testcase_23 | AC | 225 ms
92,496 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, ROUND_HALF_UP 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()) lenS = len(S) if len(set(S)) == 1: if lenS % 2 == 0: print(0) else: print(-1) exit() if S != S[::-1]: print(lenS) exit() if lenS >= 4: print(lenS-2) else: if lenS == 3: print(-1) if __name__ == '__main__': main()