結果
問題 | No.1222 -101 |
ユーザー | chineristAC |
提出日時 | 2020-10-08 23:26:26 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,319 ms / 2,000 ms |
コード長 | 2,081 bytes |
コンパイル時間 | 522 ms |
コンパイル使用メモリ | 87,000 KB |
実行使用メモリ | 142,132 KB |
最終ジャッジ日時 | 2023-09-27 12:06:10 |
合計ジャッジ時間 | 17,850 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 71 ms
71,320 KB |
testcase_01 | AC | 69 ms
71,296 KB |
testcase_02 | AC | 75 ms
75,592 KB |
testcase_03 | AC | 71 ms
71,372 KB |
testcase_04 | AC | 72 ms
71,240 KB |
testcase_05 | AC | 71 ms
71,292 KB |
testcase_06 | AC | 68 ms
71,336 KB |
testcase_07 | AC | 69 ms
71,216 KB |
testcase_08 | AC | 68 ms
71,320 KB |
testcase_09 | AC | 71 ms
71,432 KB |
testcase_10 | AC | 212 ms
101,180 KB |
testcase_11 | AC | 190 ms
100,208 KB |
testcase_12 | AC | 769 ms
125,092 KB |
testcase_13 | AC | 763 ms
125,100 KB |
testcase_14 | AC | 787 ms
125,168 KB |
testcase_15 | AC | 610 ms
117,756 KB |
testcase_16 | AC | 714 ms
120,592 KB |
testcase_17 | AC | 802 ms
124,480 KB |
testcase_18 | AC | 608 ms
114,048 KB |
testcase_19 | AC | 681 ms
118,028 KB |
testcase_20 | AC | 734 ms
120,548 KB |
testcase_21 | AC | 707 ms
119,368 KB |
testcase_22 | AC | 68 ms
71,560 KB |
testcase_23 | AC | 70 ms
71,412 KB |
testcase_24 | AC | 70 ms
71,408 KB |
testcase_25 | AC | 69 ms
71,516 KB |
testcase_26 | AC | 72 ms
71,152 KB |
testcase_27 | AC | 73 ms
71,304 KB |
testcase_28 | AC | 72 ms
71,096 KB |
testcase_29 | AC | 72 ms
71,360 KB |
testcase_30 | AC | 73 ms
71,260 KB |
testcase_31 | AC | 73 ms
71,036 KB |
testcase_32 | AC | 381 ms
106,592 KB |
testcase_33 | AC | 384 ms
106,804 KB |
testcase_34 | AC | 1,312 ms
141,760 KB |
testcase_35 | AC | 1,319 ms
142,108 KB |
testcase_36 | AC | 894 ms
141,824 KB |
testcase_37 | AC | 866 ms
142,132 KB |
testcase_38 | AC | 901 ms
141,944 KB |
ソースコード
import heapq import sys mod = 10**9+7 class BIT(): def __init__(self,n): self.BIT=[0]*(n+1) self.num=n def query(self,idx): res_sum = 0 while idx > 0: res_sum += self.BIT[idx] idx -= idx&(-idx) return res_sum #Ai += x O(logN) def update(self,idx,x): while idx <= self.num: self.BIT[idx] += x idx += idx&(-idx) return input = sys.stdin.readline N,M = map(int,input().split()) cond = [None for i in range(N+1)] for _ in range(M): l,r,p = map(int,input().split()) cond[r] = (l,p) left = [N+1 for i in range(N+1)] pos = -1 for i in range(1,N+1): if cond[i]: l,p = cond[i] if p == 0: for j in range(pos+1,l): left[j] = i pos = max(l-1,pos) right = [N+1 for i in range(N+1)] que = [] query = [] for i in range(1,N+1): query.append((i,10**9)) if cond[i] and cond[i][1] != 0: query.append((cond[i][0],i)) query.append((i,-i)) query.sort() erase = [False]*(N+1) for a,b in query: if b<0: erase[-b] = True elif b==10**9: while que and erase[que[0]]: heapq.heappop(que) if que: right[a] = que[0] else: heapq.heappush(que,b) erase = [[] for i in range(N+1)] for i in range(N+1): if min(left[i],right[i])!=N+1: t = min(left[i],right[i]) erase[t].append(i) bit = BIT(N+1) dp = [0 for i in range(N+1)] dp[0] = 1 S = 1 for i in range(1,N+1): #print(S) if cond[i]: l,p = cond[i] if p==0: dp[i] = S for v in erase[i]: S -= dp[v] * pow(2,bit.query(v+1),mod) S %= mod bit.update(l+1,1) bit.update(i+1,-1) S = (2*S + dp[i]) % mod else: for v in erase[i]: S -= dp[v] * pow(2,bit.query(v+1),mod) S %= mod else: dp[i] = S S *= 3 S %= mod bit.update(1,1) bit.update(i+1,-1) print(S)