input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, K = list(map(int, input().split()))
LRs = [tuple(map(int, input().split())) for _ in range(K)]
mod = 998244353
mem = [0] * (N)
mem[N-1] = 1
for _i in range(N-1):
i = N-2 - _i
for l, r in LRs:
if i+l < N:
mem[i] += sum(mem[i+l:min(i+r+1, N)])
mem[i] %= mod
print(... | N, K = list(map(int, input().split()))
LRs = [tuple(map(int, input().split())) for _ in range(K)]
mod = 998244353
def diff(l):
tmp = None
res = []
for elm in l:
if tmp is None:
res.append(elm)
tmp = elm
else:
res.append(elm-tmp)
t... | p02549 |
n,k = tuple(map(int,input().split()))
boolean = [False for _ in range(n+1)]
for _ in range(k):
l,r = tuple(map(int,input().split()))
for num in range(l,r+1):
boolean[num] = True;
dp = [0 for _ in range(n+1)]
dp[1] = 1
for i in range(2,n+1):
for lower in range(1,i):
if boolean[lower]: #start + l... | MOD = 998244353
N, K = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for i in range(K)]
dp = [0] * (N+1)
dp[1] = 1 #ok
for i in range(1, N):
dp[i] += dp[i-1] #as min k = 1, so carry this on to the next
dp[i] %= MOD
for l, r in LR:
ll = i + l
rr = i + r
if ll... | p02549 |
n, k = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(k)]
MOD = 998244353
dp = [0] * n
dp[0] = 1
for i in range(n):
for l, r in LR:
for j in range(l, r + 1):
if i - j >= 0:
dp[i] += dp[i - j]
dp[i] %= MOD
print((dp[-1])) | n, k = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(k)]
MOD = 998244353
dp = [0] * n
dp[0] = 1
ruidp = [0] * (n + 1)
ruidp[1] = 1
for i in range(n):
for l, r in LR:
dp[i] += (ruidp[max(i - l + 1, 0)] - ruidp[max(i - r, 0)])
dp[i] %= MOD
ruidp[i + ... | p02549 |
N,K=list(map(int,input().split()))
arr={0}
for i in range(K):
a,b=list(map(int,input().split()))
arr|=set([j for j in range(a,b+1)])
arr.discard(0)
dp=[[0]*N for i in range(N)]
dp[0][0]=1
ans=0
for i in range(N):
for j in range(i,N):
if dp[i][j]!=0:
for k in arr:
... | N,K=list(map(int,input().split()))
arr={0}
for i in range(K):
a,b=list(map(int,input().split()))
arr|=set([j for j in range(a,b+1)])
arr.discard(0)
dp=[0]*N
dp[0]=1
ans=0
for i in range(N):
for j in arr:
if i+j<=N-1:
dp[i+j]+=dp[i]
print((dp[-1]%998244... | p02549 |
import sys
input = sys.stdin.readline
mod = 998244353
n, k = list(map(int, input().split()))
lr = [tuple(map(int, input().split())) for _ in range(k)]
lr.sort()
leaplist = []
for l, r in lr:
leaplist += list(range(l, r + 1))
pass
dp = [0] * n
dp[0] = 1
for i in range(1, n):
for l in lea... | import sys
input = sys.stdin.readline
mod = 998244353
n, k = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(k)]
lr.sort()
a = [0] * n
a[0] = 1
a[1] = -1
f = [1]
for i in range(n - 1):
for l, r in lr:
if i + l < n:
a[i + l] += f[i]
... | p02549 |
import sys
input = sys.stdin.readline
mod = 998244353
n, k = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(k)]
lr.sort()
a = [0] * n
a[0] = 1
a[1] = -1
f = [1]
for i in range(n - 1):
for l, r in lr:
if i + l < n:
a[i + l] += f[i]
... | import sys
input = sys.stdin.readline
mod = 998244353
n, k = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(k)]
lr.sort()
if lr[0][0] == 1:
f = [1, 1]
else:
f = [1, 0]
for i in range(2, n):
next_f = f[i - 1]
for l, r in lr:
if i - l ... | p02549 |
N, K = [int(_) for _ in input().split()]
LR = [[int(_) for _ in input().split()] for _ in range(K)]
mod = 998244353
class LazySegmentTree():
def __init__(self, array, f, g, h, ti, ei):
"""
Parameters
----------
array : list
to construct segment tree from
... | N, K = [int(_) for _ in input().split()]
LR = [[int(_) for _ in input().split()] for _ in range(K)]
mod = 998244353
class SegmentTree():
def __init__(self, array, f, ti):
"""
Parameters
----------
array : list
to construct segment tree from
f : func
... | p02549 |
N, K = list(map(int, input().split()))
mod = 998244353
D = []
dp = [0] * (N+10)
for i in range(K):
L, R = list(map(int, input().split()))
for i in range(L, R+1):
D.append(i)
D = sorted(D)
dp[0] = 1
for i in range(N):
for d in D:
if i + d > N:
continue
dp[i... | N, K = list(map(int, input().split()))
mod = 998244353
D = []
dp = [0] * (N+1)
for i in range(K):
L, R = list(map(int, input().split()))
D.append([L, R])
dp[0] = 1
a = 0
for i in range(N):
a += dp[i]
a %= mod
for d in D:
if i + d[0] > N:
continue
dp[i + d... | 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])
a = [0 for i in range(N+1)]
a[1] = 1
b = [0 for i in range(N+1)]
b[1] = 1
for i in range(2,N+1):
for j in range(K):
if l[j][0] < i:
a[i] += b[i-l[j][0]]-b[m... | 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()
a = [0 for i in range(N+1)]
a[1] = 1
b = [0 for i in range(N+1)]
b[1] = 1
for i in range(2,N+1):
for j in range(K):
if l[j][0] < i:
a[i] += b[i-l[j]... | 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])
l.sort()
a = [0 for i in range(N+1)]
a[1] = 1
b = [0 for i in range(N+1)]
b[1] = 1
for i in range(2,N+1):
for j in range(K):
if l[j][0] < i:
a[i] += b[i-l[j]... | N,K = list(map(int,input().split()))
l = []
mod = 998244353
for i in range(K):
L,R = list(map(int,input().split()))
l.append([L,R])
l.sort()
a = [0 for i in range(N+1)]
a[1] = 1
b = [0 for i in range(N+1)]
b[1] = 1
for i in range(2,N+1):
for j in range(K):
if l[j][0] < i:
... | p02549 |
N, K = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(K)]
D = [1]
M = 10
memo = []
for i in range(1, N):
count = 0
for l, r in LR:
if l <= i:
ll = i - min(i, r)
rr = i - l + 1
LL = (ll + M - 1) // M
RR = rr // M
if RR > LL:
... | N, K = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(K)]
D = [1]
M = 1000
memo = []
for i in range(1, N):
count = 0
for l, r in LR:
if l <= i:
ll = i - min(i, r)
rr = i - l + 1
LL = (ll + M - 1) // M
RR = rr // M
if RR > LL:
... | p02549 |
N, K = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(K)]
D = [1]
M = 5000
memo = []
for i in range(1, N):
count = 0
for l, r in LR:
if l <= i:
ll = i - min(i, r)
rr = i - l + 1
LL = (ll + M - 1) // M
RR = rr // M
if RR > LL:
... | N, K = list(map(int, input().split()))
LR = [tuple(map(int, input().split())) for _ in range(K)]
D = [1]
M = 100
memo = []
memo2 = []
for i in range(1, N):
count = 0
for l, r in LR:
if l <= i:
l1 = i - min(i, r)
r1 = i - l + 1
l2 = (l1 + M - 1) // M
r2 = r1 // M
l3 ... | p02549 |
n,k = list(map(int,input().split()))
jis = [list(map(int, input().split())) for _ in range(k)]
jis.sort()
dp = [0 for _ in range(n)]
dp[0] = 1
mod = 998244353
for i in range(1,n):
flag = True
for u,v in jis:
if flag is False: break
for w in range(u,v+1):
if i-w>=0:
dp[i] += dp[i - w]
dp[i]... | n,k = list(map(int,input().split()))
jis = [list(map(int, input().split())) for _ in range(k)]
jis.sort()
dp = [0 for _ in range(n)]
dp[0] = 1
pre = [0 for _ in range(n)]
pre[0] = 1
mod = 998244353
for i in range(1,n):
flag = True
for u,v in jis:
uu,vv = i - v, i - u
if vv >= 0:
dp[i] += pre... | p02549 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 998244353
n, k = list(map(int, input().split()))
s = set()
for i in range(k):
a, b = list(map(int, input().split()))
s.update(list(range(a, b + 1)))
s = sorted(list(s))
dp = [0] + [0] * n
dp[1] = 1
for i in range(1, n + 1... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
MOD = 998244353
n, k = list(map(int, input().split()))
s = list()
for i in range(k):
s.append(tuple(map(int, input().split())))
dp = [0] + [0] * n
diff = [0] + [0] * n
dp[1] = 1
for i in range(1, n):
for j, k in s:
if ... | p02549 |
import math
class SegmentTree():
def __init__(self, size):
self.size = 2**((size-1).bit_length())
self.val = [0]*(self.size*2)
def update(self, i, x):
i += self.size
self.val[i] = x
while i > 0:
i = i >> 1
self.val[i] = ... | class BITRAQ:
def __init__(self, n):
self.n = n + 1
self.bit = [[0]*(self.n) for _ in range(2)]
def add_sub(self, p, i, x):
while i < self.n:
self.bit[p][i] += x
i += i & -i
def add(self, l, r, x):
self.add_sub(0, l, -x * (l - 1))
... | p02549 |
class BITRAQ:
def __init__(self, n):
self.n = n + 1
self.bit = [[0]*(self.n) for _ in range(2)]
def add_sub(self, p, i, x):
while i < self.n:
self.bit[p][i] += x
i += i & -i
def add(self, l, r, x):
self.add_sub(0, l, -x * (l - 1))
... | class BITRAQ:
def __init__(self, n, mod):
self.n = n + 1
self.mod = mod
self.bit = [[0]*(self.n) for _ in range(2)]
def add_sub(self, p, i, x):
while i < self.n:
self.bit[p][i] += x
self.bit[p][i] %= self.mod
i += i & -i
... | p02549 |
mod = 998244353
def main(N, S):
dp = [0 if n != 0 else 1 for n in range(N)] # 初期値
lst_S = sorted(list(S))
for i in range(N):
if dp[i] == 0: # 計算時間削減のため， 時間さえ間に合えば不要かも．
continue
for j in lst_S:
if i + j > N - 1:
break
else:
... | mod = 998244353
# 貰うDP
def main(N, S):
dp = [0 if n != 0 else 1 for n in range(N)] # dp[i]はマスiに行く通り数． (答えはdp[-1]), dp[0] = 1 (最初にいる場所だから1通り)
A = [0 if n != 0 else 1 for n in range(N)] # dp[i] = A[i] - A[i-1] (i >= 1), A[0] = dp[0] = 1 (i = 0) が成り立つような配列を考える．
for i in range(1, N): # 今いる点 ... | p02549 |
import sys
sys.setrecursionlimit(10**9)
N, K = list(map(int, input().split()))
S = set()
MOD = 998244353
for _ in range(K):
L, R = list(map(int, input().split()))
S |= set(range(L, R + 1))
# print(f'{S=}')
DP = [-1] * (N + 1)
DP[0] = 0
DP[1] = 1
def f(idx):
ans = 0
for s in S:
... | 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))
# print(f'{LR=}')
DP = [0] * (N + 1)
DP[1] = 1
S = [0] * (N + 1)
for i in range(1, len(DP)):
for L, R in LR:
v = S[max(i - L, 0)] - S[max(i - R -... | p02549 |
from itertools import *
n, k = list(map(int, input().split()))
mod = 998244353
strides = []
for i in range(k):
l, r = list(map(int, input().split()))
for t in range(l, r + 1):
strides.append(t)
strides.sort()
d = [0] * (n + 1) # マスに対応
d[0] = 1
for i in range(1, n):
for stride in strides:
i... | n, k = list(map(int, input().split()))
mod = 998244353
d = [0] * (n + 1)
d[1] = 1
LR =[list(map(int, input().split())) for _ in range(k)]
for i in range(2, n+1):
d[i] = d[i - 1]
for l, r in LR:
if i - l <= 0:
continue
d[i] = (d[i] + (d[i-l] - d[max(0,i-r-1)])) % mod
print(((d[-1] - d[-2])... | p02549 |
import heapq
n,k=list(map(int,input().split()))
can=[]
for i in range(k):
l,r=list(map(int,input().split()))
for j in range(l,r+1):
can.append(j)
table=[0]*n
table[0]=1
ka=[0]*(n+1)
ka[0]=1
que=[0]
heapq.heapify(que)
can.sort()
while que:
now=heapq.heappop(que)
ka[now]=0
for... | p=998244353
n,k=list(map(int,input().split()))
kukan=[]
for i in range(k):
l,r=list(map(int,input().split()))
kukan.append((l,r))
dp=[0]*n
sdp=[0]*(n+1)
dp[0]=1
sdp[1]=1
for i in range(1,n):
for l,r in kukan:
left=max(0,i-r)
right=max(0,i-l+1)
dp[i]=(dp[i]+sdp[right]-sd... | p02549 |
def resolve():
#n=int(input())
#a,b=map(int,input().split())
#x=list(map(int,input().split()))
#a=[list(map(lambda x:int(x)%2,input().split())) for _ in range(h)]
n,k=list(map(int,input().split()))
a=set()
MOD=998244353
for i in range(k):
l,r=list(map(int,input().split()))... | def resolve():
#n=int(input())
#a,b=map(int,input().split())
#x=list(map(int,input().split()))
#a=[list(map(lambda x:int(x)%2,input().split())) for _ in range(h)]
n,k=list(map(int,input().split()))
MOD=998244353
lr=[list(map(int,input().split())) for _ in range(k)]
dp=[0]*(n+1)
... | p02549 |
MOD = 998244353
class ModInt(int):
def __init__(self, x):
self.x = x % MOD
def __str__(self):
return str(self.x)
__repr__ = __str__
def __add__(self, other):
return ModInt(self.x + other.x) if isinstance(other, ModInt) else ModInt(self.x + other)
def __sub__(... | def main():
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)
s = [0] * (n + 1)
dp[1] = 1
s[1] = 1
for i in range(2, n + 1):
... | p02549 |
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=998244353
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x)... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=998244353
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
# def LF(): return [float(x)... | p02549 |
inf=998244353
N,K=list(map(int,input().split()))
SS=[]
for i in range(K):
s1,s2=list(map(int,input().split()))
for j in range(s1,s2+1):
SS.append(j)
SS.sort()
table = [0 for k in range(N-1)]
for s in SS:
if s<=N-1:
table[s-1]+=1
for i in range(N-1):
if table[i]!... | inf=998244353
N,K=list(map(int,input().split()))
SS=[list(map(int,input().split())) for i in range(K)]
SS.sort()
table = [0 for k in range(N)]
diff = [0 for k in range(N-1)]
table[0]=1
diff[0]=-1
for i in range(N-1):
if table[i]!=0:
for s in SS:
lef=s[0]
rig=... | p02549 |
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(N, K, LR):
mod = 998244353
S = []
for lr in LR:
S += [i for i in range(lr[0], lr[1] + 1)]
S.sort()
dp = [0] * (N + 1)
... | # 解説などを参考に作成
"""
N = 10, LR = [2, 4] を例とする.
fi:=マスiまで移動する方法の個数とおく.
便宜上0マスから始めると、
N: 0 1 2 3 4 5 6 7 8 9 10
fi: 0 1 0 1 1 2 2 4 5 8 11
となる.(1マス目には最初からいるのでf1 = 1とする.)
ここで、N=5,6の時で考えると、LR=[2,4]から
f5 = f1 + f2 + f3 (∵2～4マス前からしか遷移がないので)
f6 = f2 + f3 + f4
よってf5とf6の差はf1とf4によって求めることができる.
... | p02549 |
N, K = list(map(int, input().split()))
S = []
for i in range(K):
L, R = list(map(int, input().split()))
S.append((L, R))
dp = [0] * (N+1)
dpsum = [0] * (N+1)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N+1):
for s in S:
l = i - s[1]
r = i - s[0]
if r < 1:continue
... | mod = 998244353
N, K = list(map(int, input().split()))
S = []
for i in range(K):
L, R = list(map(int, input().split()))
S.append((L, R))
dp = [0] * (N+1)
dpsum = [0] * (N+1)
dp[1] = 1
dpsum[1] = 1
for i in range(2, N+1):
for s in S:
l = i - s[1]
r = i - s[0]
if r ... | p02549 |
n, k = list(map(int, input().split()))
s = set()
for i in range(k):
l, r = list(map(int, input().split()))
for i in range(l, r+1):
s.add(i)
mod = 998244353
col = list(s)
counts = [0]*(n+1)
for i in range(1, n+1):
for c in col:
if c > i:
break
if c == i:
... | n, k = list(map(int, input().split()))
# n, k = (2*10**5, 10)
ranges = []
for i in range(k):
l, r = list(map(int, input().split()))
# f = (2 * 10 ** 5) // k
# l, r = (f * i, f*(i+1))
ranges.append((l, r))
mod = 998244353
counts = [0]*(n+1)
sum_dp = [0]*(n+2)
counts[0] = 1
sum_dp[1] = 1... | p02549 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 998244353
class BIT:
def __init__(self, n):
self.n = n
self.data = [0] * (n + 1)
self.step = pow(2, n.bit_length() - 1)
de... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 998244353
def main():
N, K, *LR = list(map(int, read().split()))
interval = [(l, r) for l, r in zip(*[iter(LR)] * 2)]
dp = [0] * (N + 2)
dp... | p02549 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 998244353
def main():
N, K, *LR = list(map(int, read().split()))
interval = [(l, r) for l, r in zip(*[iter(LR)] * 2)]
dp = [0] * (N + 2)
dp... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 998244353
def main():
N, K, *LR = list(map(int, read().split()))
interval = [(l, r) for l, r in zip(*[iter(LR)] * 2)]
dp = [0] * (N + 1)
dp... | p02549 |
n,k=list(map(int,input().split()))
B=[[0]*2 for i in range(k)]
for i in range(k):
B[i]=list(map(int,input().split()))
mod=998244353
A=[0]*(n+1)
A[0]=1
a=1
for i in range(n):
for j in range(k):
A[min(n,i+B[j][0])]=A[min(n,i+B[j][0])]+a
A[min(n,i+B[j][1]+1)]=A[min(n,i+B[j][1]+1)]-a
a=a+A[i+1]
p... | n,k=list(map(int,input().split()))
B=[[0]*2 for i in range(k)]
for i in range(k):
B[i]=list(map(int,input().split()))
mod=998244353
A=[0]*(n+1)
A[0]=1
a=1
for i in range(n):
for j in range(k):
A[min(n,i+B[j][0])]=(A[min(n,i+B[j][0])]+a)%mod
A[min(n,i+B[j][1]+1)]=(A[min(n,i+B[j][1]+1)]-a)%mod
a... | p02549 |
N,K=list(map(int,input().split()))
dp=[0]*(N)
dp[0]=1
mod=998244353
L=list()
for i in range(K):
a,b=list(map(int,input().split()))
L.append([a,b])
for i in range(N):
for j in range(K):
a,b=L[j]
if i>=b:
dp[i]+=sum(dp[i-b:i-a+1])
elif i>=a:
dp[i]+=sum(dp[:i-a+1])
dp[i]%=m... | N,K=list(map(int,input().split()))
dp=[0]*(N)
dp[0]=1
mod=998244353
L=list()
for i in range(K):
a,b=list(map(int,input().split()))
L.append([a,b])
R=[0,1]
for i in range(1,N):
for j in range(K):
a,b=L[j]
if i>=b:
dp[i]+=R[i-a+1]-R[i-b]
elif i>=a:
dp[i]+=R[i-a+1]
dp[i]%=... | p02549 |
n, k = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(k)]
dp = [0]*(n+1)
dp[1] = 1
mod = 998244353
for i in range(2, n+1):
for j in range(k):
li = max(i-s[j][1], 1)
ri = i-s[j][0]
if ri < 0:
continue
dp[i] += sum(dp[li: ri... | n, k = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(k)]
dp = [0]*(n+1)
dp[1] = 1
mod = 998244353
dpsum = [0]*(n+1)
dpsum[1] = 1
for i in range(2, n+1):
for j in range(k):
li = max(i-s[j][1], 1)
ri = i-s[j][0]
if ri < 0:
continu... | p02549 |
n, k = list(map(int, input().split()))
lr = [list(map(int,input().split())) for _ in range(k)]
s = []
mod = 998244353
for i in range(k):
l,r = lr[i]
for j in range(l, r+1):
s.append(j)
li = [0]*(n+1)
li[0] = 1
for i in range(n):
for j in s:
if i+j > n:
continue... | n, k = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(k)]
s = []
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 lr:
l, r = j
li = i-r
ri = i-l
if ri < 0:
conti... | p02549 |
N, K = list(map(int, input().split()))
mod = 998244353
S = []
for i in range(K):
l, r = list(map(int, input().split()))
for j in range(l, r+1):
S.append(j)
S = sorted(S)
dp = [0] * (N+1)
dp[1] = 1
for i in range(1, N):
for j in S:
if i + j > N:
break
dp[i+... | N, K = list(map(int, input().split()))
mod = 998244353
lr = [0] * K
for i in range(K):
lr[i] = list(map(int, input().split()))
lr[i][1] += 1
dp = [0] * (N+1)
dp[1] = 1
s = 0
for i in range(1, N):
s += dp[i]
for j in range(K):
if (i + lr[j][0]) <= N:
dp[i + lr[j][0]] = ... | p02549 |
p = 998244353
n, k = list(map(int, input().split()))
LRs = []
for j in range(k):
lj, rj = list(map(int, input().split()))
LRs.append((lj, rj))
A = [0] * (n + 1)
i0 = min(lj for lj, rj in LRs)
A[0] = 1
A[i0] = 1
for i in range(i0 + 1, n):
A[i] = A[i - 1]
for j in range(k):
lj, rj = L... | p = 998244353
n, k = list(map(int, input().split()))
LRs = [tuple(map(int, input().split())) for _ in range(k)]
A = [0] * (2 * n + 1)
for lj, rj in LRs:
A[lj] += 1
A[rj + 1] -= 1
s = 0
for i in range(1, n):
s = (s + A[i]) % p
for lj, rj in LRs:
A[i + lj] += s
A[i + rj + 1] -=... | p02549 |
n,m,q=list(map(int,input().split()))
counts=[[0 for _ in range(n)] for _ in range(n)]
for _ in range(m):
l,r=list(map(int,input().split()))
counts[l-1][r-1]+=1
cumsum=[[0 for _ in range(n+1)] for _ in range(n)]
for i in range(n):
for j in range(n):
cumsum[i][j+1]=cumsum[i][j]+counts[i][j]
... | n,m,q=list(map(int,input().split()))
counts=[[0 for _ in range(n)] for _ in range(n)]
for _ in range(m):
l,r=list(map(int,input().split()))
counts[l-1][r-1]+=1
cumsum=[[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(n):
for j in range(n):
cumsum[i+1][j+1]=cumsum[i+1][j]+counts[i]... | p03283 |
#!/usr/bin/env python3
import sys
def solve(N: int, M: int, Q: int, L: "List[int]", R: "List[int]", p: "List[int]", q: "List[int]"):
matrix = [[0]*(N+1) for _ in range(N+1)]
for i in range(M):
matrix[L[i]][R[i]] += 1
for j in range(Q):
answer = 0
for k in range(p[j],q... | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, Q: int, L: "List[int]", R: "List[int]", p: "List[int]", q: "List[int]"):
matrix = [[0]*(N+1) for _ in range(N+1)]
for i in range(M):
matrix[L[i]][R[i]] += 1
ruisekiwa = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
... | p03283 |
#!/usr/bin/env python3
import sys
def solve(N: int, M: int, Q: int, L: "List[int]", R: "List[int]", p: "List[int]", q: "List[int]"):
matrix = [[0]*(N+1) for _ in range(N+1)]
for i in range(M):
matrix[L[i]][R[i]] += 1
ruisekiwa = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
... | #!/usr/bin/env python3
import sys
def solve(N: int, M: int, Q: int, L: "List[int]", R: "List[int]", p: "List[int]", q: "List[int]"):
matrix = [[0]*(N+1) for _ in range(N+1)]
for i in range(M):
matrix[L[i]][R[i]] += 1
for i in range(1,N+1):
for j in range(1,N+1):
... | p03283 |
import sys
from collections import Counter
from collections import deque
import math
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,input().split()))
n,m,Q=mp()
grid=[[0]*(n+1) for i in range(n+1)]
for i in range(m):
l,r=mp... | import sys
from collections import Counter
from collections import deque
import math
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,input().split()))
n,m,Q=mp()
grid=[[0]*(n+1) for i in range(n+1)]
for i in range(m):
l,r=mp... | p03283 |
def main():
N,M,Q = list(map(int, input().split()))
X = [[0 for _ in range(N)] for _ in range(N)]
"""
for i in range(M):
l,r = map(int, input().split())
X[l-1][r-1] += 1
"""
LR = [list(map(int, input().split())) for _ in range(M)]
query = [tuple(map(int, ... | N,M,Q = list(map(int, input().split()))
train = [[0 for _ in range(N)] for _ in range(N)]
for _ in range(M):
l,r = list(map(int, input().split()))
train[l-1][r-1] += 1
query = [tuple(map(int, input().split())) for _ in range(Q)]
"""
l~rの間を走ってるやつ
→ {l~l + l~l+1 + l~l+2 + ... + l~r} + {l+1~l+1 + l+1... | p03283 |
n,m,q=list(map(int,input().split()))
h=[[0]*(n) for _ in range(n)]
for i in range(m):
l,r=list(map(int,input().split()))
l-=1
r-=1
h[n-1-l][r]+=1
ans=0
for i in range(n):
for j in range(n-1):
h[i][j+1] += h[i][j]
for j in range(n):
for i in range(n-1):
h[i+1][j] +... | n,m,q=list(map(int,input().split()))
g=[[0]*n for _ in [0]*n]
for i in range(m):
l,r=list(map(int,input().split()))
l-=1
r-=1
g[n-l-1][r]+=1
for i in range(n):
for j in range(n-1):
g[i][j+1]+=g[i][j]
for i in range(n):
for j in range(n-1):
g[j+1][i]+=g[j][i]
for ... | p03283 |
N, M, Q = list(map(int, input().split()))
train = []
for i in range(0, N):
train.append([])
for i in range(0, M):
L, R = list(map(int, input().split()))
train[L-1].append(R)
for i in range(0, N):
train[i-1].sort()
counter = []
for i in range(0, N):
lst = []
for j in range(0, N):
lst.append(0)
... | N, M, Q = list(map(int, input().split()))
train = []
for i in range(0, N):
train.append([])
for i in range(0, M):
L, R = list(map(int, input().split()))
train[L-1].append(R)
for i in range(0, N):
train[i-1].sort()
counter = []
for i in range(0, N):
lst = []
for j in range(0, N):
lst.append(0)
... | p03283 |
N, M, Q = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(M)]
Y = [list(map(int, input().split())) for _ in range(Q)]
p = [[0] * (N + 1) for _ in range(N + 1)]
for l, r in X:
p[l][r] += 1
for i in range(1, N + 1):
for j in range(1, N + 1):
p[i][j] +=... | N, M, Q = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(M)]
Y = [list(map(int, input().split())) for _ in range(Q)]
grid = [[0] * (N + 1) for _ in range(N + 1)]
for l, r in X:
grid[l][r] += 1
for i in range(N):
for j in range(N):
grid[i + 1][j + 1] += gr... | p03283 |
import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(100000)
def read_values():
return list(map(int, input().split()))
def read_index():
return [x - 1 for x in list(map(int, input().split()))]
def read_list():
return list(read_values())
def read_lists(N):
... | import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(100000)
def read_values():
return list(map(int, input().split()))
def read_index():
return [x - 1 for x in list(map(int, input().split()))]
def read_list():
return list(read_values())
def read_lists(N):
... | p03283 |
from copy import deepcopy
N, M, Q = [int(elem) for elem in input().split(' ')]
lines = [[int(elem) for elem in input().split(' ')] for _ in range(M)]
queries = [[int(elem) for elem in input().split(' ')] for _ in range(Q)]
def cuml_1d(N, lines, queries):
coords = [[0] * N for _ in range(N)]
for l, r... | import sys
fin = sys.stdin.readline
N, M, Q = [int(elem) for elem in fin().split()]
trains = [[int(elem) - 1 for elem in fin().split()] for _ in range(M)]
queries = [[int(elem) - 1 for elem in fin().split()] for _ in range(Q)]
map_2D = [[0] * N for _ in range(N)]
for l, r in trains:
map_2D[l][r] += 1
... | p03283 |
# Reference: https://ikatakos.com/pot/programming_algorithm/data_structure/binary_indexed_tree
# Fenwick Tree
class BinaryIndexedTree:
# a = [0] * n
# O(n)
def __init__(self, n):
self.size = n
self.data = [0] * (n+1)
# return sum(a[0:i])
# O(log(n))
def cumulative_sum... | from sys import stdin
input = stdin.buffer.readline
def main():
n, m, q = list(map(int, input().split()))
# Two-dimensional Cumulative Sum
cs = [[0] * (n+1) for _ in range(n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
cs[l][r] += 1
for l in range(1,... | p03283 |
N,M,Q = list(map(int,input().split()))
Train = [list(map(int,input().split())) for i in range(M)]
Query = [list(map(int,input().split())) for i in range(Q)]
City = [[0]*N for i in range(N)]
Accum = [[0]*(N+1) for i in range(N+1)]
for train in Train:
City[train[0]-1][train[1]-1] += 1
for i in range(N):
... | import sys
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
D = [[0 for j in range(N)] for i in range(N)]
for _ in range(M):
l, r = list(map(int, input().split()))
D[l - 1][r - 1] += 1
for i in range(N):
for j in range(1, N):
D[i][j] += D[i][j - 1]
for j in ra... | p03283 |
N, M, Q = list(map(int, input().split()))
class Ruisekiwa2D:
def __init__(self, h, w):
self.H = h
self.W = w
self.G = [[0] * w for _ in range(h)]
def load(self, points):
# 問題によってイメージしやすいよう書き換えてください
# load終了時にcalcが呼ばれることに注意してください
for x, y in points:
... | N, M, Q = list(map(int, input().split()))
X = []
for i in range(M):
l, r = list(map(int, input().split()))
l, r = l - 1, r - 1
X.append((l, r))
class Ruisekiwa2D:
def __init__(self, h, w):
self.H = h
self.W = w
self.G = [[0] * w for _ in range(h)]
def load(se... | p03283 |
# ABC106D - AtCoder Express 2
from itertools import accumulate as acc
def main():
# 2D cumulative sum
N, M, Q, *X = list(map(int, open(0).read().split()))
LR, PQ = X[: 2 * M], X[2 * M :]
rails = [[0] * (N + 1) for _ in range(N + 1)]
for l, r in zip(*[iter(LR)] * 2):
rails[l][r] +... | # ABC106D - AtCoder Express 2
from itertools import accumulate as acc
def main():
# 2D cumulative sum
N, M, Q, *X = list(map(int, open(0).read().split()))
LR, PQ = X[: 2 * M], X[2 * M :]
rails = [[0] * (N + 1) for _ in range(N + 1)]
for l, r in zip(*[iter(LR)] * 2):
rails[l][r] +... | p03283 |
n, m, q = list(map(int, input().split()))
trnum = [[0 for _ in range(n+1)] for _ in range(n+1)]
cnum = [[0 for _ in range(n+1)] for _ in range(n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
trnum[l][r] += 1
for i in range(n+1):
for j in range(n+1):
cnum[i][j] = cnum[i][j-1] + trnum[... | n, m, q = list(map(int, input().split()))
trnum = [[0 for _ in range(n+1)] for _ in range(n+1)]
cnum = [[0 for _ in range(n+1)] for _ in range(n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
trnum[l][r] += 1
for i in range(1, n+1):
for j in range(1, n+1):
trnum[i][j] += trnum[i][j-1]... | p03283 |
N, M, Q = list(map(int, input().split()))
LR = [[0 for i in range(501)] for j in range(501)]
for i in range(M):
L, R = list(map(int, input().split()))
LR[L][R] += 1
LR2 = [[0 for i in range(501)] for j in range(501)]
for i in range(1, 501):
for j in range(1, 501):
LR2[i][j] = LR2[i][j - 1] +... | N, M, Q = list(map(int, input().split()))
LR = [[0 for i in range(N)] for j in range(N)]
for i in range(M):
L, R = list(map(int, input().split()))
LR[L - 1][R - 1] += 1
for i in range(1, N):
LR[0][i] += LR[0][i - 1]
LR[i][0] += LR[i - 1][0]
for i in range(1, N):
for j in range(1, N):
... | p03283 |
n,m,Q = list(map(int, input().split()))
train = []
for i in range(n):
a = []
for j in range(n):
a.append(0)
train.append(a)
for i in range(m):
l,r = list(map(int, input().split()))
train[l-1][r-1] += 1
for i in range(n):
lst = [0,train[i][0]]
for j in range(1,n):
lst.append(lst[... | n,m,Q = list(map(int, input().split()))
train = []
for i in range(n):
a = []
for j in range(n):
a.append(0)
train.append(a)
for i in range(m):
l,r = list(map(int, input().split()))
train[l-1][r-1] += 1
cumsum = []
list1 = []
for i in range(n+1):
list1.append(0)
cumsum.append(list1)
fo... | p03283 |
import collections
import bisect
import copy
def main():
N, M, Q = list(map(int, input().split()))
train = []
for _ in range(M):
l, r = list(map(int, input().split()))
train.append([l, r])
train.sort()
# print(train)
end = []
ends = []
j = M-1
for i ... | def main():
N, M, Q = list(map(int, input().split()))
train = [[0 for _ in range(N)] for _ in range(N)]
for _ in range(M):
l, r = list(map(int, input().split()))
train[l-1][r-1] += 1
accum = [[0 for _ in range(N+1)]]
for i in range(N):
temp = [0]
v = 0
... | p03283 |
N,M,Q = list(map(int,input().split()))
Section = [[0]*N for _ in range(N)]
for _ in range(M):
L,R = list(map(int,input().split()))
Section[L-1][R-1] += 1
Sum = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N):
Sum[i+1][j+1] = Sum[i][j+1]+Sum[i+1][j]-Sum[i][j]+Section[... | import sys
s = sys.stdin.readlines()
N,M,Q = list(map(int,s[0].split()))
Section = [[0]*N for _ in range(N)]
for L,R in (list(map(int, e.split())) for e in s[1:M+1]):
Section[L-1][R-1] += 1
Sum = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N):
Sum[i+1][j+1] = Sum[i][j+... | p03283 |
import sys
s = sys.stdin.readlines()
N,M,Q = list(map(int,s[0].split()))
Section = [[0]*N for _ in range(N)]
for L,R in (list(map(int, e.split())) for e in s[1:M+1]):
Section[L-1][R-1] += 1
Sum = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N):
Sum[i+1][j+1] = Sum[i][j+... | import sys
s = sys.stdin.readlines()
N,M,Q = list(map(int,s[0].split()))
Section = [[0]*N for _ in range(N)]
for L,R in (list(map(int, e.split())) for e in s[1:M+1]):
Section[L-1][R-1] += 1
Sum = [[0]*(N+1) for _ in range(N+1)]
for i in range(N):
for j in range(N):
Sum[i+1][j+1] = Sum[i][... | p03283 |
n,m,q = list(map(int, input().split()))
mmap = [ [ 0 for j in range(n+1) ] for i in range(n+1) ]
for i in range(m):
s,e = list(map(int, input().split()))
mmap[s][e] += 1
for i in range(q):
s,e = list(map(int, input().split()))
cnt = 0
for j in range(s,e+1):
for k in range(s,e+1):
cnt += mm... | n,m,q = list(map(int, input().split()))
mmap = [ [ 0 for j in range(n+1) ] for i in range(n+1) ]
for i in range(m):
s,e = list(map(int, input().split()))
mmap[s][e] += 1
for i in range(n+1):
for j in range(1,n+1):
mmap[i][j] = mmap[i][j] + mmap[i][j-1]
for j in range(n+1):
for i in range(n-1,0,-1):... | p03283 |
# input
N, M, Q = list(map(int, input().split()))
Trains = [list(map(int, input().split())) for _ in range(M)]
Trains = sorted(Trains)
Questions = {}
for i in range(Q):
Questions[i] = list(map(int, input().split()))
Questions = sorted(list(Questions.items()), key = lambda x: x[1])
Ans = [0 for _ in rang... | # input
N, M, Q = list(map(int, input().split()))
train_query = {} # 対象区間とクエリを一緒にソート
for i in range(M + Q):
train_query[i] = list(map(int, input().split()))
train_query = sorted(list(train_query.items()), key=lambda x: x[1][1])
# 辞書をソートするとリストが返ってくることに注意
StartPoints = [0 for _ in range(N)] # 対象区間の開始位置
an... | p03283 |
n, m, q = list(map(int,input().split()))
ways = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(m):
l,r = list(map(int,input().split()))
ways[l][r] += 1
sgways = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(1,n+1):
for j in range(i,n+1):
for k in range(i,j+1):
... | n, m, q = list(map(int,input().split()))
ways = [[0 for i in range(n+2)] for j in range(n+2)]
for i in range(m):
l,r = list(map(int,input().split()))
ways[l][r] += 1
sgways = [[0 for i in range(n+2)] for j in range(n+2)]
for j in range(1,n+1):
for i in range(j):
sgways[j-i][j] = sgways[j-i... | p03283 |
N, M, Q = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
pq = [list(map(int, input().split())) for _ in range(Q)]
XY = [[0 for _ in range(N)] for _ in range(N)]
for l, r in LR:
XY[l - 1][r - 1] += 1
for i in range(N):
for j in range(N - 1):
XY[i][j +... | N, M, Q = list(map(int, input().split()))
LR = [list(map(int, input().split())) for _ in range(M)]
pq = [list(map(int, input().split())) for _ in range(Q)]
XY = [[0 for _ in range(N)] for _ in range(N)]
for l, r in LR:
XY[l - 1][r - 1] += 1
for i in range(N):
for j in range(N):
if i == 0 and... | p03283 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
#from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import ... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, copy,bisect
from operator import itemgetter
#from heapq import heappush, heappop
#import numpy as np
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson
#from scipy.sparse import c... | p03283 |
n, m, q = list(map(int, input().split()))
x = [[0]*n for _ in range(n)]
for i in range(m):
l, r = list(map(int, input().split()))
l, r = l-1, r-1
x[l][r] += 1
s = [[0]*(n+1) for _ in range(n+1)]
for i in range(n):
for j in range(n):
s[i+1][j+1] = s[i+1][j] + s[i][j+1] - s[i][j] + x[i][j]
... | n, m, q = list(map(int, input().split()))
A = [[0]*n for i in range(n)]
for i in range(m):
l, r = list(map(int, input().split()))
l, r = l-1, r-1
A[l][r] += 1
#print(A)
s = [[0]*(n+1) for _ in range(n+1)]
for i in range(n):
for j in range(n):
s[i+1][j+1] = s[i+1][j] + s[i][j+1] - s[i... | p03283 |
from itertools import accumulate
N, M, Q = list(map(int, input().split()))
D = [[0] * (N + 1) for i in range(N + 1)]
for _ in range(M):
L, R = list(map(int, input().split()))
D[L][R] += 1
for i in range(N - 1, 0, -1):
for j in range(1, N + 1):
D[i][j] += D[i + 1][j]
for i in range(1, N + 1)... | from sys import stdin
from itertools import accumulate
input = stdin.readline
N, M, Q = list(map(int, input().split()))
D = [[0] * (N + 1) for i in range(N + 1)]
for _ in range(M):
L, R = list(map(int, input().split()))
D[L][R] += 1
for i in range(N - 1, 0, -1):
for j in range(i, N + 1):
D... | p03283 |
import sys
input = sys.stdin.readline
N, M, Q = [int(x) for x in input().split()]
L = [0] * M
R = [0] * M
p = [0] * Q
q = [0] * Q
for i in range(M):
L[i], R[i] = [int(x) for x in input().split()]
for j in range(Q):
p[j], q[j] = [int(x) for x in input().split()]
train = [[0 for i in range(N + 1)] ... | import sys
input = sys.stdin.readline
N, M, Q = [int(x) for x in input().split()]
L = [0] * M
R = [0] * M
p = [0] * Q
q = [0] * Q
for i in range(M):
L[i], R[i] = [int(x) for x in input().split()]
for j in range(Q):
p[j], q[j] = [int(x) for x in input().split()]
train = [[0 for i in range(N + 1)] ... | p03283 |
N, M, Q = list(map( int, input().split()))
NN = [ [ 0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
L, R = list(map( int, input().split()))
NN[L][R] += 1
Sum = [ [ 0 ] for _ in range(N+1)]
for i in range(1,N+1):
for j in range(1,N+1):
Sum[i].append(Sum[i][-1]+NN[i][j])
for _ ... | N, M, Q = list(map( int, input().split()))
NN = [ [0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
L, R = list(map( int, input().split()))
NN[L][R] += 1
for i in range(1,N+1):
for j in range(1,N+1):
NN[i][j] += NN[i][j-1]+NN[i-1][j]-NN[i-1][j-1]
for _ in range(Q):
p, q ... | p03283 |
N,M,Q = list(map(int,input().split()))
station = [[0]*N for i in range(N)]
for i in range(M):
L,R = list(map(int,input().split()))
station[L-1][R-1] += 1
DP = [[0]*(N) for i in range(N)]
for i in range(N):
for j in range(N):
for a in range(i,j+1):
for b in range(i,j+1):
... | N,M,Q = list(map(int,input().split()))
station = [[0]*(N+1) for i in range(N+1)]
for i in range(M):
l,r = list(map(int,input().split()))
station[l][r] += 1
DP = [[0]*(N+1) for i in range(N+1)]
for i in range(N+1):
for j in range(N):
DP[i][j+1] = DP[i][j] + station[i][j+1]
for i in... | p03283 |
n, m, q = list(map(int, input().split()))
tr = []
for i in range(m):
l, r = list(map(int, input().split()))
tr.append((l, r))
qu = []
for i in range(q):
p, q = list(map(int, input().split()))
qu.append((p, q))
print((len(list([s for s in tr if p <= s[0] and s[1] <= q])))) | n, m, q = list(map(int, input().split()))
T = [[0] * n for i in range(n)]
for i in range(m):
l, r = list(map(int, input().split()))
T[l - 1][r - 1] += 1
for i in range(n):
for j in range(1, n):
T[i][j] += T[i][j - 1]
for j in range(n):
for i in range(n - 2, -1, -1):
T[i][j]... | p03283 |
from copy import deepcopy
n, m, q = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
pq = [list(map(int, input().split())) for _ in range(q)]
cnt = [[0] * (n + 1) for _ in range(n + 1)]
for l, r in lr:
cnt[l][r] += 1
acc = deepcopy(cnt)
for i in range(n):
f... | n, m, q = list(map(int, input().split()))
lr = [list(map(int, input().split())) for _ in range(m)]
pq = [list(map(int, input().split())) for _ in range(q)]
acc = [[0] * (n + 1) for _ in range(n + 1)]
for l, r in lr:
acc[l][r] += 1
for i in range(n):
for j in range(n):
tmp = acc[i][j + 1] + acc... | p03283 |
N, M, Q = list(map(int, input().split()))
X = [[0 for j in range(510)] for i in range(510)]
C = [[0 for j in range(510)] for i in range(510)]
LR = []
for i in range(M):
L, R = list(map(int, input().split()))
X[L][R] += 1
for i in range(1, N+1):
for j in range(1, N+1):
C[i][j] = C[i][j... | N, M, Q = list(map(int, input().split()))
# 入力
A = [[0 for j in range(N+1)] for i in range(N+1)]
for _ in range(M):
L, R = list(map(int, input().split()))
A[L][R] += 1
# 二次元累積和
Cum = [[0 for j in range(N+1)] for i in range(N+1)]
for i in range(N):
for j in range(N):
Cum[i+1][j+1] = C... | p03283 |
n,m,q=list(map(int,input().split()))
g=[[0 for i in range(n)] for j in range(n)]
for i in range(m):
a,b=list(map(int,input().split()))
a-=1
b-=1
g[a][b]+=1
r=[[0 for i in range(n+1)] for j in range(n)]
for i in range(n):
for j in range(1,n+1):
r[i][j]=r[i][j-1]+g[i][j-1]
for i in ... | n,m,q=list(map(int,input().split()))
g=[[0 for i in range(n+1)] for j in range(n+1)]
for i in range(m):
a,b=list(map(int,input().split()))
#a-=1
#b-=1
g[a][b]+=1
for i in range(n):
for j in range(n+1):
g[i+1][j]+=g[i][j]
for i in range(n+1):
for j in range(n):
g... | p03283 |
n, m, Q = list(map(int, input().split()))
LR = [[0 for _ in range(n)] for _ in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
LR[l-1][r-1] += 1
# 各Lについて累積和を取る
LR_rui = [[0] for _ in range(n)]
for i in range(n):
for j in range(n):
LR_rui[i].append(LR[i][j]+LR_rui[i][-1... | n, m, Q = list(map(int, input().split()))
LR = [[0 for _ in range(n)] for _ in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
LR[l-1][r-1] += 1
# 二次元累積和の作成
LR_rui = [[0 for _ in range(n+1)] for _ in range(n+1)]
# 各Lについての累積
for i in range(n):
for j in range(n):
LR_rui... | p03283 |
n,m,q = list(map(int,input().split()))
lr = [[0 for i in range(n+1)] for j in range(n+1)]
#lr = [[int(i) for i in input().split()]for j in range(m)]
st = [0] * (n+1)
ed = [0] * (n+1)
for i in range(m):
l,r = list(map(int,input().split()))
lr[l][r] += 1
pq = [[int(i) for i in input().split()]for ... | n,m,q = list(map(int,input().split()))
lr = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(m):
l,r = list(map(int,input().split()))
lr[l][r] += 1
pq = [[int(i) for i in input().split()]for j in range(q)]
dp = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(1,n+1):
... | p03283 |
N,M,Q=list(map(int,input().split()))
Town=[[int(i) for i in input().split()] for i in range(M)]
Town.sort(key=lambda x:x[0])
def BS_left(x,L,s):
L_copy=L[:]
left=0
if L[s-1]<x:
return s-1
else:
while s>2:
if L_copy[s//2]<x:
L_copy=L_copy[s//2:s]
left+=s//2
s=... | N,M,Q=list(map(int,input().split()))
Train=[[int(i) for i in input().split()] for i in range(M)]
Map=[[0]*(N+1) for i in range(N+1)]
for i in Train:
x,y=i[0],i[1]
Map[y][x]+=1
for a in range(1,N+1):
for b in range(1,N+1):
if b<=N-1:
Map[a][b+1]=Map[a][b]+Map[a][b+1]
if a>=2:
Map[a][... | p03283 |
N, M, Q = list(map(int, input().split()))
A = [[0] * N for _ in range(N)]
for _ in range(M):
l, m = list(map(int, input().split()))
A[l - 1][m - 1] += 1
questions = []
for _ in range(Q):
p, q = list(map(int, input().split()))
questions.append((p - 1, q - 1))
D = []
for l in range(N):
... | N, M, Q = list(map(int, input().split()))
A = [[0] * N for _ in range(N)]
for _ in range(M):
l, m = list(map(int, input().split()))
A[l - 1][m - 1] += 1
questions = []
for _ in range(Q):
p, q = list(map(int, input().split()))
questions.append((p - 1, q - 1))
D = []
for l in range(N):
... | p03283 |
N, M, Q = list(map(int, input().split()))
A = [[0] * N for _ in range(N)]
for _ in range(M):
l, m = list(map(int, input().split()))
A[l - 1][m - 1] += 1
questions = []
for _ in range(Q):
p, q = list(map(int, input().split()))
questions.append((p - 1, q - 1))
D = []
for l in range(N):
... | N, M, Q = list(map(int, input().split()))
A = [[0] * N for _ in range(N)]
for _ in range(M):
l, m = list(map(int, input().split()))
A[l - 1][m - 1] += 1
questions = []
for _ in range(Q):
p, q = list(map(int, input().split()))
questions.append((p - 1, q - 1))
D = []
for l in range(N):
... | p03283 |
n, m, Q = list(map(int, input().split()))
imos = [[0 for i in range(n)] for j in range(n)]
for i in range(m):
l, r = list(map(int, input().split()))
l -= 1
r -= 1
imos[l][r] += 1
for i in range(n):
for j in range(n-1):
imos[i][j+1] += imos[i][j]
for j in range(n):
for ... | n, m, q = list(map(int, input().split()))
imos = [[0 for i in range(n)] for j in range(n)]
for i in range(m):
l, r = list(map(int, input().split()))
imos[l-1][r-1] += 1
for i in range(n):
for j in range(n-1):
imos[i][j+1] += imos[i][j]
for j in range(n):
for i in range(n-1):
... | p03283 |
#横にn個入力
n, m, q = list(map(int, input().split()))
#行列
s = []
for i in range(m):#h:高さ
s.append([int(m) for m in input().split()] + [i])
# 行列
t = []
for i in range(q): # h:高さ
t.append([int(m) for m in input().split()])
lin = []
li0 = []
for i in range(n):
lin.append(set())
li0.append(set(... | #横にn個入力
n, m, q = list(map(int, input().split()))
#行列
s = []
for i in range(m):#h:高さ
s.append([int(m) for m in input().split()] + [i])
# 行列
t = []
for i in range(q): # h:高さ
t.append([int(m) for m in input().split()])
LR = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for v in range(m):
L... | p03283 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemge... | p03283 |
from bisect import bisect
n,m,q=(int(i) for i in input().strip().split(" "))
from collections import defaultdict
d=defaultdict(list)
for _ in range(m):
a,b=(int(i) for i in input().strip().split(" "))
d[a].append(b)
for i in list(d.keys()):
d[i].sort()
for i in range(q):
l,r=(int(i) for i in i... |
n,m,q=(int(i) for i in input().strip().split(" "))
from collections import defaultdict
d=defaultdict(int)
for _ in range(m):
a,b=(int(i) for i in input().strip().split(" "))
d[(a,b)]+=1
for i in range(1,n+1):
for j in range(1,n+1):
d[(i,j)]+=d[(i,j-1)]
for i in range(1,n+1):
for j ... | p03283 |
num_city, num_train, num_question = [int(i) for i in input().split()]
#電車の数
trains = [[0] * (num_city + 1) for i in range(0, num_city + 1)]
for i in range(0, num_train):
start, arrive = [int(j) for j in input().split()]
trains[start][arrive] += 1
#累積和表を作る
trains_cumulative_sum = [[0] * (num_city + 1)... | num_city, num_train, num_question = [int(i) for i in input().split()]
#電車の数
trains = [[0] * (num_city + 1) for i in range(0, num_city + 1)]
for i in range(0, num_train):
start, arrive = [int(j) for j in input().split()]
trains[start][arrive] += 1
#累積和表を作る
cumlative_sum = [[0] * (num_city + 1) for i i... | p03283 |
# D - AtCoder Express 2
# https://atcoder.jp/contests/abc106/tasks/abc106_d
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lam... | # D - AtCoder Express 2
# https://atcoder.jp/contests/abc106/tasks/abc106_d
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lam... | p03283 |
N, M, Q = list(map(int,input().split()))
m = [[0 for y in range(N+1)] for x in range(N+1)]
m2 = [[0 for y in range(N+1)] for x in range(N+1)]
for i in range(M):
l, r = list(map(int,input().split()))
m[l][r]+=1
for i in range(1,N+1):
s=m[i][i]
m2[i][i]=s
for j in range(i+1,N+1):
... | N, M, Q = list(map(int,input().split()))
m = [[0 for y in range(N+1)] for x in range(N+1)]
m2 = [[0 for y in range(N+1)] for x in range(N+1)]
m3 =[[0 for y in range(N+1)] for x in range(N+1)]
for i in range(M):
l, r = list(map(int,input().split()))
m[l][r]+=1
for j in range(1, N+1):
s=0
f... | p03283 |
n, m, q = list(map(int, input().split()))
Arr = []
for i in range(n+1):
Arr.append([0] * (n+1))
for i in range(m):
l, r = list(map(int, input().split()))
Arr[l][r] += 1
#print(Arr)
for i in range(q):
left, right = list(map(int, input().split()))
train_num = 0
for j in range(left, right+1):
... | n, m, q = list(map(int, input().split()))
Arr = []
for i in range(n+1):
Arr.append([0] * (n+1))
for i in range(m):
l, r = list(map(int, input().split()))
Arr[l][r] += 1
#print(Arr)
B = []
for i in range(n+1):
B_line = [0]
for j in range(1, n+1):
B_line.append(B_line[-1] + Arr[i][j])
B.app... | p03283 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03283 |
N, M, Q = list(map(int, input().split()))
Mi = [list(map(int, input().split())) for i in range(M)]
Qi = [list(map(int, input().split())) for i in range(Q)]
qi = [Qi[i].extend([0, i]) for i in range(Q)]
Mi.sort()
Qi.sort()
for mi in Mi:
for i in range(Q):
if mi[0] < Qi[i][0]:
continue
... | N, M, Q = list(map(int, input().split()))
LR = [[0] * (N+1) for _ in range(N+1)]
for m in range(M):
l, r = list(map(int, input().split()))
LR[l][r] += 1
# 二次元累積和をとる
LR_sum = [[0] * (N+1) for _ in range(N+1)]
LR_sum[1][1] = LR[1][1]
## 初期化
for i in range(1, N+1):
LR_sum[1][i] = LR_sum[1][i-1] + L... | p03283 |
N,M,Q = list(map(int, input().split()))
LR = [list(map(int, input().split())) for i in range(M)]
pq = [list(map(int, input().split())) for i in range(Q)]
res = [[0]*N for i in range(N)]
def lsadd(L,R):
L-=1
R-=1
for i in range(0,L+1):
for j in range(R,N):
res[i][j] += ... | N,M,Q = list(map(int, input().split()))
LR = [list(map(int, input().split())) for i in range(M)]
pq = [list(map(int, input().split())) for i in range(Q)]
res = [[0]*N for i in range(N)]
def lsadd(L,R):
L-=1
R-=1
for i in range(0,L+1):
res[i][R] += 1
for l,r in LR:
lsadd(l,r)
... | p03283 |
from itertools import accumulate
n, m, q = list(map(int, input().split()))
rails = [[0] * n for _ in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
rails[l - 1][r - 1] += 1
rails = [list(accumulate(s)) for s in rails]
rails = [list(reversed(list(accumulate(reversed(s))))) for s in ... | import sys
from itertools import accumulate
n, m, q = list(map(int, input().split()))
ipt = sys.stdin.readlines()
rails = [[0] * n for _ in range(n)]
for l, r in (list(map(int, line.split())) for line in ipt[:m]):
rails[l - 1][r - 1] += 1
rails = [list(reversed(list(accumulate(reversed(s))))) for s in zip(... | p03283 |
import sys
from itertools import accumulate
n, m, q = list(map(int, input().split()))
ipt = sys.stdin.readlines()
rails = [[0] * n for _ in range(n)]
for l, r in (list(map(int, line.split())) for line in ipt[:m]):
rails[l - 1][r - 1] += 1
rails = [list(reversed(list(accumulate(reversed(s))))) for s in zip(... | import sys
from itertools import accumulate, islice
n, m, q = list(map(int, input().split()))
ipt = (list(map(int, line.split())) for line in sys.stdin.readlines())
rails = [[0] * n for _ in range(n)]
for l, r in islice(ipt, m):
rails[l - 1][r - 1] += 1
rails = [list(accumulate(reversed(s))) for s in zip(*... | p03283 |
import sys
from itertools import accumulate, islice
n, m, q = list(map(int, input().split()))
ipt = (list(map(int, line.split())) for line in sys.stdin.readlines())
rails = [[0] * n for _ in range(n)]
for l, r in islice(ipt, m):
rails[l - 1][r - 1] += 1
rails = [list(accumulate(reversed(s))) for s in zip(*... | import sys
from itertools import accumulate, islice
n, m, q = list(map(int, input().split()))
ipt = (list(map(int, line.split())) for line in sys.stdin.readlines())
rails = [[0] * n for _ in range(n)]
for l, r in islice(ipt, m):
rails[l - 1][r - 1] += 1
rails = [list(accumulate(reversed(s))) for s in zip(*... | p03283 |
import bisect
N,M,Q=list(map(int,input().split()))
Rli=[[] for _ in range(N)]
for i in range(M):
l,r=list(map(int,input().split()))
Rli[l-1].append(r)
for i in range(N):
Rli[i].sort()
for i in range(Q):
ans=0
p,q=list(map(int,input().split()))
for j in range(p-1,N):
ans+=bisect.bisect_ri... | import bisect
N,M,Q=list(map(int,input().split()))
LR=[[0]*(N+1) for _ in range(N)]
for i in range(M):
l,r=list(map(int,input().split()))
LR[l-1][r]+=1
for i in range(N):
for j in range(1,N+1):
LR[i][j]+=LR[i][j-1]
for _ in range(Q):
ans=0
p,q=list(map(int,input().split()))
for i in rang... | p03283 |
# 累積和
# PyPy なら通る
N, M, Q = list(map(int, input().split()))
t = [[0] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
L, R = list(map(int, input().split()))
t[L][R] += 1
for i in range(N + 1):
for j in range(N):
t[i][j + 1] += t[i][j]
result = []
for _ in range(Q):
p, q = li... | # 累積和
# PyPy なら通る
N, M, Q = map(int, input().split())
t = [[0] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
L, R = map(int, input().split())
t[L][R] += 1
for i in range(N + 1):
for j in range(N):
t[i][j + 1] += t[i][j]
result = []
for _ in range(Q):
p, q = map(int, input... | p03283 |
from bisect import bisect_left
n,m,q=list(map(int,input().split())) #0-indexed
tree=[[] for i in range(n)]
lentree=[0]*n
for i in range(m):
l,r=list(map(int,input().split()))
tree[l-1].append(r-1)
for i in range(n):
if tree[i]!=[]:
tree[i].sort()
for i in range(n):
lentree[i]+=len(tree[... | import itertools
n,m,q=list(map(int,input().split())) #0-indexed
LR=[[0]*(n+1) for i in range(n+1)]
for i in range(m):
l,r=list(map(int,input().split()))
LR[l][r]+=1
for i in range(n):
LR[i]=list(itertools.accumulate(LR[i]))
for i in range(q):
l,r=list(map(int,input().split()))
ans=0
... | p03283 |
# https://atcoder.jp/contests/abc106/tasks/abc106_d
'''
N が小さいので、N^2 を考えると良いことが分かる。
'''
from collections import defaultdict
N, M, Q = list(map(int, input().split())) # N, M: リストの長さ
edges = [list(map(int, input().split())) for _ in range(M)]
data = defaultdict(int) # defaultdict ... | N, M, Q = list(map(int, input().split()))
C = [[0]*N for _ in range(N)]
for _ in range(M):
L, R = list(map(int, input().split()))
C[L-1][R-1] += 1
S = [[0]*(N+1) for _ in range(N+1)]
for r in range(N):
for l in reversed(list(range(N))):
S[l][r] = S[l+1][r] + C[l][r]
D = [[0]*(N+1) for _ in ... | p03283 |
def main():
import sys
input = sys.stdin.readline
n,m,q = list(map(int,input().split()))
l = [[0]*(n) for i in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
l[a-1][b-1] += 1
for i in range(q):
a,b = list(map(int,input().split()))
co... | n,m,q = list(map(int,input().split()))
l = [[0]*(n) for i in range(n)]
for i in range(m):
a,b = list(map(int,input().split()))
l[a-1][b-1] += 1
for i in range(n):
for j in range(n):
if i != 0:
l[i][j] += l[i-1][j]
if j != 0:
l[i][j] += l[i][j-1]
... | p03283 |
N, M, Q = list(map(int, input().split()))
count = [[0] * N for i in range(N)]
for _ in range(M):
L,R = list(map(int, input().split()))
for i in range(0,L):
for j in range(R-1,N):
count[i][j] += 1
for _ in range(Q):
p,q = list(map(int, input().split()))
print((count[p-1][q-1]))
| N, M, Q = list(map(int, input().split()))
count = [[0] * (N+1) for i in range(N)]
for _ in range(M):
L,R = list(map(int, input().split()))
count[L-1][R] += 1
for i in range(N):
for j in range(1,N+1):
count[i][j] += count[i][j-1]
for _ in range(Q):
p,q = list(map(int, input().split()))
... | p03283 |
N,M,Q=list(map(int,input().split()))
cumsum = [[0] * (N+1) for _ in range(N+1)]
for _ in range(M):
L,R=list(map(int,input().split()))
cumsum[L][R] += 1
for i in range(1,N+1):
for j in range(1,N+1):
cumsum[i][j] += cumsum[i-1][j] + cumsum[i][j-1] - cumsum[i-1][j-1]
for _ in range(Q):
p,q... | N,M,Q=list(map(int,input().split()))
table = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
L,R=list(map(int,input().split()))
table[L][R] += 1
for i in range(1,N+1):
for j in range(1,N+1):
table[i][j] += table[i-1][j] + table[i][j-1] - table[i-1][j-1]
for _ in range(Q):
... | p03283 |
from itertools import accumulate
N,M,Q=list(map(int,input().split()))
Station=[[0 for x in range(N+2)] for y in range(N+2)]
for i in range(M):
s,t=list(map(int,input().split()))
Station[1][t]+=1
Station[s+1][t]-=1
Station[1][N+1]+=1
Station[s+1][N+1]-=1
ST1 = [list(accumulate(l)) for l in zip... | from itertools import accumulate
N,M,Q=list(map(int,input().split()))
Station=[[0 for x in range(N+2)] for y in range(N+2)]
for i in range(M):
s,t=list(map(int,input().split()))
Station[1][t]+=1
Station[s+1][t]-=1
Station[1][N+1]+=1
Station[s+1][N+1]-=1
ST1 = [list(accumulate(l)) for l in zip... | p03283 |
n, m, Q = list(map(int, input().split()))
ts = [[0] * (n+1) for _ in range(n+1)]
for _ in range(m):
l, r = tuple(map(int, input().split()))
ts[l][r] += 1
from itertools import accumulate
tsa = [list(accumulate(t)) for t in ts]
for _ in range(Q):
p, q = tuple(map(int, input().split()))
c =... | n, m, Q = list(map(int, input().split()))
ts = [[0] * (n+1) for _ in range(n+1)]
for _ in range(m):
l, r = tuple(map(int, input().split()))
ts[l][r] += 1
# 二次元累積和
for i in range(1, n+1):
for j in range(1, n+1):
ts[i][j] += ts[i][j-1]
for i in range(1, n+1):
for j in range(1, n+1):
... | p03283 |
N, M, Q = list(map(int, input().split()))
train = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M) :
L, R = list(map(int, input().split()))
train[L][R] += 1
que = []
for _ in range(Q) :
p, q = list(map(int, input().split()))
que.append((p, q))
# 累積和
S = [[0 for _ in rang... | N, M, Q = map(int, input().split())
LR = [[0] * (N + 1) for _ in range(N + 1)]
for _ in range(M):
L, R = map(int, input().split())
LR[L][R] += 1
for l in range(1, N + 1):
for r in range(1, N + 1):
LR[l][r] = LR[l - 1][r] + LR[l][r - 1] - LR[l - 1][r - 1] + LR[l][r]
ans = []
for _ in... | p03283 |
ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
ips = lambda:input().split()
import collections
import math
import itertools
import heapq as hq
n,m,q = m... | ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
ips = lambda:input().split()
import collections
import math
import itertools
import heapq as hq
n,m,q = m... | p03283 |
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | #!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
... | p03283 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.