input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# For taking integer inputs.
def inp():
return(int(eval(input())))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings... | # For taking integer inputs.
def inp():
return(int(eval(input())))
# For taking List inputs.
def inlist():
return(list(map(int, input().split())))
# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings... | p02911 |
n, k, q = list(map(int, input().split()))
#print(n,k,q)
l = [0] * n
#print(l)
katen = []
my_append = katen.append
for i in range(q):
my_append(int(eval(input())))
#print(katen)
my_pop = l.pop
my_insert = l.insert
for j in katen:
x = my_pop(j-1)
my_insert(j-1, x+1)
#print(l)
for y in rang... | n, k, q = list(map(int, input().split()))
#print(n,k,q)
l = [0] * n
#print(l)
katen = []
my_append = katen.append
for i in range(q):
my_append(int(eval(input())))
#print(katen)
for j in katen:
l[j-1] += 1
#print(l)
for y in range(n):
if l[y] > q-k:
print('Yes')
... | p02911 |
n, k, q = list(map(int, input().split()))
l = [0] * n
katen = []
my_append = katen.append # appendを(間接的に)直接呼び出す
for i in range(q):
my_append(int(eval(input())))
for j in katen: # pop、insertを使わない、使うとTLE！
l[j-1] += 1
for y in range(n):
if l[y] > q-k:
print('Yes')
else:
p... | n, k, q = list(map(int,input().split()))
l = [int(eval(input())) for _ in range(q)]
score = [k-q] * n
for i in l:
score[i-1] += 1
for j in score:
if j > 0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q = list(map(int,input().split()))
a=[]
for i in range(Q):
a.append(int(eval(input())))
for i in range(1,N+1):
if a.count(i) >= (Q-K+1):
print("Yes")
else:
print("No") | # coding: utf-8
# Your code here!
N, K, Q = list(map(int,input().split()))
L = [0]*N
for i in range(Q):
a = int(eval(input()))
L[a-1] += 1
for i in range(N):
if Q - L[i] < K:
print('Yes')
else:
print('No') | p02911 |
import sys
readline = sys.stdin.buffer.readline
N, K, Q = list(map(int, readline().split()))
A = []
for a in range(Q):
A.append(int(readline()))
points = [K] * N
for i in range(Q):
for j in range(N):
if A[i] - 1 != j:
points[j] -= 1
for p in points:
print(("Yes" i... | import sys
readline = sys.stdin.buffer.readline
N, K, Q = list(map(int, readline().split()))
A = []
for a in range(Q):
A.append(int(readline()))
points = [0] * N
for i in range(Q):
points[A[i] - 1] += 1
for p in points:
score = K - Q + p
print(("Yes" if score > 0 else "No")) | p02911 |
import sys
input=sys.stdin.readline
N,K,Q=list(map(int,input().split()))
J=[int(eval(input())) for _ in range(Q)]
for i in range(1,N+1):
print(("Yes" if K-Q+J.count(i)>0 else "No"))
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N,K,Q = list(map(int,input().split()))
A = (int(x) for x in sys.stdin.read().split())
score = [K-Q] * (N+1)
for x in A:
score[x] += 1
answer = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(answer) | p02911 |
N,K,Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
P = [K for _ in range(N)]
for i in range(Q):
ans = A[i]
P = list([x-1 for x in P])
P[ans-1] += 1
for i in range(N):
if P[i] > 0:
print('Yes')
else:
print('No') | N,K,Q = list(map(int, input().split()))
P = [0 for _ in range(N)]
for q in range(Q):
num = int(eval(input()))
P[num - 1] += 1
val = K - Q
if val > 0:
for i in range(N):
print('Yes')
else:
standard = abs(val) + 1
for i in range(N):
if P[i] >= standard:
print... | p02911 |
#入力。参加者数N, 初期得点K ,正解数Q
N, K, Q = list(map(int,input().split()))
#入力。正解した人の番号A[i]
A = [None for _ in range(Q)]
for i in range(Q):
A[i] = int(eval(input()))
#初期得点(hp)をリスト化。
hp = [K for _ in range(N)]
#まず他の人への攻撃力at(各人の正解数)を記録。
at = [0 for _ in range(N)]
#正解した人の攻撃力+1。
for i in range(Q):
j = A[i]
at[j-1] ... | #入力。参加者数N, 初期得点K ,正解数Q
N, K, Q = list(map(int,input().split()))
#入力。正解した人の番号A[i]
A = [None for _ in range(Q)]
for i in range(Q):
A[i] = int(eval(input()))
#初期得点(hp)をリスト化。
hp = [K for _ in range(N)]
#まず他の人への攻撃力at(各人の正解数)を記録。
at = [0 for _ in range(N)]
#正解した人の攻撃力+1。
for i in range(Q):
j = A[i]
at[j-1] ... | p02911 |
def minus(n):
return n - 1
n,k,q = list(map(int,input().split()))
a = [0] * q
b = [0] * n
member = [k]*n
for i in range(q):
a[i] = int(eval(input()))
member[a[i]-1] = member[a[i]-1] + 1
member = list(map(minus, member))
for k in range(n):
if member[k] <= 0:
print("No")
... | n,k,q = list(map(int,input().split()))
a = [0] * q
member = [k] * n
for i in range(q):
a[i] = int(eval(input()))
member[a[i]-1] = member[a[i]-1] + 1
for j in range(n):
if member[j] - q <= 0:
print("No")
else:
print("Yes") | p02911 |
# coding: utf-8
# Your code here!
import sys
input = sys.stdin.readline
N,K,Q=list(map(int,input().split()))
A=[int(eval(input()))-1 for i in range(Q)]
for j in range(N):
if K-Q+A.count(j)>0:
print("Yes")
else:
print("No") | N, K, Q = list(map(int, input().split()))
P = [0] * N
for i in range(Q):
tmp = int(eval(input())) - 1
P[tmp] += 1
sumP = sum(P)
for n in range(N):
ans = 'No'
total = sumP - P[n]
if K - total > 0:
ans = 'Yes'
print(ans) | p02911 |
n, k, q = list(map(int, input().split()))
score = [0] * n
for _ in range(q):
i = int(eval(input()))
i -= 1
score[i] += 1
for i in range(n):
print(('Yes' if k > q - score[i] else 'No'))
| n, k, q = list(map(int, input().split()))
score = [k - q] * n
for _ in range(q):
i = int(eval(input()))
i -= 1
score[i] += 1
ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score)
print(ans) | p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
A.append(int(eval(input())))
point = [K] * N
def mainasu(n):
return n-1
for i in range(Q):
point = list(map(mainasu, point))
point[A[i] - 1] += 1
for j in range(N):
if point[j] > 0:
print('Yes')
else... | N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
A.append(int(eval(input())))
point = [K-Q] * N
for i in range(Q):
point[A[i] - 1] += 1
for j in range(N):
if point[j] > 0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q = list(map(int, input().split()))
#A = [K] * N
A = [0] * N
for i in range(Q):
a = int(eval(input()))
A[a-1] += 1
sum(A)
for j in range(N):
if K - (sum(A)-A[j]) > 0:
print("Yes")
else:
print("No")
| N,K,Q = list(map(int, input().split()))
#A = [K] * N
A = [0] * N
for i in range(Q):
a = int(eval(input()))
A[a-1] += 1
sm = sum(A)
for j in range(N):
if K - (sm-A[j]) > 0:
print("Yes")
else:
print("No")
| p02911 |
n, k, q = list(map(int, input().split()))
a = [eval(input()) for i in range(q)]
point = []
one = []
ans = []
for j in range(n):
point.append(k)
one.append(1)
for x in range(q):
point = [p-o for (p,o) in zip(point, one)]
point[int(a[x])-1] += 1
for y in range(n):
if point[y] <= 0:
a... | n, k, q = list(map(int, input().split()))
a = [eval(input()) for i in range(q)]
point = []
ans = []
for z in range(n):
point.append(0)
for j in range(q):
point[int(a[j])-1] += 1
for x in range(n):
if point[x] > q-k:
ans.append('Yes')
else:
ans.append('No')
print((ans[x])) | p02911 |
N,K,Q = list(map(int,input().split()))
L = [K for n in range(N)]
for i in range(Q):
A = int(eval(input()))
for j in range(N):
if j != A-1:
L[j] -= 1
for j in range(N):
if L[j] > 0:
print("Yes")
else:
print("No") | N,K,Q = list(map(int,input().split()))
L = [0 for n in range(N)]
for i in range(Q):
A = int(eval(input()))
L[A-1] += 1
for j in range(N):
if K - (Q-L[j]) > 0:
print("Yes")
else:
print("No") | p02911 |
#Nは参加人数,Kは初期ポイント、Qはクイズ回数
N ,K ,Q = list(map(int,input().split()))
N_case =[]
i =0
while i <N :
N_case.append(K)
i+=1
j =0
while j <Q :
k =0
a = int(eval(input()))
while k <N:
N_case[k] -=1
k+=1
N_case[a-1] +=1
j +=1
for n in N_case:
if n>0:
print('Yes')
else:
... | #Nは参加人数,Kは初期ポイント、Qはクイズ回数
N ,K ,Q = list(map(int,input().split()))
N_case =[]
i =0
while i <N :
N_case.append(K-Q)
i+=1
j =0
while j <Q :
a = int(eval(input()))
N_case[a-1] +=1
j +=1
for n in N_case:
if n>0:
print('Yes')
else:
print('No')
| p02911 |
N, K, Q = [ int(n) for n in input().split() ]
A = []
for _ in range(Q):
A.append(int(eval(input()))-1)
Points = [ K for _ in range(N) ]
for a in A:
for i in range(0,a):
Points[i] -= 1
for i in range(a+1,N):
Points[i] -= 1
for i in range(N):
if Points[i] > 0:
... | N, K, Q = [ int(n) for n in input().split() ]
A = []
for _ in range(Q):
A.append( int(eval(input()))-1 )
Points = [ K-Q for _ in range(N) ]
for a in A:
Points[a] += 1
for i in range(N):
if Points[i] > 0:
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
a = []
for _ in range(q):
a.append(int(eval(input())))
for i in range(n):
num = 0
for cp in a:
if cp == i + 1:
num += 1
if k <= q - num:
print("No")
else:
print("Yes") | n, k, q = list(map(int, input().split()))
a = [0] * n
for _ in range(q):
a[int(eval(input())) - 1] += 1
for i in range(n):
if k - (q - a[i]) > 0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q = list(map(int,input().split()))
Answer_list = list()
point_list = [K] *N
for i in range(0,Q):
Answer_list.append(int(eval(input())))
for j in Answer_list:
for k in range(0,N):
if k != j-1:
point_list[k] -= 1
for l in point_list:
if l <= 0:
print("No")
... | N,K,Q = list(map(int,input().split()))
Answer_list = list()
point_list = [0] *N
for i in range(0,Q):
Answer_list.append(int(eval(input())))
for j in Answer_list:
point_list[j-1] += 1
for l in point_list:
if Q - l >= K:
print("No")
else:
print("Yes")
| p02911 |
def maina(n):
return n-1
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
score = [int(K) for __ in range(N)]
for i in range(Q):
score = list(map(maina, score))
score[A[i]-1] = score[A[i]-1]+1
for k in range(N):
if score[k] <= 0:
print("No")
... | n, k, q = list(map(int, input().split()))
p = k-q
l = [p]*n
for i in range(q):
a = int(eval(input()))
l[a-1] += 1
for k in range(n):
print(("Yes" if l[k]>0 else "No")) | p02911 |
n, k, q = list(map(int, input().split()))
p = [k]*n
loser = 0
for i in range(1, q+1):
p = list([x-1 for x in p])
p[int(eval(input()))-1] += 1
for i in range(0, n):
if p[i] >= 1:
print('Yes')
else:
print('No')
| n, k, q = list(map(int, input().split()))
p = [-q+k]*n
for i in range(0, q):
p[int(eval(input()))-1] += 1
for i in range(0, n):
if p[i] > 0:
print('Yes')
else:
print('No')
| p02911 |
n, k, q = list(map(int, input().split()))
points = [k] * n
mi = lambda x: x - 1
for _ in range(q):
win = int(eval(input()))
#points = [p-1 for p in points]
points = list(map(mi, points))
points[win-1] += 1
for i in points:
if i >= 1:
print('Yes')
else:
print('No... | n, k, q = list(map(int, input().split()))
points = [k] * n
for _ in range(q):
win = int(eval(input()))
points[win-1] += 1
points = [p-q for p in points]
for i in points:
if i >= 1:
print('Yes')
else:
print('No')
| p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for q in range(Q):
A.append(int(eval(input())))
score = [K - Q] * (N + 1)
for a in A:
score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans) | import sys
N, K, Q = list(map(int, input().split()))
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * (N + 1)
for a in A:
score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans) | p02911 |
import sys
N, K, Q = list(map(int, input().split()))
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * N
for a in A:
score[a - 1] += 1
for s in score:
print(('Yes' if s > 0 else 'No')) | import sys
N, K, Q = list(map(int, input().split()))
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * (N + 1)
for a in A:
score[a] += 1
print(("\n".join('Yes' if s > 0 else 'No' for s in score[1:]))) | p02911 |
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []
SCORE = [K] * N
for i in range(Q):
XX = [x - 1 for x in SCORE]
SCORE = list(XX)
SCORE[int(eval(input()))-1] += 1
for i in range(N):
if(SCORE[i]<1):
print("No")
else:
print("Yes") | ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []
SCORE = [0] * N
for i in range(Q):
SCORE[int(eval(input()))-1] += 1
for i in range(N):
if(SCORE[i]<= Q-K):
print("No")
else:
print("Yes") | p02911 |
n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
P = [k for _ in range(n)]
for i in range(q):
for j in range(n):
if (A[i] - 1) != j:
P[j] -= 1
for i in range(n):
print(("Yes" if P[i] > 0 else "No")) | n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
P = [k - q] * n
for i in range(q):
P[A[i] - 1] += 1
for i in range(n):
print(("Yes" if P[i] > 0 else "No")) | p02911 |
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(Q)]
Pt=[K]*N
for i in range(Q):
Pt=[k-1 for k in Pt]
Pt[A[i]-1]=Pt[A[i]-1]+1
for j in range(N):
print(("No" if Pt[j]<=0 else "Yes")) | N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(Q)]
Pt=[K-Q]*N
for i in range(Q):
Pt[A[i]-1]=Pt[A[i]-1]+1
for j in range(N):
print(("No" if Pt[j]<=0 else "Yes")) | p02911 |
n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
ans = [k for _ in range(n)]
for i in range(q):
ans[a[i]-1] += 1
for j in range(n):
ans[j] -= 1
for i in range(n):
if ans[i] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
ans = [0 for _ in range(n)]
for i in range(q):
ans[a[i]-1] += 1
for i in range(n):
if q-ans[i] < k:
print("Yes")
else:
print("No") | p02911 |
N,K,Q=list(map(int,input().split()))
A=[K]*N
for q in range(Q):
win=int(eval(input()))
for i in range(N):
if i!=win-1:
A[i]-=1
def hantei(x):
if x >0:
return('Yes')
else:
return('No')
for answer in map(hantei,A):
print(answer) | N,K,Q=list(map(int,input().split()))
A=[0]*N
for i in range(Q):
A[int(eval(input()))-1]+=1
for j in range(N):
if K-Q+A[j]>0:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int,input().split()))
list_a = [k-q]*n
#b_list = list(map(int,input().split()))
#print(" ".join(map(str,c_list)))
for i in range(q):
a = int(eval(input()))
list_a[a-1] += 1
for i in range(n):
if list_a[i] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
# a=[int(input()) for i in range(q)]
ans=[k-q]*n
for i in range(q):
ans[int(eval(input()))-1] += 1
# print(ans)
for i in ans:
if i>0:
print("Yes")
else:
print("No") | p02911 |
n,k,q = list(map(int,input().split()))
#a = [ int(input()) for i in range(q)]
h = [k]*n
for i in range(q):
a = int(eval(input()))
h = [ h[i] - 1 for i in range(n)]
h[a-1] += 1
for i in range(n):
if h[i] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
h = [k]*n
for i in range(q):
a = int(eval(input()))
h[a-1] += 1
h = [ h[i] - q for i in range(n)]
for i in range(n):
if h[i] > 0:
print("Yes")
else:
print("No") | p02911 |
n,k,q = (int(i) for i in input().split())
a = []
for i in range(q):
a.append(int(eval(input())))
score = [k for _ in range(n)]
for i in range(len(a)):
clear_num = a[i]-1
for j in range(n):
if j != clear_num:
score[j] += -1
for j in range(n):
if score[j] > 0:
... | n,k,q = (int(i) for i in input().split())
a = []
for i in range(q):
a.append(int(eval(input())))
score = [0 for _ in range(n)]
for i in range(len(a)):
clear_num = a[i]-1
score[clear_num] += 1
for j in range(n):
if k + score[j] - q > 0:
print('Yes')
else:
print('... | p02911 |
n,k,q=list(map(int, input().split()))
a=list(int(eval(input())) for _ in range(q))
for i in range(n):
if k-(q-a.count(i+1)) > 0:
print("Yes")
else:
print("No")
| n,k,q=list(map(int, input().split()))
a=[0]*n
for _ in range(q):
a[int(eval(input()))-1]+=1
for i in range(n):
if k-(q-a[i]) > 0:
print("Yes")
else:
print("No")
| p02911 |
n,k,q=list(map(int, input().split()))
a=[0]*n
for _ in range(q):
a[int(eval(input()))-1]+=1
for i in range(n):
if k-(q-a[i]) > 0:
print("Yes")
else:
print("No")
| n, k, q = list(map(int, input().split()))
p = [0]*n
for _ in range(q):
p[int(eval(input()))-1] += 1
for _p in p:
if k-(q-_p) > 0:
print("Yes")
else:
print("No")
| p02911 |
n, k, q = list(map(int, input().split()))
a = [0]*q
for i in range(q):
a[i] = int(eval(input()))
for i in range(n):
if a.count(i+1) > q-k :
print("Yes")
else:
print("No") | N, K, Q = list(map(int, input().split()))
A = [0]*N
for i in range(Q):
a = int(eval(input()))
A[a-1]+=1
for j in range(N):
if A[j] > Q-K :
print("Yes")
else:
print("No")
| p02911 |
n, k, q = list(map(int, input().split()))
point = [k-q] * n
for i in range(q):
a = int(eval(input()))
point[a-1] = point[a-1] + 1
ans = '\n'.join('Yes' if i > 0 else 'No' for i in point[0:])
print(ans) | n, k, q = list(map(int, input().split()))
point = [k-q for _ in range(n)]
for i in range(q):
a = int(eval(input()))
point[a-1] = point[a-1] + 1
ans = '\n'.join('Yes' if i > 0 else 'No' for i in point[0:])
print(ans) | p02911 |
n,k,q=list(map(int,input().split()))
a=[]
[a.append(int(eval(input()))-1) for _ in range(q)]
i=[k]*n
for l in range(q):
i = list([x-1 for x in i])
i[a[l]] += 1
for l in range(n):
if i[l] <= 0:
print("No")
else:
print("Yes") | n,k,q=list(map(int,input().split()))
a=[]
[a.append(int(eval(input()))-1) for _ in range(q)]
i=[k-q]*n
for l in range(q):
i[a[l]] += 1
for l in range(n):
if i[l] <= 0:
print("No")
else:
print("Yes")
| p02911 |
def slove():
import sys
import bisect
import collections
import fractions
import heapq
input = sys.stdin.readline
n, k, q = list(map(int, input().rstrip('\n').split()))
a = [int(input().rstrip('\n')) for _ in range(q)]
ls = [k-q] * n
for v in a:
ls[v-1] += 1
... | import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, k, q = list(map(int, input().rstrip('\n').split()))
a = [int(input().rstrip('\n')) for _ in range(q)]
ls = [0] * n
for v in a:
ls[v-1] += 1
for i in range(n):
if q - ls[i] < k:
... | p02911 |
N, K, Q = list(map(int,input().split()))
A = []
for i in range(Q):
A.append(int(eval(input()))-1)
for i in range(N):
if A.count(i) >= Q - K + 1:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int,input().split()))
A = []
for i in range(Q):
A.append(int(eval(input()))-1)
count = [0 for i in range(N)]
for i in A:
count[i] += 1
for i in range(N):
if count[i] >= Q - K + 1:
print("Yes")
else:
print("No") | p02911 |
n,k,q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(q)]
ANS = [k - q] * n
for i in range(n):
if ANS[i] + A.count(i+1) > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(q)]
S = [k] * n
for i in range(q):
S[A[i]-1] += 1
ANS = [S[i]- q for i in range(n)]
for i in range(n):
if ANS[i] <= 0:
print("No")
else:
print("Yes") | p02911 |
N,K,Q = list(map(int,input().split()))
P = N*[K-Q]
for q in range(Q):
a = int(eval(input()))
P[a-1]+=1
for n in range(N):
if P[n]<=0:
print("No")
else:
print("Yes") | N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for q in range(Q)]
P = N*[K-Q]
for a in A:
P[a-1]+=1
for n in range(N):
if P[n]<=0:
print("No")
else:
print("Yes") | p02911 |
x = list(map(int,input().split()))
n=x[0]
k=x[1]
q=x[2]
a=[]
for i in range(q):
y=int(input())
a.append(y-1)
for i in range(n):
if k-q+a.count(i)>0:
print("Yes")
else:
print("No")
| x = list(map(int,input().split()))
n=x[0]
k=x[1]
q=x[2]
z=[k-q]*n
for i in range(q):
y=int(input())
z[y-1]=z[y-1]+1
for i in range(n):
if z[i]>0:
print("Yes")
else:
print("No")
| p02911 |
import sys
input = sys.stdin.readline
n,k,q = list(map(int,input().split()))
l = [int(eval(input())) for _ in range(q)]
l.sort()
ll = set(l)
l2 = []
for _ in ll:
l2.append(l.count(_))
lll = list(ll)
for _ in range(1,n+1):
if _ in lll:
if k - q + l2[lll.index(_)] > 0:
print('Yes')
else:
... | n,k,q = list(map(int,input().split()))
a = [k-q]*n
for i in range(q):
a[int(eval(input()))-1] += 1
for i in a:
print(('Yes' if i>0 else 'No')) | p02911 |
N,K,Q=list(map(int,input().split()))
list_seikaisha =[]
for i in range(Q):
list_seikaisha.append(int(eval(input()))-1)
list_pt=[K for i in range(N)]
for seikaisha in list_seikaisha:
list_pt=[x-1 for x in list_pt]
list_pt[seikaisha]=list_pt[seikaisha]+1
list_YN=[]
f=lambda pt:"Yes" if pt>=... | N,K,Q=list(map(int,input().split()))
list_seikaisha =[]
for i in range(Q):
list_seikaisha.append(int(eval(input()))-1)
list_pt=[K for i in range(N)]
for seikaisha in list_seikaisha:
list_pt[seikaisha]=list_pt[seikaisha]+1
list_pt=[x-Q for x in list_pt]
list_YN=[]
f=lambda pt:"Yes" if pt>=1 el... | p02911 |
n,k,q = list(map(int,input().split()))
ans_list =[]
point = []
for i in range(n):
point.append(k)
#print(point)
for j in range(q):
ans_list.append(input().rstrip())
#print(ans_list)
for k in ans_list:
for l in range(n):
if l != int(k)-1:
point[l] -=1
for m in point:
if m>0:
print("Y... | n,k,q = list(map(int,input().split()))
ans_list =[]
point = []
for i in range(n):
point.append(k)
#print(point)
for j in range(q):
ans_list.append(int(eval(input())))
#print(ans_list)
for k in ans_list:
point[k-1] += 1
#print(point)
for l in range(n):
point[l] -= q
if point[l]>0:
prin... | p02911 |
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
m = [k] * n
for c in a :
for e in range(n) :
if(not(c-1 == e)) :
m[e] -= 1
for j in range(n) :
if(m[j] > 0) :
print('Yes')
else :
print('No') | n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
m = [k-q] * n
for c in a :
m[c-1] += 1
for j in range(n) :
if(m[j] > 0) :
print('Yes')
else :
print('No') | p02911 |
N,K,Q=list(map(int,input().split()))
c=[K-Q]*N
for i in range(Q):
A=int(eval(input()))-1
for r in range(N):
if r==A:
c[r]+=1
for k in range(N):
if c[k]>0:
c[k]='Yes'
else:
c[k]='No'
for j in range(N):
print((c[j]))
| N,K,Q=list(map(int,input().split()))
c=[K-Q]*N
for i in range(Q):
A=int(eval(input()))-1
c[A]+=1
for k in range(N):
if c[k]>0:
c[k]='Yes'
else:
c[k]='No'
for j in range(N):
print((c[j]))
| p02911 |
# -*- coding: utf-8 -*-
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
if k > q:
for i in range(n):
print('Yes')
elif k == q:
for j in range(1, n+1):
if j in a:
print('Yes')
else:
print('No')
else:
border = ... | # -*- coding: utf-8 -*-
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
if k > q:
for i in range(n):
print('Yes')
else:
ans = [k-q] * n
for j in a:
ans[j-1] += 1
for h in range(n):
if ans[h] <= 0:
print('No')
... | p02911 |
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for x in range(Q)]
for i in range(N):
z = 0
for j in range(Q):
if A[j] == i + 1:
z += 1
if z > Q - K:
print('Yes')
else:
print('No')
| N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for x in range(Q)]
ans = [K - Q] * N
for j in range(Q):
ans[A[j] - 1] += 1
for i in range(N):
print(('Yes' if ans[i] > 0 else 'No')) | p02911 |
n,k,q=(int(x) for x in input().split())
a=[]
for i in range(q):
a.append(int(eval(input())))
p=[0]*n
for i in range(k):
for j in range(n):
p[j]+=1
for i in range(n):
for j in range(q):
p[i]-=1
if a[j]-1 == i:
p[i]+=1
for i in range(n):
if p[i]>0:
... | n,k,q=(int(x) for x in input().split())
a=[]
for i in range(q):
a.append(int(eval(input())))
p=[k-q]*n
for i in range(q):
p[a[0]-1]+=1
del a[0]
for i in range(n):
if p[i]>0:
print("Yes")
else:
print("No")
| p02911 |
(N, K, Q) = list(map(int, list(input().split())))
A = list(map(int,[eval(input()) for i in range(Q)]))
for y in range(1, N+1):
if K - Q + A.count(y) > 0:
print("Yes")
else:
print("No")
| (N, K, Q) = list(map(int, list(input().split())))
points = []
for x in range(N):
points.append(K-Q)
for y in range(Q):
ansed = int(eval(input())) - 1
points[ansed] += 1
for point in points:
if point > 0:
print("Yes")
else:
print("No")
| p02911 |
n,k,q=list(map(int,input().split()))
a=[]
for _ in range(q):
a.append(int(eval(input())))
for i in range(1,n+1):
if k-(q-a.count(i))>0:
print('Yes')
else:
print('No') | n,k,q=list(map(int,input().split()))
cnt=[0]*n
for _ in range(q):
cnt[int(eval(input()))-1]+=1
for i in range(n):
if k-(q-cnt[i])>0:
print('Yes')
else:
print('No') | p02911 |
n, k, q = [int(x) for x in input().split()]
a = []
for i in range(q):
a.append(int(eval(input())))
a_dict = dict((x, 0) for x in range(1, n + 1))
for i in range(q):
a_dict[a[i]] += 1
for i in range(n):
tmp = k - (q - a_dict[i + 1])
if tmp > 0:
ans = 'Yes'
else:
ans = ... | n, k, q = [int(x) for x in input().split()]
a = []
for i in range(q):
a.append(int(eval(input())))
n_list = [k - q for i in range(n)]
for i in range(q):
n_list[a[i] - 1] += 1
for i in range(n):
if n_list[i] > 0:
ans = 'Yes'
else:
ans = 'No'
print(ans) | p02911 |
from sys import stdin
from collections import Counter
lines = stdin.readlines()
N, K, Q = list(map(int, lines[0].split()))
ans = [0] * N
A = Counter((int(i) - 1 for i in lines[1:]))
for k in list(A.keys()):
ans[k] += A[k]
print(("\n".join(("Yes" if Q < K + a
else "No" for a in ans))))
| from sys import stdin
from collections import Counter
lines = stdin.readlines()
N, K, Q = list(map(int, lines[0].split()))
ans = [0] * N
A = Counter([int(i) - 1 for i in lines[1:]])
for k in list(A.keys()):
ans[k] += A[k]
print(("\n".join(["Yes" if Q < K + a
else "No" for a in ans])))
| p02911 |
from collections import Counter
from sys import stdin
def main():
lines = stdin.readlines()
N, K, Q = list(map(int, lines[0].split()))
A = Counter([int(i) - 1 for i in lines[1:]])
print(("\n".join(["Yes" if Q < K + A[i] else "No" for i in range(0, N)])))
return
main()
| from collections import Counter
def main():
N, K, Q, *A = list(map(int, open(0).read().split()))
A = Counter(A)
print(("\n".join(["Yes" if Q < K + A[i]
else "No" for i in range(1, N + 1)])))
return
main()
| p02911 |
##C
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
b = [k]*n
for i in range(q):
b[a[i]-1] += 1
for j in range(n):
b[j] += -1
for i in b:
if i >= 1:
print("Yes")
else:
print("No") | ##C
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
b = [k]*n
for j in range(n):
b[j] += -q
for i in range(q):
b[a[i]-1] += 1
for i in b:
if i >= 1:
print("Yes")
else:
print("No") | p02911 |
list1=input().split(' ')
N=int(list1[0])
K=int(list1[1])
Q=int(list1[2])
listQ=[]
for i in range(Q):
listQ.append(int(eval(input())))
listScores=[K for i in range(N)]
for i in listQ:
listScores=[x-1 for x in listScores]
listScores[i-1]=listScores[i-1]+1
for i in listScores:
if i>0:
... | list1=input().split(' ')
N=int(list1[0])
K=int(list1[1])
Q=int(list1[2])
listQ=[]
for i in range(Q):
listQ.append(int(eval(input())))
listScores=[K for i in range(N)]
sum=0
for i in listQ:
sum=sum+1
listScores[i-1]=listScores[i-1]+1
for i in listScores:
i=i-sum
if i>0:
print('... | p02911 |
n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
if k>q:
for i in range(n):
print('Yes')
else:
for i in range(1,n+1):
print(('Yes' if k-len(a)+a.count(i)>0 else 'No')) | n,k,q = list(map(int, input().split()))
ans = [0]*n
for i in range(q):
w = int(eval(input()))
ans[w-1]+=1
for i in range(n):
print(('Yes' if ans[i]>=q-k+1 else 'No')) | p02911 |
n,k,q = list(map(int, input().split()))
al = [int(eval(input())) for i in range(q)]
for i in range(n):
print(('Yes' if k-(q-al.count(i+1))>0 else 'No')) | n,k,q = list(map(int, input().split()))
al = [0]*n
for i in range(q):
al[int(eval(input()))-1]+=1
for i in al:
print(('Yes' if k-q+i>0 else 'No')) | p02911 |
# N:人数, K:初期ポイント, Q:クイズ数
N, K, Q = list(map(int,input().split()))
points = [K] * N
def not_ans(li):
return li -1
for i in range(Q):
anser = int(eval(input()))-1
points = list(map(not_ans,points))
points[anser] += 1
for y in range(N):
if points[y] < 1:
print('No')
el... | # N:人数, K:初期ポイント, Q:クイズ数
N, K, Q = list(map(int,input().split()))
s = K-Q
points = [s] * N
for _ in range(Q):
ans = int(eval(input()))
points[ans-1] += 1
for p in points:
print(('Yes' if p>0 else 'No')) | p02911 |
m = list(map(int,input().split()))
a=[int(eval(input())) for i in range(m[2])]
n = [0] * m[0]
b=list(set(a))
for i in range(len(b)):
n[b[i]-1] = a.count(b[i])
for i in range(m[0]):
if n[i] - m[2] + m[1] > 0:
print('Yes')
else:
print('No') | m = list(map(int,input().split()))
n = [0] * m[0]
for i in range(m[2]):
n[int(eval(input()))-1] += 1
for i in range(m[0]):
if n[i] - m[2] + m[1] > 0:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int,input().split()))
ans = [k]*n
for i in range(q):
idx = int(eval(input())) - 1
for i in range(n):
if idx != i:
ans[i] -= 1
for i in ans:
print(('Yes' if i >0 else 'No')) | n,k,q = list(map(int,input().split()))
ans = [0]*n
for i in range(q):
idx = int(eval(input())) -1
ans[idx] += 1
for i in ans:
print(('Yes' if q-k<i else 'No')) | p02911 |
import sys
import math
from collections import Counter
import itertools
import fractions
#from functools import reduce
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したも... | import sys
import math
from collections import Counter
import itertools
import fractions
#from functools import reduce
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したも... | p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
A.append(eval(input()))
points = [K] * N
for correct in A:
for i in range(N):
if i != int(correct) - 1:
points[i] -= 1
for p in points:
if p > 0:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
answer_count = [0] * N
for i in range(Q):
answer_count[int(eval(input()))-1] += 1
for a in answer_count:
if K - (Q - a) > 0:
print("Yes")
else:
print("No")
| p02911 |
n, k, q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(q)]
B = [k] * n
for i in A:
B[i-1] = B[i-1] + 1
for j in range(n):
B[j] = B[j] - 1
for k in range(n):
if B[k] > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(q)]
B = [k] * n
for i in A:
B[i-1] = B[i-1] + 1
for k in range(n):
if B[k]-q > 0:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int, list(input().split())))
point=[k]*n
a=[]
for i in range(q):
point = list([x-1 for x in point])
a.append(int(eval(input())))
point[a[i]-1]+=1
max=max(point)
for i in range(n):
if point[i]==max or point[i]>0:
print("Yes")
else:
print("No") | n,k,q = list(map(int, list(input().split())))
point=[k]*n
a=[]
for i in range(q):
a.append(int(eval(input())))
point[a[i]-1]+=1
for i in range(n):
if point[i]-q>0:
print("Yes")
else:
print("No")
| p02911 |
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(q)]
ans = [k] * n
for i in range(q):
for j in range(n):
if a[i]-1 != j :
ans[j] -= 1
for anss in ans:
print(("Yes" if anss > 0 else "No")) | n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(q)]
ans = [0] * n
for i in range(q):
ans[a[i]-1] += 1
for anss in ans:
print(("Yes" if k - q + anss > 0 else "No")) | p02911 |
num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])
tmp = [init_point]*participant
for i in range(correct):
answer_person = int(eval(input()))
tmp[answer_person-1] += 1
tmp = [i-1 for i in tmp]
for item in tmp:
if item>0: print("Yes")
else: print("... | import sys
num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])
tmp = [0]*participant
for i in range(correct):
answer_person = int(eval(input()))-1
tmp[answer_person] += 1
for i in tmp:
if i<=correct-init_point:
print("No")
else:
print("Yes"... | p02911 |
import sys
info = input().split(" ")
N = int(info[0])
K = int(info[1])
Q = int(info[2])
point = [K]*N
for i in range(1, Q+1):
person = int(eval(input()))
for n in range(N):
if person != n+1:
point[n] = point[n] - 1
for p in point:
if p <= 0:
print("No")
else:
... | import sys
info = input().split(" ")
N = int(info[0])
K = int(info[1])
Q = int(info[2])
ns = []
for i in range(N):
ns.append(K - Q)
for i in range(Q):
s = int(eval(input()))
s = s - 1
ns[s] = ns[s] + 1
for p in ns:
if p <= 0:
print("No")
else:
print("Yes")
| p02911 |
N, K, Q = list(map(int, input().split()))
A_list = [int(eval(input())) for i in range(Q)]
ori = K - Q
for n in range(1, N + 1):
n_count = A_list.count(n)
if n_count == 0:
if ori > 0:
print('Yes')
else:
print('No')
else:
if ori + n_count > 0:
... | N, K, Q = list(map(int, input().split()))
index_list = [int(eval(input())) - 1 for i in range(Q)]
zero_list = [0 for n in range(N)]
ori = K - Q
for i in range(Q):
zero_list[index_list[i]] += 1
for i in range(N):
zero_list[i] += ori
for i in range(N):
if zero_list[i] > 0:
print('Yes')
... | p02911 |
import collections
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
c = collections.Counter(A)
if (K - Q) > 0:
for _ in range(N):
print('Yes')
else:
l = []
for i,v in list(dict(c).items()):
if v >(Q - K):
l.append(i-1)
l.sort()... | import collections
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
c = collections.Counter(A)
if (K - Q) > 0:
for _ in range(N):
print('Yes')
else:
l = ['No'] * N
for i,v in list(dict(c).items()):
if v >(Q - K):
l[i-1] = 'Yes'
... | p02911 |
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
for i in range(1,N+1):
plus = A.count(i)
if K - (Q-plus) <= 0:
print("No")
else:
print("Yes")
| N,K,Q = list(map(int,input().split()))
minas = [-Q]*N
A = [int(eval(input())) for _ in range(Q)]
for i in A:
minas[i-1] += 1
for i in minas:
if K + i<= 0:
print("No")
else:
print("Yes")
| p02911 |
n, k, q = list(map(int, input().split()))
score = [k for i in range(n)]
for i in range(q):
a = int(eval(input()))
score[a - 1] += 1
score = list([x- 1 for x in score])
for i in range(n):
if score[i] > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
score = [0 for i in range(n)]
for i in range(q):
a = int(eval(input()))
score[a - 1] += 1
for i in range(n):
if q - score[i] >= k:
print('No')
else:
print('Yes') | p02911 |
n, k, q = list(map(int, input().split()))
ns_points = [k] * n
for i in range(q):
a = int(eval(input()))
ns_points = list([x - 1 for x in ns_points])
ns_points[a - 1] += 1
for points in ns_points:
if points <= 0:
print('No')
else:
print('Yes') | n, k, q = list(map(int, input().split()))
ns_points = [k] * n
ns_corrects = [0] * n
for i in range(q):
ns_corrects[int(eval(input()))-1] += 1
for j in range(len(ns_points)):
if ns_points[j] - (q - ns_corrects[j]) <= 0:
print('No')
else:
print('Yes') | p02911 |
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
for i in range(N):
katisuu = A.count(i+1)
point = Q - katisuu
if point < K:
print("Yes")
else:
print("No")
| N,K,Q = list(map(int,input().split()))
l = [0]*N
for i in range(Q):
l[int(eval(input()))-1] += 1
for i in range(N):
point = Q - l[i]
if point < K:
print("Yes")
else:
print("No")
| p02911 |
N,point,answer=list(map(int,input().split()))
W=[point]*N
for i in range(answer):
U=int(eval(input()))
W=[n-1 for n in W]
W[U-1]+=1
for k in range(N):
if W[k]<=0:
print("No")
else:
print("Yes")
| N,point,answer=list(map(int,input().split()))
W=[point]*N
for i in range(answer):
U=int(eval(input()))
W[U-1]+=1
W=[n-answer for n in W]
for k in range(N):
if W[k]<=0:
print("No")
else:
print("Yes")
| p02911 |
N,K,Q=list(map(int,input().split()))
ls1 = [int(eval(input())) for i in range(Q)]
ls_ = [K]*N
for i in ls1:
ls_ = list([x-1 for x in ls_])
ls_[i-1]+=1
for i in ls_:
if i <=0:
print("No")
else:
print("Yes") | N,K,Q=list(map(int,input().split()))
ls_ = [K]*N
for i in range(Q):
ls_[int(eval(input()))-1]+=1
ls__ = ["No" if i <= Q else "Yes" for i in ls_]
string = "\n".join(ls__)
print(string) | p02911 |
N, K, Q = list(map(int, input().split()))
A_lis = [int(eval(input())) for _ in range(Q)]
for i in range(N):
if K-Q+A_lis.count(i+1)>0:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
A_lis = [int(eval(input())) for _ in range(Q)]
#A_lis.sort()
B_lis = [int(K-Q)]*N
for A in A_lis:
B_lis[A-1]+=1
for B in B_lis:
if B>0:
print("Yes")
else:
print("No")
| p02911 |
N, K, Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
point = []
for i in range(N):
point.append(K)
for i in range(Q):
for j in range(N):
if j == A[i]-1:
pass
else:
point[j] -= 1
for i in range(N):
if point[i] ... | N, K, Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
point = []
for i in range(N):
point.append(0)
for i in range(Q):
point[A[i]-1] += 1
for i in range(N):
if point[i]+(K-Q) > 0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
man = [K] * N
for i in A:
man = list([x - 1 for x in man])
man[i-1] += 1
for out in man:
if out <= 0:
print("No")
else:
print("Yes")
| N, K, Q = list(map(int, input().split()))
man = [K - Q] * N
for _ in range(Q):
man[int(eval(input()))-1] += 1
for out in man:
if out <= 0:
print("No")
else:
print("Yes")
| p02911 |
n,k,q = list(map(int,input().split()))
ans = [0] * n
data = [k] * n
data2 = [0] * n
for i in range(q):
tmp = int(eval(input()))
data2[tmp-1] += 1
for i in range(n):
ans[i] = data2[i] + data[i] - q
for i in range(n):
if ans[i] >0 :
print("Yes")
else:
print("No")
| n,k,q = list(map(int,input().split()))
data = [k] * n
for i in range(q):
answer = int(eval(input()))
data[answer-1] += 1
for i in range(n):
data[i] = data[i] - q
for i in range(n):
if data[i] >= 1:
print('Yes')
else:
print('No')
| p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
point = [k - q] * (n + 1)
for x in range(q):
for y in range(n) :
if y + 1 == a[x] :
point[y] += 1
for z in range(n) :
if point[z] > 0:
print("Yes")
else :
print("No") | n, k, q = list(map(int, input().split()))
point = [k - q] * (n + 1)
for _ in range(q):
point[int(eval(input())) -1] += 1
for z in range(n) :
if point[z] > 0:
print("Yes")
else :
print("No")
| p02911 |
n, k, q = list(map(int, input().split()))
pts = [0 for _ in range(n)]
for _ in range(q):
pts[int(eval(input())) - 1] += 1
for pt in pts:
if q - pt < k:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
pts = [k - q for _ in range(n)]
for _ in range(q):
pts[int(eval(input())) - 1] += 1
for pt in pts:
if pt > 0:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int,input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
p = [k for _ in range(n)]
for s in a:
p = list([x -1 for x in p])
p[s-1] = p[s-1] + 1
for i in p:
if i > 0:
print('Yes')
else:
print('No') | n,k,q = list(map(int,input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
p = [k for _ in range(n)]
p = list([x -q for x in p])
for s in a:
p[s-1] = p[s-1] + 1
for i in p:
if i > 0:
print('Yes')
else:
print('No') | p02911 |
#141
N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
A += [int(eval(input()))]
cnt = 0
for j in range(N):
for k in range(Q):
if A[k] == j+1:
cnt += 1
print(('No' if (Q - cnt) >= K else 'Yes'))
cnt = 0 | #141
N, K, Q = list(map(int, input().split()))
cnt = 0
P = [K - Q] * N
for i in range(Q):
idx = int(eval(input())) - 1
P[idx] += 1
for j in range(N):
if P[j] > 0:
print('Yes')
else:
print('No')
| p02911 |
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
for i in range(n):
if k-q+a.count(i+1) > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
point = [k]*n
for i in range(q):
point[int(eval(input()))-1] += 1
for i in range(n):
if point[i]-q > 0:
print('Yes')
else:
print('No') | p02911 |
L=list(map(int,input().split()))
N=L[0]
K=L[1]
Q=L[2]
S=[]
for i in range(Q):
S.append(int(eval(input())))
S.sort()
for i in range(N):
num_ans=S.count(i+1)
point=K-Q+num_ans
if point>0 :
print("Yes")
else:
print("No")
S=S[num_ans:] | L=list(map(int,input().split()))
N=L[0]
K=L[1]
Q=L[2]
point=[K-Q]*N
for i in range(Q):
ans=int(eval(input()))
point[ans-1]+=1
for i in range(N):
if point[i]>0 :
print("Yes")
else:
print("No") | p02911 |
n,k,q=list(map(int,input().split()))
as_=[int(eval(input())) for _ in range(q)]
for p in range(n):
if k-q+as_.count(p+1)>0:
print('Yes')
else:
print('No') | n,k,q=list(map(int,input().split()))
as_=[int(eval(input())) for _ in range(q)]
ps=[k-q]*n
for a in as_:
ps[a-1]+=1
for p in ps:
print(('Yes'if p>0 else 'No')) | p02911 |
N, K, Q = list(map(int, input().split()))
right_answers = list(int(eval(input())) for _ in list(range(Q)))
indexes = [v-1 for v in right_answers]
scores = [K for _ in range(N)]
for i in indexes:
scores[i] = scores[i]+1
scores = [w-1 for w in scores]
for j in scores:
if j > 0:
print(... | N, K, Q = list(map(int, input().split()))
right_answers = list(int(eval(input())) for _ in list(range(Q)))
indexes = [v-1 for v in right_answers]
scores = [K-Q for _ in range(N)]
for i in indexes:
scores[i] = scores[i]+1
for j in scores:
if j > 0:
print('Yes')
else:
print('... | p02911 |
N, K, Q = list(map(int, input().split()))
A = [0]*N
for _ in range(Q):
q = int(eval(input()))
A[q-1] += 1
for a in A:
if K-Q+a>0:
print('Yes')
else:
print('No') | import sys
input = sys.stdin.readline
def main():
N, K, Q = list(map(int, input().split()))
A = [0]*N
for _ in range(Q):
q = int(eval(input()))
A[q-1] += 1
for a in A:
if K-Q+a>0:
print('Yes')
else:
print('No')
if __name__ == '_... | p02911 |
import sys
from collections import Counter
input=sys.stdin.readline
n,k,q=list(map(int,input().split()))
a=Counter([int(eval(input())) for _ in range(q)])
ans=[False]*n
for key,v in list(a.items()):
if k-(q-v)>0:
ans[key-1]=True
ss=set(a.keys())
for i in range(n):
if i+1 in ss:continu... | # 2019/09/16
# 解説のやつ
import sys
input=sys.stdin.readline
n,k,q=list(map(int,input().split()))
res=[k-q]*n
for i in range(q):
res[int(eval(input()))-1]+=1
for e in res:
print(('Yes' if e>0 else 'No')) | p02911 |
n,k,q=list(map(int,input().split()))
K=k-q
x=[]
for i in range (q):
a=int(eval(input()))
x.append(a)
for i in range (1,n+1,1):
if K+int(x.count(i))>0:
print('Yes')
else:
print('No') | n,k,q=list(map(int,input().split()))
p=k-q
l=[p]*n
for i in range(q):
a=int(eval(input()))
l[a-1]+=1
for i in range(n):
print(('Yes' if l[i]>0 else 'No'))
| p02911 |
n,k,q=list(map(int,input().split()))
a=[k]*n
for i in range(q):
o=int(eval(input()))
a[o-1]+=1
for j in range(n):
a[j]-=1
for s in range(n):
if a[s]>0:
print("Yes")
else:
print("No")
| n,k,q=list(map(int,input().split()))
a=[k-q]*n
for i in range(q):
o=int(eval(input()))
a[o-1]+=1
for s in range(n):
if a[s]>0:
print("Yes")
else:
print("No") | p02911 |
N=list(map(int,input().split(" ")))
ans=[int(eval(input())) for i in range(N[2])]
point=[N[1] for i in range(N[0])]
def down(y):
return y-1
for i in ans:
point=list(map(down,point))
point[i-1]+=1
#print(point)
for i in range(N[0]):
if point[i]>0:
print("Yes")
else:
print("No") | N=list(map(int,input().split(" ")))
ans=[int(eval(input())) for i in range(N[2])]
point=[N[1]-N[2] for i in range(N[0])]
for i in ans:
point[i-1]+=1
#print(point)
for i in range(N[0]):
if point[i]>0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
member = [K] * N
flag = False
for i in range(0, Q):
n = int(eval(input()))
for j in range(0, N):
member[j] = member[j] - 1
member[n-1] = member[n-1] + 1
for i in range(0, N):
if member[i] <= 0:
print("No")
else:
prin... | N, K, Q = list(map(int, input().split()))
member = [K] * N
flag = False
for i in range(0, Q):
n = int(eval(input()))
member[n-1] = member[n-1] + 1
for j in range(0, N):
member[j] = member[j] - Q
if member[j] <= 0:
print("No")
else:
print("Yes")
| p02911 |
N,K,Q=list(map(int,input().split()))
res=[K-Q]*N
for i in range(Q):
ans=int(eval(input()))-1
res[ans]=res[ans]+1
for j in range(N):
print((("No","Yes")[res[j]>0]))
| import sys
readline = sys.stdin.readline
# (Q - 正解数)点減る
N,K,Q = list(map(int,readline().split()))
P = [0] * N
for i in range(Q):
P[int(readline()) - 1] += 1
for p in P:
if K - (Q - p) > 0:
print("Yes")
else:
print("No") | p02911 |
import sys
import bisect
input = sys.stdin.readline
def main():
n,k,q = list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
point=[k for i in range(n)]
for i in range(q):
for j in range(n):
if(j!=(a[i]-1) and point[j]>0):
point[j]-=1
... | n,k,q = list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
point=[k-q for i in range(n)]
for i in range(q):
point[a[i]-1]+=1
for i in range(n):
if(point[i]>0):
print("Yes")
else:
print("No")
| p02911 |
# -*- coding: utf-8 -*-
n, k, q =list(map(int, input().split()))
m = [k]*n
for i in range(q):
a = int(eval(input()))-1
m[a]+=1
for j in range(n):
m[j]-=1
for i in range(n):
if m[i]>0:
print("Yes")
else:
print("No") | # -*- coding: utf-8 -*-
n, k, q =list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
p = [0]*(n+1)
for i in range(q):
p[a[i]] += 1
for i in range(1,n+1):
if p[i]>q-k:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
Ai = list(map(int, [eval(input()) for i in range(Q)]))
final = [K-Q for i in range(N)]
add = [Ai.count(i+1) for i in range(N)]
scores = list(map(lambda x, y: x+y, final, add))
for k in range(len(scores)):
if scores[k] > 0 :
print('Yes')
else:
... | N, K, Q = list(map(int, input().split()))
Ai = list(map(int, [eval(input()) for i in range(Q)]))
scores = [K-Q for i in range(N)]
for i in range(Q):
scores[Ai[i] - 1] += 1
scores = scores
for k in range(len(scores)):
if scores[k] > 0 :
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split(" ")))
A = [int(eval(input())) for i in range(Q)]
tmp = []
for i in range(N):
tmp.append(A.count(i+1)) #正解数
# 得点は, 最初の点数 - 他人の正解数
# 他人の正解数は, 問題数 - 自分の正解数
# 得点は, 最初の点数 - 問題数 + 自分の正解数
# 得点 > 0 であれば, "Yes"
for i in range(N):
if K - Q + tmp[i] > 0:
print("Y... | N, K, Q = list(map(int, input().split(" "))) # N:人数, K:初期スコア, Q:問題数
A = [int(eval(input())) for i in range(Q)] # 正解者のリスト
B = [0 for i in range(N)] # 正解数
for i in range(Q):
num_ans_person = A[i] - 1
B[num_ans_person] += 1
# 得点は, 最初の点数 - 他人の正解数
# 他人の正解数は, 問題数 - 自分の正解数
# 得点は, 最初の点数 - 問題数 + 自分の... | p02911 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.