結果
問題 | No.929 よくあるボールを移動するやつ |
ユーザー | McGregorsh |
提出日時 | 2022-07-06 10:23:26 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,475 bytes |
コンパイル時間 | 297 ms |
コンパイル使用メモリ | 87,108 KB |
実行使用メモリ | 110,080 KB |
最終ジャッジ日時 | 2023-08-23 06:37:19 |
合計ジャッジ時間 | 5,949 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 242 ms
92,748 KB |
testcase_01 | AC | 240 ms
92,816 KB |
testcase_02 | AC | 241 ms
92,716 KB |
testcase_03 | AC | 239 ms
92,876 KB |
testcase_04 | AC | 242 ms
92,720 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | AC | 286 ms
108,236 KB |
testcase_14 | AC | 283 ms
108,248 KB |
testcase_15 | AC | 293 ms
107,920 KB |
ソースコード
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()) B = i_list() two = [] for i in range(n): if B[i] >= 2: two.append(i) ans = 0 for i in range(n): if B[i] == 0: point = bisect_right(two, i) num1 = INF num2 = INF if point == 0: num2 = abs(two[point] - i) elif 1 <= point < len(two): num1 = abs(two[point] - i) num2 = abs(two[point-1] - i) elif point == len(two): num1 = abs(two[point-1] - i) ans += min(num1, num2) if num1 == INF and num2 != INF: B[two[point]] -= 1 if B[two[point]] == 0: two.pop(point) if num1 != INF and num2 == INF: B[two[point-1]] -= 1 if B[two[point-1]] == 0: two.pop(point-1) if num1 != INF and num2 != INF: if num1 >= num2: B[two[point-1]] -= 1 if B[two[point-1]] == 0: two.pop(point-1) else: B[two[point]] -= 1 if B[two[point]] == 0: two.pop(point) print(ans) if __name__ == '__main__': main()