結果
問題 | No.921 ずんだアロー |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 09:19:14 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,054 bytes |
コンパイル時間 | 885 ms |
コンパイル使用メモリ | 87,008 KB |
実行使用メモリ | 108,104 KB |
最終ジャッジ日時 | 2023-08-23 05:33:40 |
合計ジャッジ時間 | 8,990 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 235 ms
92,920 KB |
testcase_01 | AC | 235 ms
92,600 KB |
testcase_02 | AC | 237 ms
92,716 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 233 ms
92,924 KB |
testcase_07 | AC | 233 ms
92,904 KB |
testcase_08 | AC | 234 ms
92,920 KB |
testcase_09 | AC | 232 ms
92,920 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 239 ms
94,196 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 247 ms
99,480 KB |
testcase_16 | AC | 232 ms
93,640 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | AC | 255 ms
107,692 KB |
testcase_24 | WA | - |
ソースコード
import sys, re 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(): n = int(input()) a = i_list() juge = [False] * n for i in range(n-1): if a[i] == a[i+1]: juge[i] = True juge[i+1] = True nums = [] left = 0 right = 0 cou = 0 for i in range(n): if juge[i] == False and cou == 0: left = i cou += 1 if juge[i] and cou == 1: right = i-1 cou = 0 nums.append([left, right]) if len(nums) == 0: if n % 2 == 1: print(n // 2 + 1) exit() else: print(n // 2) exit() #print(nums) ans = sum(juge) for i in range(len(nums)): score = max(0, (nums[i][1] - nums[i][0] + 1) - 2) ans += score // 2 print(ans) if __name__ == '__main__': main()