input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def c_Sentou(N, T, t):
ans = 0
for i in range(N):
if i == N - 1:
ans += T
continue
ans += min(T, t[i + 1] - t[i])
return ans
N,T = [int(i) for i in input().split()]
t = [int(i) for i in input().split()]
print((c_Sentou(N, T, t))) | def c_sentou(N, T, time):
time.append(float('inf')) # 番兵
ans = 0
for i in range(N):
ans += min(T, time[i + 1] - time[i])
return ans
N,T = [int(i) for i in input().split()]
time = [int(i) for i in input().split()]
print((c_sentou(N, T, time))) | p03731 |
def c_sentou(N, T, Times):
times = Times + [Times[-1] + T] # 番兵を追加(最後の人が押したT秒後に止まる)
return sum([min(T, times[i + 1] - times[i]) for i in range(N)])
N, T = [int(i) for i in input().split()]
Time = [int(i) for i in input().split()]
print((c_sentou(N, T, Time))) | def c_sentou():
N, T = [int(i) for i in input().split()]
Times = [int(i) for i in input().split()] + [float('inf')] # 番兵追加
return sum([min(T, Times[i + 1] - Times[i]) for i in range(N)])
print((c_sentou())) | p03731 |
def resolve():
n,t=list(map(int,input().split()))
T=list(map(int,input().split()))
ans=t
for i in range(1,n):
if T[i]-T[i-1]>t:
ans+=t
else:
ans+=T[i]-T[i-1]
print(ans)
resolve() |
def resolve():
n,t=list(map(int,input().split()))
T=list(map(int,input().split()))
T.append(T[-1]+10**10)
ans=0
for i in range(n):
if T[i+1]-T[i]>t:
ans+=t
else:
ans+=T[i+1]-T[i]
print(ans)
resolve() | p03731 |
import sys
input = sys.stdin.readline
from collections import deque
class Unionfindtree:
def __init__(self, number,L):
self.par = [i for i in range(number)]
self.rank = [0] * (number)
self.count = L
def find(self, x): # 親を探す
if self.par[x] == x:
return x
... | import sys
input = sys.stdin.readline
from collections import deque
class Unionfindtree:
def __init__(self, number,L):
self.par = [i for i in range(number)]
self.rank = [0] * (number)
self.cost = L
self.count = [0] * (number)
def find(self, x): # 親を探す
if self... | p03143 |
from collections import deque
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
EDGE = [list(map(int, input().split())) for i in range(M)]
EDGE.sort(key=lambda x:x[2])
EDGELIST = [[] for i in range(N+1)]
for i in range(M):
x, y, w = EDGE[i]
EDGELIST[x].append(i)
EDGELIST[... | import sys
input = sys.stdin.readline
from collections import deque
N, M = list(map(int, input().split()))
X = list(map(int, input().split()))
EDGE = [list(map(int, input().split())) for i in range(M)]
EDGE.sort(key=lambda x:x[2])
EDGELIST = [[] for i in range(N+1)]
for i in range(M):
x, y, w = EDGE[i]
... | p03143 |
import sys
sys.setrecursionlimit(10**6)
N, M = list(map(int, input().split()))
*X, = list(map(int, input().split()))
E = []
for i in range(M):
a, b, y = list(map(int, input().split()))
E.append((y, a-1, b-1))
E.sort()
*p, = list(range(N))
Z = [0]*M
A = X[:]
C = [-1]*N
def root(x):
if x == ... | from collections import deque
import operator
N, M = list(map(int, input().split()))
*X, = list(map(int, input().split()))
E = []
for i in range(M):
a, b, y = list(map(int, input().split()))
E.append((y, a-1, b-1))
E.sort()
*Y, = list(map(operator.itemgetter(0), E))
*p, = list(range(N))
def root(... | p03143 |
import sys
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self._root(self.table[x])
return self.table[x]
def find(self, x, y):
return... | import sys
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self._root(self.table[x])
return self.table[x]
def find(self, x, y):
return... | p03143 |
class UnionFindVerSize():
def __init__(self, N,init,M):
""" N個のノードのUnion-Find木を作成する """
# 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる
self._parent = [n for n in range(0, N)]
# グループのサイズ（個数）
self._size = [1] * N
self._weight=init
self._set=[[0,0] for i... | class UnionFindVerSize():
def __init__(self, N,init):
""" N個のノードのUnion-Find木を作成する """
# 親の番号を格納する。自分が親だった場合は、自分の番号になり、それがそのグループの番号になる
self._parent = [n for n in range(0, N)]
self._size = [1] *N
# グループのサイズ（個数）
self._weight=init
self._set=[[0,0] for i in... | p03143 |
def main():
import heapq
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
aby = [list(map(int, input().split())) for _ in [0]*m]
aby = [(a-1, b-1, y) for a, b, y in aby]
tree1 = [sum(x)]
tree2 = [0]*n
def Kruskal(n, abc, weight=False):
class u... | def main():
from sys import stdin
input = stdin.readline
import heapq
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
aby = [list(map(int, input().split())) for _ in [0]*m]
aby = [(a-1, b-1, y) for a, b, y in aby]
tree1 = [sum(x)]
tree2 = [0]*n
... | p03143 |
def solve():
MOD = 998244353
N, K = list(map(int, input().split()))
S = set()
for i in range(K):
_l, _r = list(map(int, input().split()))
_s = set(list(range(_l, _r+1)))
S |= _s
# dp[i] : iに到達する経路数
dp = [0] * (N+1)
dp[1] = 1
for i in range(2, N+1):
... |
def solve():
MOD = 998244353
N, K = list(map(int, input().split()))
LR_L = [[int(x) for x in input().split()] for y in range(K)]
# S = set()
# for i in range(K):
# _l, _r = map(int, input().split())
# _s = set(list(range(_l, _r+1)))
# S |= _s
# dp[i] : iに到達する... | p02549 |
N,K=list(map(int,input().split()))
MOD = 998244353
dp = [0]*(N+1)
LR = []
for _ in range(K):
l, r = list(map(int, input().split()))
LR.append((l,r))
LR.sort()
dp[1] = 1
dp_sum = [0]*(N+1) # dp[i]の累積和
dp_sum[1] = 1
for i in range(2, N+1):
for l, r in LR:
if i - l >= 1:
... | N,K=list(map(int,input().split()))
MOD = 998244353
dp = [0]*(N*3)
LR = []
for _ in range(K):
l, r = list(map(int, input().split()))
LR.append((l,r))
LR.sort()
imos = [0]*(N*3)
dp[1] = 1
imos[1] = 1
for i in range(1, N):
if i >= 2:
dp[i+1] += dp[i]
for l, r in LR:
d... | p02549 |
N, K = [int(v) for v in input().split()]
links = []
for k in range(K):
L, R = [int(v) for v in input().split()]
links.append((L, R))
links = sorted(links, key=lambda x: x[1])
count = [1]
sub = [0, 1]
subtotal = 1
for i in range(1, N):
v = 0
for l, r in links:
r2 = i - l + 1
... | N, K = [int(v) for v in input().split()]
links = []
for k in range(K):
L, R = [int(v) for v in input().split()]
links.append((L, R))
links = sorted(links, key=lambda x: x[1])
count = [1]
sub = [0, 1]
subtotal = 1
for i in range(1, N):
v = 0
for l, r in links:
r2 = i - l + 1
... | p02549 |
import sys
sys.setrecursionlimit(10 ** 9)
n,k = list(map(int,input().split()))
s = []
for i in range(k):
l,r = list(map(int,input().split()))
s.append((l,r))
MOD = 998244353
memo = [-1 for _ in range(n+1)]
def f(x):
if x < 1:
return 0
if x == 1:
return 1
if memo[x] != -1:
retu... | import sys
sys.setrecursionlimit(10 ** 9)
n,k = list(map(int,input().split()))
s = []
for i in range(k):
l,r = list(map(int,input().split()))
s.append((l,r))
s.sort()
MOD = 998244353
memo = [-1 for _ in range(n+1)]
def f(x):
if x < 1:
return 0
if x == 1:
return 1
if memo[x] != -1:... | p02549 |
def main():
n, k = list(map(int, input().split()))
mod = 998244353
dp = [0] * (n + 1)
dp[1] = 1
delta = []
for _ in range(k):
l, r = list(map(int, input().split()))
for i in range(l, r + 1):
delta.append(i)
delta.sort()
for i in range(n):
f... | def main():
n, k = list(map(int, input().split()))
mod = 998244353
dp = [0] * (n + 1)
dp[1] = 1
dp[2] = -1
left = [0] * k
right = [0] * k
for i in range(k):
left[i], right[i] = list(map(int, input().split()))
right[i] += 1
for i in range(1, n + 1):
... | p02549 |
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
MOD = 998244353
n, k = list(map(int, input().split()))
dp = [0] * n
dp[0] = 1
dp[1] = -1
delta = []
for _ in range(k):
l, r = list(map(int, input().split()))
delta.append((l, 1))
delta.append((r+1, -1))
total = 0
for i in range(n... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
MOD = 998244353
n, k = list(map(int, input().split()))
dp = [0] * n
dp[0] = 1
dp[1] = -1
delta = []
for _ in range(k):
l, r = list(map(int, input().split()))
delta.append((l, 1))
delta.append((r+1, -1))
total = 0
for i in range(n... | p02549 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, K = mapint()
mod = 998244353
dp = [0]*N
dp[0] = 1
ok = [0]*(N+1)
for _ in range(K):
l, r = mapint()
ok[l-1] += 1
ok[r] -= 1
from itertools import ... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, K = mapint()
mod = 998244353
dp = [0]*(N+1)
dp[1] = 1
Ks = [list(mapint()) for _ in range(K)]
Ks.sort()
class Bit:
def __init__(self, n):
self.si... | p02549 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, K = mapint()
mod = 998244353
dp = [0]*(N+1)
dp[1] = 1
Ks = [list(mapint()) for _ in range(K)]
Ks.sort()
class Bit:
def __init__(self, n):
self.si... | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N, K = mapint()
dp = [0]*(N*3+1)
dp[1] = 1
dp[2] = -1
mod = 998244353
LR = [list(mapint()) for _ in range(K)]
for i in range(1, N+1):
dp[i] = (dp[i]+dp[i-1])%mod... | p02549 |
N, K = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(K)]
MOD = 998244353
dp = [0] * (N + 1)
dp[1] = 1
for i in range(1, N):
for l, r in X:
for k in range(l, r + 1):
if i + k > N:
break
dp[i + k] += dp[i]
... |
N, K = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(K)]
MOD = 998244353
dp = [0] * N
sdp = [0] * (N + 1)
dp[0] = 1
sdp[1] = 1
for i in range(1, N):
for l, r in X:
dp[i] += sdp[max(0, i - l + 1)] - sdp[max(0, i - r)]
dp[i] %= MOD
sdp[i + 1] ... | p02549 |
# coding:UTF-8
import sys
from math import factorial
MOD = 998244353
INF = 10000000000
def main():
n, k = list(map(int, input().split())) # スペース区切り連続数字
lrList = [list(map(int, input().split())) for _ in range(k)] # スペース区切り連続数字(行列)
s = []
for l, r in lrList:
for i in range(l, r+... | # coding:UTF-8
import sys
from math import factorial
MOD = 998244353
INF = 10000000000
def main():
n, k = list(map(int, input().split())) # スペース区切り連続数字
lrList = [list(map(int, input().split())) for _ in range(k)] # スペース区切り連続数字(行列)
s = []
for l, r in lrList:
for i in range(l, r+... | p02549 |
def main():
n, k = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(k)]
dp = [0] * (n+1);
dp[0] = 1
dp[1] = -1
for i in range(0, n):
if i>0: dp[i] += dp[i-1]
for l,r in lr:
if i+l > n: continue
dp[i+l] +=... | n, k = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(k)]
dp = [0] * (n+1);
dp[0] = 1
dp[1] = -1
for i in range(0, n):
if i>0: dp[i] += dp[i-1]
dp[i] %= 998244353
for l,r in lr:
if i+l > n: continue
dp[i+l] += dp[i]
dp[min(n, i+r... | p02549 |
MOD = 998244353
N, K = list(map(int, input().split()))
L = []
R = []
for k in range(K):
l, r = list(map(int, input().split()))
L += [l]
R += [r]
# memo = [[0 for i in range(N+2)] for k in range(K)]
memo = [0 for i in range(N+2)]
memo[1] = 1
memo[2] = -1
cusum = 0
for i in range(1, N+1):
cu... | MOD = 998244353
N, K = list(map(int, input().split()))
L = []
R = []
for k in range(K):
l, r = list(map(int, input().split()))
L += [l]
R += [r]
# memo = [[0 for i in range(N+2)] for k in range(K)]
memo = [0 for i in range(N+2)]
memo[1] = 1
memo[2] = -1
cusum = 0
for i in range(1, N+1):
cu... | p02549 |
#dpで素直にやるとO(N^2)だから、累積和で高速化しO(KN)にする
n, k = list(map(int,input().split()))
mod = 998244353
s = []
for i in range(k):
s.append(list(map(int,input().split())))
cnt = [0]*n
cnt[0] = 1
sum = [0]*n
sum[0] = 1
for i in range(1,n):
for j in range(k):
if i > s[j][1]:
cnt[i] += sum[i-s[j][0]] - ... | #dpで素直にやるとO(N^2)だから、累積和で高速化しO(KN)にする
n, k = list(map(int,input().split()))
mod = 998244353
s = []
for i in range(k):
s.append(list(map(int,input().split())))
cnt = [0]*n
cnt[0] = 1
sum = [0]*n
sum[0] = 1
for i in range(1,n):
for j in range(k):
if i > s[j][1]:
cnt[i] += sum[i-s[j][0]] - ... | p02549 |
N,K=list(map(int,input().split()))
S=[]
NUM=998244353
for _ in range(K):
l,r=list(map(int,input().split()))
for i in range(l,r+1):
S.append(i)
S.sort()
dp=[0]*(N+1)
dp[1]=1
for i in range(2,N+1):
for s in S:
if i-s<=0: break
dp[i]+=dp[i-s]
dp[i]%=NUM
print((d... | N,K=list(map(int,input().split()))
S=[list(map(int,input().split())) for _ in range(K)]
NUM=998244353
dp=[0]*(N+1)
dp[1]=1
sums=[0]*(N+1)
sums[1]=1
for i in range(2,N+1):
for s in S:
_l,_r=i-s[0],i-s[1]-1
if _l<0:
continue
elif _r<0:
_r=0
dp[i]... | p02549 |
import sys
input = sys.stdin.readline
class FenwickTree:
def __init__(self, size):
self.bit = [0] * (size + 1)
self.size = size
def sum(self, i):
i += 1
s = 0
while i > 0:
s += self.bit[i]
s %= mod
i -= i & -i
r... | import sys
input = sys.stdin.readline
mod = 998244353
N, K = list(map(int, input().split()))
L, R = list(zip(*[list(map(int, input().split())) for _ in range(K)]))
dp = [0] * (N + 1)
dp[1] = 1
dp[2] = -1
x = 0
for i in range(1, N):
x = (x + dp[i]) % mod
for j in range(K):
if i + L[j] > N:
... | p02549 |
n,k=list(map(int,input().split()))
S = {}
for i in range(k):
tmp = list(map(int,input().split()))
lr = list(range(tmp[0],tmp[1]+1))
S = set(lr).union(S)
MOD = 998244353
dp = [0]*(n+1)
dp[1] = 1
for i in range(1,n+1):
for j in S:
if i-j > 0:
dp[i] += dp[i-j]%MOD
print((dp[n]%MOD)) | n,k=list(map(int,input().split()))
lr=[list(map(int,input().split())) for _ in range(k)]
mod = 998244353
dp = [0] * (n+1)
sdp = [0] * (n+1)
dp[1] = 1
sdp[1] = 1
for i in range(n+1):
for j in range(k):
left = max(0, i-lr[j][1])
right = max(0, i-lr[j][0]+1)
dp[i] += sdp[right] - sdp[l... | p02549 |
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | p02549 |
n,k = list(map(int,input().split()))
st = set([])
for i in range(k):
x,y = list(map(int,input().split()))
for z in range(x,y+1):
st.add(z)
ans = [1]
for i in range(1,n):
s = 0
for x in st:
if i >= x:
s = s + ans[i-x]
ans.append(s % 998244353)
print((ans[-1]))
... | n,k = list(map(int,input().split()))
st = []
for i in range(k):
x,y = list(map(int,input().split()))
st.append((x,y))
total = [1]
for i in range(1,n):
s = 0
for (x,y) in st:
if i > y:
s = (s + total[i-x] - total[i-y-1]) % 998244353
elif i >= x:
s = (s + total[i-x]) % 998244353
... | p02549 |
n , k = list(map(int, input().split()))
li = [0]*(n+2)
lis = []
lis2 =[0]*(3*n)
lis2[1]=1
for i in range(k):
l,r = list(map(int, input().split()))
for j in range(l,r+1):
lis.append(j)
for i in range(1,n+1):
for j in lis:
lis2[i]%=998244353
lis2[i+j]+=lis2[i]
prin... | n , k = list(map(int, input().split()))
li = [0]*(n+2)
lis = []
lr=[]
lis2 =[0]*(3*n)
lis2[1]=1
lis2[2]=-1
for i in range(k):
l,r = list(map(int, input().split()))
lr.append((l,r))
for i in range(1,n+1):
lis2[i]+=lis2[i-1]
lis2[i]%=998244353
for j,k in lr:
lis2[i+j]+=li... | p02549 |
n,k = (int(x) for x in input().split())
s = []
for _ in range(k):
a,b = (int(x) for x in input().split())
s+=list(range(a,b+1))
mod = 998244353
l = [0]*(n)
s = sorted(s)
min_num = s[0]
for i in range(min_num,n):
for j in s:
if j < i:
l[i] += (l[i-j])
if i in s:
... | n,k = (int(x) for x in input().split())
lr = []
for _ in range(k):
l,r = (int(x) for x in input().split())
lr.append((l,r))
lr.sort()
mod = 998244353
dp= [0]*(n+1)
dp[1] = 1
for i in range(2,n+1):
cnt = 0
for l,r in lr:
if l >= i:
break
else:
... | p02549 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 =... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
in_n = lambda: int(readline())
in_nn = lambda: list(map(int, readline().split()))
in_s = lambda: readline().rstrip().decode('utf-8')
in_nl = lambda: list(map(int, readline().split()))
in_nl2 =... | p02549 |
import sys
from functools import lru_cache
sys.setrecursionlimit(10 ** 8)
N, K = list(map(int, input().split()))
M = 998244353
S = set()
for _ in range(K):
L, R = list(map(int, input().split()))
for i in range(L, R + 1):
S.add(i)
@lru_cache(None)
def dp(i):
if i < 1:
ret... | N, K =list(map(int,input().split()))
K = [tuple(map(int,input().split())) for i in range(K)]
M = 998244353
dp = [0] * N
dp[1] = 1
prefix = [1] * N
for i in range(1, N):
cur = 0
for L, R in K:
a = i - R
b = i - L
if b < 0:
continue
cur += prefix[b] - (... | p02549 |
class BIT:
def __init__(self, n, MOD):
self.n = n
self.data = [0] * (n + 1)
self.MOD = MOD
def sum(self, i):
s = 0
while i > 0:
s += self.data[i]
s %= self.MOD
i -= i & -i
return s
def add(self, i, x):
... | class BIT:
def __init__(self, n, MOD):
self.n = n
self.data = [0] * (n + 1)
self.MOD = MOD
def sum(self, i):
s = 0
while i > 0:
s += self.data[i]
s %= self.MOD
i -= i & -i
return s
def add(self, i, x):
... | p02549 |
class BIT:
def __init__(self, n, MOD):
self.n = n
self.data = [0] * (n + 1)
self.MOD = MOD
def sum(self, i):
s = 0
while i > 0:
s += self.data[i]
s %= self.MOD
i -= i & -i
return s
def add(self, i, x):
... | class BIT:
def __init__(self, n, MOD):
self.n = n
self.data = [0] * (n + 1)
self.MOD = MOD
def sum(self, i):
s = 0
while i > 0:
s += self.data[i]
s %= self.MOD
i -= i & -i
return s
def add(self, i, x):
... | p02549 |
N, K = list(map(int, input().split()))
MOD = 998244353
lr = []
for _ in range(K):
l, r = list(map(int, input().split()))
lr.append((l, r))
lr.sort()
dp = [0]*(N+1)
dpsum = [0]*(N+1)
dp[1] = 1
dpsum[1] = 1
# 区間の合計を複数回求める＝累積和
# 累積和を作りながらDPをする
for i in range(2, N+1):
# マスiに移動できる数を求める
f... | N, K = list(map(int, input().split()))
MOD = 998244353
lr = []
for _ in range(K):
l, r = list(map(int, input().split()))
lr.append((l, r))
lr.sort()
dp = [0]*(N+1)
dpsum = [0]*(N+1)
dp[1] = 1
dpsum[1] = 1
# 区間の合計を複数回求める＝累積和
# 累積和を作りながらDPをする
for i in range(2, N+1):
# マスiに移動できる数を求める
f... | p02549 |
import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_... | import sys, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_... | p02549 |
MOD=998244353
N,K=list(map(int,input().split()))
lrlist=[]
for _ in range(K):
l,r=list(map(int,input().split()))
lrlist.append((l,r))
#print(lrlist)
#A1～Aiまでの和 O(logN)
def BIT_query(idx):
res_sum = 0
while idx > 0:
res_sum += BIT[idx]
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)... | MOD=998244353
N,K=list(map(int,input().split()))
lrlist=[]
for _ in range(K):
l,r=list(map(int,input().split()))
lrlist.append((l,r))
#print(lrlist)
#A1～Aiまでの和 O(logN)
def BIT_query(idx):
res_sum = 0
while idx > 0:
res_sum += BIT[idx]
idx -= idx&(-idx)
return res_sum
#Ai += x O(logN)... | p02549 |
N, K = list(map(int,input().split()))
LR = [tuple(map(int,input().split())) for _ in range(K)]
d = [0]*N
ans = [0]*N
ans[0] = 1
MOD = 998244353
for i in range(N):
x = ans[i]
for k in range(K):
L, R = LR[k]
if i+L < len(d):
d[i+L] += x
d[i+L] %= MOD
if... | N, K = list(map(int,input().split()))
LR = [tuple(map(int,input().split())) for _ in range(K)]
d = [0]*N
d[0] = 1
MOD = 998244353
for i in range(N-1):
x = d[i]
d[0] = 0
for k in range(K):
L, R = LR[k]
if i+L < len(d):
d[i+L] += x
d[i+L] %= MOD
if ... | p02549 |
MOD = 998244353
N, K = list(map(int,input().split()))
S = []
for _ in range(K):
L, R = list(map(int,input().split()))
for i in range(L,R+1):
if i not in S:
S.append(i)
# dp[i]: マスiに移動する方法
dp = [0] * 200010
dp[0] = 1
for i in range(N):
for d in S:
if i+d < N:
... | MOD = 998244353
N, K = list(map(int,input().split()))
LR = [list(map(int,input().split())) for _ in range(K)]
# dp[i]: マスiに移動する方法
dp = [0] * 200010
dp[0] = 1
for i in range(N):
for l, r in LR:
if i+l < N:
dp[i+l] += dp[i]
dp[i+l] %= MOD
if i+r < N:
... | p02549 |
def getsum(BITTree, i):
s = 0 # initialize result
# index in BITree[] is 1 more than the index in arr[]
i = i + 1
# Traverse ancestors of BITree[index]
while i > 0:
# Add current element of BITree to sum
s += BITTree[i]
# Move index to parent node in getSum Vie... | def getsum(BITTree, i):
s = 0 # initialize result
# index in BITree[] is 1 more than the index in arr[]
i = i + 1
# Traverse ancestors of BITree[index]
while i > 0:
# Add current element of BITree to sum
s += BITTree[i]
# Move index to parent node in getSum Vie... | p02549 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def solve():
MOD = 998244353
def makeBIT(numEle):
numPow2 = 2 ** (numEle-1).bit_length()
data = [0] * (numPow2+1)
return data, numPow2
def setInit(As):
for iB, A in enumerate(As, 1):
... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
def solve():
MOD = 998244353
def makeBIT(numEle):
numPow2 = 2 ** (numEle-1).bit_length()
data = [0] * (numPow2+1)
return data, numPow2
def setInit(As):
for iB, A in enumerate(As, 1):
... | p02549 |
MOD = 998244353
def main():
from bisect import bisect_left
N, K = (int(i) for i in input().split())
S = set()
for _ in range(K):
le, ri = (int(i) for i in input().split())
for i in range(le, ri+1):
S.add(i)
A = sorted(S)
memo = [0] * (N+1)
memo[0]... | MOD = 998244353
def main():
N, K = (int(i) for i in input().split())
LR = [[int(i) for i in input().split()] for j in range(K)]
dp = [0] * (N+2)
dp[1] = 1
dp[2] = -1
for i in range(1, N+1):
for le, ri in LR:
if i+le <= N:
dp[i+le] += dp[i]
... | p02549 |
MOD = 998244353
def main():
N, K = (int(i) for i in input().split())
LR = [[int(i) for i in input().split()] for j in range(K)]
dp = [0] * (N+2)
dp[1] = 1
dp[2] = -1
for i in range(1, N+1):
for le, ri in LR:
if i+le <= N:
dp[i+le] += dp[i]
... | MOD = 998244353
def main():
# 配るdp + imos法
N, K = (int(i) for i in input().split())
LR = [[int(i) for i in input().split()] for j in range(K)]
dp = [0] * (N+2)
dp[1] = 1
dp[2] = -1
for i in range(1, N+1):
for le, ri in LR:
if i+le <= N:
dp... | p02549 |
n, k = list(map(int, input().split()))
lr = []
for _ in range(k):
l, r = list(map(int, input().split()))
lr.append((l, r))
mod = 998244353
dp = [0]*(2*n+1)
dp[0] = 1
dp[1] = -1
now = 1
for i in range(n):
for l, r in lr:
dp[i+l] += now
dp[i+r+1] -= now
now += dp[i+1]
print(... | n, k = list(map(int, input().split()))
lr = []
for _ in range(k):
l, r = list(map(int, input().split()))
lr.append((l, r))
mod = 998244353
dp = [0]*(2*n+1)
dp[0] = 1
dp[1] = -1
now = 1
for i in range(n):
for l, r in lr:
dp[i+l] += now
dp[i+r+1] -= now
now += dp[i+1]
no... | p02549 |
n,k = list(map(int,input().split()))
ns = []
for i in range(k):
l, r = list(map(int,input().split()))
for k in range(l, r+1):
ns.append(k)
arr = [0 for i in range(n)]
arr[0] = 1
for i in range(n):
for j in ns:
if i + j < n:
arr[i + j] += arr[i]
print((arr[n-1] % 99824... | MOD = 998244353
n,k = list(map(int,input().split()))
ns = [list(map(int,input().split())) for i in range(k)]
dp = [0 for j in range(n+1)]
cum = [0 for j in range(n+1)]
dp[1] = 1
cum[1] = 1
for i in range(2, n+1):
for j in range(k):
l, r = ns[j]
if i - l >= 0:
dp[i] += cu... | p02549 |
n, k = list(map(int, input().split()))
s = []
for i in range(k):
l, r = list(map(int, input().split()))
s += list(range(l, r+1))
mod = 998244353
dp = [0] * (n+1)
dp[1] = 1
s = sorted(s)
for i in range(1, n):
dp[i] %= mod
for add in s:
if i+add <= n:
dp[i+add] += dp[i]
... | n, k = list(map(int, input().split()))
s = []
for i in range(k):
l, r = list(map(int, input().split()))
s.append([l, r])
mod = 998244353
dp = [0] * (n+1)
cumsum = [0] * (n+1)
dp[1] = 1
s = sorted(s)
counter = 0
for i in range(1, n+1):
counter += cumsum[i]
dp[i] += counter
dp[i] %= ... | p02549 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with... | p02549 |
N,K = [int(i) for i in input().split()]
mod = 998244353
LR = []
S = []
dp = [0]*(N+1)
dps = [0]*(N+1)
dps[1] = 1
for i in range(K):
LR.append([int(i) for i in input().split()])
rM = 0
for i in range(N):
for lr in LR:
if lr[0] <= i and i <= lr[1]:
S.append(i)
rM = max(rM, lr[1])
for i in r... | N,K = [int(i) for i in input().split()]
mod = 998244353
LR = []
S = []
dp = [0]*(N+1)
dps = [0]*(N+1)
dps[1] = 1
dp[1] = 1
for i in range(K):
LR.append([int(i) for i in input().split()])
for i in range(1,N+1):
for l,r in LR:
l,r = i - r,i - l
#print(l,r)
if r < 1:
continue
l ... | p02549 |
import sys
input = sys.stdin.readline
INF = 10**18
sys.setrecursionlimit(10**6)
import itertools as it
import collections as cl
from collections import deque
import math
from functools import reduce
from collections import defaultdict
MOD = 998244353
def li():
return [int(x) for x in input().split()... | import sys
input = sys.stdin.readline
INF = 10**18
sys.setrecursionlimit(10**6)
import itertools as it
import collections as cl
from collections import deque
import math
from functools import reduce
from collections import defaultdict
MOD = 998244353
def li():
return [int(x) for x in input().split()... | p02549 |
N,K = list(map(int, input().split()))
d = [0]*2*K
for i in range(K):
d[2*i], d[2*i+1] = list(map(int, input().split()))
a=[0]*(N+1)
b=[0]*(N+1)
a[1]=1
b[1]=1
for i in range(2,N+1):
t=0
for j in range(K):
if i-d[2*j]>0:
t+=b[i-d[2*j]]
if i-d[2*j+1]-1>0:
t... | N,K = list(map(int, input().split()))
d = [0]*2*K
for i in range(K):
d[2*i], d[2*i+1] = list(map(int, input().split()))
a=[0]*(N+1)
b=[0]*(N+1)
a[1]=1
b[1]=1
for i in range(2,N+1):
t=0
for j in range(K):
if i-d[2*j]>0:
t+=b[i-d[2*j]]
if i-d[2*j+1]-1>0:
t... | p02549 |
n,k=list(map(int,input().split()))
lst=[list(map(int,input().split())) for i in range(k)]
mod=998244353
dp=[1]
imos=[0]*(2*n+10)
imos[0]=1
imos[1]=-1
for i in range(n):
for l,r in lst:
imos[i+l]+=dp[-1]
imos[i+r+1]-=dp[-1]
dp.append((dp[-1]+imos[i+1])%mod)
print((dp[n-1])) | n,k=list(map(int,input().split()))
lst=[list(map(int,input().split())) for i in range(k)]
mod=998244353
dp=[0]*(2*n+10)
dp[0]=1
dp[1]=-1
for i in range(n):
for l,r in lst:
dp[i+l]+=dp[i]
dp[i+r+1]-=dp[i]
dp[i+1]+=dp[i]
dp[i+1]%=mod
print((dp[n-1])) | p02549 |
n, k = list(map(int, input().split()))
mod = 998244353
list_s = []
for _ in range(k):
l, r = list(map(int, input().split()))
list_s.append((l, r))
dp = [0] * (n + 1)
sdp = [0] * (n + 1)
dp[1] = 1
sdp[0] = 0
sdp[1] = 1
for i in range(2, n + 1):
for l, r in list_s:
dl = max(0, i - r - 1... | n, k = list(map(int, input().split()))
mod = 998244353
list_s = []
for _ in range(k):
l, r = list(map(int, input().split()))
list_s.append((l, r))
dp = [0] * (n + 1)
sdp = [0] * (n + 1)
dp[1] = 1
sdp[0] = 0
sdp[1] = 1
for i in range(2, n + 1):
for l, r in list_s:
dl = max(0, i - r - 1... | p02549 |
def main():
n, k = list(map(int, input().split()))
ds = set()
for _ in range(k):
l, r = list(map(int, input().split()))
ds = ds | {i for i in range(l, r + 1)}
dp = [0] * (n + 1)
dp[1] = 1
for i in range(1, n + 1):
for d in ds:
if i + d <= n:
... | def main():
n, k = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(k)]
dp = [0] * (n + 1)
dp[1] = 1
dpsum = [0] * (n + 1)
dpsum[1] = 1
mod = 998244353
for i in range(2, n + 1):
for j in range(k):
li = i - lr[j][1]
... | p02549 |
n, k = list(map(int, input().split()))
lr = []
for _ in range(k):
lr.append(tuple(map(int, input().split())))
mod = 998244353
dp = [0]*n
dp[0] = 1
acc = [0]*n
acc[0] = 1
for i in range(1, n):
for l, r in lr:
if 0 <= i-r and i-l < i:
dp[i] += acc[i-l]-acc[i-r-1]
eli... | n, k = list(map(int, input().split()))
lr = []
for _ in range(k):
lr.append(tuple(map(int, input().split())))
mod = 998244353
dp = [0]*n
dp[0] = 1
acc = [0]*n
acc[0] = 1
for i in range(1, n):
for l, r in lr:
if 0 <= i-r and i-l < i:
dp[i] += acc[i-l]-acc[i-r-1]
eli... | p02549 |
N, K = list(map(int, input().split()))
MOD = 998244353
P = []
for _ in range(K):
l, r = list(map(int, input().split()))
for i in range(l, r+1):
P.append(i)
dp = [0]*(N+1)
dp[0]=1
for i in range(N):
for p in P:
dp[min(i+p,N)] += dp[i]
dp[min(i + p, N)]%=MOD
print((dp[N-1]... | N, K = list(map(int, input().split()))
MOD = 998244353
D = []
for _ in range(K):
l, r = list(map(int, input().split()))
D.append((l,r))
imos = [0]*(N+2)
dp = [0]*(N+1)
imos[0]=1
imos[1]=-1
for i in range(N):
dp[i] = dp[i-1] + imos[i]
dp[i] %= MOD
for a, b in D:
imos[min(i+a,N+1... | p02549 |
mod = 998244353
n,k = list(map(int,input().split()))
K = [list(map(int,input().split())) for i in range(k)]
dp = [0]*(n+5)
dp[1] = 1
dp2 = [0]*(n+5)
for i in range(1,n+1):
dp[i] = (dp[i]+dp2[i]+dp2[i-1])%mod
dp2[i] = (dp2[i]+dp2[i-1])%mod
for l,r in K:
dp2[min(i+l,n+2)] += dp[i]
... | mod = 998244353
n,k = list(map(int,input().split()))
K = [list(map(int,input().split())) for i in range(k)]
dp = [0]*(n+1)
dp[0] = 1
dp2 = [0]*(n+1)
for i in range(n):
dp2[i] = (dp2[i]+dp2[i-1])%mod
dp[i] = (dp[i]+dp2[i])%mod
for l,r in K:
dp2[min(i+l,n)] = (dp2[min(i+l,n)]+dp[i])%mod
... | p02549 |
n,k=list(map(int,input().split()))
dp=[0 for i in range(n+1)]
dp[1]=1
accum=[0 for i in range(n+1)]
accum[1]=1
s=[]
for i in range(k):
x,y=list(map(int,input().split()))
s.append([x,y])
for i in range(2,n+1):
for j in s:
l,r=j
tmpl=i-r
tmpr=i-l
if(tmpl<1):
... | n,k=list(map(int,input().split()))
dp=[0 for i in range(n+1)]
dp[1]=1
accum=[0 for i in range(n+1)]
accum[1]=1
s=[]
for i in range(k):
x,y=list(map(int,input().split()))
s.append([x,y])
for i in range(2,n+1):
for j in s:
l,r=j
tmpl=i-r
tmpr=i-l
if(tmpl<1):
... | p02549 |
N, K = list(map(int, input().split()))
L = [0] * K
R = [0] * K
for i in range(0, K):
L[i], R[i] = list(map(int, input().split()))
moves = [0] * N
moves[0] = 1
rui_wa = [0] * N
rui_wa[0] = 1
for i in range(1, N):
for j in range(0, K):
l = max(i - L[j], 0)
r = max(i - R[j], 0)
... | N, K = list(map(int, input().split()))
L = [0] * K
R = [0] * K
for i in range(0, K):
L[i], R[i] = list(map(int, input().split()))
moves = [0] * N
moves[0] = 1
rui_wa = [0] * N
rui_wa[0] = 1
for i in range(1, N):
for j in range(0, K):
l = max(i - L[j], 0)
r = max(i - R[j], 0)
... | p02549 |
import sys
import math
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
L = [[] for _ in range(K)]
for t in range(K):
l, r = list(map(int, input().split()))
for j in range(l, r + 1):
L[t].append(j)
l... | import sys
import math
def input():
return sys.stdin.readline().rstrip()
def main():
N, K = list(map(int, input().split()))
L = [[] for _ in range(K)]
for t in range(K):
l, r = list(map(int, input().split()))
for j in range(l, r + 1):
L[t].append(j)
l... | p02549 |
mod = 998244353
N,K = list(map(int,input().split()))
move = [list(map(int,input().split())) for _ in range(K)]
dp = [0]*(N+1)
dp_sum = [0]*(N+1)
dp[1] = dp_sum[1] = 1
for i in range(2,N+1):
for l,r in move:
if 0<i-l:
dp[i] += dp_sum[i-l]
if 0<i-r-1:
dp[i]... | mod = 998244353
N,K = list(map(int,input().split()))
move = [list(map(int,input().split())) for _ in range(K)]
dp = [0]*(N+1)
dp_sum = [0]*(N+1)
dp[1] = dp_sum[1] = 1
for i in range(2,N+1):
for l,r in move:
if 0<i-l:
dp[i] += dp_sum[i-l]
if 0<i-r-1:
dp[i]... | p02549 |
import sys
import re
import queue
import collections
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from b... | import sys
import re
import queue
import collections
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from b... | p02549 |
N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
MOD = 998244353
dic = []
for l, r in LR:
tmp = [x for x in range(l, r+1)]
dic += tmp
dic.sort()
dp = [0]*(N+1)
dp[1] = 1
n = len(dic)
cnt = 0
t = []
for i in range(2, N+1):
tmp = i-1
while cn... | def main():
N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
MOD = 998244353
dp = [0]*(N+1)
S = [0]*(N+1)
dp[1] = 1
S[1] = 1
for i in range(2, N+1):
for l, r in LR:
if i-l < 0:
continue
... | p02549 |
MOD = 998244353
class BIT:
def __init__(self, n, init=None):
self.size = n
if init is None:
self.v = [0] * (n + 1) # don't use bit[0]
else:
self.v = [0] + init
for i in range(1, n):
if i + (i & -i) <= n: self.v[i + (i & -i)] += s... | MOD = 998244353
N, K = list(map(int, input().split()))
segments = [tuple(map(int, input().split())) for _ in range(K)]
dp = [0] * (2 * N + 1)
for i in range(N):
for s, t in segments:
t += 1
dp[i + s] += dp[i] if i != 0 else 1
dp[i + t] -= dp[i] if i != 0 else 1
dp[i + 1] += dp... | p02549 |
N, K = (int(i) for i in input().split())
l, r = [0]*K, [0]*K
for k in range(K):
l[k], r[k] = (int(x) for x in input().split())
# dp : マスiまで移動する方法のパターン数
# TLE
'''
import numpy as np
dp = [0]*N
dp[0] = 1
for i in range(N):
for k in range(K):
for j in range(l[k], r[k]+1):
if (i+j... | N, K = (int(i) for i in input().split())
l, r = [0]*K, [0]*K
for k in range(K):
l[k], r[k] = (int(x) for x in input().split())
# dp : マスiまで移動する方法のパターン数
# TLE
'''
import numpy as np
dp = [0]*N
dp[0] = 1
for i in range(N):
for k in range(K):
for j in range(l[k], r[k]+1):
if (i+j... | p02549 |
n,k=list(map(int,input().split()))
ans=[0 for _ in range(n*3)]
ans[1]=1
idou=[]
for _ in range(k):
a=list(map(int,input().split()))
idou.append(a)
mod=998244353
rui=[0 for _ in range(n+1)]
rui[1]=1
for i in range(2,n+1):
for g in idou:
x,y=g
left=max(0,i-y-1)
right=ma... | n,k=list(map(int,input().split()))
ans=[0 for _ in range(n*3)]
ans[1]=1
idou=[]
for _ in range(k):
a=list(map(int,input().split()))
idou.append(a)
mod=998244353
rui=[0 for _ in range(n+1)]
rui[1]=1
for i in range(2,n+1):
for g in idou:
x,y=g
left=max(0,i-y-1)
right=ma... | p02549 |
#editorial
n,k=list(map(int,input().split()))
*lr,=[tuple(map(int, input().split())) for _ in range(k)]
res =[0]*(2*n+3)
##############
diff=[0]*(2*n+3)
######
#res[0]=1
diff[0]=1
diff[1]=-1
mod=998244353
for i in range(n+1):
res[i]=res[i-1]+diff[i]
for li,ri in lr:
diff[i+li]+=res[i]
... | #editorial
n,k=list(map(int,input().split()))
*lr,=[tuple(map(int, input().split())) for _ in range(k)]
res =[0]*(2*n+3)
##############
diff=[0]*(2*n+3)
######
#res[0]=1
diff[0]=1
diff[1]=-1
mod=998244353
for i in range(n+1):
res[i]=res[i-1]+diff[i]
res[i]%=mod
diff[i]%=mod
for li,ri ... | p02549 |
n, k = list(map(int, input().split()))
F = [0]*(n+2) # [l,r+1): 1<=[l]<[r+1]<=n+1
for _ in range(k):
l, r = list(map(int, input().split()))
F[l] += 1
F[r+1] += -1
# print(F)
S = []
for i in range(n+1): # i:[0, n]
if F[i] > 0: S.append(i)
F[i+1] += F[i]
# print(F)
# print(n,k)
# pr... | n, k = list(map(int, input().split()))
LR = []
for _ in range(k):
l, r = list(map(int, input().split()))
LR.append([l, r+1])
MOD = 998244353
dp = [0]*(n+1) # [0,n]
dp[0] = 1
dp[1] = -1
for i in range(n): # i:[0,n-1]
if i > 0: dp[i] += dp[i-1]
for j in range(k):
l, r = LR[j]
... | p02549 |
n,k = list(map(int,input().split()))
sec = []
for i in range(k):
l,r = list(map(int,input().split()))
sec.append([l,r])
dp = [0]*(n+1)
dp[0],dp[1] = 0,1
cumsum = [0]*(n+1)
cumsum[1] = 1
for i in range(2,n+1):
for l,r in sec:
if i>l:
dp[i] += cumsum[i-l]-cumsum[max(0,i-r-1)]
cumsum[i] = ... | n,k = list(map(int,input().split()))
sec = []
for i in range(k):
l,r = list(map(int,input().split()))
sec.append([l,r])
mod = 998244353
dp = [0]*(n+1)
dp[0],dp[1] = 0,1
cumsum = [0]*(n+1)
cumsum[1] = 1
for i in range(2,n+1):
for l,r in sec:
if i>l:
dp[i] += cumsum[i-l]-cumsum[max(0,i-r-1)... | p02549 |
from collections import deque
MOD = 998244353
N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
S = list()
for lr in LR:
for i in range(lr[0], lr[1]+1):
S.append(i)
dp = [0]*(N+1) # dp[i] : iに行く方法
dp[1] = 1
memo1 = deque()
memo2 = deque()
for... | MOD = 998244353
N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
dp = [0]*(N+1)
acc = [0]*(N+1) # acc[i] = dp[1] + ... dp[i]
dp[1] = 1
acc[1] = 1
for i in range(2, N+1):
for lr in LR:
l = lr[0]
r = lr[1]
dp[i] += (acc[max(0, i -... | p02549 |
n, k = list(map(int, input().split()))
s = []
for i in range(k):
a, b = list(map(int, input().split()))
for j in range(a, b+1):
s.append(j)
s = set(s)
dp = [0]*(n+1)
dp[1] = 1
mod = 998244353
for i in range(1, n+1):
for ss in s:
if i+ss <= n:
dp[i+ss] += dp[i]
... | n, k = list(map(int, input().split()))
s = []
for i in range(k):
a, b = list(map(int, input().split()))
s.append((a, b))
dp = [0]*(n+1)
v = 0
mod = 998244353
for i in range(1, n+1):
if i == 1:
for l, r in s:
if i+l <= n:
dp[i+l] += 1
if i+r+1 <= n... | p02549 |
n, k = list(map(int, input().split()))
l = []
r = []
for i in range(k):
a, b = list(map(int, input().split()))
l.append(a)
r.append(b)
mod = 998244353
dp = [0] * (n + 1)
#１マス目の行き方は１通り
dp[1] = 1
dpsum = [0] * (n + 1)
dpsum[1] = 1
for i in range(2, n + 1):
for j in range(k):
li = i - r[j]... | n, k = list(map(int, input().split()))
l = []
r = []
for i in range(k):
a, b = list(map(int, input().split()))
l.append(a)
r.append(b)
mod = 998244353
dp = [0] * (n + 1)
#１マス目の行き方は１通り
dp[1] = 1
dpsum = [0] * (n + 1)
dpsum[1] = 1
for i in range(2, n + 1):
for j in range(k):
li = i - r[j]... | p02549 |
n, k = list(map(int, input().split()))
s = []
mod = 998244353
for i in range(k):
l, r = list(map(int, input().split()))
s.append([l, r])
dp = [0 for _ in range(n+1)]
dp[1] = 1
dpsum = [0 for _ in range(n+1)]
dpsum[1] = 1
for i in range(2,n+1):
for l, r in s:
li = max(i-r,1)
... | n, k = list(map(int, input().split()))
s = []
mod = 998244353
for i in range(k):
l, r = list(map(int, input().split()))
s.append([l, r])
dp = [0 for _ in range(n+1)]
dp[1] = 1
dpsum = [0 for _ in range(n+1)]
dpsum[1] = 1
for i in range(2,n+1):
for l, r in s:
li = max(i-r,1)
... | p02549 |
n,k=list(map(int,input().split()))
mod=998244353
r=[0]*k
l=[0]*k
for _ in range(k):
l_,r_=list(map(int,input().split()))
l[_]=l_
r[_]=r_
dp=[0]*n
dp[0]=1
dpsum=[0]*n
dpsum[0]=1
for i in range(1,n):
for j in range(k):
li=i-r[j]
ri=i-l[j]
if ri>=0:
li=max(li,0)
dp[i]+=dps... | n,k=list(map(int,input().split()))
mod=998244353
s=set()
for _ in range(k):
l,r=list(map(int,input().split()))
for j in range(l,r+1):
s.add(j)
m=len(s)
dp=[0]*n
dp[0]=1
for i in range(1,n):
for j in s:
if i-j>=0:
dp[i]+=dp[i-j]
print((dp[n-1]%mod))
| p02549 |
n,k=list(map(int,input().split()))
mod=998244353
s=set()
for _ in range(k):
l,r=list(map(int,input().split()))
for j in range(l,r+1):
s.add(j)
m=len(s)
dp=[0]*n
dp[0]=1
for i in range(1,n):
for j in s:
if i-j>=0:
dp[i]+=dp[i-j]
print((dp[n-1]%mod))
| n,k=list(map(int,input().split()))
mod=998244353
l=[0]*n
r=[0]*n
for i in range(k):
l[i],r[i]=list(map(int,input().split()))
dp=[0]*(n+10)
dp[0]=1
sumdp=[0]*(n+10)
sumdp[1]=1
for i in range(1,n):
for j in range(k):
li=max(0,i-r[j])
ri=max(0,i-l[j]+1)
dp[i]+=sumdp[ri]-sumdp[li]
sumdp[i+1... | p02549 |
N,K = list(map(int,input().split()))
MOD = 998244353
interval = []
for i in range(K):
L,R = list(map(int,input().split()))
for j in range(L,R+1):
interval.append(j)
dp = [0]*N
dp[0] = 1
for i in range(N-1):
for j in interval:
if j <= N-1 - i:
dp[i+j] += dp[i]
... | N,K = list(map(int,input().split()))
MOD = 998244353
interval = []
for i in range(K):
intv = [int(x) for x in input().split()]
interval.append(intv)
dp = [0]*N
diff = [0]*(N-1)
dp[0] = 1
diff[0] = -1
for i in range(N-1):
for L,R in interval:
if L <= N-1 - i:
diff[i+L... | p02549 |
import sys
def input(): return sys.stdin.readline().rstrip()
N, K = list(map(int, input().split()))
L = []
for i in range(K):
l, r = list(map(int, input().split()))
L.append((l,r))
L.sort()
dp = [0] * (N+1)
dp[1] = 1
for i in range(2,N+1):
count = 0
for l,r in L:
if l >= i... | import sys
def input(): return sys.stdin.readline().rstrip()
mod = 998244353
N, K = list(map(int, input().split()))
L = []
for i in range(K):
l, r = list(map(int, input().split()))
L.append((l,r))
L.sort()
dp = [0] * (N+1)
dp[1] = 1
for i in range(2,N+1):
count = 0
for l,r in L:
... | p02549 |
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int... | p02549 |
n,k = list(map(int,input().split()))
mod = 998244353
s = []
for i in range(k):
l,r = list(map(int,input().split()))
for i in range(l,r+1):
s.append(i)
s.sort()
# print(s)
dp = [0 for i in range(n+1)]
dp[1] = 1
for i in range(2,n+1):
for j in s:
if i-j >= 1:
dp[i] ... | n,k = list(map(int,input().split()))
mod = 998244353
l,r = [0]*k,[0]*k
for i in range(k):
ll,rr = list(map(int,input().split()))
l[i],r[i] = ll,rr
dp = [0]*(n+1)
dpsum = [0]*(n+1)
dp[1], dpsum[1] = 1,1
for i in range(2,n+1):
for j in range(k):
li = i - r[j]
ri = i - l[j]
... | p02549 |
import sys
input = sys.stdin.readline
m = 998244353
def main():
n,k = list(map(int,input().split()))
l,r = [],[]
for _ in range(k):
l_, r_ = list(map(int,input().split()))
l.append(l_)
r.append(r_)
dp = [0]*(n+1)
dp[1] = 1
dpsum = [0]*(n+1)
dpsum[1] = 1... | m = 998244353
def main():
n,k = list(map(int,input().split()))
l,r = [],[]
for _ in range(k):
l_, r_ = list(map(int,input().split()))
l.append(l_)
r.append(r_)
dp = [0]*(n+1)
dp[1] = 1
dpsum = [0]*(n+1)
dpsum[1] = 1
for i in range(2,n+1):
... | p02549 |
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
mod = 998244353
n, k = list(map(int, input().split()))
s = set()
for _ in range(k):
l, r = list(map(int, input().split()))
for i in range(l, r + 1):
s.add(i)
dp = [0] * (n + 1)
dp[0] = 1
for i in range(1, n + 1):
for ... | import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
mod = 998244353
n, k = list(map(int, input().split()))
l = []
r = []
for _ in range(k):
l_, r_ = list(map(int, input().split()))
l.append(l_)
r.append(r_)
dp = [0] * (n + 1)
dp_csum = [0] * (n + 1)
dp[1] = 1
dp_csum[1] = 1
for ... | p02549 |
P=998244353
N,K=list(map(int,input().split()))
LR=[]
for _ in range(K):
l,r=list(map(int,input().split()))
LR+=list(range(l,r+1))
LR=list(set(LR))
c=[0]*N
c[0]=1
for k in range(N):
S=[x for x in LR if x<=k]
while len(S):
c[k]+=c[k-S[-1]]%P
S.pop()
print((c[-1]%P)) | P=998244353
N,K=list(map(int, input().split()))
LR=[list(map(int, input().split())) for _ in range(K)]
s=[0 for _ in range(N+1)]
s[1]=1
for i in range(1,N):
s[i+1] = s[i]
for l,r in LR:
s[i+1]+=(s[max(0,i-l+1)]-s[max(0,i-r)])%P
s[i+1]%=P
print(((s[N]-s[N-1])%P)) | p02549 |
N,K=list(map(int,input().split()))
L=[]
for i in range(K):
l,r=list(map(int,input().split()))
L.append([l,r+1])
L.sort()
mod=998244353
A=[0 for i in range(N+1)]
A[1]=1
for i in range(N+1):
if A[i]>0:
A[i]%=mod
for l,r in L:
for n in range(l+i,r+i):
i... | N,k=list(map(int,input().split()))
L=[0 for i in range(2)]
K=[]
for i in range(k):
l,r=list(map(int,input().split()))
K.append([l,r])
mod=998244353
L[1]=1
R=[0,1]
for i in range(2,N+1):
cnt=0
for l,r in K:
cnt+=R[max(0,i-l)]
cnt-=R[max(0,i-(r+1))]
cnt%=mod
L.appe... | p02549 |
# -*- coding: utf-8 -*-
"""
Created on Sat Sep 19 20:18:10 2020
@author: liang
"""
#D
N, K = list(map(int, input().split()))
areas = list()
for i in range(K):
l, r = list(map(int,input().split()))
areas.append((l,r))
areas_sum = [0] * N
d = [0] * N
d[0] = 1
for i in range(N):
for j in ra... | # -*- coding: utf-8 -*-
"""
Created on Sat Sep 19 20:18:10 2020
@author: liang
"""
#D
N, K = list(map(int, input().split()))
areas = list()
for i in range(K):
l, r = list(map(int,input().split()))
areas.append((l,r))
#areas_sum = [0] * N
tmp = 0
d = [0] * N
#check = [0] * N
#check[0] = 1
d[0]... | p02549 |
N, K = list(map(int, input().split()))
S = []
for j in range(K):
LRj = list(map(int, input().split()))
for s in range(LRj[0], LRj[1] + 1):
S.append(s)
m = 998244353
# print(S)
dp = [0] * N
dp[0] = 1
for i in range(1, N):
for s in S:
if s <= i:
# print(i, i-s)
... | N, K = list(map(int, input().split()))
S = []
for j in range(K):
S.append(list(map(int, input().split())))
m = 998244353
# print(S)
dp = [0] * N
dp[0] = 1
sum_of_region = [0] * K
for i in range(1, N):
for j in range(K):
if i - S[j][0] >= 0:
sum_of_region[j] += dp[i - S[j][... | p02549 |
N, K = list(map(int, input().split()))
dp = [0] * N
dp[0] = 1
dp_sum = [0] * N
L = [0] * K
R = [0] * K
mod = 998244353
for i in range(K):
l, r = list(map(int, input().split()))
L[i] = l
R[i] = r
for i in range(1, N):
# マスiにたどり着くためのパターン数を数える
cnt = 0
for j in range(K):
s... | N, K = list(map(int, input().split()))
dp = [0] * N
dp[0] = 1
dp_sum = [0] * N
dp_sum[0] = 1
L = [0] * K
R = [0] * K
mod = 998244353
for i in range(K):
l, r = list(map(int, input().split()))
L[i] = l
R[i] = r
for i in range(1, N):
# マスiにたどり着くためのパターン数を数える
cnt = 0
for j in range... | p02549 |
n,k=[int(c) for c in input().split()]
MOD = 998244353
segs = set()
for _ in range(k):
a,b=[int(c) for c in input().split()]
for i in range(a,b+1):
segs.add(i)
dp =[0 for i in range(n)]
dp[0] = 1
# print(segs)
for i in range(n-1):
if dp[i] != 0:
for j in segs:
if ... | n,k=[int(c) for c in input().split()]
MOD = 998244353
segs = []
for _ in range(k):
a,b=[int(c) for c in input().split()]
segs.append((a,b))
dp=[0 for i in range(n+5)]
dp[0] = 1
for i in range(n):
# dp[i] = dp[i] + dp[i-1]
if dp[i] < 0:
dp[i]+=MOD
for a,b in segs:
i... | p02549 |
N, K = list(map(int, input().split()))
dp = [0] * (2 * 10 ** 5 + 1)
S = set()
for i in range(K):
l, r = list(map(int, input().split()))
for v in range(l, r + 1):
S.add(v)
dp[1] = 1
MOD = 998244353
for i in range(1, N):
for v in S:
if i + v <= N:
dp[i + v] += dp[i]
... | N, K = list(map(int, input().split()))
W = [0] * (N + 1)
W[1] = 1
R = []
for i in range(K):
l, r = list(map(int, input().split()))
R.append((l, r))
MOD = 998244353
for i in range(1, N):
for l, r in R:
a = max(i - r, 0)
b = i - l
if b < 0:
continue
... | p02549 |
N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
dp = [0] * (N + 1)
dpsum = [0] * (N + 1)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N + 1):
for j in range(K):
li = max(i - LR[j][1], 1)
ri = i - LR[j][0]
if ri < 0:
continu... | N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
mod = 998244353
dp = [0] * (N + 1)
dpsum = [0] * (N + 1)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N + 1):
for j in range(K):
li = max(i - LR[j][1], 1)
ri = i - LR[j][0]
if ri < 0:
... | p02549 |
mod = 998244353
class FenwickTree:
def __init__(self, n, init_list=None):
self.n = n
self.data = [0] * n
if init_list:
assert n == len(init_list)
for i in range(n):
self.add(i, init_list[i])
def add(self, i, val):
asse... | mod = 998244353
n, k = list(map(int, input().split()))
s = []
for _ in range(k):
l, r = list(map(int, input().split()))
s.append((l, r))
dp = [0] * (n + 1)
dp[1] = 1
for i in range(2, n+1):
for l, r in s:
jl = max(i - l, 0)
jr = max(i - r - 1, 0)
dp[i] = (dp[i] + dp... | p02549 |
mod = 998244353
N, K = list(map(int,input().split()))
v = []
for _ in range(K):
L, R = list(map(int,input().split()))
# for d in range(L, R+1):
# moves.append(d)
v.append((L, R))
v.sort()
dp = [0] * N # マスi-1に到達するまでの操作列の個数
sdp = [0] * (N + 1) # dp[i]までの累積和
dp[0] = 1
sdp[1] = ... | n, k = list(map(int, input().split()))
sec = [list(map(int, input().split())) for _ in range(k)]
sec.sort()
mod = 998244353
dp = [0] * n
dp[0] = 1
sum_dp = [0, 1]
for i in range(1, n):
for l, r in sec:
if i - l < 0:
break
elif i - r > 0:
dp[i] = ((dp[i... | p02549 |
n, k = list(map(int, input().split()))
m = 998244353
s = []
for i in range(k):
l, r = list(map(int, input().split()))
for j in range(l, r+1):
s.append(j)
dp = [0] * n
dp[0] = 1
for i in range(n):
for j in s:
ind = i-j
if ind >= 0:
dp[i] += dp[ind]
... | n, k = list(map(int, input().split()))
m = 998244353
s = []
for i in range(k):
l, r = list(map(int, input().split()))
s.append((l, r))
dp = [0] * n
dp[0] = 1
totals = [0] * n
totals[0] = 1
for i in range(1, n):
thisTotal = 0
for l, r in s:
indL = i-l
if indL >= 0:
... | p02549 |
root=[]
n,k = list(map(int,input().split()))
for i in range(k):
x,y = list(map(int,input().split()))
root.append([x,y])
toori=[0]*(2*10**5)+[0]*n+[0]*(2*10**5)
toori[2*10**5]=1
cum=[0]*k
for a,i in enumerate (root):
s=0
for j in range (i[0],i[1]+1):
s+=toori[2*10**5+1-j]
cum[a]... | root=[]
n,k = list(map(int,input().split()))
for i in range(k):
x,y = list(map(int,input().split()))
root.append([x,y])
toori=[0]*(2*10**5)+[0]*n+[0]*(2*10**5)
toori[2*10**5]=1
cum=[0]*k
for a,i in enumerate (root):
s=0
for j in range (i[0],i[1]+1):
s+=toori[2*10**5+1-j]
cum[a]... | p02549 |
def resolve():
n, k = list(map(int, input().split()))
S = []
L, R = [], []
for _ in range(k):
l1, r1 = list(map(int, input().split()))
L.append(l1)
R.append(r1)
dp = [0 for i in range(n + 1)]
dpsum = [0 for i in range(n + 1)]
dp[1] = 1
dpsum[1] = 1
... | def resolve():
n, k = list(map(int, input().split()))
S = []
L, R = [], []
for _ in range(k):
l1, r1 = list(map(int, input().split()))
L.append(l1)
R.append(r1)
dp = [0 for i in range(n + 1)]
dpsum = [0 for i in range(n + 1)]
dp[1] = 1
dpsum[1] = 1
... | p02549 |
N, K = list(map(int, input().split()))
C = 998244353
S = set()
for _ in range(K):
l, r = list(map(int, input().split()))
S |= set(range(l, r+1))
# print(S)
dp = [0]*N
dp[0] = 1
for i in range(N-1):
if dp[i] == 0:
continue
for j in S:
if i+j < N:
dp[i+j] = (dp[... | N, K = list(map(int, input().split()))
C = 998244353
L = [None]*K
for j in range(K):
l, r = list(map(int, input().split()))
L[j] = [l, r+1]
dp = [0]*N
dp[0] = 1
imos = [0]*(N+1)
imsm = [0]*N
for i in range(N-1):
if i > 0:
imsm[i] = imsm[i-1]+imos[i]
dp[i] = imsm[i] % C
... | p02549 |
N,K = list(map(int,input().split()))
S = [tuple(map(int,input().split())) for _ in range(K)]
MOD=998244353
dp=[0]*N
dp[0]=1
for i in range(N-1):
x = dp[i]
dp[0]=0
for k in range(K):
l,r = S[k]
if i+l < N:
dp[i+l]+=x
dp[i+l]%MOD
if i+r+1 < N:
... | N,K = list(map(int,input().split()))
S = [tuple(map(int,input().split())) for _ in range(K)]
MOD=998244353
dp=[0]*N
dp[0]=1
for i in range(N-1):
x = dp[i]
dp[0]=0
for k in range(K):
l,r = S[k]
if i+l < N:
dp[i+l]+=x
dp[i+l]%=MOD
if i+r+1 < N:
... | p02549 |
#!/usr/bin/env Python3
#import
#import math
#import numpy as np
#= int(input())
#= input()
modnum = 998244353
N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
def mod(num):
return num % modnum
S = []
for l, r in LR:
for i in range(l, r + 1):
... | #!/usr/bin/env Python3
#import
#import math
#import numpy as np
#= int(input())
#= input()
modnum = 998244353
N, K = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(K)]
def mod(num):
return num % modnum
dp = [0] * (N + 1)
sdp = [0] * (N + 1)
dp[1] = 1
sdp... | p02549 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
N,K = list(map(int,input().split()))
LR = [tuple(map(int,input().split())) for i in range(K)]
LR.sort()
MOD = 998244353
arr = []
for l,r in LR:
for i in range(l,r+1):
arr.append(i)
from functools import lru_cache
@lru_cache(m... | import sys
input = sys.stdin.readline
N,K = list(map(int,input().split()))
LR = [tuple(map(int,input().split())) for i in range(K)]
MOD = 998244353
dp = [1]
cumdp = [0,1]
for i in range(1,N):
tmp = 0
for l,r in LR:
if i-l+1 <= 0: continue
tmp += cumdp[i-l+1] - cumdp[max(0,i-r)]
... | p02549 |
def main():
N, K = list(map(int, input().split()))
MOD = 998244353
cand = set()
for _ in range(K):
L, R = list(map(int, input().split()))
A = set(range(L,R+1))
cand |= A
dp = [0] * (N + 5)
dp[0] = 1
for i in range(N):
for j in cand:
i... |
def main():
N, K = list(map(int, input().split()))
MOD = 998244353
L = [0] * K
R = [0] * K
for i in range(K):
L[i], R[i] = list(map(int, input().split()))
dp = [0] * (N + 1)
dpsum = [0] * (N + 1)
dp[1] = 1
dpsum[1] = 1
for i in range(2,N+1):
... | p02549 |
N, K = list(map(int, input().split()))
S = []
for _ in range(K):
L, R = list(map(int, input().split()))
S.extend(list(range(L,R+1)))
S.sort()
DP =[[0]*N for _ in range(N)]
DP[0][0] = 1
for i in range(N-1):
DP[i+1] = DP[i]
for j in S:
if i+j<N:
DP[i+1][i+j] += DP[i][i]
... | N, K = list(map(int, input().split()))
S = []
for _ in range(K):
L, R = list(map(int, input().split()))
S.extend(list(range(L,R+1)))
S.sort()
DP =[0]*N
DP[0] = 1
for i in range(N-1):
for j in S:
if i+j<N:
DP[i+j] += DP[i]
else:
break
print((DP[-1]%998244353)) | p02549 |
N, K = list(map(int, input().split()))
S = []
for i in range(K):
s = list(map(int, input().split()))
S.append(s)
DP = [0]*N
DP[0] = 1
#print(DP)
for i in range(1,N):
T = 0
for s in S:
l = max(0,i-s[1])
r = max(0,i-s[0]+1)
T += sum(DP[l:r])
DP[i] = T
#print(DP)
print... | N, K = list(map(int, input().split()))
L = []
R = []
for _ in range(K):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
dp = [0]*(N+5)
dp[1] = 1
for i in range(2, N+1):
dp[i] = dp[i-1]
for j in range(K):
if i-L[j] >= 0:
dp[i] += dp[i-L[j]]
if i-R[j]-1 >= 0:... | p02549 |
# 配るDP、もらうDP
n, k = list(map(int, input().split()))
mod = 998244353
kukan = []
for _ in range(k):
# 区間の問題は扱いやすいように[ ) の形に直せるなら直す
l, r = list(map(int, input().split()))
l -= 1
kukan.append([l, r])
dp = [0 for i in range(n)]
dp[0] = 1
# 区間のL, Rは数字が大きいため、その差一つ一つを考えると時間がない！
# それゆえにL, Rの端... | N, K = list(map(int, input().split()))
mod = 998244353
L = []
for _ in range(K):
a, b = list(map(int, input().split()))
b += 1
L.append([a, b])
ruiwa = [0] * (N + 1)
dp = [0] * (N + 1)
dp[1] = 1
ruiwa[1] = 1
for i in range(2, N + 1):
for l, r in L:
l = i - l
r = i - r
... | p02549 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.