結果
問題 | No.1053 ゲーミング棒 |
ユーザー | McGregorsh |
提出日時 | 2023-07-12 21:09:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 289 ms / 2,000 ms |
コード長 | 2,047 bytes |
コンパイル時間 | 845 ms |
コンパイル使用メモリ | 86,832 KB |
実行使用メモリ | 112,408 KB |
最終ジャッジ日時 | 2023-10-12 11:11:27 |
合計ジャッジ時間 | 13,369 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 250 ms
90,000 KB |
testcase_01 | AC | 243 ms
89,928 KB |
testcase_02 | AC | 246 ms
89,972 KB |
testcase_03 | AC | 242 ms
90,024 KB |
testcase_04 | AC | 245 ms
90,080 KB |
testcase_05 | AC | 246 ms
90,036 KB |
testcase_06 | AC | 245 ms
89,944 KB |
testcase_07 | AC | 244 ms
89,984 KB |
testcase_08 | AC | 246 ms
89,772 KB |
testcase_09 | AC | 249 ms
90,144 KB |
testcase_10 | AC | 246 ms
89,944 KB |
testcase_11 | AC | 242 ms
89,960 KB |
testcase_12 | AC | 246 ms
89,916 KB |
testcase_13 | AC | 245 ms
89,968 KB |
testcase_14 | AC | 246 ms
89,996 KB |
testcase_15 | AC | 244 ms
89,984 KB |
testcase_16 | AC | 242 ms
90,064 KB |
testcase_17 | AC | 248 ms
89,732 KB |
testcase_18 | AC | 247 ms
90,148 KB |
testcase_19 | AC | 243 ms
89,688 KB |
testcase_20 | AC | 243 ms
90,072 KB |
testcase_21 | AC | 244 ms
90,000 KB |
testcase_22 | AC | 244 ms
90,148 KB |
testcase_23 | AC | 280 ms
112,148 KB |
testcase_24 | AC | 289 ms
112,408 KB |
testcase_25 | AC | 265 ms
105,380 KB |
testcase_26 | AC | 264 ms
105,664 KB |
testcase_27 | AC | 251 ms
89,756 KB |
testcase_28 | AC | 248 ms
89,692 KB |
testcase_29 | AC | 245 ms
90,020 KB |
testcase_30 | AC | 265 ms
103,340 KB |
testcase_31 | AC | 265 ms
103,092 KB |
testcase_32 | AC | 265 ms
103,408 KB |
testcase_33 | AC | 262 ms
103,340 KB |
testcase_34 | AC | 267 ms
103,176 KB |
testcase_35 | AC | 264 ms
104,264 KB |
testcase_36 | AC | 265 ms
104,192 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math 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, lru_cache from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N = int(input()) A = i_list() s = 0 for i in range(N-1): a, b = A[i], A[i+1] if a != b: s = i break t = 0 for i in range(N-1, 0, -1): a, b = A[i], A[i-1] if a != b: t = i break if s < t: if A[s] in A[s+1:t] or A[t] in A[s+1:t]: print(-1) else: if A[s] != A[t]: nums = [[] for i in range(N+1)] for i in range(s, t+1): nums[A[i]].append(i) for i in range(N+1): for j in range(len(nums[i])-1): a, b = nums[i][j], nums[i][j+1] if a + 1 != b: print(-1) exit() print(0) else: print(1) else: print(0) if __name__ == '__main__': main()