結果
問題 | No.921 ずんだアロー |
ユーザー | McGregorsh |
提出日時 | 2023-05-17 12:53:41 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,043 bytes |
コンパイル時間 | 340 ms |
コンパイル使用メモリ | 87,156 KB |
実行使用メモリ | 108,592 KB |
最終ジャッジ日時 | 2023-08-21 17:53:23 |
合計ジャッジ時間 | 8,635 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 262 ms
92,588 KB |
testcase_01 | AC | 242 ms
92,452 KB |
testcase_02 | AC | 254 ms
92,392 KB |
testcase_03 | AC | 239 ms
92,388 KB |
testcase_04 | AC | 252 ms
92,580 KB |
testcase_05 | AC | 236 ms
92,444 KB |
testcase_06 | AC | 253 ms
92,600 KB |
testcase_07 | AC | 237 ms
92,584 KB |
testcase_08 | AC | 254 ms
92,696 KB |
testcase_09 | AC | 237 ms
92,436 KB |
testcase_10 | AC | 270 ms
106,604 KB |
testcase_11 | WA | - |
testcase_12 | AC | 249 ms
94,472 KB |
testcase_13 | AC | 262 ms
103,396 KB |
testcase_14 | AC | 259 ms
104,848 KB |
testcase_15 | AC | 255 ms
99,408 KB |
testcase_16 | AC | 250 ms
93,692 KB |
testcase_17 | AC | 269 ms
106,004 KB |
testcase_18 | AC | 272 ms
108,496 KB |
testcase_19 | AC | 270 ms
108,352 KB |
testcase_20 | WA | - |
testcase_21 | AC | 270 ms
108,408 KB |
testcase_22 | AC | 268 ms
108,592 KB |
testcase_23 | AC | 265 ms
108,368 KB |
testcase_24 | AC | 267 ms
108,380 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(): N = int(input()) A = i_list() juge1 = [False] * N for i in range(0, N, 2): juge1[i] = True for i in range(1, N, 2): if i == N-1: if A[i-1] == A[i]: juge1[i] = True else: if A[i-1] == A[i] == A[i+1]: juge1[i] = True juge2 = [False] * N for i in range(1, N, 2): juge2[i] = True for i in range(0, N, 2): if i == 0: if A[i] == A[i+1]: juge2[i] = True elif i == N-1: if A[i-1] == A[i]: juge2[i] = True else: if A[i-1] == A[i] == A[i+1]: juge2[i] = True print(max(sum(juge1), sum(juge2))) if __name__ == '__main__': main()