結果
問題 | No.1765 While Shining |
ユーザー | McGregorsh |
提出日時 | 2022-07-26 21:36:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 291 ms / 2,000 ms |
コード長 | 2,006 bytes |
コンパイル時間 | 305 ms |
コンパイル使用メモリ | 87,188 KB |
実行使用メモリ | 123,200 KB |
最終ジャッジ日時 | 2023-09-23 12:02:22 |
合計ジャッジ時間 | 10,246 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 238 ms
92,416 KB |
testcase_01 | AC | 229 ms
92,496 KB |
testcase_02 | AC | 230 ms
92,272 KB |
testcase_03 | AC | 225 ms
92,312 KB |
testcase_04 | AC | 228 ms
92,288 KB |
testcase_05 | AC | 228 ms
92,476 KB |
testcase_06 | AC | 229 ms
92,364 KB |
testcase_07 | AC | 227 ms
92,484 KB |
testcase_08 | AC | 237 ms
92,396 KB |
testcase_09 | AC | 272 ms
110,976 KB |
testcase_10 | AC | 288 ms
122,628 KB |
testcase_11 | AC | 291 ms
116,228 KB |
testcase_12 | AC | 282 ms
119,208 KB |
testcase_13 | AC | 280 ms
116,476 KB |
testcase_14 | AC | 284 ms
122,640 KB |
testcase_15 | AC | 289 ms
122,884 KB |
testcase_16 | AC | 284 ms
122,872 KB |
testcase_17 | AC | 283 ms
122,776 KB |
testcase_18 | AC | 291 ms
122,664 KB |
testcase_19 | AC | 289 ms
122,632 KB |
testcase_20 | AC | 282 ms
122,644 KB |
testcase_21 | AC | 289 ms
122,964 KB |
testcase_22 | AC | 285 ms
122,852 KB |
testcase_23 | AC | 285 ms
123,200 KB |
testcase_24 | AC | 270 ms
122,816 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(): n = int(input()) a = i_list() count = [0] * n point = 0 while point < n-1: if a[point] == 0: point += 1 continue else: now = 1 cou = 0 for i in range(point, n-1): if now == a[i]: cou += 1 else: break now = abs(now-1) cost = cou for j in range(point, n-1, 2): if cou - 2 >= 1: count[j] = cou cou -= 2 else: count[j] = cou break point += cost #print(count) print(sum(count)) if __name__ == '__main__': main()