結果
問題 | No.1990 Candy Boxes |
ユーザー | mkawa2 |
提出日時 | 2022-06-25 09:11:19 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,659 bytes |
コンパイル時間 | 462 ms |
コンパイル使用メモリ | 87,312 KB |
実行使用メモリ | 121,116 KB |
最終ジャッジ日時 | 2023-08-12 23:14:12 |
合計ジャッジ時間 | 13,751 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge10 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 74 ms
71,400 KB |
testcase_01 | AC | 74 ms
70,924 KB |
testcase_02 | AC | 71 ms
71,032 KB |
testcase_03 | AC | 74 ms
71,216 KB |
testcase_04 | AC | 74 ms
71,084 KB |
testcase_05 | AC | 73 ms
71,104 KB |
testcase_06 | AC | 73 ms
71,284 KB |
testcase_07 | AC | 73 ms
71,076 KB |
testcase_08 | AC | 73 ms
71,128 KB |
testcase_09 | AC | 72 ms
71,304 KB |
testcase_10 | AC | 73 ms
71,092 KB |
testcase_11 | AC | 75 ms
71,100 KB |
testcase_12 | AC | 111 ms
94,928 KB |
testcase_13 | AC | 112 ms
94,756 KB |
testcase_14 | AC | 94 ms
91,800 KB |
testcase_15 | AC | 101 ms
95,936 KB |
testcase_16 | AC | 100 ms
96,220 KB |
testcase_17 | AC | 102 ms
99,020 KB |
testcase_18 | AC | 101 ms
98,892 KB |
testcase_19 | AC | 102 ms
97,336 KB |
testcase_20 | AC | 109 ms
100,460 KB |
testcase_21 | AC | 107 ms
100,040 KB |
testcase_22 | AC | 97 ms
92,472 KB |
testcase_23 | AC | 107 ms
94,144 KB |
testcase_24 | AC | 104 ms
93,704 KB |
testcase_25 | AC | 117 ms
104,104 KB |
testcase_26 | AC | 215 ms
102,788 KB |
testcase_27 | AC | 214 ms
102,976 KB |
testcase_28 | AC | 300 ms
106,232 KB |
testcase_29 | AC | 219 ms
105,924 KB |
testcase_30 | AC | 234 ms
99,116 KB |
testcase_31 | AC | 228 ms
106,008 KB |
testcase_32 | AC | 177 ms
90,836 KB |
testcase_33 | AC | 202 ms
99,568 KB |
testcase_34 | AC | 139 ms
103,344 KB |
testcase_35 | AC | 152 ms
103,268 KB |
testcase_36 | AC | 153 ms
103,340 KB |
testcase_37 | AC | 220 ms
102,632 KB |
testcase_38 | AC | 201 ms
97,540 KB |
testcase_39 | AC | 199 ms
99,804 KB |
testcase_40 | AC | 214 ms
102,408 KB |
testcase_41 | AC | 205 ms
102,376 KB |
testcase_42 | AC | 180 ms
102,132 KB |
testcase_43 | AC | 183 ms
97,500 KB |
testcase_44 | AC | 185 ms
94,656 KB |
testcase_45 | AC | 98 ms
96,184 KB |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | AC | 73 ms
71,136 KB |
testcase_50 | AC | 73 ms
71,620 KB |
testcase_51 | AC | 73 ms
71,392 KB |
testcase_52 | AC | 74 ms
71,264 KB |
testcase_53 | AC | 75 ms
71,196 KB |
testcase_54 | AC | 76 ms
71,296 KB |
testcase_55 | AC | 75 ms
71,400 KB |
testcase_56 | AC | 76 ms
71,364 KB |
testcase_57 | AC | 75 ms
71,328 KB |
testcase_58 | AC | 75 ms
71,260 KB |
testcase_59 | AC | 74 ms
71,376 KB |
testcase_60 | AC | 75 ms
71,128 KB |
testcase_61 | AC | 75 ms
71,032 KB |
testcase_62 | AC | 75 ms
70,924 KB |
testcase_63 | AC | 76 ms
71,160 KB |
testcase_64 | AC | 74 ms
71,072 KB |
testcase_65 | WA | - |
testcase_66 | WA | - |
testcase_67 | AC | 159 ms
103,040 KB |
testcase_68 | AC | 197 ms
93,248 KB |
testcase_69 | AC | 127 ms
103,388 KB |
testcase_70 | WA | - |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | AC | 116 ms
99,288 KB |
testcase_74 | WA | - |
testcase_75 | AC | 98 ms
96,448 KB |
ソースコード
import sys sys.setrecursionlimit(200005) int1 = lambda x: int(x)-1 pDB = 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+7 md = 998244353 from heapq import * n = II() aa = [0]+LI() now = 0 for i in range(n): now = aa[i+1]-now if 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): d = max(1, dd[i]) dd[j] += d dd[i] -= d for i in range(n-1): if dd[i] & 1 == 0: continue if dd[i+1] & 1 == 0: d = dd[i] dd[i] -= d dd[i+2] += d else: 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) def ng(si): now = 0 for i in range(si, n, 2): now += dd[i] if now < 0: return True return False print("No" if ng(0) or ng(1) or dd[-2] else "Yes")