input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
A[i] = int(eval(input()))
for i in range(Q):
for j in range(N):
if j+1 != A[i]:
P[j] -= 1
for i in range(N):
if P[i] <= 0:
... | V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
A[i] = int(eval(input()))
for i in range(Q):
P[A[i]-1] += 1
for i in range(N):
if P[i] - Q <=0:
print("No")
if P[i] - Q > 0:
print("Yes") | p02911 |
N,K,Q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(Q)]
Z=[K for i in range(N)]
for i in A:
for c in range(N):
if c==i-1:
continue
else:
Z[c]=Z[c]-1
for t in Z:
if t<=0:
print('No')
else:
print('Yes') | N,K,Q=list(map(int,input().split()))
l=[0 for i in range(N)]
for t in range(Q):
A=int(eval(input()))
l[A-1]+=1
for i in range(N):
if K-(Q-l[i])<=0:
print('No')
else:
print('Yes') | p02911 |
n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(q)]
p=[k]*n
for i in range(q):
seikai=a[i]-1
for j in range(n):
p[j]-=1
p[seikai]+=1
for j in range(n):
if p[j]>0:
print('Yes')
else:
print('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 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):
_ = int(eval(input()))
if _ in A:
A[_] += 1
else:
A[_] = 1
for i in range(N):
try:
print(('Yes' if 0 < K - Q + A[i+1] else 'No'))
except KeyError as e:
print(('Yes' if 0 < K - Q else 'No')) | N,K,Q=list(map(int,input().split()))
A = [0]*N
for i in range(Q):
A[int(eval(input()))-1]+=1
for i in range(N):
print(('Yes'if K-Q+A[i]>0 else'No')) | p02911 |
n,k,q = list(map(int,input().split()))
a = [0 for _ in range(q)]
point = [k for _ in range(n)]
for i in range(q):
a[i] = int(eval(input()))
for i in range(q):
for j in range(len(point)):
point[j] -= 1
point[a[i]-1] += 1
for i in range(n):
if(point[i] > 0):
print("Yes")
... | n,k,q = list(map(int,input().split()))
a = [0 for _ in range(q)]
point = [0 for _ in range(n)]
for i in range(q):
a[i] = int(eval(input()))
for i in range(q):
point[a[i]-1] += 1
for i in range(n):
if(point[i] > q-k):
print("Yes")
else:
print("No") | p02911 |
n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
for i in range(n):
if 0 < k-q+a.count(i+1):
print('Yes')
else:
print('No') | n,k,q = list(map(int, input().split()))
p = [k-q]*n
for i in range(q):
a = int(eval(input()))
p[a-1] += 1
for j in p:
if 0 < j:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
point_list = []
for i in range(N):
point_list.append(K)
for i in range(Q):
num = int(eval(input())) - 1
point_list[num] += 1
res = []
for i in point_list:
i -= Q
res.append(i)
for i in res:
if i > 0:
print('Yes')
else:
print('No') | N, K, Q = list(map(int, input().split()))
point_list = []
for i in range(N):
point_list.append(K)
for i in range(Q):
num = int(eval(input())) - 1
point_list[num] += 1
for i in point_list:
i -= Q
if i > 0:
print('Yes')
else:
print('No')
| p02911 |
N, K, Q = list(map(int, input().split()))
point_list = []
for i in range(N):
point_list.append(K)
for i in range(Q):
num = int(eval(input())) - 1
point_list[num] += 1
for i in point_list:
i -= Q
if i > 0:
print('Yes')
else:
print('No')
| N, K, Q = list(map(int, input().split()))
point_list = [K for i in range(N)]
for i in range(Q):
num = int(eval(input())) - 1
point_list[num] += 1
for i in point_list:
i -= Q
if i > 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(k-q+a.count(i+1)>0):
print('Yes')
else:
print('No') | N,K,Q = list(map(int, input().split()))
List = [int(eval(input())) for i in range(Q)]
PList=[K-Q]*N
for i in range(0,Q):
PList[(List[i])-1]+=1
for j in range(0,N):
if PList[j]>0:
print("Yes")
else:
print("No") | p02911 |
num, point, ques = list(map(int, input().split(" ")))
ans_list = []
point_list = []
for i in range(ques):
ans_list.append(int(eval(input())))
for i in range(num):
point_list.append(point)
for ans in ans_list:
point_list[ans-1]+=1
for i in range(num):
point_list[i] -= 1
for i i... | num, point, ques = list(map(int, input().split(" ")))
ans_list = []
point_list = []
for i in range(num):
point_list.append(point)
for i in range(ques):
point_list[int(eval(input()))-1]+=1
for i in range(num):
if(point_list[i]-ques<=0):
print("No")
else:
print("Yes") | p02911 |
n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
point = [k for _ in range(n)]
for i in range(q):
for j in range(n):
if a[i] != j:
point[j - 1] -= 1
for i in range(n):
if point[i] > 0:
print("Yes")
else:
... | n, k, q = list(map(int, input().split()))
a = []
for i in range(q):
a.append(int(eval(input())))
point = [0 for _ in range(n)]
for i in range(q):
point[a[i] - 1] += 1
for i in range(n):
if k - q + point[i] > 0:
print("Yes")
else:
print("No")
| p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for i in range(Q)]
N_K = [K for i in range(N)]
for a in A:
N_K = [n_k-1 if a-1 != i else n_k for i, n_k in enumerate(N_K)]
for n_k in N_K:
if n_k <= 0:
print("No")
else:
print("Yes")
| N, K, Q = list(map(int, input().split()))
A = [0]*N
# print(A)
for i in range(Q):
A[int(eval(input()))-1] +=1
# print(A)
for i in range(N):
if K-Q+A[i] <= 0:
print("No")
else:
print("Yes")
| p02911 |
N,K,Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)
N_point = []
A = []
for i in range(Q):
A.append(int(eval(input())))
for i in range(N):
N_point.append(K)
def calc_hiku(n):
return n - 1
for i in A:
N_point = list(map(calc_hiku, N_point))
N_point[i-1] = int(N_point[i-1]) + 1
... | N,K,Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)
N_point = []
A = []
for i in range(Q):
A.append(int(eval(input())))
for i in range(N):
N_point.append(K)
def calc_hiku(n):
return n - Q
for i in A:
#N_point = list(map(calc_hiku, N_point))
N_point[i-1] = int(N_point[i-1]) + 1
... | p02911 |
nkq = list(map(int, input().split()))
n, k, q = nkq[0], nkq[1], nkq[2]
attendees = dict()
for i in range(n):
attendees[i] = k
attendees = [(i, k) for i in range(n)]
respondents = [int(eval(input())) for i in range(q)]
for r in respondents:
r_index = r - 1
for a in attendees:
i, p = a... | nkq = list(map(int, input().split()))
n, k, q = nkq[0], nkq[1], nkq[2]
attendees = dict()
for i in range(n):
attendees[i] = 0
respondents = [int(eval(input())) for i in range(q)]
for r in respondents:
r_index = r - 1
attendees[r_index] += 1
for i, p in list(attendees.items()):
point = p ... | p02911 |
# AtCoder
N, K, Q = list(map(int, input().split()))
solved = [int(eval(input())) for i in range(Q)]
ilst = [int(K)] * N
def calc_minus(n):
return n - 1
for i in solved:
ilst[i-1] += 1
ilst = list(map(calc_minus, ilst))
for i in ilst:
if i >= 1:
print("Yes")
else:
... | N, K, Q = list(map(int, input().split()))
ilst = [int(K-Q)] * N
for i in range(Q):
inp = int(eval(input()))
ilst[inp-1] += 1
for i in ilst:
if i > 0:
print("Yes")
else:
print("No")
| p02911 |
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
ans = eval(input())
y.append(int(ans))
l += 1
for i in y:
for n in range(len(plist)):
if n != i-1:
plist[n] -= 1
for p in plist:
if p > 0:
print("Yes")
... | x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
ans = eval(input())
y.append(int(ans))
l += 1
for i in y:
plist[i-1] += 1
for p in plist:
if p - int(x[2]) > 0:
print("Yes")
else:
print("No")
| p02911 |
n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for i in range(q)]
ans = []
def calc(n):
return n-1
for i in range(n):
ans.append(k)
for i in range(q):
ans = list(map(calc, ans))
ans[a[i]-1]+= 1
for i in range(n):
if ans[i] <= 0:
print("No")
else:
print("Yes") | n,k,q=list(map(int,input().split()))
a=[int(eval(input())) for i in range(q)]
ans = []
def calc(n):
return n-q
for i in range(n):
ans.append(k)
ans = list(map(calc, ans))
for i in range(q):
ans[a[i]-1]+= 1
for i in range(n):
if ans[i] <= 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)]
for i in range(n):
if a_list.count(i+1) > q-k:
print("Yes")
else:
print("No") | n,k,q=list(map(int,input().split()))
li=[0]*n
for i in range(q):
a=int(eval(input()))
li[a-1]+=1
for i in range(n):
if li[i]>q-k:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input()))-1 for _ in range(Q)]
Point = [K]*N
for i in range(Q):
Point[A[i]] += 1
for j in range(N):
Point[j] -= 1
for p in Point:
if p>0:
print('Yes')
else:
print('No') | N, K, Q = list(map(int, input().split()))
A = [int(eval(input()))-1 for _ in range(Q)]
Point = [K-Q]*N
for i in range(Q):
Point[A[i]] += 1
for p in Point:
if 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()))
judge = [K-Q] * N
for j in A:
judge[j-1] += 1
for k in judge:
if k > 0:
print("Yes")
else:
print("No")
| import sys
input = sys.stdin.readline
N,K,Q = list(map(int,input().split()))
A = [0] * Q
for i in range(Q):
A[i] = int(eval(input()))
judge = [K-Q] * N
for j in A:
judge[j-1] += 1
for k in judge:
if k > 0:
print("Yes")
else:
print("No")
| p02911 |
# ABC141c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
sanka = [k]*n
for i in a:
sanka[i-1] += 1
for j in range(n):
sanka[j] -= 1
# print(sanka)
for i in sanka:
print(('Yes... | # ABC141c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
sanka = [0]*n
for i in a:
sanka[i-1] += 1
# print(sanka)
for i in sanka:
print(('Yes' if i+k-q > 0 else 'No')) | p02911 |
from collections import Counter, defaultdict
n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
C = Counter(A)
d = defaultdict(int)
for key, val in list(C.items()):
d[key] = k + val - q
for i in range(1, n+1):
if i not in A:
d[i] = k-q
for i in range(1, n+1)... | from collections import Counter
n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
C = Counter(A)
for i in range(1, n+1):
if C[i] + k - q <= 0:
print('No')
else:
print('Yes')
| p02911 |
n, k, q = list(map(int, input().split()))
point = [k for _ in range(n)]
for i in range(q):
point = list([x-1 for x in point])
idx = int(eval(input())) - 1
point[idx] += 1
for j in range(n):
if point[j] > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
point = [k-q for _ in range(n)]
for i in range(q):
idx = int(eval(input())) - 1
point[idx] += 1
for j in range(len(point)):
if point[j] > 0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K] * N
for i in range(Q):
point = [j - 1 for j in point]
point[A[i] - 1] += 1
for i in range(N):
print("Yes") if point[i] > 0 else print("No")
| N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
point = [K] * N
point = [j - Q for j in point]
for i in range(Q):
point[A[i] - 1] += 1
for i in range(N):
print("Yes") if point[i] > 0 else print("No")
| p02911 |
N, K, Q = list(map(int, input().split()))
val = [K]*N
a = []
for i in range(Q):
num = [int(i) for i in range(N)]
num.remove(int(eval(input()))-1)
for j in num:
val[j] -= 1
for i in val:
if i <= 0:
print('No')
else:
print('Yes')
| N, K, Q = list(map(int, input().split()))
val = [K]*N
for i in range(Q):
val[int(eval(input()))-1] += 1
for i in val:
if i - Q <= 0:
print('No')
else:
print('Yes')
| p02911 |
n,k,q = list(map(int,input().split()))
a = [eval(input()) for i in range(q)]
K = [k]*n
for i in range(q):
tmp = a[i]
for j in range(len(K)):
K[j] -= 1
K[int(tmp)-1] = K[int(tmp)-1]+1
for k in range(len(K)):
if K[k] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
a = [eval(input()) for i in range(q)]
K = [k]*n
limit = 0
for i in range(q):
tmp = a[i]
K[int(tmp)-1] = K[int(tmp)-1]+1
limit += 1
for k in range(len(K)):
if K[k] > limit:
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
a = [-1] * q
for i in range(q):
a[i] = int(eval(input()))
t = [0] * (n+1)
for i in range(q):
t[ a[i] ] += 1
p = [k] * (n+1)
for i in range(1, n+1):
for j in range(1, n+1):
if i != j:
p[j] -= t[i]
for i in range(1, n+1):
i... | n, k, q = list(map(int, input().split()))
a = [-1] * q
for i in range(q):
a[i] = int(eval(input()))
t = [0] * (n+1)
for i in range(q):
t[ a[i] ] += 1
p = [0] * (n+1)
for i in range(1, n+1):
p[i] = k - q + t[i]
for i in range(1, n+1):
if p[i] > 0:
print('Yes')
else:
... | p02911 |
# coding utf-8
N, K, Q = input().split()
N, K, Q = int(N), int(K), int(Q)
points = [K-Q for _ in range(N)]
for q in range(Q):
collect = int(eval(input())) - 1
points[collect] += 1
for p in points:
if p>0:
print('Yes')
else:
print('No') | # coding: utf-8
def reader(N):
for n in range(N):
yield eval(input())
def main():
N, K, Q = input().split()
N, K, Q = int(N), int(K), int(Q)
participants = [K-Q for _ in range(N)]
for a in reader(Q):
participants[int(a)-1] += 1
for p in participants:
... | p02911 |
from collections import deque
list1=list(map(int,input().split()))
N=list1[0]
K=list1[1]
Q=list1[2]
dl=deque()
point=deque()
for i in range(N):
point.append(K)
for i in range(Q):
dl.append(int(eval(input())))
for i in range(Q):
for i in range(N):
point[i]=point[i]-1
for i in ... | N, K, Q = list(map(int, input().split()))
A = []
P = [0]*N
for q in range(Q):
A.append(int(eval(input())))
for q in range(Q):
P[A[q]-1] += 1
for n in range(N):
if K - (Q - P[n]) > 0:
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split()))
#正解者順リスト
al = [int(eval(input())) for i in range(q)]
#このリストのindex+1が参加者ナンバーです
#みんなの持ち点
nl = []
for m in range(n):
nl.append(k)
for r in range(q):
for x in range(n):
nl[x] = nl[x]-1
#とりあえず全員、全正解数＊-1点する作業
for y in al:
nl[y-1] = nl[y-1]+1
... | n, k, q = list(map(int, input().split()))
#正解者順リスト
al = [int(eval(input())) for i in range(q)]
#このリストのindex+1が参加者ナンバーです
#みんなの持ち点
nl = []
for m in range(n):
nl.append(k-q)
for y in al:
nl[y-1] = nl[y-1]+1
for z in nl:
if z > 0:
print('Yes')
else:
print('No')
| p02911 |
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):
if p[i] > 0: print('Yes')
else: print('No') | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
# 愚直に考えるとO(QN)で間に合わないので、以下のような操作に置き換える
# 開始時点の全員のポイントはK-Qとする
# Q回の正解それぞれに対し、正解者のポイントを1増やす
# するとO(Q+N)で解け、間に合う
p = [K-Q]*N
for i in range(Q):
p[A[i]-1] += 1
for i in range(N):
if p[i] > 0: print('Yes')
else: print... | p02911 |
l = input().split()
N = int(l[0])
K = int(l[1])
Q = int(l[2])
A = []
for i in range(Q):
A.append(eval(input()))
for i in range(N):
if Q-A.count(i+1) < K:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
S = [0 for i in range(N)]
for i in range(Q):
Ai = int(input()) -1
S[Ai] = S[Ai] + 1
for i in range(N):
S[i] = K - (Q - S[i])
#print S
for i in range(N):
... | p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
s = k - q
if k <= q:
for i in range(1, n + 1):
if s + a.count(i) > 0:
print('Yes')
else:
print('No')
else:
for _ in range(n):
print('Yes') | n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
l = [0] * n
s = k - q
for i in a:
l[i - 1] += 1
if s <= 0:
for i in range(n):
if s + l[i] > 0:
print('Yes')
else:
print('No')
else:
for _ in range(n):
print('Yes... | p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) - 1 for i in range(q)]
nl = [k for i in range(n)]
for i in a:
nl = [j-1 for j in nl]
nl[i] += 1
for i in range(n):
if nl[i] > 0:
print('Yes')
else:
print('No')
| n, k, q = list(map(int, input().split()))
a = [int(eval(input())) - 1 for i in range(q)]
nl = [k-q for i in range(n)]
for i in a:
nl[i] += 1
for i in range(n):
if nl[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(1, n+1):
s = 'Yes' if k-q+a.count(i)>0 else 'No'
print(s) | 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):
s = 'Yes' if k-q+a[i]>0 else 'No'
print(s) | p02911 |
N,K,Q = list(map(int,input().split()))
lis = list()
A = K -Q
point = [A for i in range(N)]
for i in range(Q):
lis.append(int(eval(input())))
for i in range(Q):
for j in range(N):
if lis[i] == j:
point[j-1] += 1
for i in range(N):
if point[i] >= 1:
print("Yes")
else:
print("No") | N,K,Q = list(map(int,input().split()))
lis = list()
A = K -Q
point = [A for i in range(N)]
for i in range(Q):
lis.append(int(eval(input())))
for i in range(Q):
point[lis[i]-1] += 1
for i in range(N):
if point[i] >= 1:
print("Yes")
else:
print("No") | p02911 |
n, k, q = input().split()
n, k, q = [int(n), int(k), int(q)]
scores = [k for i in range(0,n)]
for i in range(0,q):
A = int(eval(input()))
for j in range(0, n):
if not (j+1)==A:
scores[j] -= 1
for i in range(0, n):
if scores[i]>0:
print("Yes")
else:
print("No") | n, k, q = input().split()
n, k, q = [int(n), int(k), int(q)]
d = dict()
for i in range(0, n):
d[i+1] = 0
for i in range(0, q):
A = int(eval(input()))
d[A] += 1
for i in range(0, n):
times = d[i+1]
if (k-q+times)>0:
print("Yes")
else:
print("No") | p02911 |
import collections
n,k,q = list(map(int,input().split()))
alist = [int(eval(input())) for i in range(q)]
"""
atuple = tuple(alist)
acount = collections.Counter(atuple)
print(acount,q,k)
tlist = []
for key,v in acount.items():
if q - v < k:
tlist.append(key)
"""
for i in range(1,n+1):
... | import collections
n,k,q = list(map(int,input().split()))
alist = [int(eval(input())) for i in range(q)]
atuple = tuple(alist)
acount = collections.Counter(atuple)
#print(acount,q,k)
for i in range(1,n+1):
if q - acount[i] < k:
print("Yes")
else:
print("No") | p02911 |
n, k, q = map(int, input().split())
quiz = [int(input()) for i in range(q)]
point = [k]*n
for i in quiz:
point = list(map(lambda x: x-1, point))
point[i-1] += 1
[print("Yes") if i > 0 else print("No") for i in point]
| n, k, q = map(int, input().split())
quiz = [int(input()) for i in range(q)]
point = [k-q]*n
for i in quiz:
point[i-1] += 1
[print("Yes") if i > 0 else print("No") for i in point]
'''
1. あらかじめ全員のポイントを Q 減らしておく (つまり，開始時点のポイントは K − Q)．
2. Q 回の正解それぞれに対して，正解者のポイントを 1 増やす．
リストの中身すべてに計算すると「リスト要素」＊「ループ回数」の計算量になる
... | p02911 |
N, K, Q = list(map(int, input().split()))
point = [K - Q] * N
for i in range(Q):
ans = int(eval(input()))
point[ans-1] += 1
for item in point:
if item <= 0:
print('No')
else:
print('Yes')
| N, K, Q = list(map(int, input().split()))
ans = [0]*(N+1)
for i in range(Q):
ans[int(eval(input()))] += 1
sum_ans = sum(ans)
for i in range(1,N+1):
print(('Yes' if K-(sum_ans-ans[i]) > 0 else 'No')) | p02911 |
n, k, q = list(map(int, input().split()))
a = [ int(eval(input())) for i in range(q) ]
for i in range(1,n+1):
x = a.count(i)
if k-q+x > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
a = [ int(eval(input())) for i in range(q) ]
score = [k-q]*n
for i in a:
score[i-1] += 1
for i in score:
print(('Yes' if i > 0 else 'No')) | p02911 |
N, K, Q = list(map(int, input().split()))
P = [K for _ in range(N)]
D = []
for _ in range(Q):
A = int(eval(input())) - 1
for i, p in enumerate(P):
if A != i:
P[i] -= 1
for x in P:
if x <= 0:
print('No')
else:
print('Yes')
| N, K, Q = list(map(int, input().split()))
P = [K for _ in range(N)]
D = []
for _ in range(Q):
A = int(eval(input())) - 1
P[A] += 1
for x in P:
if Q + 1 <= x:
print('Yes')
else:
print('No')
| p02911 |
N, K, Q = list(map(int, input().split(' ')))
res = [K for _ in range(N)]
for i in range(Q):
a = int(eval(input())) - 1
res = list([n-1 for n in res])
res[a] = res[a] + 1
for i in range(N):
print(('Yes' if res[i] > 0 else 'No'))
| N, K, Q = list(map(int, input().split(' ')))
res = [0 for _ in range(N)]
for i in range(Q):
a = int(eval(input())) - 1
res[a] = res[a] + 1
res = list([n - Q + K for n in res])
for i in range(N):
print(('Yes' if res[i] > 0 else 'No'))
| p02911 |
N,K,Q = input().split()
N=int(N)
K=int(K)
Q=int(Q)
seikai_list = []
for i in range(Q):
seikai_list.append(int(eval(input())))
for n in range(N):
point = seikai_list.count(n+1) + K - Q
if point > 0:
print("Yes")
else:
print("No") | N,K,Q = input().split()
N=int(N)
K=int(K)
Q=int(Q)
seikai_list = [K - Q] * N
for i in range(Q):
num = int(eval(input())) -1
seikai_list[num] = seikai_list[num] +1
for n in seikai_list:
if n > 0:
print("Yes")
else:
print("No") | p02911 |
def scoredown(n):
return n-1
N, K, q=list(map(int, input().split()))
a=[int(eval(input())) for i in range(q)]
score=[K]*N
for i in range(q):
score=list(map(scoredown, score))
score[a[i]-1]+=1
for i in range(N):
if score[i]<=0:
print("No")
else:
print("Yes") | N, K, q=list(map(int, input().split()))
score=[0]*N
for i in range(q):
tmp=int(eval(input()))
score[tmp-1]+=1
for i in range(N):
if K-(q-score[i])>0:
print("Yes")
else:
print("No") | p02911 |
N, k, Q = list(map(int, input().split()))
A =[]
j = 0
c = 0
def calc_de(n):
return n - 1
A = [int(eval(input())) for index in range(Q)]
S = [k]*N
for j in A:
S = list(map(calc_de, S))
S[j-1] += 1
for c in range(N):
if S[c] > 0:
print('Yes')
else:
pri... | N, K, Q = list(map(int, input().split()))
A = [K]*N
C = [0]*N
for r in range(Q):
correct = int(eval(input()))
C[correct-1] = C[correct-1] + 1
for i in range(N):
A[i] = A[i] - Q + C[i]
if A[i] > 0:
print('Yes')
else:
print('No')
| p02911 |
#C
n, k, q = list(map(int, input().split()))
a = sorted([int(eval(input())) for _ in range(q)])
j = 0
for i in range(n):
count = a.count(i+1)
if q - count >= k:
print('No')
else:
print('Yes')
a[:count] = []
| n, k, q = list(map(int, input().split()))
a = sorted([int(eval(input())) for _ in range(q)])
point = [k-q for _ in range(n)]
for i in range(q):
point[a[i]-1] += 1
for j in point:
if j > 0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = [int(x) for x in input().split()]
scores = [K] * N
for i in range(Q):
ans = int(eval(input()))
scores = list([x - 1 for x in scores])
scores[ans - 1] += 1
for score in scores:
print(('Yes' if score > 0 else 'No'))
| N, K, Q = [int(x) for x in input().split()]
scores = [K - Q] * N
for i in range(Q):
ans = int(eval(input()))
scores[ans - 1] += 1
for score in scores:
print(('Yes' if score > 0 else 'No'))
| p02911 |
n, k, q = list(map(int, input().split()))
aq = [int(eval(input())) for i in range(q)]
point = [k for i in range(n)]
correct_ans = [0] * n
for i in range(q):
correct_ans[aq[i] - 1] += 1
point = ['Yes' if p - (q - ca) > 0 else 'No' for (p, ca) in zip(point, correct_ans)]
for p in point:
print(p... | n, k, q = map(int, input().split())
aq = [int(input()) for i in range(q)]
point = [k for i in range(n)]
correct_ans = [0] * n
for i in range(q):
correct_ans[aq[i] - 1] += 1
point = ['Yes' if p - (q - ca) > 0 else 'No' for (p, ca) in zip(point, correct_ans)]
print(*point, sep='\n')
| p02911 |
# imos 法
N, K, Q = list(map(int, input().split()))
cs = [0] * N
cs[0] = K
for _ in range(Q):
A = int(eval(input()))
if A == 1:
cs[1] -= 1
elif A == N:
cs[0] -= 1
cs[N - 1] += 1
else:
cs[0] -= 1
cs[A - 1] += 1
cs[A] -= 1
for i in range(1, N):... | # imos 法
N, K, Q = list(map(int, input().split()))
cs = [0] * N
cs[0] = K
for _ in range(Q):
A = int(eval(input()))
if A == 1:
cs[1] -= 1
elif A == N:
cs[0] -= 1
cs[N - 1] += 1
else:
cs[0] -= 1
cs[A - 1] += 1
cs[A] -= 1
for i in range(1, N):... | p02911 |
N,K,Q = [int(i) for i in input().split()]
mem_point = [K for i in range(N)]
_points = [-1 for i in range(N)]
for rounds in range(Q):
temp = _points.copy()
anser = int(eval(input()))
temp[anser-1] = 0
mem_point = list(map(lambda x,y:x+y,mem_point,temp))
for point in mem_point:
if 0 < point:
... | N,K,Q = [int(i) for i in input().split()]
mem_point = [K-Q for i in range(N)]
for rounds in range(Q):
temp = int(eval(input()))
mem_point[temp-1] += 1
for point in mem_point:
if 0 < point:
print("Yes")
else:
print("No")
| p02911 |
sankaNum, scoreMax, ansCnt = list(map(int, input().split()))
score = []
for i in range(sankaNum):
score.append(scoreMax)
for n in range(ansCnt):
ansSanka = eval(input())
for k in range(sankaNum):
if int(ansSanka) - 1 != k:
score[k] -= 1
for m in range(sankaNum):
... | sankaNum, scoreMax, ansCnt = list(map(int, input().split()))
score = [scoreMax-ansCnt]*sankaNum
for _ in range(ansCnt):
score[int(eval(input())) - 1] += 1
for m in range(sankaNum):
if score[m] > 0:
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split(" ")))
a = [k for _ in range(n)]
for i in range(q):
winIndex = int(eval(input())) - 1
for j in range(n):
if j != winIndex:
a[j]-= 1
for i in range(n):
print(("Yes" if a[i] > 0 else "No")) | n, k, q = list(map(int, input().split(" ")))
a = [0 for _ in range(n)]
for i in range(q):
winIndex = int(eval(input())) - 1
a[winIndex] += 1
for i in range(n):
print(("Yes" if k > q - a[i] else "No")) | p02911 |
N, K, Q = list(map(int, input().split()))
ans_r = [K] * N
cor = list(map(int, [eval(input()) for i in range(Q)]))
for i in cor:
ans_r[i - 1] += 1
ans_r = list([x - 1 for x in ans_r])
ans_r = list(["No" if x <= 0 else "Yes" for x in ans_r])
for i in ans_r:
print(i)
| N, K, Q = list(map(int, input().split()))
ans_r = [K - Q] * N
cor = list(map(int, [eval(input()) for i in range(Q)]))
for i in cor:
ans_r[i - 1] += 1
for i in ans_r:
if i <= 0:
print("No")
else:
print("Yes")
| p02911 |
N,K,Q = list(map(int,input().split()))
A = []
L = []
for i in range(N):
A.append(K - Q)
for i in range(Q):
L.append(int(eval(input())))
for i in range(Q):
for j in range(N):
if j == L[i] - 1:
A[j] += 1
for i in range(N):
if A[i] <= 0:
print('No')
else:
... | N,K,Q = list(map(int,input().split()))
A = []
L = []
for i in range(N):
A.append(K - Q)
for i in range(Q):
L.append(int(eval(input())))
for i in range(Q):
j = L[i]
A[j - 1] += 1
for i in range(N):
if A[i] <= 0:
print('No')
else:
print('Yes') | p02911 |
N,K,Q = list(map(int,input().split()))
A = []
L = []
for i in range(N):
A.append(K - Q)
for i in range(Q):
L.append(int(eval(input())))
for i in range(Q):
j = L[i]
A[j - 1] += 1
for i in range(N):
if A[i] <= 0:
print('No')
else:
print('Yes') | n,k,q = list(map(int,input().split()))
a = list(int(eval(input())) for i in range(q))
z = [0] * n
for i in range(q):
z[a[i]-1] += 1
for i in range(n):
if z[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)]
score = [k-q for i in range(n)]
for i in a:
for j in range(len(score)):
if j == i-1:
score[j] = score[j]+1
pass
for i in score:
if i <= 0:
print('No')
else:
pr... | n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
score = [k-q for i in range(n)]
for i in a:
score[i-1] = score[i-1]+1
for i in score:
if i <= 0:
print('No')
else:
print('Yes') | p02911 |
"""
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, Q, *A = map(int, read().split())
point =[K-Q]*(N+1)
for i in A:
point[i] += 1
print(*['Yes' if i > 0 else... | """
author : halo2halo
date : 4, Feb, 2020
"""
import sys
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, K, Q, *A = list(map(int, read().split()))
point = [K - Q] * (N + 1)
for i in A:
point[i] += 1
ans = '\n'.j... | p02911 |
def resolve():
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
for i in range(N):
if K + A.count(i+1) - Q > 0:
print('Yes')
else:
print('No')
return
resolve() | def resolve():
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
points = [0] * N
for i in range(Q):
points[A[i]-1] += 1
for i in range(N):
if K + points[i] - Q > 0:
print('Yes')
else:
print('No')
r... | 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 + A.count(i+1) - Q > 0:
print('Yes')
else:
print('No') | N, K, Q = list(map(int, input().split()))
scores = [K-Q] * N
for i in range(Q):
scores[int(eval(input())) - 1] += 1
for score in scores:
if score > 0:
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split()))
alist = []
for i in range(q):
a = int(eval(input()))
alist.append(a - 1)
pscore = [k] * n
for j in range(q):
for k in range(n):
if alist[j] != k:
pscore[k] -= 1
for k in range(n):
if pscore[k] <= 0:
print('No')
else:
print('Yes') | n, k, q = list(map(int, input().split()))
alist = []
for i in range(q):
a = int(eval(input()))
alist.append(a - 1)
pscore = [0] * n
for j in range(q):
pscore[alist[j - 1]] += 1
for i in range(n):
pscore[i] -= (q - k)
if pscore[i] <= 0:
print('No')
else:
print('Yes') | p02911 |
n,k,q = list(map(int,input().split()))
plist = [k]*n
for j in range(q):
s = int(eval(input()))
for i in range(n):
plist[i] -= 1
plist[s-1] += 1
for i in plist:
if i <= 0:
print('No')
else:print('Yes')
| n,k,q = list(map(int,input().split()))
plist = [k-q]*n
for i in range(q):
s = int(eval(input()))
plist[s-1] += 1
for i in plist:
if i <= 0:
print('No')
else:print('Yes') | p02911 |
n,k,q = list(map(int,input().split()))
li = []
for i in range(q):
li.append(int(eval(input())))
for i in range(n):
if k - q + li.count(i+1) > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
li = [k-q] * n
numli = [int(eval(input())) for i in range(q)]
for a in numli:
li[a-1] += 1
for i in li:
if i > 0:
print("Yes")
else:
print("No") | p02911 |
from collections import Counter
N, K, Q = list(map(int, input().strip().split()))
ansl = [int(input().strip()) for _ in range(Q)]
countl = Counter(ansl)
for i in range(N):
pid = i+1
if sum([v for k,v in list(countl.items()) if k != pid]) < K:
print('Yes')
else:
print('No') | from collections import Counter
N, K, Q = map(int, input().strip().split())
ansl = [int(input().strip()) for _ in range(Q)]
countl = Counter(ansl)
sumcountl = sum(countl.values())
for i in range(N):
print('Yes') if sumcountl-countl[i+1] < K else print('No')
| p02911 |
import sys
input=sys.stdin.readline
z=list(map(int,input().split()))
a,b,c=[],[],z[2]-z[1]
for i in range(z[2]):
a.append(int(eval(input())))
for i in range(z[0]):
b.append(a.count(i+1))
for i in range(z[0]):
if c-b[i]>=0:
print('No')
else:
print('Yes') | n,k,q=list(map(int,input().split()))
a,b=[int(eval(input())) for _ in range(q)],[0]*n
for i in a:
b[i-1]+=1
for i in b:
print(('Yes' if i+k-q>0 else 'No')) | p02911 |
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
a = sorted(a)
for i in range(1,n+1):
if len(a) - a.count(i) >= k:
print("No")
else:
print("Yes") | n,k,q = list(map(int,input().split()))
p = [0]*n
for i in range(q):
a = int(eval(input()))
p[a-1] += 1
for i in range(n):
if k > q - p[i]:
print("Yes")
else:
print("No")
| p02911 |
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
temp=int(eval(input()))
a.append(temp)
border=-k+q
res = '\n'.join('Yes' if a.count(j+1)> border else 'No' for j in range(0,n))
print(res)
| n,k,q=(int(x) for x in input().split())
a=[]
p=[0]*n
for i in range(0,q):
temp=int(eval(input()))
p[temp-1]+=1
border=-k+q
res = '\n'.join('Yes' if p[j]> border else 'No' for j in range(0,n))
print(res)
| p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
A.append(int(eval(input())))
pts = [K - Q]*N
for ai in A:
for i, _ in enumerate(pts):
if (i+1)==ai:
pts[i] += 1
for p in pts:
if p>0:
print('Yes')
else:
print('No') | N, K, Q = list(map(int, input().split()))
A = []
for _ in range(Q):
A.append(int(eval(input())))
pts = [K - Q]*N
for ai in A:
pts[ai-1] += 1
for p in pts:
if p>0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q=list(map(int,input().split()))
a=[]
A=[]
for _ in range(Q):
a.append(int(eval(input())))
for _ in range(N):
A.append(int(K))
for n in range(Q):
A[a[n]-1]+=1
for m in range(N):
A[m]-=1
for s in range(N):
if A[s]<1:
print("No")
else:
print("... | N,K,Q=list(map(int,input().split()))
a=[]
A=[]
for _ in range(Q):
a.append(int(eval(input())))
for _ in range(N):
A.append(int(K))
for n in range(Q):
A[a[n]-1]+=1
for s in range(N):
if A[s]-Q<1:
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):
pt = k
pl = a.count(i+1)
if pl > 0:
pt = pt - q + pl
else:
pt -= q
if pt > 0:
print('Yes')
else:
print('No') | n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(q)]
pt = [k-q for _ in range(n)]
for i in a:
pt[i-1] += 1
for i in pt:
if i > 0:
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split()))
ls_a = [int(eval(input())) for _ in range(q)]
ls_p = [k] * n
for i in range(n):
num = 0
num = ls_a.count(i+1)
ls_p[i] += (num - q)
for j in range(n):
if ls_p[j] > 0:
print("Yes")
elif ls_p[j] <= 0:
print("No") | n, k, q = list(map(int, input().split()))
ls_a = [int(eval(input())) for _ in range(q)]
ls_p = [k] * n
ls_c = [0] * n
for i in range(q):
ls_c[ls_a[i] - 1] += 1
for j in range(n):
ls_p[j] += ls_c[j] - q
for l in range(n):
if ls_p[l] > 0:
print("Yes")
elif ls_p[l] <= 0:
... | p02911 |
import sys
input = sys.stdin.readline
def main():
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 a[i] - Q + K > 0:
print('Yes')
else:
print('No')
if __name__ == '_... | import sys
input = sys.stdin.readline
def main():
N, K, Q = list(map(int, input().split()))
a = [K-Q]*N
for _ in range(Q):
a[int(eval(input()))-1] += 1
for i in range(N):
if a[i] > 0:
print('Yes')
else:
print('No')
if __name__ == '__main_... | p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
for i in range(n):
print(("Yes" if k + a.count(i + 1) - q > 0 else "No"))
| n, k, q = list(map(int, input().split()))
nList = [0] * n
for _ in range(q):
nList[int(eval(input())) - 1] += 1
for j in range(n):
print(("Yes" if k + nList[j] - q > 0 else "No"))
| p02911 |
n, k ,q = list(map(int, input().split()))
li = [input() for i in range(q)]
list = []
for j in range(1,n+1):
L = str(j)
if li.count(L) > q - k:
list.append('Yes')
else:
list.append('No')
[print(x) for x in list]
| n, k ,q = list(map(int, input().split()))
listAns = [eval(input()) for i in range(q)]
score = [0] * n
count = 0
for j in listAns:
score[int(j) - 1] += 1
for h in score:
if h > q - k:
print("Yes")
else:
print("No") | p02911 |
num,k,q = list(map(int,input().split()))
arr = [k]*num
for i in range(q):
a = int(eval(input()))
arr = [i-1 for i in arr]
arr[a-1] +=1
for i in range(len(arr)):
if arr[i] > 0:
print("Yes")
else:
print("No")
| num,k,q = list(map(int,input().split()))
arr = [0]*num
for i in range(q):
a = int(eval(input()))
arr[a-1] +=1
arr = [i-(q-k) for i in arr]
for i in range(len(arr)):
if arr[i] > 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(1, Q+1):
ans = list([x-1 for x in ans])
ans[A[i-1]-1] += 1
for k in ans:
if k <= 0:
print('No')
else:
print('Yes') | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
ans = [K-Q]*N
for i in range(1,Q+1):
ans[A[i-1]-1] += 1
for k in ans:
if k <= 0:
print('No')
else:
print('Yes') | p02911 |
n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
# print(A)
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()))
Point = [k - q] * n
for _ in range(q):
Point[int(eval(input())) - 1] += 1
for e in Point:
if e > 0:
print('Yes')
else:
print('No')
| p02911 |
N, K, Q = list(map(int,input().split()))
scores = [K] * N
def minus(ans_i):
for i in range(N):
scores[i] -= 1
scores[ans_i-1] += 1
for i in range(Q):
ans_i = int(eval(input()))
minus(ans_i)
for player in scores:
if player <= 0:
print("No")
else:
pri... | N, K, Q = list(map(int,input().split()))
scores = [0] * N
for i in range(Q):
ans_i = int(eval(input()))
scores[ans_i-1] += 1
for i in range(N):
final_res = K - (Q - scores[i])
if final_res <= 0:
print("No")
else:
print("Yes") | p02911 |
import bisect as bi
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [K]*N
p = 0
for i in range(N+1):
A.append(i+1)
C = sorted(A)
for i in range(N):
B[i] += bi.bisect_left(C,i+2) - p - 1
p = bi.bisect_left(C,i+2)
for i in range(N):
if(B[i] > Q):
... | N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
B = [K]*N
p = 0
for i in range(Q):
B[A[i]-1] += 1
for i in range(N):
if(B[i] > Q):
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
if k - q > 0:
res = ['Yes'] * n
else:
res = ['No'] * n
ans = tuple(set(a))
for i in ans:
if k - q + a.count(i) > 0:
res[i-1] = 'Yes'
print(('\n'.join(map(str, res)))) | n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
if k - q > 0:
res = ['Yes'] * n
else:
res = ['No'] * n
ans = [0] * n
for i in range(len(a)):
ans[a[i]-1] += 1
for i in range(n):
if k - q + ans[i] > 0:
res[i] = 'Yes'
print(('\n'.join(map(str, res)... | p02911 |
NKQ = input().split(' ')
N = int(NKQ[0])
K = int(NKQ[1])
Q = int(NKQ[2])
An = [K] * N
for _ in range(Q):
A = int(eval(input()))
for i in range(N):
An[i] -= 1
An[A-1] += 1
for i in range(N):
if An[i] > 0:
print('Yes')
else:
print('No') | NKQ = input().split(' ')
N = int(NKQ[0])
K = int(NKQ[1])
Q = int(NKQ[2])
Bn = [0] * N
for _ in range(Q):
A = int(eval(input()))
Bn[A-1] += 1
for i in range(N):
if K - Q + Bn[i] > 0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q=list(map(int,input().split()))
A=[]
score=[K]*N
for i in range(0,Q):
A.append(int(eval(input()))-1)
for j in range(0,N):
score[j]=score[j]-(Q-A.count(j))
if(score[j]>0):
print("Yes")
else:
print("No")
| N,K,Q=list(map(int,input().split()))
A=[0]*N
score=[K]*N
for i in range(0,Q):
a=int(eval(input()))
A[a-1]+=1
for j in range(0,N):
score[j]=score[j]-(Q-A[j])
if(score[j]>0):
print("Yes")
else:
print("No")
| p02911 |
n,k,q = list(map(int,input().split()))
d = {}
for i in range(1,n+1):
d[i] = k
def s (x:int):
for k,v in list(d.items()):
if k == x:
pass
else:
d[k] = v-1
for _ in range(q):
a = int(eval(input()))
s (a)
for v in list(d.values()):
if 0 < v:
... | n,k,q = list(map(int,input().split()))
d = {}
for _ in range(q):
a = int(eval(input()))
if a in d:
d[a] += 1
else:
d[a] = 1
for i in range(1,n+1):
if not i in d:
if q < k:
print ("Yes")
else:
print ("No")
else:
if k <... | p02911 |
n, k, q = tuple(map(int, input().split()))
scores = [k]*n
for i in range(q):
answered = int(eval(input())) - 1
scores[answered] += 1
scores = [v - 1 for v in scores]
for i in range(n):
result = "Yes" if scores[i] > 0 else "No"
print(result) | n, k, q = tuple(map(int, input().split()))
answereds = [0]*n
for i in range(q):
answered = int(eval(input())) - 1
answereds[answered] += 1
for i in range(n):
result = "Yes" if q-answereds[i] < k else "No"
print(result) | p02911 |
n,k,q = list(map(int,input().split()))
a = [] # 順番
for _ in range(q):
a.append(int(eval(input())))
point = [k] * n
for win in a: # 勝った人(a[win-1])以外を下げる
point[win-1] += 1
for i in range(n):
point[i] -= 1
# print(point)
#print(point)
for i in point:
if i <=... | n,k,q = list(map(int,input().split())) #N人、Kpoint、Q回答
a = [] # 順番
for _ in range(q):
a.append(int(eval(input())))
# 最初に回数分引く
point = [k-q] * n
for win in a:
point[win-1] += 1
#print(point)
for i in point:
if i <= 0:
print("No")
elif i >= 1:
print("Yes")
| p02911 |
def quiz(N,K,Q):
if K>Q:
for ans in range(N):
print('Yes')
else:
an=[]
for qui in range(Q):
an.append(int(eval(input())))
po=(Q+1)-K
for su in range(1,N+1):
if an.count(su) >=po:
print('Yes')
else... | n, k, q = list(map(int, input().split()))
b = [k - q] * n
for i in range(q):
ai = int(eval(input()))
b[ai - 1] += 1
for j in range(n):
if b[j] > 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()))
score = [k] * n
for a in A:
for i in range(n):
if i != a-1:
score[i] -= 1
for i in range(n):
if score[i] <= 0:
print('No')
else:
print('Yes') | n, k, q = list(map(int, input().split()))
A = [0] * q
for i in range(q):
A[i] = int(eval(input()))
score = [k - q] * n
for a in A:
score[a-1] += 1
# print(score)
for i in range(n):
if score[i] <= 0:
print('No')
else:
print('Yes') | p02911 |
n, k, q = list(map(int, input().split()))
ai = [int(eval(input())) for _ in range(q)]
bi = [int(k) for _ in range(n)]
for i in range(q):
for s in range(n):
if ai[i]-1 != s:
bi[s] -= 1
for i in range(n):
if bi[i] > 0:
print("Yes")
else:
print("N... | n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
b = [int(0) for _ in range(n)]
for i in a:
b[i-1] += 1
for i in range(n):
if b[i] > q-k:
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]*n
for i in range(q):
solver = a[i]-1
for j in range(0,solver):
point[j] -= 1
for j in range(solver+1,n):
point[j] -= 1
for i in range(n):
if point[i] > 0:
print('Yes... | n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
point = [0]*n
for i in range(q):
point[a[i]-1] += 1
for i in range(n):
if point[i] > q-k:
print('Yes')
else:
print('No') | p02911 |
n, k, q = list(map(int, input().split(' ')))
scores = [k for i in range(n)]
for i in range(q):
a = int(eval(input()))
for j in range(n):
scores[j] -= 1
scores[a-1] += 1
for i in range(n):
if scores[i] > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split(" ")))
liste = [(k-q) for i in range(n)]
for i in range(q):
a = int(eval(input()))
liste[a-1] += 1
for i in liste:
if i > 0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
win_list = [int(eval(input())) for i in range(Q)]
score = [K for i in range(N)]
for x in win_list:
for a, b in enumerate(score):
if not a == x-1:
score[a] = b-1
for s in score:
if s > 0:
print('Yes')
else:
print('N... | N,K,Q = list(map(int,input().split()))
A = list(int(eval(input())) for _ in range(Q))
correct = [K-Q] * N
for i in range(Q):
correct[A[i]-1] += 1
for i in correct:
if i > 0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
life = [K] * N
for i in range(Q):
life[A[i]-1] += 1
life = list([x-Q for x in life])
for l in life:
if l > 0:
print("Yes")
else:
print("No") | N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
life = [K-Q] * N
for i in range(Q):
life[A[i]-1] += 1
for l in life:
if l > 0:
print("Yes")
else:
print("No") | p02911 |
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
c = [0]*n
for i in a:
c[i-1] += 1
for i in range(n) :
if sum(c)-c[i] >= k :
print("No")
else :
print("Yes")
| n,k,q = list(map(int,input().split()))
c = [k-q]*(n+1)
for i in range(q):
c[int(eval(input()))] += 1
for i in range(1,n+1) :
if c[i]>0 :
print("Yes")
else :
print("No")
| p02911 |
N,K,Q=list(map(int,input().split()))
P=[K]*N
for i in range(Q):
a=int(eval(input()))
for n in range(N):
if n!=a-1:P[n]-=1
for i in range(N):
if P[i]>0:print("Yes")
else:print("No") | N,K,Q=list(map(int,input().split()))
P=[K-Q]*N
for i in range(Q):
a=int(eval(input()))
P[a-1]+=1
for i in range(N):
if P[i]>0:print("Yes")
else:print("No") | p02911 |
N,K,Q=list(map(int, input().split()))
score=[K]*N
for i in range(Q):
A = int(eval(input()))
score[A-1]+=1
score = [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=[K-Q]*N
for i in range(Q):
A = int(eval(input()))
score[A-1]+=1
for i in range(N):
if score[i] > 0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [K-Q for _ in range(N)]
for i in range(1, N+1):
point[i-1] = point[i-1] + A.count(i)
print(('Yes' if point[i-1]>0 else 'No')) | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [K-Q]*N
for i in A:
point[i-1] += 1
for p in point:
print(('Yes' if p > 0 else 'No'))
| p02911 |
N, K ,Q = (int(nkq) for nkq in input().split())
A = []
score_list = [-1] + [K for _ in range(N)]
for _ in range(Q):
A.append(int(eval(input())))
for a in A:
score_list = [-1] + [score_list[i]-1 if i != a else score_list[i] for i in range(1, N+1)]
for score in score_list[1:]:
if score > 0:
... | N, K ,Q = (int(nkq) for nkq in input().split())
A = []
score_list = [-1] + [K-Q for _ in range(N)]
for _ in range(Q):
A.append(int(eval(input())))
for a in A:
score_list[a] += 1
for score in score_list[1:]:
if score > 0:
print("Yes")
else:
print("No") | p02911 |
n,k,q=list(map(int,input().split()))
s=[k]*n
for i in range(q):
a=int(input())
s=list(map(lambda x:x-1,s))
s[a-1]+=1
t=list(map(lambda x:'Yes' if x>0 else 'No',s))
[print(i) for i in t]
| n,k,q=list(map(int,input().split()))
s=[k]*n
for i in range(q):
a=int(input())
s[a-1]+=1
s=list(map(lambda x:x-q,s))
t=list(map(lambda x:print('Yes') if x>0 else print('No'),s))
| p02911 |
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for i in range(Q)]
for i in range(N):
temp = A.count(i+1)
if K > Q-temp:
print('Yes')
else:
print('No')
| N,K,Q = list(map(int,input().split()))
A = []
for i in range(Q):
A.append(int(eval(input())))
points = [K-Q]*N
for i in range(Q):
points[A[i]-1] += 1
for i in range(N):
if points[i] > 0:
print('Yes')
else:
print('No')
| p02911 |
N,K,Q=list(map(int,input().split()))
mylist=[]
pointlist=[]
for i in range(Q):
mylist.append(int(eval(input())))
#print(N,K,Q)
#print(mylist)
for i in range(N):
pointlist.append(K)
i=0
while i<Q:
winner=mylist[i]-1
#winner以外のポイントを減らす
for j in range(N):
if j==winne... | N,K,Q=list(map(int,input().split()))
mylist=[]
pointlist=[]
for i in range(Q):
mylist.append(int(eval(input())))
for i in range(N):
#全員にKポイント与えるが、Qポイント引く
pointlist.append(K-Q)
#正解者に1ぽいんとずつ足す。
for i in range(Q):
#mylist[i]をjとしたら、j番目の人が勝者ということ。pointlist[j-1]に1を足す。
j=mylist[i]
... | p02911 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.