input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
d, n = list(map(int, input().split()))
if n < 100:
a = 10 ** (2 * d)
b = a * n
print(b)
if n == 100:
a = 10 ** (2 * d)
b = a * (n + 1)
print(b) | d, n = list(map(int, input().split()))
ans = n * (100 ** (d))
if (ans // (100 ** d)) % 100 == 0:
ans = (n + 1) * (100 ** (d))
print(ans)
| p03324 |
# coding: utf-8
# Your code here!
d,n=list(map(int,input().split()))
if n!=100:
print((100**d*n))
else:
print((100**d*(n+1))) | # coding: utf-8
# Your code here!
d,n=list(map(int,input().split()))
if n==100:
print((100**d*(n+1)))
else:
print((100**d*n)) | p03324 |
d, n = list(map(int, input().split()))
start = 100 ** d
counter = 0
while True:
if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
counter += 1
if counter == n:
print(start)
break
start += 1
| d, n = list(map(int, input().split()))
start = 100 ** d
counter = 0
while True:
if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
counter += 1
if counter == n:
print(start)
break
start += 100 ** d
| p03324 |
s = input().strip()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
x = i
c = 0
while x % 100 == 0:
x //= 100
c += 1
if c == d:
n -= 1
if n == 0:
print(i)
break
i += 1
| s = input()
ss = s.split()
d = int(ss[0])
n = int(ss[1])
i = 1
while 1:
x = i
c = 0
while x % 100 == 0:
x //= 100
c += 1
if c == d:
n -= 1
if n == 0:
print(i)
break
i += 1
| p03324 |
D,N = list(map(int,input().split()))
if N==100: N+=1
print((N * (100**D))) | D,N = list(map(int,input().split()))
if N==100:
N += 1
print((100**D * N)) | p03324 |
D,N = list(map(int,input().split()))
list = []
for i in range(10000000):
if i % 100**D == 0:
list.append(i)
print((list[N]))
| D,N = list(map(int,input().split()))
if N == 100:
print((100**D*101))
else:
print((100**D*N))
| p03324 |
D, N = list(map(int,input().split()))
n = []
for i in range(1,1001):
if D == 0:
if i % 100 !=0:
n.append(i)
continue
elif D == 1:
if i % 100 !=0:
n.append(100*i)
continue
elif D == 2:
if i % 100 !=0:
n.append(10... | D, N = list(map(int,input().split()))
n = []
for i in range(1,1001):
if i % 100 !=0:
if D == 0:
n.append(i)
elif D == 1:
n.append(100*i)
elif D == 2:
n.append(10000*i)
print((n[N-1])) | p03324 |
d, n = list(map(int,input().split()))
result = 0
for i in range(1,n+1):
if i // 100 == 0:
result = i*(100**d)
else:
j = 0
while not(((i+j) //100 == 0)):
j += 1
result = (i+j)*(100**d)
print(result)
| d, n = list(map(int,input().split()))
result = 0
for i in range(1,n+1):
if i // 100 == 0:
result = i*(100**d)
else:
j = 1
result = (i+j)*(100**d)
print(result)
| p03324 |
D,N = list(map(int,input().split()))
L = []
for i in range(N*2) :
l = 100**D
l *= (i+1)
if D == 0 :
if (l % 100) != 0 :
L.append(l)
elif D == 1 :
if (l % 10000) != 0 :
L.append(l)
else :
if (l % 1000000) != 0 :
L.append(l)
... | D,N = list(map(int,input().split()))
cnt = 0
calc = 100**D
ans = 0
while cnt != N :
ans += calc
if (ans % 100**D == 0) and (ans % 100**(D+1) != 0) :
cnt += 1
print(ans)
| p03324 |
D,N=list(map(int,input().split()))
ans=N*100**D
if N==100:
ans+=1*100**D
print(ans) | a,b=list(map(int,input().split()))
if a==0 and b==100:
print((101))
elif a==1 and b==100:
print((10100))
elif a==2 and b==100:
print((1010000))
else:
print(((100**a)*b))
| p03324 |
d,n=list(map(int,input().split()))
if n==100:
if d==0:
print((101))
exit()
elif d==1:
print((10100))
exit()
else:
print((1010000))
exit()
print((pow(100,d)*n)) | # 入力
D,N=list(map(int,input().split()))
# D（=0,1,2）の値によって場合分け
if D==0:
if N==100:
print((101))
else:
print(N)
elif D==1:
if N==100:
print((10100))
else:
print((N*100))
else:
if N==100:
print((1010000))
else:
print((N*10000))
| p03324 |
d, n = list(map(int, input().split()))
if n != 100:
print((100 ** d * n))
else:
print((100 ** d * (n + 1))) | d, n = list(map(int, input().split()))
if n % 100 != 0:
print((100 ** d * n))
else:
print((100 ** d * (n + 1))) | p03324 |
D,N=list(map(int,input().split()))
if N==100:
print((100**D*(N+1)))
else:
print((100**D*N)) | d, n = list(map(int, input().split()))
# d, n = 0, 5
# d, n = 1, 11
# d, n = 2, 85
if n != 100:
print((100**d*n))
else:
print((100**d*101))
| p03324 |
from heapq import heappush, heappop
INF = 10 ** 20
n, m, k, s = list(map(int, input().split()))
p, q = list(map(int, input().split()))
z_dist = [INF] * n
que = []
for _ in range(k):
c = int(eval(input())) - 1
z_dist[c] = 0
heappush(que, (0, c))
edges = [[] for _ in range(n)]
for _ in range(m):
a... | from heapq import heappush, heappop
INF = 10 ** 20
n, m, k, s = list(map(int, input().split()))
p, q = list(map(int, input().split()))
z_dist = [INF] * n
que = []
for _ in range(k):
c = int(eval(input())) - 1
z_dist[c] = 0
heappush(que, (0, c))
edges = [[] for _ in range(n)]
for _ in range(m):
a... | p00546 |
from itertools import chain
a = list(open(0))
n = int(a[0].split()[0])
print((n - len(set(chain.from_iterable(list(map(str.split, a[2::2])))))))
| R = lambda: list(map(int, input().split()))
n, k = R()
s = set()
for _ in range(k):
R()
s.update(R())
print((n - len(s)))
| p02688 |
import sys
input = sys.stdin.readline
from collections import *
N, K = list(map(int, input().split()))
cnt = [0]*N
for _ in range(K):
d = int(eval(input()))
a = list(map(int, input().split()))
for ai in a:
cnt[ai-1] += 1
ans = cnt.count(0)
print(ans) | N, K = list(map(int, input().split()))
flag = [False]*N
for _ in range(K):
d = int(eval(input()))
A = list(map(int, input().split()))
for Ai in A:
flag[Ai-1] = True
print((flag.count(False))) | p02688 |
## coding: UTF-8
N,K = list(map(int,input().split()))
d = []
A = []
for i in range(K):
d.append(int(eval(input())))
A.append(list(map(int,input().split())))
#print(d)
#print(A)
have_not = [0] + [1] * N
for i in range(K):
for j in range(len(A[i])):
#print(A[i][j])
have_not[A... | ## coding: UTF-8
N,K = list(map(int,input().split()))
havent = [0] + [1] * N
for i in range(K):
d = int(eval(input()))
a = list(map(int,input().split()))
for e in a:
havent[e] = 0
print((sum(havent))) | p02688 |
(n,k),*p = [[*list(map(int, i.split()))] for i in open(0)]
a = sum([p[2*i+1] for i in range(k)],[])
print((n - len(set(a)))) | n,k = list(map(int, input().split()))
a = set()
for i in [0]*k:
_ = eval(input())
a = a | set([*list(map(int, input().split()))])
print((n - len(a))) | p02688 |
n,k = list(map(int,input().split()))
people = list(range(1,n+1))
li = []
for i in range(k) :
gomi = eval(input())
[li.append(int(j)) for j in input().split()]
st = set(li)
ans = 0
for i in people :
if not i in st :
ans += 1
print(ans) | n,k = list(map(int,input().split()))
li = []
for i in range(k) :
gomi = eval(input())
[li.append(int(j)) for j in input().split()]
st = set(li)
print((n - len(st))) | p02688 |
def main():
N, K = list(map(int, input().split()))
v = [0 for _ in range(N)]
for _ in range(K):
d = int(eval(input()))
A = list(map(int, input().split()))
for u in A:
v[u-1] += 1
ans = 0
for i in range(N):
if v[i] == 0: ans += 1
return ans... | def main():
N, K = list(map(int, input().split()))
p = set()
for _ in range(K):
d = int(eval(input()))
A = list(map(int, input().split()))
for i in range(d):
p.add(A[i])
return N - len(p)
if __name__ == '__main__':
print((main()))
| p02688 |
N,K=list(map(int,input().split()))
A=[int(i) for i in range(1,N+1,1)]
for _ in range(K):
d=int(eval(input()))
A_lis=list(map(int,input().split()))
for i in A_lis:
if i in A: A.remove(i)
print((len(A))) | N,K=list(map(int,input().split()))
A=set()
for _ in range(K):
d=int(eval(input()))
A=A.union(set(map(int,input().split())))
print((N-len(A))) | p02688 |
a = 1;
treat = 0;
n, k = list(map(int, input().split()));
data = [input().split() for l in range(2*k)]
while a <= n:
b = 0;
d = 0;
while b < k:
search = int(data[2*b][0]);
c = 0;
while c < search:
x = int(data[2*b+1][c]);
if x... | a = 1;
treat = 0;
n, k = list(map(int, input().split()));
data = list(input().split() for l in range(2*k))
while a <= n:
b = 0;
d = 0;
while b < k:
search = int(data[2*b][0]);
c = 0;
while c < search:
x = int(data[2*b+1][c]);
... | p02688 |
N, K = list(map(int, input().split()))
sunuke = [0]*N
for _ in range(K):
d = int(eval(input()))
A = list(map(int, input().split()))
for a in A:
sunuke[a-1] += 1
ans = 0
for i in range(N):
if sunuke[i-1] == 0:
ans += 1
print(ans)
| import sys
sys.setrecursionlimit(10 ** 6)
def input():
return sys.stdin.readline()[:-1]
N, K = list(map(int, input().split()))
A = [0]*N
for _ in range(K):
d = int(eval(input()))
tmp = list(map(int, input().split()))
for a in tmp:
A[a-1] += 1
print((A.count(0)))
| p02688 |
n, k = list(map(int, input().split()))
A = [None]*k
for i in range(k):
d = int(eval(input()))
A[i] = list(map(int, input().split()))
sunuke = [0] * n
for i in range(k):
for j in A[i]:
sunuke[j - 1] += 1
ans = 0
for i in sunuke:
if i == 0:
ans += 1
print(ans)
| n, k = list(map(int, input().split()))
A = [None]*k
for i in range(k):
d = int(eval(input()))
A[i] = list(map(int, input().split()))
snuke = [0] * n
for i in range(k):
for j in A[i]:
snuke[j - 1] += 1
ans = 0
for i in snuke:
if i == 0:
ans += 1
print(ans) | p02688 |
import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().split()))
li = []
for i in range(k):
d = int(eval(input()))
a_li = list(map(int, input().split()))
li += a_li
print((n - len(set(li))))
if __name__ == '__main__':
main()
| n, k = list(map(int, input().split()))
li = []
for i in range(k):
d = int(eval(input()))
a_li = list(map(int, input().split()))
li += a_li
print((n - len(set(li))))
| p02688 |
n,k = list(map(int, input().split()))
d = []
a = []
for _ in range(k):
d1 = int(eval(input()))
A = list(map(int, input().split()))
d.append(d1)
a.append(A)
ans = [0] * n
for s in a:
for v in s:
ans[v-1] = 1
print((ans.count(0))) | n,k = list(map(int, input().split()))
d = []
a = []
for _ in range(k):
D = int(eval(input()))
A = list(map(int, input().split()))
d.append(D)
a += A
a = list(set(a))
check = [1] * n
for i in a:
check[i-1] = 0
print((sum(check))) | p02688 |
N, K = list(map(int, input().split()))
tmp = set()
for i in range(K):
eval(input())
tmp.update(list(map(int, input().split())))
print((N - len(tmp))) | N, K = list(map(int, input().split()))
tmp = [0] * N
for i in range(K):
eval(input())
for j in map(int, input().split()):
tmp[j-1] |= 1
print((N - sum(tmp)))
| p02688 |
N, K = list(map(int, input().split()))
A = [[] for _ in range(N)]
for k in range(K):
d = int(eval(input()))
for a in map(int, input().split()):
A[a - 1].append(k)
print((sum([1 for a in A if len(a) == 0])))
| N, K = list(map(int, input().split()))
F = [1 for _ in range(N)]
for _ in range(K):
d = int(eval(input()))
for a in map(int, input().split()):
F[a - 1] = 0
print((sum(F)))
| p02688 |
n, k = list(map(int, input().split()))
a = set()
for i in range(k):
d = int(eval(input()))
a |= set(map(int, input().split()))
print((len(set(range(1, n + 1)) - a))) | n, k = list(map(int, input().split()))
a = set()
for i in range(k):
d = int(eval(input()))
a |= set(map(int, input().split()))
print((n - len(a))) | p02688 |
# input
N, K = list(map(int, input().split()))
# initialization
p_list = [0]*N
# count
for i in range(K):
d = int(eval(input()))
a_nums = list(map(int, input().split()))
for j in range(d):
p_list[a_nums[j]-1] += 1
# check
ans = 0
for i in range(N):
if p_list[i]==0:
an... | # Problem B - Trick or Treat
# input
N, K = list(map(int, input().split()))
# initialization
snuke = [0]*N
ans = 0
# count
for k in range(K):
d = int(eval(input()))
a_nums = list(map(int, input().split()))
for a in a_nums:
snuke[a-1] += 1
# check
for s in snuke:
if s==0:
... | p02688 |
N,K = list(map(int, input().split()))
l = []
for i in range(K):
int(eval(input()))
temp = input().split()
l.extend(temp)
print((N-len(set(l)))) | N,K = list(map(int, input().split()))
l = []
for _ in range(K):
int(eval(input()))
l.extend(input().split())
print((N-len(set(l)))) | p02688 |
n,k = list(map(int,input().split()))
count = [0]*n
for i in range(k):
d = int(eval(input()))
a = list(map(int,input().split()))
for j in range(len(a)):
count[a[j]-1] += 1
print((count.count(0))) | n,k = list(map(int,input().split()))
ans = [0]*n
for i in range(k):
d = int(eval(input()))
a = list(map(int,input().split()))
for j in range(len(a)):
ans[a[j]-1] += 1
print((ans.count(0))) | p02688 |
n,k = list(map(int,input().split()))
sunuke = [i for i in range(1,n+1)]
while k > 0:
d = int(eval(input()))
a = list(map(int,input().split()))
for i in range(len(a)):
if a[i] in sunuke:
sunuke.remove(a[i])
k -= 1
print((len(sunuke)))
| n,k = list(map(int,input().split()))
sunuke = [i for i in range(1,n+1)]
have = []
for i in range(k):
d = int(eval(input()))
a = list(map(int,input().split()))
for i in a:
have.append(i)
ans = list(set(sunuke) - set(have))
print((len(ans)))
| p02688 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(... | #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p02688 |
def resolve():
n, k = list(map(int, input().split()))
p = [0]*n
for _ in range(k):
eval(input())
t = list(map(int, input().split()))
for i in t:
p[i-1] += 1
ans = 0
for i in p:
if i == 0:
ans += 1
print(ans)
resolve() | def resolve():
n, k = list(map(int, input().split()))
s = [False]*n
for i in range(k):
eval(input())
for j in list(map(int, input().split())):
s[j-1] = True
print((s.count(False)))
resolve() | p02688 |
N,K = list(map(int,input().split()))
snuke = [0]*N
for i in range(K):
d = int(eval(input()))
A = list(map(int,input().split()))
for j in A:
snuke[j-1] += 1
cnt = 0
for i in snuke:
if i == 0:
cnt += 1
print(cnt) | N,K = list(map(int,input().split()))
snukes = [1]*N
for _ in range(K):
d = int(eval(input()))
A = list(map(int,input().split()))
for i in A:
snukes[i-1] = 0
print((sum(snukes))) | p02688 |
N, K = list(map(int, input().split()))
d = []
A = []
for i in range(K):
d.append(int(eval(input())))
A.append(list(map(int, input().split())))
hito = [i for i in range(1, N+1)]
for i in range(N):
name = hito[i]
for j in range(K):
if name in A[j]:
hito[i] = -1
... | N, K = list(map(int, input().split()))
d = []
A = []
for i in range(K):
d.append(int(eval(input())))
st = list(map(int, input().split()))
for j in st:
A.append(j)
print((N-len(set(A)))) | p02688 |
n, k = list(map(int, input().split()))
d_list = []
a_list = []
for i in range(k):
d_list.append(int(eval(input())))
a_list.append(list(map(int, input().split())))
nonhave_list = []
for j in range(n):
for l in range(k):
exist = False
if j+1 in a_list[l]:
exist = Tru... | n, k = list(map(int, input().split()))
d_list, a_list = [], []
ans_list = [1] * n
for i in range(k):
d_list.append(int(eval(input())))
a_list = list(map(int, input().split()))
for j in a_list:
if ans_list[j-1] == 1:
ans_list[j-1] = 0
print((sum(ans_list)))
| p02688 |
n, k = list(map(int, input().split()))
A = [0]*n
for i in range(k):
d = int(eval(input()))
a_list = list(map(int, input().split()))
for a in a_list:
A[a-1] += 1
count = 0
for i in A:
if i == 0:
count += 1
print(count) | n, k = list(map(int, input().split()))
A = [0]*n
for i in range(k):
d = int(eval(input()))
a_list = list(map(int, input().split()))
for a in a_list:
A[a-1] += 1
print((A.count(0))) | p02688 |
N,K=list(map(int,input().split()))
a = [[0]*N]*K
a = [[0 for n in range(N)] for k in range(K)]
for k in range(K):
d=int(eval(input()))
have_k=list(map(int,input().split()))
for h in have_k:
a[k][h-1]=1
an=[0]*N
for k in range(K):
for n in range(N):
an[n] = an[n]+a[k][n]
resul... | N,K=list(map(int,input().split()))
a = [[0 for n in range(N)] for k in range(K)]
for k in range(K):
d=int(eval(input()))
have_k=list(map(int,input().split()))
for h in have_k:
a[k][h-1]=1
an=[0]*N
for k in range(K):
for n in range(N):
an[n] = an[n]+a[k][n]
result=0
for i in a... | p02688 |
n, k = list(map(int, input().split()))
a = []
for i in range(k):
d = int(eval(input()))
a[len(a):len(a)] = list(map(int, input().split()))
list(set(a))
ans = 0
for i in range(1, n+1):
if i not in a:
ans += 1
print(ans) | n, k = list(map(int, input().split()))
a = []
for i in range(k):
d = int(eval(input()))
a.extend(list(map(int, input().split())))
a = list(set(a))
print((n-len(a))) | p02688 |
n, k = list(map(int, input().split()))
A = set([])
for i in range(k):
d = eval(input())
A = A | set(map(int, input().split()))
ans = 0
for i in range(n):
if i+1 not in A:
ans += 1
print(ans) | n, k = list(map(int, input().split()))
A = set([])
for i in range(k):
d = eval(input())
A = A | set(map(int, input().split()))
print((n-len(A))) | p02688 |
import sys
input = sys.stdin.readline
n, k = [int(x) for x in input().split()]
flag = [0]*n
for _ in range(k):
d = int(eval(input()))
a = [int(x) for x in input().split()]
for i in a:
flag[i - 1] = 1
ans = 0
for i in flag:
if not i:
ans += 1
print(ans)
| import sys
input = sys.stdin.readline
n, k = [int(x) for x in input().split()]
s = set()
for _ in range(k):
d = int(eval(input()))
a = [int(x) for x in input().split()]
for i in a:
s.add(i)
ans = 0
for i in range(n):
if i + 1 not in s:
ans += 1
print(ans) | p02688 |
# B
inp = input().split(' ')
N, K = int(inp[0]), int(inp[1])
sunuke = [1] * N
for i in range(K):
di = int(eval(input()))
tmp = list(map(int, input().split()))
for t in tmp:
sunuke[t-1] = 0
print((sum(sunuke))) | # B
N, K = list(map(int, input().split()))
sunuke = [1] * N
for i in range(K):
di = int(eval(input()))
tmp = list(map(int, input().split()))
for t in tmp:
sunuke[t-1] = 0
print((sum(sunuke))) | p02688 |
N, K = list(map(int, input().split()))
cnt = [0] * N
for _ in range(K):
_ = int(eval(input()))
for a in map(int, input().split()):
cnt[a - 1] += 1
print((cnt.count(0))) | n,k = list(map(int,input().split()))
cnt = [0]*n
for i in range(k):
d = eval(input())
As = list(map(int, input().split()))
for a in As:
cnt[a-1] += 1
print((cnt.count(0))) | p02688 |
N, K = list(map(int, input().split()))
sunuke = [True]*N
for i in range(K):
d = int(eval(input()))
A = list(map(int, input().split()))
for a in A:
sunuke[a-1] = False
ans = 0
for i in range(N):
if sunuke[i]:
ans += 1
print(ans) | N, K = list(map(int, input().split()))
flag = [True]*N
for i in range(K):
d = int(eval(input()))
A = list(map(int, input().split()))
for a in A:
flag[a-1] = False
ans = 0
for i in range(N):
if flag[i]:
ans += 1
print(ans) | p02688 |
N,K = list(map(int, input().split()))
a = set()
for i in range(K):
eval(input())
b= set(map(int,input().split()))
a|= b
print((N - len(a))) | N,K = list(map(int, input().split()))
a = set()
for i in range(K):
gomi = eval(input())
b = set(map(int,input().split()))
a |= b
print((N - len(a))) | p02688 |
n, k =list(map(int, input().split()))
l = [0] * n
for i in range(k):
d = int(eval(input()))
lst = list(map(int,input().split()))
for i in range(d):
l[lst[i] - 1] += 1
print((l.count(0))) | n, k = list(map(int, input().split()))
l = [0] * n
for i in range(k):
d = int(eval(input()))
a = list(map(int, input().split()))
for j in range(len(a)):
l[a[j] - 1] = 1
print((l.count(0)))
| p02688 |
#!/usr/bin/env python3
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
def input_int_list():
return list(map(int, input().split()))
def input_int_list_with_length(length=None):
if length == None:
length = int(eval(input()))
return list(map(int, input().split()))[:l... | #!/usr/bin/env python3
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools
def input_int_list():
return list(map(int, input().split()))
def input_int_list_with_length(length=None):
if length == None:
length = int(eval(input()))
return list(map(int, input().split()))[:l... | p02688 |
N,K=list(map(int,input().split()))
hoge=[0 for j in range(N)]
for j in range(K):
eval(input())
for i in input().split():
hoge[int(i)-1]+=1
print((sum([j==0 for j in hoge])))
| N,K=list(map(int,input().split()))
hoge={}
for j in range(K):
eval(input())
[hoge.update({int(j)-1:1}) for j in input().split()]
print((sum([not j in hoge for j in range(N)])))
| p02688 |
import itertools
import math
import fractions
import functools
n, k = list(map(int, input().split()))
a = []
for i in range(k):
di = int(eval(input()))
ai = list(map(int, input().split()))
a.append(ai)
count = [0] * (n+1)
for i in range(k):
for j in range(len(a[i])):
count[a[i][... | import itertools
import math
import fractions
import functools
n, k = list(map(int, input().split()))
a = []
for i in range(k):
di = int(eval(input()))
ai = list(map(int, input().split()))
a.append(ai)
count=set()
for i in range(k):
for j in range(len(a[i])):
count.add(a[i][j])
... | p02688 |
N,K = list(map(int,input().split()))
list_A = [0]*N
ans = 0
d = []
A = []
for i in range(K):
d.append(int(eval(input())))
A.append(list(map(int,input().split())))
list_A = [0]*N
for i in range(len(A)):
for j in A[i]:
list_A[j-1] += 1
for i in range(N):
if list_A[i]... | N,K = list(map(int,input().split()))
tmp_A = [0]*N
ans = 0
for i in range(K):
d = int(eval(input()))
A = list(map(int,input().split()))
for j in range(d):
tmp_A[A[j]-1] += 1
for i in range(N):
if tmp_A[i] == 0:
ans += 1
print(ans) | p02688 |
N,K=list(map(int,input().split()))
con = 0
ans = list(int() for _ in range(100000))
pre = 0
for _ in range(K):
D = int(eval(input()))
arr = list(map(int,input().split()))
for j in range(D):
ans[pre+j]=arr[j]
pre += D
fin = (N+1) - len(set(ans))
print(fin) | N,K=list(map(int,input().split()))
con = 0
ans = list(int() for _ in range(10001))
pre = 0
for _ in range(K):
D = int(eval(input()))
arr = list(map(int,input().split()))
for j in range(D):
ans[pre+j]=arr[j]
pre += D
fin = (N+1) - len(set(ans))
print(fin) | p02688 |
def main():
n,k = tuple([int(t)for t in input().split()])
t = [0]*n
for _ in range(k):
eval(input())
k = tuple([int(t)-1 for t in input().split()])
for k_i in k:
t[k_i]+=1
ans = 0
for t_i in t:
if t_i==0:
ans+=1
print(an... | n,k = tuple(map(int,input().split()))
ans = [1]*n
for i in range(k):
d = int(eval(input()))
a_i = tuple(map(int,input().split()))
for a_ij in a_i:
ans[a_ij-1] = 0
print((sum(ans)))
| p02688 |
N, K = list(map(int, input().split()))
d = []
A = []
for _ in range(K):
d.append(int(eval(input())))
A.append(list(map(int, input().split())))
cnt = {}
for i in range(N):
cnt.setdefault(str(i + 1), 0)
for Ai in A:
for Aij in Ai:
cnt[str(Aij)] += 1
ans = 0
for key, val in lis... | N, K = list(map(int, input().split()))
d = []
A = []
for _ in range(K):
d.append(int(eval(input())))
A.append(list(map(int, input().split())))
cnt = {}
for i, Ai in enumerate(A):
for j, Aij in enumerate(Ai):
key = str(Aij)
cnt.setdefault(key, 0)
cnt[key] += 1
ans = 0
... | p02688 |
(n,_),*t=[t.split()for t in open(0)][::2]
print((int(n)-len(set(sum(t,[]))))) | n,_,*t=''.join([*open(0)][::2]).split()
print((int(n)-len({*t}))) | p02688 |
N, K = list(map(int, input().split()))
sunuke_who_has_sweets = set()
for i in range(K):
d = int(eval(input()))
sunuke_who_has_sweets |= set(map(int, input().split()))
print((N - len(sunuke_who_has_sweets))) | N,K = list(map(int,input().split()))
r = set()
for i in range(K):
d = int(eval(input()))
r |= set(map(int,input().split()))
print((N-len(r))) | p02688 |
n, k = list(map(int, input().split()))
i = 0
a = list()
d = 0
while i<k:
d += int(eval(input()))
a += (list(map(int, input().split())))
i += 1
i=0
while i<d:
x = d-1
while x > i:
if a[x] < a[x-1]:
c = a[x]
a[x] = a[x-1]
a[x-1] = c
... | n, k = list(map(int, input().split()))
i = 0
a = list()
d = 0
while i<k:
d += int(eval(input()))
a += (list(map(int, input().split())))
i += 1
i=0
b = [0]*n
while i<d:
b[a[i]-1]=1
i+=1
i=0
ans = 0
while i<n:
if b[i] ==0:
ans += 1
i+=1
print(ans)
| p02688 |
def main():
n, k = list(map(int, input().split()))
snack = set()
for _ in range(k):
eval(input())
a = set(list(map(int, input().split())))
snack |= a
print((n-len(snack)))
if __name__ == "__main__":
main() | def main():
n, k = list(map(int, input().split()))
sunukes = set()
for _ in range(k):
eval(input())
sunukes |= set(list(map(int, input().split())))
print((n-len(sunukes)))
if __name__ == "__main__":
main() | p02688 |
def main():
n, k = list(map(int, input().split()))
sunukes = set()
for _ in range(k):
eval(input())
sunukes |= set(list(map(int, input().split())))
print((n-len(sunukes)))
if __name__ == "__main__":
main() | def main():
n, k = list(map(int, input().split()))
a = set()
for i in range(k):
eval(input())
a |= set(list(map(int, input().split())))
print((n-len(a)))
if __name__ == "__main__":
main() | p02688 |
N, K = list(map(int, input().split()))
snuke = [0] * N
# K 回ループ
for i in range(K):
d = int(eval(input())) # A の要素数
# A をリストとして受け取る
A = list(map(int, input().split()))
for j in range(d):
snuke[A[j] - 1] = 1
ans = 0
for i in range(N):
if snuke[i] == 0:
ans += 1
... | N, K = list(map(int, input().split()))
S = [1] * N
for i in range(K):
d = int(eval(input()))
A = list(map(int, input().split()))
for j in A:
S[j - 1] = 0
print((S.count(1)))
| p02688 |
from collections import Counter
n, k = list(map(int, input().split()))
b = []
for j in range(k):
d = int(eval(input()))
a = list(map(int, input().split()))
for f in a:
b.append(f)
print((n - len(Counter(b)))) | n, k = list(map(int, input().split()))
l = [0] * n
for i in range(k):
d = int(eval(input()))
x = list(map(int, input().split()))
for j in range(d):
l[x[j]-1] += 1
print((l.count(0))) | p02688 |
N, K = list(map(int, input().split()))
has_snack = set()
for i in range(K):
d = int(eval(input()))
A = set(map(int, input().split()))
has_snack |= A
print((N-len(has_snack))) | N, K = list(map(int, input().split()))
has_snack = [False]*N
# has_snack: 1つ以上のお菓子を持っているかどうか
# has_snack[i] = True なら、すぬけ君i+1は1つ以上のお菓子を持っている
for i in range(K):
d = int(eval(input())) # d を読む (使わないけど)
A = list(map(int, input().split())) # A を読む
for v in A: # A の各要素 v について、
has_snack[v-1]... | p02688 |
N, K = list(map(int, input().split()))
has_snack = [False]*N
# has_snack: 1つ以上のお菓子を持っているかどうか
# has_snack[i] = True なら、すぬけ君i+1は1つ以上のお菓子を持っている
for i in range(K):
d = int(eval(input())) # d を読む (使わないけど)
A = list(map(int, input().split())) # A を読む
for v in A: # A の各要素 v について、
has_snack[v-1]... | N, K = list(map(int, input().split()))
# setについての詳細:
# https://docs.python.org/ja/3/library/stdtypes.html#set-types-set-frozenset
has_snack = set() # 1つ以上のお菓子を持っているすぬけ君を入れておくset
for i in range(K):
d = int(eval(input())) # d を読む（使わないけど）
A = set(map(int, input().split())) # A を set として読む
has_sna... | p02688 |
n, k = list(map(int, input().split()))
A = [-1] * n
for i in range(k):
d = int(eval(input()))
a = list(map(int, input().split()))
for j in range(d):
x = a[j]-1
if A[x] == -1:
A[x] = a[j]-1
ans = 0
for i in range(n):
if A[i] == -1:
ans += 1
print(a... | n, k = list(map(int, input().split()))
s = []
for _ in range(k):
d = int(eval(input()))
t = list(map(int, input().split()))
for i in range(len(t)):
s.append(t[i])
l = set(s)
print((n - len(l)))
| p02688 |
n, k = list(map(int, input().split()))
N = [i for i in range(1, n+1)]
ans = []
for i in range(k):
d = int(eval(input()))
a = list(map(int, input().split()))
for j in a:
ans.append(j)
count = 0
for x in N:
if x not in ans:
count += 1
print(count) | n, k = list(map(int, input().split()))
ans = set()
for i in range(k):
d = int(eval(input()))
a = list(map(int, input().split()))
for j in a:
ans.add(j)
print((n-len(ans))) | p02688 |
N, K = list(map(int, input().split()))
n = dict()
for i in range(K):
ds = int(eval(input()))
d = list(map(int, input().split()))
for j in range(ds):
n[d[j] - 1] = 1
print((N - len(n)))
| N, K = list(map(int, input().split()))
n = set()
for i in range(K):
ds = eval(input())
n = n | set(input().split())
print((N - len(n))) | p02688 |
n, k = list(map(int, input().split()))
a = []
d = []
for i in range(k):
d = int(eval(input()))
a += list(map(int, input().split()))
a_set=set(a)
a_set=list(a_set)
print((n-len(a_set))) | n, k = list(map(int, input().split()))
a = []
for i in range(k):
d = int(eval(input()))
a.extend(list(map(int, input().split())))
a_set = set(a)
a_set = list(a_set)
print((n - len(a_set))) | p02688 |
n,k = list(map(int,input().split()))
t = [True for i in range(n)]
for i in range(k):
d = int(eval(input()))
a = list(map(int,input().split()))
for j in range(d):
t[a[j]-1] = False
count = 0
for i in t:
if i:
count+=1
print(count) | n,k = list(map(int,input().split()))
su = [True for i in range(n)]
for i in range(k):
d = int(eval(input()))
a = list(map(int,input().split()))
for j in range(d):
su[a[j]-1] = False
count = 0
for i in range(n):
if su[i]:
count+=1
print(count) | p02688 |
n, k = list(map(int, input().split()))
a = []
for i in range(k):
d = int(eval(input()))
ai = list(map(int, input().split()))
a = a+ai
a = set(a)
ans = 0
for i in range(1, n+1):
if i not in a:
ans += 1
print(ans) | n, k = list(map(int, input().split()))
a = []
for i in range(k):
d = int(eval(input()))
ai = list(map(int, input().split()))
a = a + ai
print((n-len(set(a)))) | p02688 |
n,k=list(map(int,input().split()))
ans=[0]*n
for i in range(k):
d=int(eval(input()))
a=list(map(int,input().split()))
for j in a:
ans[j-1]=1
print((n-sum(ans)))
| N, K = list(map(int, input().split()))
A = set()
for _ in range(K):
d = eval(input())
A = A.union(set(map(int, input().split())))
print((N - len(A))) | p02688 |
N, K = list(map(int,input().split()))
counts = [0 for i in range(N)]
for i in range(K):
d = int(eval(input()))
A = list(map(int,input().split()))
for a in A:
counts[a-1] += 1
print((counts.count(0))) | N, K = list(map(int,input().split()))
counts = [0]*N
for i in range(K):
d = int(eval(input()))
A = list(map(int,input().split()))
for a in A:
counts[a-1] += 1
print((counts.count(0))) | p02688 |
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n,k=list(map(int,input().split()))
c=[False]*n
for i in range(k):
d=int(eval(input()))
A=list(map(int,input().split()))
for j in A:
if c[j-1]==Fals... | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
N,K=list(map(int,input().split()))
S=[0]*N
for i in range(K):
d=int(eval(input()))
A=list(map(int,input().split()))
for i in range(len(A)):
S[A... | p02688 |
from operator import itemgetter
N = int(eval(input()))
a = [tuple(map(int, input().split())) for _ in [0]*N]
ans = float("inf")
a.sort()
for (x1, y1), (x2, y2) in zip(a, a[1:]):
dist = (x1-x2)**2 + (y1-y2)**2
if ans > dist:
ans = dist
a.sort(key=itemgetter(1))
for (x1, y1), (x2, y2) in zip... | import sys
from operator import itemgetter
N = int(eval(input()))
a = sorted(tuple(map(int, l.split())) for l in sys.stdin.readlines())
ans = float("inf")
for (x1, y1), (x2, y2) in zip(a, a[1:]):
dist = (x1-x2)**2 + (y1-y2)**2
if ans > dist:
ans = dist
a.sort(key=itemgetter(1))
for (x1, y1... | p00508 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0585
"""
import sys
from sys import stdin
from collections import namedtuple
input = stdin.readline
def closest_part(points, n):
# ?????¬???p324???
if n <= 1:
return float('inf')
m = n // 2
x ... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0585
"""
import sys
from sys import stdin
from collections import namedtuple
input = stdin.readline
def closest_part(points, n):
# ?????¬???p324???
if n <= 1:
return float('inf')
m = n // 2
x ... | p00508 |
# -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0585
"""
import sys
from sys import stdin
from collections import namedtuple
input = stdin.readline
def closest_part(points, n):
# ?????¬???p324???
if n <= 1:
return float('inf')
m = n // 2
x ... | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=0585
"""
import sys
from sys import stdin
input = stdin.readline
def closest_part(points, n):
# ?????¬???p324???
if n <= 1:
return float('inf')
m = n // 2
x = points[m][0]
d = min(closest_... | p00508 |
n=int(eval(input()))-1
A=list(map(int,input().split()))
i=0
for j in range(n):
if A[j]<=A[-1]:A[i],A[j]=A[j],A[i];i+=1
A[i],A[n]=A[n],A[i]
print((" ".join(map(str,A[:i]))+" ["+str(A[i])+"] "+" ".join(map(str,A[i+1:]))))
| def s():
n=int(eval(input()))-1
A=list(map(int,input().split()))
i=0
for j in range(n):
if A[j]<=A[-1]:A[i],A[j]=A[j],A[i];i+=1
A[i],A[n]=A[n],A[i]
print((" ".join(map(str,A[:i]))+" ["+str(A[i])+"] "+" ".join(map(str,A[i+1:]))))
if'__main__'==__name__:s()
| p02276 |
class Partition:
def partion(self, a, p, r):
x = a[-1]
i = p - 1
for j in range(p, r):
if a[j] <= x:
i += 1
a[i], a[j] = a[j], a[i]
# a[i + 1], a[-1] = a[-1], a[i + 1]
return((a, i))
if __name__ == '__main__':
n = ... | class Partition:
def partion(self, a, p, r):
x = a[r]
i = p - 1
for j in range(p, r):
if a[j] <= x:
i += 1
a[i], a[j] = a[j], a[i]
a[i + 1], a[r] = a[r], a[i + 1]
return(i+1)
if __name__ == '__main__':
n = int(inpu... | p02276 |
def partition(A, p, r):
x = A[r - 1]
i = p - 1
for j in range(p, r-1):
if A[j] <= x:
i += 1
temp = A[i]
A[i] = A[j]
A[j] = temp
temp = A[i+1]
A[i+1] = A[r-1]
A[r-1] = temp
return i
if __name__ == '__main__':
# ... | def partition(A, p, r):
x = A[r]
i = p - 1
for j in range(p, r):
if A[j] <= x:
i += 1
temp = A[i]
A[i] = A[j]
A[j] = temp
temp = A[i+1]
A[i+1] = A[r]
A[r] = temp
return i
if __name__ == '__main__':
# ??????????... | p02276 |
class SegmentTree(object):
def __init__(self, init_array, seg_func=min, seg_func_null=10 ** 9 + 7):
self.seg_func = seg_func
self.seg_func_null = seg_func_null
self.n = 1
while self.n < len(init_array):
self.n *= 2
self.dat = [0] * (2 * self.n - 1)
... | import sys
input = sys.stdin.readline
class SegmentTree(object):
def __init__(self, init_array, seg_func=min, seg_func_null=10 ** 9 + 7):
self.seg_func = seg_func
self.seg_func_null = seg_func_null
self.n = 1
while self.n < len(init_array):
self.n *= 2
... | p02758 |
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True and False
BIG = 10**18
R = 998244353
def ddprint(x):
if DBG:
print(x)
# # # # class Segtree # ... | printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True and False
BIG = 10**18
R = 998244353
def ddprint(x):
if DBG:
print(x)
# # # # class Segtree # ... | p02758 |
from heapq import heappush, heappop
import sys
input = sys.stdin.readline
mod = 998244353
N = int(eval(input()))
XD = [tuple(map(int, input().split())) for _ in range(N)]
XD.sort(key=lambda x : x[0])
children = [[] for _ in range(N)]
pq = []
for i, (x, d) in list(enumerate(XD))[::-1]:
while pq and pq[0]... | import sys
input = sys.stdin.readline
mod = 998244353
N = int(eval(input()))
XD = [tuple(map(int, input().split())) for _ in range(N)]
XD.sort(key=lambda x : x[0])
children = [[] for _ in range(N)]
stack = []
for i, (x, d) in list(enumerate(XD))[::-1]:
while stack and stack[-1][0] < x + d:
y, j ... | p02758 |
import sys
from bisect import bisect_left
MOD = 998244353
input = sys.stdin.readline
class SegmentTree():
def __init__(self, values, merge_func=min, default=float("inf")):
n = len(values)
self.size = 1
self.height = 1
self.default = default
self.merge = merge_... | import sys
from bisect import bisect_left
MOD = 998244353
input = sys.stdin.readline
class SegmentTree():
def __init__(self, values, merge_func=min, default=float("inf")):
n = len(values)
self.size = 1
self.default = default
self.merge = merge_func
while self.... | p02758 |
class SegmentTreeMax():
def __init__(self,n,init):
self.offset=2**((n-1).bit_length())
self.tree=[init]*(2*self.offset)
self.init=init
def update(self,pos,val):
pos+=self.offset
self.tree[pos]=val
while pos>1:
pos=pos//2
self.tree[pos]=max(self.tree[2*pos],self.tree[2*p... | class SegmentTreeMax():
def __init__(self,n,init):
self.offset=2**((n-1).bit_length())
self.tree=[init]*(2*self.offset)
self.init=init
def update(self,pos,val):
pos+=self.offset
self.tree[pos]=val
while pos>1:
pos=pos//2
self.tree[pos]=max(self.tree[2*pos],self.tree[2*p... | p02758 |
from bisect import bisect_left, bisect_right
MOD = 998244353
class SegmentTree:
def __init__(self, n, func=lambda x, y: min(x, y), ide=float("inf")):
self.n = 2 ** (n-1).bit_length()
self.data = [ide] * (self.n*2)
self.func, self.ide = func, ide
def build(self, data):
... | import sys
from bisect import bisect_left, bisect_right
input = lambda: sys.stdin.readline()
MOD = 998244353
class SegmentTree:
def __init__(self, n, func=lambda x, y: min(x, y), ide=float("inf")):
self.n = 2 ** (n-1).bit_length()
self.data = [ide] * (self.n*2)
self.func, self.ide ... | p02758 |
mod = 998244353
n = 0
x = []
d = []
def search(s):
lo = 0
hi = n - 1
while lo <= hi:
mid = (lo + hi) // 2
if s > x[mid]:
lo = mid + 1
elif s < x[mid]:
hi = mid - 1
else:
return mid
return max(lo, hi)
if __name__ ... | mod = 998244353
n = 0
x = []
d = []
def search(s):
lo = 0
hi = n - 1
while lo <= hi:
mid = (lo + hi) // 2
if s > x[mid]:
lo = mid + 1
elif s < x[mid]:
hi = mid - 1
else:
return mid
return max(lo, hi)
if __name__ ... | p02758 |
def main():
from bisect import bisect_left
import sys
input = sys.stdin.readline
N = int(eval(input()))
MOD = 998244353
X = []
X_append = X.append
dic = dict() #Xから動ける先の場所
for _ in range(N):
x, d = list(map(int, input().split()))
X_append(x)
... | def main():
from bisect import bisect_left
import sys
input = sys.stdin.readline
N = int(eval(input()))
MOD = 998244353
X = []
X_append = X.append
dic = dict() #Xから動ける先の場所
for _ in range(N):
x, d = list(map(int, input().split()))
X_append(x)
... | p02758 |
from bisect import bisect_left, bisect_right
import sys
input = sys.stdin.readline
def solve():
MOD = 998244353
INF = float('inf')
N = int(eval(input()))
XDs = [tuple(map(int, input().split())) for _ in range(N)] + [(10**12, 0)]
XDs.sort()
Xs = [X for X, D in XDs]
def max2(... | import sys
input = sys.stdin.readline
def solve():
MOD = 998244353
N = int(eval(input()))
XDs = [tuple(map(int, input().split())) for _ in range(N)] + [(10**12, 0)]
XDs.sort()
Xs = [X for X, D in XDs]
stack = [N]
dp = [0] * (N+1)
dp[-1] = 1
for i in reversed(list(r... | p02758 |
from bisect import bisect
from itertools import accumulate
from functools import reduce
from sys import setrecursionlimit
setrecursionlimit(10000000)
MOD = 998244353
def solve(robots):
N = len(robots)
robots.sort()
parent = [None]*(N+1)
stack = [(float('inf'),0)]
for i,(x,d) in ... | from bisect import bisect
from itertools import accumulate
from functools import reduce
from sys import setrecursionlimit
setrecursionlimit(10000000)
MOD = 998244353
def solve(robots):
N = len(robots)
robots.sort()
parent = [None]*(N+1)
stack = [(float('inf'),0)]
for i,(x,d) in ... | p02758 |
import sys
from bisect import bisect_left
from operator import itemgetter
class SegTreeMax:
"""
以下のクエリを処理する
1.update: i番目の値をxに更新する
2.get_min: 区間[l, r)の最小値を得る
"""
def __init__(self, n, INF):
"""
:param n: 要素数
:param INF: 初期値（入りうる要素より十分に大きな数）
"""... | import sys
from operator import itemgetter
n, *xd = list(map(int, sys.stdin.buffer.read().split()))
MOD = 998244353
xd = sorted(zip(xd[0::2], xd[1::2]))
xxx = list(map(itemgetter(0), xd)) + [10 ** 10]
ans = [0] * n + [1]
stack = [n]
for i in range(n - 1, -1, -1):
x, d = xd[i]
r = x + d
while ... | p02758 |
from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): r... | from heapq import *
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): r... | p02758 |
import bisect
import operator
import os
import sys
from functools import reduce
class SegmentTree:
# http://codeforces.com/blog/entry/18051
def __init__(self, values, op=operator.add):
"""
:param list values:
:param callable op: 結合律を満たす二項演算
"""
self._size ... | import bisect
import operator
import os
import sys
from functools import reduce
class SegmentTree:
# http://codeforces.com/blog/entry/18051
def __init__(self, values, op=operator.add):
"""
:param list values:
:param callable op: 結合律を満たす二項演算
"""
self._size ... | p02758 |
import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 998244353
input = lambda:sys.stdin.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
# A : array of monoid (M, dot, unit)
# (S, compose, identity) : sub monoid of End... | import sys
sys.setrecursionlimit(2147483647)
INF = 1 << 60
MOD = 998244353
input = lambda:sys.stdin.readline().rstrip()
class SegmentTree(object):
def __init__(self, A, dot, unit):
n = 1 << (len(A) - 1).bit_length()
tree = [unit] * (2 * n)
for i, v in enumerate(A):
tr... | p02758 |
import sys
INF = 1 << 60
MOD = 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
# A : array of monoid (M, dot, unit)
# (S, compose, identity) : sub monoid of End(M... | import sys
INF = 1 << 60
MOD = 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.buffer.readline().rstrip()
class LazySegmentTree(object):
def __init__(self, A, dot, unit, compose, identity, act):
# A : array of monoid (M, dot, unit)
# (S, compose, identity) : sub monoid o... | p02758 |
import sys
input=sys.stdin.readline
sys.setrecursionlimit(1000000)
N=int(eval(input()))
robot=[]
for i in range(N):
x,d=list(map(int,input().split()))
robot.append((x,d))
mod=998244353
robot.sort()
move=[i for i in range(0,N)]
for i in range(0,N):
x,d=robot[i]
start=i
end=N-1
... | import sys
input=sys.stdin.readline
N=int(eval(input()))
robot=[]
for i in range(N):
x,d=list(map(int,input().split()))
robot.append((x,d))
mod=998244353
robot.sort()
move=[i for i in range(0,N)]
for i in range(0,N):
x,d=robot[i]
start=i
end=N-1
while end-start>1:
te... | p02758 |
from bisect import bisect_left
from heapq import heappush, heappop
N = int(eval(input()))
XD = [[int(i) for i in input().split()] for _ in range(N)]
mod = 998244353
XD.sort()
class SegTree:
def __init__(self, n, v, f) :
i = 1
while i < n :
i <<= 1
self.n = i
self.v = v
... | from bisect import bisect_left
N = int(eval(input()))
XD = [[int(i) for i in input().split()] for _ in range(N)]
mod = 998244353
XD.sort()
class SegTree:
def __init__(self, n, v, f) :
i = 1
while i < n :
i <<= 1
self.n = i
self.v = v
self.f = f
self.tree = [v] * (i ... | p02758 |
from bisect import bisect_left
N = int(eval(input()))
XD = [[int(i) for i in input().split()] for _ in range(N)]
mod = 998244353
XD.sort()
class SegTree:
def __init__(self, n, v, f) :
i = 1
while i < n :
i <<= 1
self.n = i
self.v = v
self.f = f
self.tree = [v] * (i ... | from bisect import bisect_left
import sys
input = sys.stdin.readline
N = int(eval(input()))
XD = [[int(i) for i in input().split()] for _ in range(N)]
mod = 998244353
XD.sort()
class SegTree:
def __init__(self, n, v, f) :
i = 1
while i < n :
i <<= 1
self.n = i
self.v = v
... | p02758 |
import sys
sys.setrecursionlimit(10 ** 7)
N = int(eval(input()))
XD = [[int(i) for i in input().split()] for _ in range(N)]
XD.sort()
MOD = 998244353
sorted_X = [X for X,_ in XD]
edge = [[] for _ in range(N)]
from bisect import bisect_left
parent = [-1] * N
for i in range(N-1, -1, -1):
idx = bi... | import sys
sys.setrecursionlimit(10 ** 7)
from bisect import bisect_left
N = int(eval(input()))
XD = [[int(i) for i in input().split()] for _ in range(N)]
XD.sort()
MOD = 998244353
sorted_X = [X for X,_ in XD]
edge = [[] for _ in range(N)]
parent = [-1] * N
MAXIDX = N
for i in range(N-1, -1, -1):
... | p02758 |
# 解説放送
# https://atcoder.jp/contests/abc158/submissions/10643692
# dfsの代わりに親の頂点番号を配列で管理する方法
# PyPyでは通った
def main():
from collections import deque, namedtuple
from operator import attrgetter
import sys
input = sys.stdin.readline
MOD = 998244353
Robot = namedtuple('Robot', 'x d rea... | def main():
from collections import deque
from operator import itemgetter
import sys
input = sys.stdin.readline
MOD = 998244353
N = int(eval(input()))
xds = []
xs = []
for _ in range(N):
x, d = list(map(int, input().split()))
xds.append((x, d))
... | p02758 |
import sys
from bisect import bisect, bisect_left
class RMQ(): #range minimum query
def __init__(self, N, V): #create segment tree with initial value V
self.size = 1
while self.size < N:
self.size <<= 1
self.tree = [V] * (2 * self.size - 1)
def update(self, i,... | import sys
from bisect import bisect, bisect_left
class SquareDiv(): #区間の最大値を求める
def __init__(self, N, V):
k = 1
while k ** 2 < N: k += 1
self.array = [V] * k
self.size = k
self.indivisual = [V] * N
def update(self, i, v): #i番目をvに更新する
self.indivisual... | p02758 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.