結果
問題 | No.1290 Addition and Subtraction Operation |
ユーザー | tamato |
提出日時 | 2020-11-13 23:25:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 228 ms / 2,000 ms |
コード長 | 1,338 bytes |
コンパイル時間 | 439 ms |
コンパイル使用メモリ | 87,288 KB |
実行使用メモリ | 107,168 KB |
最終ジャッジ日時 | 2023-09-30 04:19:04 |
合計ジャッジ時間 | 14,890 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 77 ms
71,824 KB |
testcase_01 | AC | 80 ms
71,756 KB |
testcase_02 | AC | 77 ms
71,988 KB |
testcase_03 | AC | 80 ms
71,752 KB |
testcase_04 | AC | 83 ms
71,892 KB |
testcase_05 | AC | 75 ms
71,784 KB |
testcase_06 | AC | 80 ms
71,868 KB |
testcase_07 | AC | 83 ms
71,704 KB |
testcase_08 | AC | 83 ms
71,816 KB |
testcase_09 | AC | 86 ms
71,728 KB |
testcase_10 | AC | 82 ms
71,628 KB |
testcase_11 | AC | 85 ms
71,908 KB |
testcase_12 | AC | 81 ms
71,956 KB |
testcase_13 | AC | 83 ms
71,856 KB |
testcase_14 | AC | 81 ms
71,884 KB |
testcase_15 | AC | 80 ms
71,440 KB |
testcase_16 | AC | 81 ms
71,844 KB |
testcase_17 | AC | 90 ms
71,904 KB |
testcase_18 | AC | 80 ms
71,640 KB |
testcase_19 | AC | 79 ms
71,744 KB |
testcase_20 | AC | 79 ms
71,788 KB |
testcase_21 | AC | 78 ms
71,744 KB |
testcase_22 | AC | 79 ms
71,752 KB |
testcase_23 | AC | 80 ms
71,476 KB |
testcase_24 | AC | 78 ms
71,420 KB |
testcase_25 | AC | 79 ms
71,860 KB |
testcase_26 | AC | 78 ms
71,480 KB |
testcase_27 | AC | 82 ms
71,792 KB |
testcase_28 | AC | 84 ms
71,860 KB |
testcase_29 | AC | 78 ms
71,656 KB |
testcase_30 | AC | 78 ms
71,472 KB |
testcase_31 | AC | 76 ms
71,736 KB |
testcase_32 | AC | 76 ms
71,460 KB |
testcase_33 | AC | 81 ms
71,820 KB |
testcase_34 | AC | 76 ms
71,840 KB |
testcase_35 | AC | 80 ms
71,916 KB |
testcase_36 | AC | 77 ms
71,808 KB |
testcase_37 | AC | 82 ms
71,920 KB |
testcase_38 | AC | 79 ms
71,736 KB |
testcase_39 | AC | 77 ms
71,764 KB |
testcase_40 | AC | 79 ms
71,872 KB |
testcase_41 | AC | 78 ms
71,992 KB |
testcase_42 | AC | 115 ms
78,420 KB |
testcase_43 | AC | 101 ms
78,468 KB |
testcase_44 | AC | 99 ms
78,388 KB |
testcase_45 | AC | 99 ms
78,240 KB |
testcase_46 | AC | 103 ms
78,452 KB |
testcase_47 | AC | 104 ms
78,396 KB |
testcase_48 | AC | 104 ms
78,584 KB |
testcase_49 | AC | 109 ms
78,580 KB |
testcase_50 | AC | 103 ms
78,724 KB |
testcase_51 | AC | 101 ms
78,372 KB |
testcase_52 | AC | 101 ms
78,064 KB |
testcase_53 | AC | 107 ms
78,376 KB |
testcase_54 | AC | 102 ms
78,580 KB |
testcase_55 | AC | 106 ms
78,252 KB |
testcase_56 | AC | 104 ms
78,328 KB |
testcase_57 | AC | 151 ms
106,460 KB |
testcase_58 | AC | 156 ms
106,344 KB |
testcase_59 | AC | 141 ms
106,396 KB |
testcase_60 | AC | 208 ms
106,340 KB |
testcase_61 | AC | 191 ms
106,660 KB |
testcase_62 | AC | 199 ms
106,220 KB |
testcase_63 | AC | 150 ms
106,076 KB |
testcase_64 | AC | 122 ms
100,044 KB |
testcase_65 | AC | 139 ms
100,264 KB |
testcase_66 | AC | 157 ms
106,408 KB |
testcase_67 | AC | 216 ms
106,172 KB |
testcase_68 | AC | 161 ms
106,308 KB |
testcase_69 | AC | 146 ms
106,028 KB |
testcase_70 | AC | 144 ms
106,332 KB |
testcase_71 | AC | 148 ms
106,404 KB |
testcase_72 | AC | 129 ms
100,264 KB |
testcase_73 | AC | 152 ms
106,072 KB |
testcase_74 | AC | 119 ms
100,060 KB |
testcase_75 | AC | 128 ms
100,428 KB |
testcase_76 | AC | 146 ms
106,376 KB |
testcase_77 | AC | 222 ms
107,168 KB |
testcase_78 | AC | 213 ms
106,684 KB |
testcase_79 | AC | 202 ms
106,752 KB |
testcase_80 | AC | 223 ms
106,932 KB |
testcase_81 | AC | 228 ms
107,024 KB |
testcase_82 | AC | 163 ms
106,964 KB |
testcase_83 | AC | 212 ms
106,944 KB |
testcase_84 | AC | 167 ms
106,660 KB |
testcase_85 | AC | 161 ms
106,664 KB |
testcase_86 | AC | 128 ms
100,968 KB |
ソースコード
mod = 1000000007 eps = 10**-9 def main(): import sys from collections import deque input = sys.stdin.buffer.readline N, M = map(int, input().split()) B = list(map(int, input().split())) B = [b * (-1)**i for i, b in enumerate(B)] C = [0] * (N+1) C[0] = B[0] for i in range(1, N): C[i] = B[i] - B[i-1] C[N] = -B[-1] adj = [[] for _ in range(N + 1)] for _ in range(M): l, r = map(int, input().split()) l -= 1 r -= 1 adj[l].append(r+1) adj[r+1].append(l) seen = [0] * (N+1) par = [-1] * (N+1) dp = [0] * (N+1) for v0 in range(N+1): if seen[v0]: continue que = deque() que.append(v0) seen[v0] = 1 seq = [] while que: v = que.popleft() seq.append(v) for u in adj[v]: if not seen[u]: par[u] = v que.append(u) seen[u] = 1 seq.reverse() for v in seq: if v != v0: x = C[v] - dp[v] dp[v] += x dp[par[v]] -= x else: if dp[v] != C[v]: print("NO") exit() print("YES") if __name__ == '__main__': main()