結果
問題 | No.1990 Candy Boxes |
ユーザー | mkawa2 |
提出日時 | 2022-06-25 08:58:36 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,503 bytes |
コンパイル時間 | 821 ms |
コンパイル使用メモリ | 87,052 KB |
実行使用メモリ | 127,740 KB |
最終ジャッジ日時 | 2023-08-12 23:13:33 |
合計ジャッジ時間 | 15,218 ms |
ジャッジサーバーID (参考情報) |
judge8 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
71,024 KB |
testcase_01 | AC | 71 ms
71,240 KB |
testcase_02 | AC | 74 ms
71,076 KB |
testcase_03 | WA | - |
testcase_04 | AC | 74 ms
71,180 KB |
testcase_05 | WA | - |
testcase_06 | AC | 73 ms
71,276 KB |
testcase_07 | WA | - |
testcase_08 | AC | 76 ms
71,364 KB |
testcase_09 | AC | 75 ms
71,436 KB |
testcase_10 | AC | 74 ms
71,320 KB |
testcase_11 | WA | - |
testcase_12 | AC | 118 ms
94,716 KB |
testcase_13 | AC | 111 ms
95,004 KB |
testcase_14 | AC | 186 ms
103,080 KB |
testcase_15 | AC | 184 ms
97,776 KB |
testcase_16 | AC | 190 ms
97,872 KB |
testcase_17 | AC | 197 ms
99,384 KB |
testcase_18 | AC | 201 ms
99,896 KB |
testcase_19 | AC | 189 ms
98,784 KB |
testcase_20 | AC | 195 ms
100,452 KB |
testcase_21 | AC | 199 ms
100,748 KB |
testcase_22 | AC | 194 ms
95,440 KB |
testcase_23 | AC | 192 ms
108,380 KB |
testcase_24 | AC | 222 ms
108,316 KB |
testcase_25 | AC | 239 ms
127,740 KB |
testcase_26 | AC | 194 ms
102,524 KB |
testcase_27 | AC | 196 ms
102,596 KB |
testcase_28 | AC | 254 ms
106,300 KB |
testcase_29 | AC | 199 ms
105,604 KB |
testcase_30 | AC | 221 ms
99,116 KB |
testcase_31 | AC | 209 ms
106,028 KB |
testcase_32 | AC | 169 ms
100,360 KB |
testcase_33 | AC | 190 ms
99,408 KB |
testcase_34 | AC | 136 ms
103,472 KB |
testcase_35 | AC | 146 ms
103,416 KB |
testcase_36 | AC | 144 ms
103,656 KB |
testcase_37 | AC | 203 ms
102,956 KB |
testcase_38 | AC | 182 ms
97,656 KB |
testcase_39 | AC | 190 ms
99,812 KB |
testcase_40 | AC | 204 ms
102,764 KB |
testcase_41 | AC | 196 ms
102,140 KB |
testcase_42 | AC | 172 ms
102,232 KB |
testcase_43 | AC | 168 ms
97,644 KB |
testcase_44 | AC | 175 ms
94,988 KB |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | AC | 72 ms
71,324 KB |
testcase_50 | AC | 68 ms
71,384 KB |
testcase_51 | AC | 70 ms
71,476 KB |
testcase_52 | WA | - |
testcase_53 | AC | 69 ms
71,484 KB |
testcase_54 | WA | - |
testcase_55 | AC | 70 ms
71,372 KB |
testcase_56 | AC | 68 ms
71,472 KB |
testcase_57 | WA | - |
testcase_58 | WA | - |
testcase_59 | WA | - |
testcase_60 | AC | 70 ms
71,188 KB |
testcase_61 | AC | 70 ms
71,460 KB |
testcase_62 | AC | 71 ms
71,480 KB |
testcase_63 | AC | 69 ms
71,464 KB |
testcase_64 | AC | 70 ms
71,396 KB |
testcase_65 | AC | 161 ms
113,192 KB |
testcase_66 | WA | - |
testcase_67 | AC | 149 ms
103,416 KB |
testcase_68 | AC | 178 ms
103,008 KB |
testcase_69 | AC | 123 ms
103,020 KB |
testcase_70 | AC | 140 ms
110,796 KB |
testcase_71 | WA | - |
testcase_72 | WA | - |
testcase_73 | AC | 227 ms
120,396 KB |
testcase_74 | WA | - |
testcase_75 | AC | 201 ms
97,608 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() 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) # print(q, dd) 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[i+1] & 1 and dd[j+1] & 1: heappush(q, j+1) dd[j] += dd[i] dd[j+1] += dd[i+1] dd[i] = dd[i+1] = 0 # print(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) else "Yes")