結果
問題 | No.1990 Candy Boxes |
ユーザー |
![]() |
提出日時 | 2022-06-25 10:53:22 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 273 ms / 2,000 ms |
コード長 | 1,578 bytes |
コンパイル時間 | 326 ms |
コンパイル使用メモリ | 82,048 KB |
実行使用メモリ | 126,336 KB |
最終ジャッジ日時 | 2024-11-20 15:37:06 |
合計ジャッジ時間 | 10,715 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 5 |
other | AC * 71 |
ソースコード
import syssys.setrecursionlimit(200005)int1 = lambda x: int(x)-1pDB = lambda *x: print(*x, end="\n", file=sys.stderr)p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)def II(): return int(sys.stdin.readline())def LI(): return list(map(int, sys.stdin.readline().split()))def LLI(rows_number): return [LI() for _ in range(rows_number)]def LI1(): return list(map(int1, sys.stdin.readline().split()))def LLI1(rows_number): return [LI1() for _ in range(rows_number)]def SI(): return sys.stdin.readline().rstrip()dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]inf = (1 << 63)-1# inf = (1 << 31)-1# md = 10**9+7md = 998244353from heapq import *n = II()aa = [0]+LI()now = 0for i in range(n):now = aa[i+1]-nowif now < 0:print("No")exit()if now:print("No")exit()q = []dd = []for i in range(n):dd.append(aa[i+1]-aa[i])if dd[-1] & 1 == 0: heappush(q, i)dd.append(0)# pDB(q, dd)def move(i,j):dd[j] += 1dd[i] -= 1for i in range(n-1):if dd[i] & 1 == 0: continueif dd[i+1] & 1 == 0:d = dd[i]dd[i] -= ddd[i+2] += delse:while q and (q[0] <= i or dd[q[0]] & 1): heappop(q)if not q:print("No")exit()j = q[0]if dd[j+1] & 1: heappush(q, j+1)move(i,j)move(i+1,j+1)# pDB(q, dd)for i in range(n-1):if dd[i]<0:print("No")exit()dd[i+2]+=dd[i]# print(dd)print("Yes")