input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
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)]
def rectangle_sum(n):
table = [[0 for _ in range(n)] for _ in range(n)]
for l, r in LR:
table[l - 1][r - 1] += 1
for y in range... | 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)]
def rectangle_sum(n):
table = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for l, r in LR:
table[l][r] += 1
for y in range... | p03283 |
n,m,q = list(map(int,input().split()))
table = []
res = []
for i in range(n+1):
table.append([0]*(i+1))
res.append([0]*(i+1))
for i in range(m):
a,b = list(map(int,input().split()))
table[b][a] += 1
for begin in range(1,n+1):
s = 0
for ending in range(begin,n+1):
for k in... | n,m,q = list(map(int,input().split()))
table = []
for i in range(n+1):
table.append([0]*(n+1))
for i in range(m):
a,b = list(map(int,input().split()))
table[b][a] += 1
#2...n
for i in range(2,n+1):
#1...n-1
for j in range(1,n+2-i):
table[i+j-1][j] += table[i+j-1][j+1]+table[... | p03283 |
N, M , Q = list(map(int, input().split()))
LR = [[0 for _ in range(N+2-i)] for i in range(N+2)]
for i in range(M):
L, R = list(map(int, input().split()))
LR[L][R-L+1] += 1
for i in range(2,N+2):
for j in range(1,N-i+2):
LR[j][i] += LR[j][i-1] + LR[j+1][i-1] - LR[j+1][i-2]
for i in range(... | N, M , Q = list(map(int, input().split()))
LR = [[0 for _ in range(N+2-i)] for i in range(N+2)]
for i in range(M):
L, R = list(map(int, input().split()))
LR[L][R-L+1] += 1
for i in range(2,N+2):
for j in range(1,N-i+2):
LR[j][i] += LR[j][i-1] + LR[j+1][i-1] - LR[j+1][i-2]
A = []
for i in r... | p03283 |
N, M , Q = list(map(int, input().split()))
LR = [[0 for _ in range(N+2-i)] for i in range(N+2)]
for i in range(M):
L, R = list(map(int, input().split()))
LR[L][R-L+1] += 1
for i in range(2,N+2):
for j in range(1,N-i+2):
LR[j][i] += LR[j][i-1] + LR[j+1][i-1] - LR[j+1][i-2]
A = []
for i in r... | import sys
sin = sys.stdin.readlines()
N, M, Q = list(map(int, sin[0].split()))
LR = [[0 for _ in range(N+2-i)] for i in range(N+2)]
for line in sin[1:M+1]:
L, R = list(map(int, line.split()))
LR[L][R-L+1] += 1
for i in range(2,N+2):
for j in range(1,N-i+2):
LR[j][i] += LR[j][i-1] + LR[j+1][i-1] ... | p03283 |
import sys
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0 for _ in range(N+2-i)] for i in range(N+2)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L][R-L+1] += 1
for i in range(2,N+2):
for j in range(1,N-i+2):
LR[j][i] += LR[j][i-1] + LR[j+1][i-1] - ... | import sys
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0 for _ in range(N+2-i)] for i in range(N+2)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L][R-L+1] += 1
for i in range(2,N+2):
for j in range(1,N-i+2):
LR[j][i] += LR[j][i-1] + LR[j+1][i-1] - ... | p03283 |
import sys
from itertools import accumulate
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0]* (N-i) for i in range(N)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L-1][R-L] += 1
for i in range(N-2,-1,-1):
for j, acc in enumerate(accumulate(LR[i])):
... | import sys
from itertools import accumulate
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0 for _ in range(N-i)] for i in range(N)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L-1][R-L] += 1
for i in range(N-2,-1,-1):
for j, acc in enumerate(accumulate(L... | p03283 |
import sys
from itertools import accumulate
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0 for _ in range(N-i)] for i in range(N)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L-1][R-L] += 1
for i in range(N-2,-1,-1):
for j, (acc, pre) in enumerate(zip(acc... | import sys
from itertools import accumulate
N, M, Q = list(map(int, sys.stdin.readline().split()))
LR = [[0 for _ in range(N-i)] for i in range(N)]
for i in range(M):
L, R = list(map(int, sys.stdin.readline().split()))
LR[L-1][R-L] += 1
for i in range(N-2,-1,-1):
acc = accumulate(LR[i])
next(acc)... | p03283 |
#!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
from operator import itemg... | #!/usr/bin/env python3
import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import ite... | p03283 |
def m():
n, M, Q = list(map(int, input().split()))
a = [[0 for _ in range(n+1)] for _ in range(n+1)]
for i in range(M):
l, r = list(map(int, input().split()))
a[l][r] += 1
for i in range(Q):
p, q = list(map(int, input().split()))
ans = 0
for j in range(... | def m():
n, M, Q = list(map(int, input().split()))
a = [[0 for _ in range(n+1)] for _ in range(n+1)]
b = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(M):
l, r = list(map(int, input().split()))
a[l][r] += 1
for i in range(1, n+1):
b[1][i] += a[1][... | p03283 |
import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N):
... | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N):
... | p03283 |
n,m,q=list(map(int,input().split()))
S=[[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()))
S[l][r]+=1
for i in range(q):
a,b=list(map(int,input().split()))
ans=0
for y in range(a,b+1):
for x in range(a,b+1):
ans+=S[x][y]... | n,m,q=list(map(int,input().split()))
S=[[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()))
S[l][r]+=1
for i in range(1,n+1):
for j in range(1,n):
S[i][j+1]+=S[i][j]
for i in range(q):
a,b=list(map(int,input().split()))
ans=0
... | p03283 |
N, M, Q = [int(_) for _ in input().split()]
nl = [[0 for i in range(N)] for j in range(N)]
for t in [input().split() for _ in range(M)]:
i = int(t[0]) - 1
j = int(t[1]) - 1
nl[i][j] += 1
l = [[0 for i in range(N)] for j in range(N)]
for i in range(N):
s = 0
for j in range(N):
l... | N, M, Q = [int(_) for _ in input().split()]
l = [[0 for i in range(N+1)] for j in range(N+2)]
for t in [input().split() for _ in range(M)]:
i = int(t[0])
j = int(t[1])
l[i][j] += 1
for k in range(N):
for i in range(1, N-k+1):
j = i + k
l[i][j] += l[i][j-1] + l[i+1][j] - l[i+... | p03283 |
N,M,Q = list(map(int,input().split()))
LR = []
num = [[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
num[l][r] += 1
LR.append([l,r])
LR.sort()
pq = []
for i in range(Q):
p,q=list(map(int,input().split()))
p -= 1
... | N,M,Q = list(map(int,input().split()))
num = [[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
num[l][r] += 1
for i in range(N):
for j in range(N-1):
num[i][j+1] += num[i][j]
for i in range(N-1,0,-1):
for j in range... | p03283 |
N,M,Q = list(map(int,input().split()))
num = [[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
num[l][r] += 1
for i in range(N):
for j in range(N-1):
num[i][j+1] += num[i][j]
for i in range(N-1,0,-1):
for j in range... | N,M,Q = list(map(int,input().split()))
num = [[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
num[l][r] += 1
for i in range(N-1,0,-1):
for j in range(N):
num[i-1][j] += num[i][j]
for i in range(N):
for j in range... | p03283 |
N,M,Q = list(map(int,input().split()))
num = [[0 for i in range(N)] for j in range(N)]
lr = [list(map(int,input().split())) for i in range(M)]
for l,r in lr:
num[l-1][r-1] += 1
for j in range(N):
for i in range(N-1,0,-1):
num[i-1][j] += num[i][j]
for i in range(N):
for j in range(N-1):
... | N,M,Q = list(map(int,input().split()))
num = [[0 for i in range(N)] for j in range(N)]
lr = [list(map(int,input().split())) for i in range(M)]
for l,r in lr:
num[l-1][r-1] += 1
for j in range(N):
for i in range(N-1,0,-1):
num[i-1][j] += num[i][j]
for i in range(N):
for j in range(N-1):
... | p03283 |
N,M,Q = map(int,input().split())
num = [[0 for i in range(N)] for j in range(N)]
lr = [list(map(int,input().split())) for i in range(M)]
for l,r in lr:
num[l-1][r-1] += 1
for j in range(N):
for i in range(N-1,0,-1):
num[i-1][j] += num[i][j]
for i in range(N):
for j in range(N-1):
... | import sys
def input(): return sys.stdin.readline().strip()
N,M,Q = map(int,input().split())
num = [[0 for i in range(N)] for j in range(N)]
lr = [list(map(int,input().split())) for i in range(M)]
for l,r in lr:
num[l-1][r-1] += 1
for j in range(N):
for i in range(N-1,0,-1):
num[i-1][j] += nu... | p03283 |
N,M,Q = list(map(int,input().split()))
A = [[0 for i in range(N+1)] for j in range(N+1)]
Acum = [[0 for i in range(N+1)] for j in range(N+1)]
for _ in range(M):
L,R = list(map(int,input().split()))
A[L-1][R-1] += 1
#2次元累積和
for i in range(N):
for j in range(N):
Acum[i+1][j+1] = Acum[i][j... | """
22:40:00
"""
N, M, Q = list(map(int, input().split()))
fields = [[0] * (N+1) for i in range(N+1)]
accs = [[0] * (N+1) for i in range(N+1)]
for i in range(M):
L,R = list(map(int, input().split()))
fields[L][R] += 1
for i in range(1,N+1):
for j in range(1,N+1):
accs[i][j] = fiel... | p03283 |
n,m,q=list(map(int,input().split()))
line=[[0]*(n+1) for _ in range(n+1)]
for i in range(m):
l,r=list(map(int,input().split()))
for j in range(0,l):
for k in range(r-1,n):
line[j][k]+=1
for _ in range(q):
x,y=list(map(int,input().split()))
print((line[x-1][y-1])) | n,m,q=list(map(int,input().split()))
line=[[0]*(n+1) for _ in range(n+1)]
for i in range(m):
l,r=list(map(int,input().split()))
line[l][r]+=1
for i in range(n+1):
for j in range(n):
line[i][j+1]+=line[i][j]
for i in range(n+1):
for j in range(n):
line[j+1][i]+=line[j][i]
for i in range(q):
... | p03283 |
n,m,q=list(map(int,input().split()))
d=[[0 for j in range(n)] for i in range(n)]
for i in range(m):
l,r=[int(x)-1 for x in input().split()]
d[l][r]+=1
for l in range(n):
for r in range(1,n):
d[l][r]+=d[l][r-1]
for l in range(n-1,0,-1):
for r in range(n):
d[l-1][r]+=d[l][r]
for i in range(q):
l,r=[i... | n,m,q=list(map(int,input().split()))
d=[[0 for j in range(n)] for i in range(n)]
for i in range(m):
l,r=list(map(int,input().split()))
d[n-l][r-1]+=1
for l in range(n):
for r in range(1,n):
d[l][r]+=d[l][r-1]
for l in range(1,n):
for r in range(n):
d[l][r]+=d[l-1][r]
for i in range(q):
l,r=list(map... | p03283 |
n,m,q = list(map(int, input().split()))
List1 = [[0 for i in range(n)] for j in range(n)]
List2 = [[0 for i in range(n)] for j in range(n)]
for i in range(m):
l,r = list(map(int, input().split()))
List1[l - 1][r - 1] += 1
for i in range(n):
for j in range(i, n):
for k in range(i, j + 1):
fo... | n,m,q = list(map(int, input().split()))
List1 = [[0 for i in range(n+1)] for j in range(n+1)]
List2 = [[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()))
List1[l - 1][r - 1] += 1
for i in range(n):
for j in range(n - i):
List2[j][j + i] = List2[... | p03283 |
n, m, q = [int(i) for i in input().split()]
m_list = [[0 for i in range(n+1)] for j in range(n+1)]
dynamic = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(m):
l, r = [int(i) for i in input().split()]
m_list[l][r] += 1
for i in range(1, n+1):
for j in range(i, n+1):
dynamic... | n, m, q = [int(i) for i in input().split()]
imos = [[0 for r in range(n+1)] for l in range(n+1)]
for i in range(m):
l, r = [int(i) - 1 for i in input().split()]
imos[0][r] += 1
imos[l+1][r] -= 1
#imos法
for l in range(n):
for r in range(1, n):
imos[l][r] += imos[l][r-1]
for r in range(n... | p03283 |
n, m, qn = list(map(int, input().split()))
t = [list(map(int, input().split())) for _ in range(m)]
qs = [list(map(int, input().split())) for _ in range(qn)]
r = dict()
for i in range(1, n + 1):
r[i] = set()
l = dict()
for i in range(1, n + 1):
l[i] = set()
for x in range(len(t)):
L, R = ... | def arr(row, column, value): return [[value for _ in range(column)] for _ in range(row)]
n, m, q = list(map(int, input().split()))
sum_range = arr(n + 1, n + 1, 0)
#sum_range[0][0] - sum_range[n][n]まで
#初期値0
#行列値は1からnを取るが、累積和を加算する過程で行列を1引いたものを参照するので、[0][0]がエラーにならないと便利？
for _ in range(m):
L, R = list(map... | p03283 |
def ary(r, c, val=False): return [[val for _ in range(c)] for _ in range(r)]
def nl(): return list(map(int, input().split()))
n, m, q = nl()
M = ary(n + 1, n + 1, 0)
for _ in range(m):
l, r = nl()
M[l][r] += 1
for L in range(1, n + 1):
for R in range(1, n + 1):
M[L][R] += M[L - 1][R]
... | N, M, Q = list(map(int, input().split()))
T = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
for _ in range(M):
L, R = list(map(int, input().split()))
T[L][R] += 1
for L in range(1, N + 1):
for R in range(1, N + 1):
T[L][R] += T[L - 1][R]
T[L][R] += T[L][R - 1]
T[L]... | p03283 |
N, M, Q = list(map(int, input().split()))
x = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
for _ in range(M):
L, R = list(map(int, input().split()))
x[L][R] += 1
c = [[0 for _ in range(N + 1)] for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(1, N + 1):
c[i][j] += c[i]... | import sys
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
t = [[0] * (N + 1) for _ in range(N + 1)]
# es[L][R]:=区間[L,R]を走る列車の本数
for _ in range(M):
l, r = list(map(int, input().split()))
t[l][r] += 1
for L in range(1, N + 1):
for R in range(1, N + 1):
t[L][R] +... | p03283 |
class Acc2D:
def __init__(self, src):
self.acc2d = self._build(src)
def _build(self, src):
h, w = len(src), len(src[0])
ret = [[0] * w for _ in range(h)]
for r in range(h):
for c in range(w):
ret[r][c] = src[r][c]
if r > 0:
... | def main():
import sys
input = sys.stdin.readline
N, M, Q = map(int, input().split())
tb = [[0] * (N + 1) for _ in range(N + 1)]
# tb[L][R]:=区間LR内を走る列車総数
for _ in range(M):
L, R = map(int, input().split())
tb[L][R] += 1
for L in range(1, N + 1):
for R ... | p03283 |
# coding: utf-8
n,m,q = list(map(int,input().split()))
M = [ list(map(int,input().split())) for i in range(m) ]
Q = [ list(map(int,input().split())) for i in range(q) ]
count = [0]*q
for i in range(q):
for j in range(m):
if Q[i][0] <= M[j][0] and M[j][1] <= Q[i][1]:
count[i] += 1
... | # coding: utf-8
n,m,q = list(map(int,input().split()))
M = [ list(map(int,input().split())) for i in range(m) ]
Q = [ list(map(int,input().split())) for i in range(q) ]
LR = [[0]*(n+1) for _ in range(n+1)]
for m in M:
LR[m[0]-1][m[1]] += 1
for l in range(n,-1,-1):
for r in range(0,n,1):
... | p03283 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc106/editorial.pdf
https://www.hamayanhamayan.com/entry/2018/08/18/234325
・累積和
"""
N, M, Q = list(map(int, input().split()))
lM, rM = [0] * M, [0] * M
pQ, qQ = [0] * Q, [0] * Q
LR = [[0] * N for i in range(N)]
# 都市番号を0-indexed
for i in range(M):
... | # -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc106/editorial.pdf
https://atcoder.jp/contests/abc106/submissions/3024983
https://imoz.jp/algorithms/imos_method.html
・二次元累積和
・最後にどこを足し引きするかは上記参考の二次元いもすと同じ話だと思う。
"""
N, M, Q = list(map(int, input().split()))
LR = [[0] * (N+1) for i in range(N+1)... | p03283 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/abc106/editorial.pdf
https://atcoder.jp/contests/abc106/submissions/3024983
https://imoz.jp/algorithms/imos_method.html
・二次元累積和
・最後にどこを足し引きするかは上記参考の二次元いもすと同じ話だと思う。
"""
N, M, Q = list(map(int, input().split()))
LR = [[0] * (N+1) for i in range(N+1)... | # -*- coding: utf-8 -*-
"""
参考：https://betrue12.hateblo.jp/entry/2018/08/18/224408
・二次元累積和
・こっちの方針のが分かりやすいかも。
"""
N, M, Q = list(map(int, input().split()))
LR = [[0] * (N) for i in range(N)]
for i in range(M):
l, r = list(map(int, input().split()))
# 左端=L、右端=Rの表
LR[l-1][r-1] += 1
# 二次元の縦横両... | p03283 |
n, m, q = list(map(int, input().split()))
ans = [[0] * (n+2) for _ in range(n+2)]
lr = [list(map(int, input().split())) for _ in range(m)]
for l, r in lr:
ans[0][r] += 1
ans[0][-1] -= 1
ans[l+1][-1] -= 1
ans[l+1][r] -= 1
for i in range(n+2):
for j in range(n+1):
ans[i][j+1] += an... | n, m, q = list(map(int, input().split()))
ans = [[0] * (n+2) for _ in range(n+2)]
for _ in range(m):
l, r = list(map(int, input().split()))
ans[0][r] += 1
ans[0][-1] -= 1
ans[l+1][-1] -= 1
ans[l+1][r] -= 1
for i in range(n+2):
for j in range(n+1):
ans[i][j+1] += ans[i][j]
... | p03283 |
N, M, Q = list(map(int, input().split()))
# cum_sum[L][R]
cum_sum = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
L, R = list(map(int, input().split()))
cum_sum[L][R] += 1
for l in range(1, N+1):
for r in range(1, N+1):
cum_sum[l][r] += cum_sum[l][r-1]
for _ in rang... | N, M, Q = list(map(int, input().split()))
# cum_sum[L][R]
cum_sum = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
L, R = list(map(int, input().split()))
cum_sum[L][R] += 1
for l in range(1, N+1):
for r in range(1, N+1):
cum_sum[l][r] += cum_sum[l][r-1] + cum_sum[l-1][r... | p03283 |
from collections import Counter
def bin(ll, target, key): # リストにtargetが最初に含まれる位置
if len(ll) < 100:
if target in [key(a) for a in ll]:
return [key(a) for a in ll].index(target)
return -1
length = len(ll)
l, r = ll[:length // 2], ll[length // 2:]
if key(r[0]) == ... | from collections import Counter
def bin(ll, target, key): # リストにtargetが最初に含まれる位置
if len(ll) < 100:
if target in [key(a) for a in ll]:
return [key(a) for a in ll].index(target)
return -1
length = len(ll)
l, r = ll[:length // 2], ll[length // 2:]
if key(r[0]) == ... | p03283 |
N, M, QN = [int(x) for x in input().split()]
MAT0 = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(M):
l, r = [int(x) for x in input().split()]
MAT0[l][r] += 1
MAT = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(0, N + 1):
MAT[i][j] = MAT[i][j - 1... | N, M, QN = [int(x) for x in input().split()]
MAT0 = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(M):
l, r = [int(x) for x in input().split()]
MAT0[l][r] += 1
MAT = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(1, N + 1):
for j in range(1, N + 1):
MAT[i][j] = MAT[i][j - 1... | p03283 |
n,m,q = list(map(int,input().split(" ")))
LR_2d = [[0 for i in range(n)] for i in range(n)]
for i in range(m):
L,R = list(map(int,input().split(" ")))
LR_2d[L-1][R-1] += 1
LR_2dsum = [[0 for i in range(n)] for i in range(n)]
for i in range(n):
LR_2dsum[i][0] = LR_2d[i][0]
for j in range(1,n):
... | n,m,q = list(map(int,input().split(" ")))
LR_2d = [[0 for i in range(n+1)] for i in range(n+1)]
for i in range(m):
L,R = list(map(int,input().split(" ")))
LR_2d[L][R] += 1
LR_2dsum = [[0 for i in range(n+1)] for i in range(n+1)]
for j in range(1,n):
LR_2dsum[0][j] = LR_2dsum[0][j-1] + LR_2d[0][j]
... | p03283 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import bisect
import array
def solve():
n, m, q = list(map(int, input().split()))
nl = [[] for j in range(n + 1)]
for e in (input().split() for _ in [0] * m):
l, r = int(e[0]), int(e[1])
bisect.insort_left(nl[l], r)
table = [a... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import bisect
import array
def solve():
n, m, q = list(map(int, input().split()))
nl = [[0 for i in range(n + 1)] for j in range(n + 1)]
for e in [input().split() for _ in range(m)]:
l, r = int(e[0]), int(e[1])
nl[l][r] += 1
t... | p03283 |
import sys
def main():
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
DP = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
l, r = list(map(int, input().split()))
for i in range(l+1):
for j in range(r, N+1):
DP[i][j] += 1
for _ in... | import sys
def main():
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
DP = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
l, r = list(map(int, input().split()))
DP[l][r] += 1
cum = [[0 for _ in range(N+1)] for _ in range(N+1)]
for i in range... | p03283 |
import sys
def main():
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
DP = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
l, r = list(map(int, input().split()))
DP[l][r] += 1
cum = [[0 for _ in range(N+1)] for _ in range(N+1)]
for i in range... | import sys
def main():
input = sys.stdin.readline
N, M, Q = list(map(int, input().split()))
Pos = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
l, r = list(map(int, input().split()))
Pos[l][r] += 1
cum = [[0 for _ in range(N+1)] for _ in range(N+1)]
for i in ran... | p03283 |
# -*- coding: utf-8 -*-
line = input().split(" ")
N = int(line[0])
M = int(line[1])
Q = int(line[2])
memo = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
line = input().split(" ")
l = int(line[0])
r = int(line[1])
memo[l][r] += 1
for _ in range(Q):
line = input().s... | # -*- coding: utf-8 -*-
n,m,q = list(map(int, input().split()))
d = [[0 for _ in range(n+1)] for _ in range(n+1)]
for _ in range(m):
l,r = list(map(int, input().split()))
d[l][r] += 1
for i in range(n,0,-1):
for j in range(n):
d[i][j+1] += d[i][j]
for j in range(n,0,-1):
for i in r... | p03283 |
n,m,q= list(map(int,input().split()))
lrList=[list(map(int,input().split()))for i in range(m)]
pqList=[list(map(int,input().split()))for i in range(q)]
for pq in pqList:
ans = 0
for lr in lrList:
ans +=(pq[0] <= lr[0] and pq[1] >= lr[1])
print(ans) | n,m,q= list(map(int,input().split()))
dataList = [[0 for xIndex in range(n+1)]for yIndex in range(n+1)]
for i in range(m):
xTemp,yTemp = list(map(int,input().split()))
dataList[yTemp][xTemp]+=1
pqList=[list([int(x) for x in input().split()])for i in range(q)]
for yIndex in range(1,n+1):
for xIndex ... | p03283 |
from itertools import accumulate
import sys
sdin = sys.stdin.readline
n,m,q = list(map(int, sdin().split()))
lr = []
for i in range(m):
l,r = list(map(int, sdin().split()))
lr.append(tuple([l-1, r-1]))
pq = []
for _ in range(q):
p,q = list(map(int, sdin().split()))
pq.append(tup... | from itertools import accumulate
import sys
sdin = sys.stdin.readline
n,m,q = list(map(int, sdin().split()))
lr = []
for i in range(m):
l,r = list(map(int, sdin().split()))
lr.append(tuple([l-1, r-1]))
pq = []
for _ in range(q):
p,q = list(map(int, sdin().split()))
pq.append(tup... | p03283 |
from itertools import accumulate
import sys
sdin = sys.stdin.readline
n,m,q = list(map(int, sdin().split()))
lr = []
for i in range(m):
l,r = list(map(int, sdin().split()))
lr.append(tuple([l-1, r-1]))
pq = []
for _ in range(q):
p,q = list(map(int, sdin().split()))
pq.append(tup... | from itertools import accumulate
import sys
sdin = sys.stdin.readline
n,m,q = list(map(int, sdin().split()))
lr = []
for i in range(m):
l,r = list(map(int, sdin().split()))
lr.append(tuple([l, r]))
pq = []
for _ in range(q):
p,q = list(map(int, sdin().split()))
pq.append(tuple([... | p03283 |
from itertools import accumulate
import sys
sdin = sys.stdin.readline
n,m,q = list(map(int, sdin().split()))
lr = []
for i in range(m):
l,r = list(map(int, sdin().split()))
lr.append(tuple([l, r]))
pq = []
for _ in range(q):
p,q = list(map(int, sdin().split()))
pq.append(tuple([... | import sys
stdin = sys.stdin
def li(): return [int(x) for x in stdin.readline().split()]
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return [float(x) for x in stdin.readline().split()]
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): re... | p03283 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03283 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readl... | p03283 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readl... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | p03283 |
def LI(): return list(map(int, input().split()))
def LI_(): return list([int(x) - 1 for x in input().split()])
if __name__ == "__main__":
N, M, Q = LI()
LR = [[0]*(N+1) for _ in range(N+1)]
for i in range(M):
l, r = LI()
LR[l][r] += 1
# 二次元累積和
for i in range(1, N+1):
... | from itertools import accumulate as acc
def LI(): return list(map(int, input().split()))
def LI_(): return list([int(x) - 1 for x in input().split()])
if __name__ == "__main__":
N, M, Q = LI()
LR = [[0]*N for _ in range(N)]
for i in range(M):
l, r = LI_()
LR[l][r] += 1
#... | p03283 |
from itertools import accumulate as acc
import sys
if __name__ == "__main__":
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
LR = [[0]*N for _ in range(N)]
for l, r in (list(map(int, e.split())) for e in s[1:M + 1]):
LR[l - 1][r - 1] += 1
S = [tuple(acc(reversed... | from itertools import accumulate as acc
import sys
if __name__ == "__main__":
s = sys.stdin.readlines()
N, M, Q = list(map(int, s[0].split()))
LR = [[0]*N for _ in [0]*N]
for l, r in (list(map(int, e.split())) for e in s[1:M + 1]):
LR[l - 1][r - 1] += 1
S = [tuple(acc(reversed(s)... | p03283 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
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 s... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
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 s... | p03283 |
N,M,Q = list(map(int,input().split()))
C = {i:{} for i in range(1,N+1)}
for _ in range(M):
L,R = list(map(int,input().split()))
if L not in C[R]:
C[R][L] = 0
C[R][L] += 1
for _ in range(Q):
p,q = list(map(int,input().split()))
A = {i:0 for i in range(1,N+1)}
for i in range(1,q+... | N,M,Q = list(map(int,input().split()))
A = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
L,R = list(map(int,input().split()))
A[L][R] += 1
B = [[0 for _ in range(N+2)] for _ in range(N+2)]
for i in range(N,0,-1):
for j in range(1,N+1):
B[i][j] = A[i][j]+B[i+1][j]+B[i][j-1]... | p03283 |
N,M,Q = list(map(int,input().split()))
A = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
l,r = list(map(int,input().split()))
A[l][r] += 1
dp = [[0 for _ in range(N+1)] for _ in range(N+1)]
dp[N][1] = A[N][1]
for j in range(2,N+1):
dp[N][j] = dp[N][j-1]+A[N][j]
for i in range(N-1... | N,M,Q = list(map(int,input().split()))
A = [[0 for _ in range(N+1)] for _ in range(N+1)]
for _ in range(M):
L,R = list(map(int,input().split()))
A[L][R] += 1
dp = [[0 for _ in range(N+1)] for _ in range(N+1)]
dp[N][N] = A[N][N]
for i in range(N-1,0,-1):
for j in range(i,N+1):
dp[i][j] = A[i... | p03283 |
import sys
input = sys.stdin.readline
def main():
N,M,Q = list(map(int,input().split()))
go = [[0 for _ in range(N)] for i in range(N)]
for _ in range(M):
L,R = list(map(int,input().split()))
go[L-1][R-1] += 1
qu = []
for _ in range(Q):
p,q = list(map(in... | import sys
input = sys.stdin.readline
def main():
N,M,Q = list(map(int,input().split()))
go = [[0 for _ in range(N)] for i in range(N)]
for _ in range(M):
L,R = list(map(int,input().split()))
go[L-1][R-1] += 1
qu = []
for _ in range(Q):
p,q = list(map(in... | p03283 |
N,M,Q = [ int(it) for it in input().split()]
grid = [ [0]*N for i in range(N) ]
gridsml = [ [0]*N for i in range(N) ]
for i in range(M):
s,g = [ int(it)-1 for it in input().split()]
grid[s][g]+=1
for i in range(N):
gridsml[i][0]=grid[i][0]
for j in range(1,N):
gridsml[i][j]+=gridsml[i][j-1]+g... | N,M,Q = [ int(it) for it in input().split() ]
lit = [ [ int(it)-1 for it in input().split() ] for i in range(M) ]
liq = [ [ int(it)-1 for it in input().split() ] for i in range(Q) ]
li = [[0]*(N+1) for i in range(N+1)]
for p,q in lit:
li[p+1][q+1]+=1
for i in range(N+1):
for j in range(N):
li[i][j+1... | p03283 |
from bisect import bisect_left
def main():
n, m, q = list(map(int, input().split()))
trains = [list(map(int, input().split())) for _ in range(m)]
queries = [list(map(int, input().split())) for _ in range(q)]
xmt = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
cmt = [[0 for _ in range(n + 1)] for _ i... | from bisect import bisect_left
def main():
n, m, q = list(map(int, input().split()))
trains = [list(map(int, input().split())) for _ in range(m)]
queries = [list(map(int, input().split())) for _ in range(q)]
xmt = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
cmt = [[0 for _ in range(n + 1)] for _ i... | p03283 |
from collections import Counter
N,M,Q = list(map(int,input().split()))
T = [[0 for _ in range(N)] for _ in range(N)]
LR = []
for i in range(M):
L,R = list(map(int, input().split()))
LR.append(L*1000+R)
LRD = Counter(LR)
for key in LRD:
L,R=key//1000,key%1000
v = LRD[key]
for r in range(R-1,N):
... | N,M,Q = list(map(int,input().split()))
T = [[0 for _ in range(N+1)] for _ in range(N+1)]
for i in range(M):
L,R = list(map(int, input().split()))
T[L][R] += 1
for l in range(1,N+1):
for r in range(1,N+1):
T[l][r] += T[l-1][r]+T[l][r-1]-T[l-1][r-1]
ans = []
for i in range(Q):
p,q = list(map(int, in... | p03283 |
N, M, Q = list(map(int, input().split()))
coordinate = [[0 for _ in range(N+1)] for i in range(N+1)]
for m in range(M):
l, r = list(map(int, input().split()))
coordinate[l-1][r-1] += 1
for i in range(N):
for j in range(1, N):
coordinate[i][j] += coordinate[i][j-1]
for i in range(Q):
... | N, M, Q = list(map(int, input().split()))
coordinate = [[0] * N for _ in range(N)]
for _ in range(M):
l, r = list(map(int, input().split()))
l, r = l - 1, r - 1
coordinate[l][r] += 1
acc = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(N):
acc[i + 1][j + 1] ... | p03283 |
N, M, Q = list(map(int, input().split()))
coordinate = [[0] * N for _ in range(N)]
for _ in range(M):
l, r = list(map(int, input().split()))
l, r = l - 1, r - 1
coordinate[l][r] += 1
acc = [[0] * (N + 1) for _ in range(N + 1)]
for i in range(N):
for j in range(N):
acc[i + 1][j + 1] ... | 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)]
acc = [[0 for i in range(N+1)] for i in range(N+1)] # acc[i][j] = i以下からスタートしてj以下で終了する電車の数
coordinate = [[0 for i in range(N)] for i in range(N)]
for l, r in... | p03283 |
from bisect import bisect
N, M, Q = list(map(int, input().split()))
G = [[] for _ in range(N+1)]
for _ in range(M):
L, R = list(map(int, input().split()))
G[L].append(R)
for i in range(N+1):
G[i].sort()
for _ in range(Q):
p, q = list(map(int, input().split()))
ans = 0
for i in range(p, ... | N, M, Q = list(map(int, input().split()))
G = [[0]*(N+1) for _ in range(N+1)]
for _ in range(M):
L, R = list(map(int, input().split()))
G[L][R] += 1
for i in range(N+1):
for j in range(1, N+1):
G[i][j] += G[i][j-1]
for _ in range(Q):
p, q = list(map(int, input().split()))
ans = 0
for ... | p03283 |
N, M, Q = list(map(int, input().split()))
city = [[0] * (N+1) for i in range(N+1)]
for i in range(M):
l, r = list(map(int, input().split()))
city[l][r] += 1
for i in range(N+1):
for j in range(N):
city[i][j+1] += city[i][j]
for i in range(Q):
p, q = list(map(int, input().split()))
print((sum... | N, M, Q = list(map(int, input().split()))
city = [[0] * (N+1) for i in range(N+1)]
for i in range(M):
l, r = list(map(int, input().split()))
city[l][r] += 1
for i in range(N+1):
for j in range(N):
city[i][j+1] += city[i][j]
for i in range(N+1):
for j in range(N):
city[j+1][i] += city[j][i]... | p03283 |
from operator import itemgetter
N, M, Q = list(map(int, input().split()))
LR = sorted([list(map(int, input().split())) for i in range(M)], key=itemgetter(0))
route = [[0 for i in range(N+1)] for i in range(N+1)]
for l in range(1, N+1):
flag = [1 for i in range(len(LR))]
for r in range(1, N+1):
... | import itertools
N, M, Q = list(map(int, input().split()))
route = [[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()))
route[L][R] += 1
for i in range(1, N):
route[i] = list(itertools.accumulate(route[i]))
for i in range(2, N+1):
for... | p03283 |
I=lambda:list(map(int,input().split()))
n,m,q=I()
k=n+2
l=[0]*k**2
for _ in range(m):
s,g=I()
l[s*k+g]+=1
for i in range(1,n+1):
for j in range(1,n+1):
l[i*k+j]+=l[i*k+j-1]
for i in range(1,n+1):
for j in range(1,n+1):
l[i*k+j]+=l[(i-1)*k+j]
for _ in range(q):
s,g=I()
print((l[g*k+g]-... | I=lambda:list(map(int,input().split()))
n,m,q=I()
l=[[0]*-~n for _ in range(n+1)]
for _ in range(m):
s,g=I()
l[s][g]+=1
for i in range(1,n+1):
for j in range(1,n+1):
l[i][j]+=l[i][j-1]
for j in range(1,n+1):
l[i][j]+=l[i-1][j]
for _ in range(q):
s,g=I()
print((l[g][g]-l[s-1][g]-l[g][s-1... | p03283 |
n,m,q=list(map(int,input().split()))
a=[[0 for _ in range(n+1)]for _ in range(n+1)]
for _ in range(m):
l,r=list(map(int,input().split()))
a[l][r]+=1
for i in range(n+1):
for j in range(n):
a[i][j+1]+=a[i][j]
for i in range(n):
for j in range(n+1):
a[i+1][j]+=a[i][j]
for _ in range(q):
l,r=... | n,m,q=list(map(int,input().split()))
a=[[0]*(n+1) for _ in range(n+1)]
for _ in range(m):
l,r=list(map(int,input().split()))
a[l][r]+=1
for i in range(n+1):
for j in range(n):
a[i][j+1]+=a[i][j]
for i in range(n):
for j in range(n+1):
a[i+1][j]+=a[i][j]
for _ in range(q):
q,p=list(map(int,... | p03283 |
n, m, q = list(map(int, input().split()))
arr = [[0 for j in range(n)] for i in range(n)]
arr_sum = [[0 for j in range(n)] for i in range(n)]
arr_sum2 = [[0 for j in range(n)] for i in range(n)]
for i in range(m):
l, r = list(map(int, input().split()))
arr[l-1][r-1] += 1
for i in range(n):
for... | n, m, q = list(map(int, input().split()))
arr = [[0 for j in range(n)] for i in range(n)]
arr_sum = []
arr_sum2 = []
for i in range(m):
l, r = list(map(int, input().split()))
arr[l-1][r-1] += 1
for i in range(n):
s = 0
arr_tmp = []
for j in range(n):
s += arr[i][j]
... | p03283 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03283 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03283 |
N,M,Q = list(map(int,input().split()))
s = [[0 for j in range(501)] for i in range(501)]
for _ in range(M):
L,R = list(map(int,input().split()))
s[L][R] += 1
# 二次元累積和
for i in range(1,501):
for j in range(1,501):
s[i][j] += s[i-1][j] + s[i][j-1] - s[i-1][j-1]
# クエリに対してO(1)で求める
for _ ... | N,M,Q = list(map(int,input().split()))
c_sum = [[0 for j in range(N+1)] for i in range(N+1)]
for _ in range(M):
L,R = list(map(int,input().split()))
c_sum[L][R] += 1
# 二次元累積和の計算
for i in range(N):
for j in range(N):
c_sum[i+1][j+1] += c_sum[i+1][j] + c_sum[i][j+1] - c_sum[i][j]
for ... | p03283 |
N,M,Q = map(int,input().split())
src = [tuple(map(lambda x:int(x)-1,input().split())) for i in range(M)]
src.sort(reverse=True)
qs = [tuple(map(lambda x:int(x)-1,input().split())) for i in range(Q)]
q_arr = [[] for i in range(N)]
for i,(l,r) in enumerate(qs):
q_arr[l].append((r,i))
bit = [0] * (N+2)
def... | N,M,Q = map(int,input().split())
src = [tuple(map(int,input().split())) for i in range(M)]
qs = [tuple(map(int,input().split())) for i in range(Q)]
imos = [[0]*(N+1) for i in range(N+1)]
for l,r in src:
imos[l][r] += 1
for i in range(N+1):
for j in range(N):
imos[i][j+1] += imos[i][j]
for i i... | p03283 |
N,M,Q = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(M)]
qs = [tuple(map(int,input().split())) for i in range(Q)]
imos = [[0]*(N+1) for i in range(N+1)]
for l,r in src:
imos[l][r] += 1
for i in range(N+1):
for j in range(N):
imos[i][j+1] += imos[i][j]
... | import sys
input = sys.stdin.readline
N,M,Q = map(int,input().split())
LR = [tuple(map(int,input().split())) for i in range(M)]
PQ = [tuple(map(int,input().split())) for i in range(Q)]
imos = [[0]*(N+1) for _ in range(N+1)]
for l,r in LR:
imos[l][r] += 1
for i in range(N+1):
for j in range(N):
... | p03283 |
def main():
N, M, Q = list(map(int, input().split()))
S = [[0] * (N+1) for _ in range(N+1)]
for i in range(M):
L, R = list(map(int, input().split()))
S[L][R] += 1
for i in range(1,N+1):
for j in range(1,N+1):
S[i][j] += S[i-1][j] + S[i][j-1] - S[i-1][j-1]
... | import sys
def input():
return sys.stdin.readline()[:-1]
def main():
N, M, Q = list(map(int, input().split()))
S = [[0] * (N+1) for _ in range(N+1)]
for i in range(M):
L, R = list(map(int, input().split()))
S[L][R] += 1
for i in range(1,N+1):
for j in range(1,N+... | p03283 |
from operator import itemgetter
import bisect
n, m, Q = list(map(int, input().split()))
train = [list(map(int, input().split())) + [i] for i in range(m)]
train_L = []
train_R = []
L_n = []
R_n = []
for i in sorted(train, key=itemgetter(0)):
train_L.append(i[0])
L_n.append(i[2])
for i in sorted(trai... | def getSumRange(L, R):
ans = sum[R][R] - sum[R][L - 1] - sum[L - 1][R] + sum[L - 1][L - 1]
return ans
n, m, Q = list(map(int, input().split()))
L = [0] * m
R = [0] * m
for i in range(m):
L[i], R[i] = list(map(int, input().split()))
p = [0] * Q
q = [0] * Q
for i in range(Q):
p[i], q[i] = lis... | p03283 |
from itertools import islice
def main():
city_count, express_count, query_count = list(map(int, input().split()))
city_list = [(set(), set()) for _ in range(city_count + 1)]
for express_index in range(1, express_count + 1):
l, r = list(map(int, input().split()))
for city in isl... | from itertools import islice
def main():
city_count, express_count, query_count = list(map(int, input().split()))
city_list = [[[], []] for _ in range(city_count + 1)]
for express_index in range(1, express_count + 1):
l, r = list(map(int, input().split()))
for city in islice(ci... | p03283 |
import bisect
n, m, q = list(map(int, input().split()))
edges = []
for i in range(m):
L, R = list(map(int, input().split()))
edges.append((L, R, i))
L_sorted = sorted(edges)
L_sorted_bi = [L for L, R, i in L_sorted]
L_cum_set = [set()for _ in range(m+1)]
for i in reversed(list(range(m))):
L_cum_... | n, m, q = list(map(int, input().split()))
edges = [[0]*n for _ in range(n)]
for _ in range(m):
L, R = [int(x)-1 for x in input().split()]
edges[L][R] += 1
for _ in range(q):
p, q = list(map(int, input().split()))
lines = edges[p-1:q]
print((sum(sum(row[p-1:q]) for row in lines))) | p03283 |
n, m, q = list(map(int, input().split()))
edges = [[0]*n for _ in range(n)]
for _ in range(m):
L, R = [int(x)-1 for x in input().split()]
edges[L][R] += 1
for _ in range(q):
p, q = list(map(int, input().split()))
lines = edges[p-1:q]
print((sum(sum(row[p-1:q]) for row in lines))) | n, m, q = list(map(int, input().split()))
edges = [[0]*n for _ in range(n)]
for _ in range(m):
L, R = [int(x)-1 for x in input().split()]
edges[L][R] += 1
S = [[0]*(n+1)for _ in range(n+1)]
for i in range(n):
for j in range(n):
S[i][j+1] = S[i][j] + edges[i][j]
for _ in range(q):
... | p03283 |
n, m, q = list(map(int, input().split()))
edges = [[0]*n for _ in range(n)]
for _ in range(m):
L, R = [int(x)-1 for x in input().split()]
edges[L][R] += 1
S = [[0]*(n+1)for _ in range(n+1)]
for i in range(n):
for j in range(n):
S[i][j+1] = S[i][j] + edges[i][j]
for _ in range(q):
... | n, m, q = list(map(int, input().split()))
edges = [[0]*(n+1) for _ in range(n+1)]
for _ in range(m):
L, R = list(map(int, input().split()))
edges[L][R] += 1
for i in range(1, n+1):
for j in range(n):
edges[i][j+1] += edges[i][j]
for i in range(n):
for j in range(1, n+1):
... | p03283 |
class Ruiseki2D:
"""二次元累積和を構築する"""
def __init__(self, matrix):
self.h = len(matrix)
self.w = len(matrix[0])
self.ru = [[0] * (self.w + 1) for _ in range(self.h + 1)]
for i in range(self.h):
for j in range(self.w):
self.ru[i + 1][j + 1] = self... | import sys
input = sys.stdin.readline
class Ruiseki2D:
"""二次元累積和を構築する"""
def __init__(self, matrix):
self.h = len(matrix)
self.w = len(matrix[0])
self.ru = [[0] * (self.w + 1) for _ in range(self.h + 1)]
for i in range(self.h):
for j in range(self.w):
... | p03283 |
n,m,q = list(map(int,input().split()))
c=[[0 for i in range(n+1)] for j in range(n+1)]
x=[[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()))
x[l][r] += 1
for i in range(1,n+1):
for j in range(1,n+1):
c[i][j] = c[i][j-1] + x[i][j]
for i in ra... | import sys
input = sys.stdin.readline
n,m,q = list(map(int,input().split()))
c=[[0 for i in range(n+1)] for j in range(n+1)]
x=[[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()))
x[l][r] += 1
for i in range(1,n+1):
for j in range(1,n+1):
... | p03283 |
n, m, q = [int(x) for x in input().split()]
t_list = [[0] * (n + 1) for i in range(n + 1)]
c_list = [[0] * (n + 1) for i in range(n + 1)]
for _ in range(m):
l, r = [int(x) for x in input().split()]
t_list[l][r] += 1
for i in range(1, n + 1):
for j in range(1, n + 1):
c_list[i][j] = t_l... | n, m, q = [int(x) for x in input().split()]
t_list = [[0] * (n + 1) for i in range(n + 1)]
c_list = [[0] * (n + 1) for i in range(n + 1)]
for _ in range(m):
l, r = [int(x) for x in input().split()]
t_list[l][r] += 1
for i in range(1, n + 1):
for j in range(1, n + 1):
c_list[i][j] = t_l... | p03283 |
from collections import Counter
from itertools import product
n,m,q = list(map(int,input().split()))
rails=[tuple(map(int,input().split())) for i in range(m)]
qs=[tuple(map(int,input().split())) for i in range(q)]
xlist = [[0 for j in range(n)] for i in range(n)]
sumlist = [[0 for j in range(n+1)] for i in... | from collections import Counter
from itertools import product
n,m,q = list(map(int,input().split()))
rails=[tuple(map(int,input().split())) for i in range(m)]
qs=[tuple(map(int,input().split())) for i in range(q)]
xlist = [[0 for j in range(n)] for i in range(n)]
sumlist = [[0 for j in range(n+1)] for i in r... | p03283 |
n, m, q = list(map(int, input().split()))
image = [[0] * n for _ in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
image[l - 1][r - 1] += 1
sumimage = [[0] * n for _ in range(n)]
for l in range(n - 1, -1, -1):
for r in range(l, n):
if l == r:
sumimage[l][r] ... | n, m, q = list(map(int, input().split()))
image = [[0] * n for _ in range(n)]
for _ in range(m):
l, r = list(map(int, input().split()))
image[l - 1][r - 1] += 1
for l in range(n - 1, -1, -1):
for r in range(l + 1, n):
image[l][r] += image[l + 1][r] + image[l][r - 1] - image[l + 1][r - 1]
for... | p03283 |
#かいせつ
import itertools
n,m,q = list(map(int,input().split()))
lr = [[0 for i in range(n)] for j in range(n)]
for _ in range(m):
l,r = list(map(int,input().split()))
lr[l-1][r-1] += 1
acc_lr = []
for l in lr:
acc_lr.append([0] + list(itertools.accumulate(l)))
for _ in range(q):
l,r =... | import itertools
n,m,q = list(map(int,input().split()))
lr = [[0 for i in range(n)] for j in range(n)]
for _ in range(m):
l,r = list(map(int,input().split()))
lr[l-1][r-1] += 1
acc_lr = []
for l in lr:
acc_lr.append([0] + list(itertools.accumulate(l)))
for _ in range(q):
l,r = list(map... | p03283 |
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | p03283 |
N, M, Q = list(map(int, input().split())) # 5 7 2
A=[]
for i in range(M):
l, r = list(map(int, input().split())) # 5 7
A.append( (l,r) )
#print(A)
for i in range(Q):
p, q = list(map(int, input().split())) # 5 7
ans=0
for a in A:
if (p<=a[0])and(a[1]<=q): ans+=1
else:
print(ans)
| N, M, Q = list(map(int, input().split())) # 5 7 2
A=[] # (l,r)をそのまま保持
B=[] # (l,r,n) lからrまでの本数nを保持, B[l][r]=n
for i in range(N+1):
a=[0]*(N+1)
B.append(a)
for i in range(M):
l, r = list(map(int, input().split())) # 5 7
A.append( (l,r) )
B[l][r]+=1
#print("A", A)
#print("B", B)
for iR in ran... | p03283 |
N, M, Q = [int(_) for _ in input().split()]
LR = [[int(_) for _ in input().split()] for _ in range(M)]
PQ = [[int(_) for _ in input().split()] for _ in range(Q)]
dp = [[0] * N for _ in range(N)]
for lr in LR:
dp[lr[0] - 1][lr[1] - 1] += 1
for pq in PQ:
print((sum([sum(dp[i][i:pq[1]]) for i in range(pq[... | N, M, Q = [int(_) for _ in input().split()]
LR = [[int(_) for _ in input().split()] for _ in range(M)]
PQ = [[int(_) for _ in input().split()] for _ in range(Q)]
cumsum = [[0] * (N+2) for _ in range(N+1)]
for lr in LR:
cumsum[lr[0]][lr[0]] += 1
if lr[1] < N:
cumsum[lr[0]][lr[1]+1] -= 1
for i i... | p03283 |
N, M, Q = list(map(int, input().split()))
x = [[0 for j in range(N + 1)] for i in range(N + 1)]
for _ in range(M):
L, R = list(map(int, input().split()))
x[N - L][R] += 1
for i in range(1, N + 1):
for j in range(1, N + 1):
x[i][j] += x[i][j - 1]
for j in range(1, N + 1):
for i i... | N, M, Q = list(map(int, input().split()))
x = [[0 for j in range(N + 1)] for i in range(N + 1)]
for _ 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):
x[i][j] += x[i][j - 1]
for j in range(1, N + 1):
for i in re... | p03283 |
from bisect import bisect_left,bisect_right
N,M,Q=list(map(int,input().split()))
t=[list(map(int,input().split())) for _ in range(M)]
query=[list(map(int,input().split())) for _ in range(Q)]
train=[[0]*(N+1) for _ in range(N+1)]
c=[[0]*(N+1) for _ in range(N+1)]
for l,r in t:
train[l][r]+=1
for l in... | N,M,Q=list(map(int,input().split()))
t=[list(map(int,input().split())) for _ in range(M)]
query=[list(map(int,input().split())) for _ in range(Q)]
train=[[0]*(N+1) for _ in range(N+1)]
c=[[0]*(N+1) for _ in range(N+1)]
for l,r in t:
train[l][r]+=1
for l in range(1,N+1):
for r in range(1,N+1):
... | p03283 |
N,M,Q=list(map(int,input().split()))
L,R=0,0
A=[[0]*(N+1) for i in range(N+1)]
for i in range(M):
L,R=list(map(int,input().split()))
A[L][R]+=1
B=[[0]*(N+1) for i in range(N+1)]
for i in range(N):
for j in range(N):
B[i+1][j+1]=B[i+1][j]+B[i][j+1]-B[i][j]+A[i+1][j+1]
for i in range(Q):
L,R=list(m... | N,M,Q=list(map(int,input().split()))
L,R=0,0
A=[[0]*(N+1) for i in range(N+1)]
for i in range(M):
L,R=list(map(int,input().split()))
A[L][R]+=1
C=[[0]*(N+1) for i in range(N+1)]
for i in range(1,N+1):
for j in range(1,N+1):
C[i][j]=C[i][j-1]+C[i-1][j]-C[i-1][j-1]+A[i][j]
for i in range(Q):
L,R=li... | p03283 |
from bisect import bisect_left
n, m, q = list(map(int, input().split()))
lrlist = [[int(x) for x in input().split()] for _ in range(m)]
pqlist = [[int(x) for x in input().split()] for _ in range(q)]
lrlist.sort(key=lambda lr: lr[1])
lrlist.sort(key=lambda lr: lr[0])
llist = [lr[0] for lr in lrlist]
rlist =... | n, m, q = list(map(int, input().split()))
lr = [[0 for _ in range(n+1)] for _ in range(n+1)]
for _ in range(m):
l, r = list(map(int, input().split()))
lr[l][r] += 1
sumlr = [[0 for _ in range(n+1)] for _ in range(n+1)]
for l, r in ((l, r) for l in range(1, n+1) for r in range(1, n+1)):
sumlr[l][r... | p03283 |
import itertools
from collections import defaultdict
N,M,Q=list(map(int,input().split()))
d=defaultdict(int)
for i in range(M):
a,b=list(map(int,input().split()))
d[(a,b)]+=1
c={}
for x in range(0,N+1):
for y in range(0,x):
c[(x,y)]=0
c[(x,x)]=d[(x,x)]
for y in range(x+1,N+1):
c[(x,y)]=c[... | N,M,Q=list(map(int,input().split()))
c=[[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()))
c[a][b]+=1
for i in range(1,N):
for j in range(1,N+1-i):
c[j][i+j]+=c[j+1][i+j]+c[j][i+j-1]-c[j+1][i+j-1]
for i in range(Q):
a,b=list(map(int,input().split()))
... | 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
ans = [[0 for _ in range(n+1)] for __ in range(n+1)]
for i in range(n):
for j in range(n+1):
ans[i+1][j] = ans[i... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
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
ans = [[0 for _ in range(n+1)] for __ in range(n+1)]
... | p03283 |
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
# 二次元累積和(indexに注意)
s = [[0 for i in range(n+1)] for j in range(n+1)]
# s[x][y]:=[0,x-1]×[0,y-1]の長方形区間の総和
for i in range(n):
for j in ra... | import sys
input = sys.stdin.readline
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
# 二次元累積和(indexに注意)
s = [[0 for i in range(n+1)] for j in range(n+1)]
# s[x][y]:=[0,x-1]×[0,y-1]の長方... | p03283 |
from sys import stdin
from bisect import bisect_left
def getval():
n,m,q = list(map(int,stdin.readline().split()))
r = [list(map(int,stdin.readline().split())) for i in range(m)]
qu = [list(map(int,stdin.readline().split())) for i in range(q)]
return n,m,q,r,qu
def main(n,m,q,r,qu):
#Kee... | from sys import stdin
from sys import stdout
def getval():
n,m,q = list(map(int,stdin.readline().split()))
r = [list(map(int,stdin.readline().split())) for i in range(m)]
qu = [list(map(int,stdin.readline().split())) for i in range(q)]
return n,m,q,r,qu
def main(n,m,q,r,qu):
#Keep all ra... | p03283 |
from sys import stdin
from sys import stdout
def getval():
n,m,q = list(map(int,stdin.readline().split()))
r = [list(map(int,stdin.readline().split())) for i in range(m)]
qu = [list(map(int,stdin.readline().split())) for i in range(q)]
return n,m,q,r,qu
def main(n,m,q,r,qu):
#Keep all ra... | from sys import stdin
from sys import stdout
def getval():
n,m,q = list(map(int,stdin.readline().split()))
rw = [[] for i in range(n)]
for i in range(m):
l,r = list(map(int,stdin.readline().split()))
rw[r-1].append(l-1)
for i in range(n):
rw[i].sort()
qu = [list(m... | p03283 |
from sys import stdin
from sys import stdout
def getval():
n,m,q = list(map(int,stdin.readline().split()))
rw = [[] for i in range(n)]
for i in range(m):
l,r = list(map(int,stdin.readline().split()))
rw[r-1].append(l-1)
for i in range(n):
rw[i].sort()
return n,m,q... | from sys import stdin
from sys import stdout
def getval():
n,m,q = list(map(int,stdin.readline().split()))
rw = [[] for i in range(n)]
for i in range(m):
l,r = list(map(int,stdin.readline().split()))
rw[r-1].append(l-1)
for i in range(n):
rw[i].sort()
return n,m,q... | p03283 |
n,m,q=list(map(int,input().split()))
mylist=[[0]*(n+1) for _ in range(n+1)]
for i in range(m):
l,r=list(map(int,input().split()))
mylist[l][r]+=1
for i in range(1,n+1):
for j in range(1,n+1):
mylist[i][j]+=mylist[i][j-1]
memo=[[-1]*(n+1) for _ in range(n+1)]
for i in range(q):
... | n,m,q=list(map(int,input().split()))
mylist=[[0]*(n+1) for _ in range(n+1)]
for i in range(m):
l,r=list(map(int,input().split()))
mylist[l][r]+=1
for i in range(1,n+1):
for j in range(1,n+1):
mylist[i][j]+=mylist[i][j-1]
memo=[[-1]*(n+1) for _ in range(n+1)]
for i in range(q):
... | p03283 |
N, M, Q = list(map(int, input().split()))
# LR = [list(map(int, input().split())) for i in range(M)]
Ls = [set() for i in range(N)]
Rs = [set() for i in range(N)]
for i in range(M):
L, R = list(map(int, input().split()))
Ls[L-1].add(i)
Rs[R-1].add(i)
for i in range(N-1):
j = N - 1 - i
Rs[i+1] |= R... | N, M, Q = list(map(int, input().split()))
Ls = [0] * N
Rs = [0] * N
for i in range(M):
L, R = list(map(int, input().split()))
Ls[L-1] |= 1 << i
Rs[R-1] |= 1 << i
for i in range(N-1):
j = N - 1 - i
Rs[i+1] |= Rs[i]
Ls[j-1] |= Ls[j]
for i in range(Q):
p, q = list(map(int, input().split()))
... | p03283 |
N, M, Q = list(map(int, input().split()))
Ls = [0] * N
Rs = [0] * N
for i in range(M):
L, R = list(map(int, input().split()))
Ls[L-1] |= 1 << i
Rs[R-1] |= 1 << i
for i in range(N-1):
j = N - 1 - i
Rs[i+1] |= Rs[i]
Ls[j-1] |= Ls[j]
for i in range(Q):
p, q = list(map(int, input().split()))
... | N, M, Q = list(map(int, input().split()))
MAP = [[0] * N for i in range(N)]
for i in range(M):
L, R = list(map(int, input().split()))
MAP[L-1][R-1] += 1
for r in range(N):
for l in range(N-1, 0, -1):
MAP[l-1][r] += MAP[l][r]
for r in range(N-1):
for l in range(N):
MAP[l][r+1] += MAP[l][r]
... | p03283 |
import sys
sys.setrecursionlimit(1000000)
N,M,Q = [int(x) for x in input().split()]
lr = [[int(x) for x in input().split()]for _ in range(M)]
pq = [[int(x) for x in input().split()]for _ in range(Q)]
dp = [[0 for _ in range(N+1)]for _ in range(N+1)]
for i in lr:
for j in range(i[0]+1):
dp[j][i... | import sys
sys.setrecursionlimit(1000000)
N,M,Q = [int(x) for x in input().split()]
lr = [[int(x) for x in input().split()]for _ in range(M)]
pq = [[int(x) for x in input().split()]for _ in range(Q)]
dp = [[0 for _ in range(N+1)]for _ in range(N+1)]
for i in lr:
dp[i[0]][i[1]]+=1
for j in range(N+1)... | p03283 |
# あらかじめ全ての区間における答えを求めておく
# 累積和が使える。
# p,qの値に関しての2次元座標系で考えると、値が存在するマスは限られてる
#
#
n, m, q = list(map(int, input().split()))
ll = [[0, 0] for i in range(m)]
p = [[0, 0] for i in range(q)]
for i in range(m):
ll[i][0], ll[i][1] = list(map(int, input().split()))
for i in range(q):
p[i][0], p[i][1] = list(ma... | # あらかじめ全ての区間における答えを求めておく
# 累積和が使える。
# 2次元累積和に関しては、下記のサイトを参照。
# https://paiza.hatenablog.com/entry/2014/05/28/もし女子大生プログラマに『アルゴリズム』を図
# p,qの値に関しての2次元座標系で考えると、値が存在するマスは限られてる
#
#
n, m, q = list(map(int, input().split()))
ll = [[0, 0] for i in range(m)]
p = [[0, 0] for i in range(q)]
for i in range(m):
ll[i][... | p03283 |
N, M, Q = list(map(int, input().split(' ')))
st_ed = {}
for i in range(M):
l, r = list(map(int, input().split(' ')))
st_ed[(l, r)] = st_ed.get((l, r), 0) + 1
memo_s = {}
# memo[(p, q)] = memo[(p, q-1)] + sum([st_ed.get((i, q), 0) for i in [1,2,3...p]])
def f(p, q):
if p == q:
return st_ed... | N, M, Q = list(map(int, input().split(' ')))
st_ed = {}
for i in range(M):
l, r = list(map(int, input().split(' ')))
st_ed[(l, r)] = st_ed.get((l, r), 0) + 1
memo_g = {}
def g(p, q):
if p == q:
return st_ed.get((p, q), 0)
if not (p, q) in memo_g:
memo_g[(p, q)] = st_ed.get((p... | p03283 |
def main():
n, m, q = list(map(int, input().split()))
trains = [list(map(int, input().split())) for _ in range(m)]
questions = [list(map(int, input().split())) for _ in range(q)]
for question in questions:
a, b = question
# result = [train for train in trains if a <= train[0] and... | n, m, q = list(map(int, input().split()))
cities = [[0 for _ in range(n+1)] for _ in range(n+2)]
trains = [list(map(int, input().split())) for _ in range(m)]
quests = [list(map(int, input().split())) for _ in range(q)]
for train in trains:
x, y = train[0], train[1]
cities[x][y] += 1
for i in range(n)... | p03283 |
#!/usr/bin/env python3
import sys
import itertools
import collections
import functools
import math
from queue import Queue
# import numpy as np
INF = float("inf")
def solve(N: int, M: int, Q: int, L: "List[int]", R: "List[int]", p: "List[int]", q: "List[int]"):
a = [[0]*(N+1) for _ in range(N+1)]
... | #!/usr/bin/env python3
import sys
import itertools
import collections
import functools
import math
from queue import Queue
# import numpy as np
INF = float("inf")
def solve(N: int, M: int, Q: int, L: "List[int]", R: "List[int]", p: "List[int]", q: "List[int]"):
a = [[0]*(N+1) for _ in range(N+1)]
... | p03283 |
n, m, q = list(map(int, input().split()))
train = [tuple(map(int, input().split())) for _ in range(m)]
quest = [tuple(map(int, input().split())) for _ in range(q)]
dp = [[0 for _ in range(n)] for _ in range(n)]
d = {}
for l in range(n):
for r in range(l,n):
d[(l,r)] = 0
for p, q in train:
d[(p-... | n, m, q = list(map(int, input().split()))
train = [tuple(map(int, input().split())) for _ in range(m)]
quest = [tuple(map(int, input().split())) for _ in range(q)]
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
d = {}
for l in range(n):
for r in range(l,n):
d[(l+1,r+1)] = 0
for p, q in train:
... | p03283 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.