Problem:


Score: 300 points

Problem Statement

Takahashi has decided to hold fastest-finger-fast quiz games. Kizahashi, who is in charge of making the scoreboard, is struggling to write the program that manages the players' scores in a game, which proceeds as follows.

A game is played by N players, numbered 1 to N. At the beginning of a game, each player has K points.

When a player correctly answers a question, each of the other N-1 players receives minus one (-1) point. There is no other factor that affects the players' scores.

At the end of a game, the players with 0 points or lower are eliminated, and the remaining players survive.

In the last game, the players gave a total of Q correct answers, the i-th of which was given by Player A_i.
For Kizahashi, write a program that determines whether each of the N players survived this game.

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq K \leq 10^9

1 \leq Q \leq 10^5

1 \leq A_i \leq N\ (1 \leq i \leq Q)

Input

Input is given from Standard Input in the following format:

N K Q
A_1
A_2
.
.
.
A_Q

Output

Print N lines. The i-th line should contain Yes if Player i survived the game, and No otherwise.

Sample Input 1

6 3 4
3
1
3
2

Sample Output 1

No
No
Yes
No
No
No

In the beginning, the players' scores are (3, 3, 3, 3, 3, 3).

Player 3 correctly answers a question. The players' scores are now (2, 2, 3, 2, 2, 2).

Player 1 correctly answers a question. The players' scores are now (2, 1, 2, 1, 1, 1).

Player 3 correctly answers a question. The players' scores are now (1, 0, 2, 0, 0, 0).

Player 2 correctly answers a question. The players' scores are now (0, 0, 1, -1, -1, -1).

Players 1, 2, 4, 5 and 6, who have 0 points or lower, are eliminated, and Player 3 survives this game.

Sample Input 2

6 5 4
3
1
3
2

Sample Output 2

Yes
Yes
Yes
Yes
Yes
Yes

Sample Input 3

10 13 15
3
1
4
1
5
9
2
6
5
3
5
8
9
7
9

Sample Output 3

No
No
No
No
Yes
No
No
No
Yes
No



Sample input:
6 3 4
3
1
3
2


Sample output:
No
No
Yes
No
No
No

Submission status: Accepted

Solution code:
import numpy as np
N,K,Q = map(int,input().split())
P = np.array(N*[K])

for q in range(Q):
  a = int(input())
  P[a-1]+=1
  P-=1

for n in range(N):
  if P[n]<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
count = [0] * N
for _ in range(Q):
  count[int(input())-1] += 1
for c in count:
  if K - (Q - c) > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

res = [0] * N

for a in A:
    res[a - 1] += 1
    
for i in range(N):
    if K - Q + res[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
cnt=[0]*(n+1)
for _ in range(q):
  cnt[int(input())]+=1
for i in range(1,n+1):
  if k-(q-cnt[i])>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
point = [0] * (n+1)
for _ in range(q):
  a = int(input())
  point[a] += 1

for i in range(1, n+1):
  if k + point[i] > q:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
N, K, Q = list(map(int, input().split()))

scores = [K-Q] * N
for i in range(Q):
    scores[int(input()) - 1] += 1

for score in scores:
    if score > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
data = [0]*N
for _ in range(Q):
    A = int(input())
    A -= 1
    data[A] += 1
print(*list("Yes" if K-Q+x>0 else "No" for x in data), sep="\n")

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())
ac = [0] * n
for _ in range(q):
    a = int(input())
    ac[a-1] += 1

ss = sum(ac)
for a in ac:
    print('Yes' if k-ss+a > 0 else 'No')

Submission status: Accepted

Solution code:

N, K, Q = map(int, input().split())
X = [int(input()) for _ in range(Q)]

cnt = [0] * N
for q in X:
    cnt[q - 1] += 1

for i in range(N):
    if Q - cnt[i] >= K:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I()
N,K,Q = LI()
A = [I() for _ in range(Q)]

c = collections.Counter(A)
# print(c)

B = np.zeros(N,dtype='int')
for i in range(1,N+1):
    B[i-1] = c[i]

# print(B)
ans = (B - Q + K) > 0
for b in ans:
    # print(b)
    if b:
        print('Yes')
    else:
        print('No')

#A,B = zip(*AB)
# A = np.array(_A)

# B = np.zeros(N)
# B[0:-K+1] = A

# 和 - 自分の得点
# B_sum = np.sum(B)
# C = B - B_sum
# print(C)
# print(np.where(B > -K, True, False))
# print(C>-K)

# if ans:
#     print('Yes')
# else:
#     print('No')

Submission status: Accepted

Solution code:
n,k,q = list(map(int,input().split()))
point = [k-q] * n

for i in range(q):
  tmp = int(input()) - 1
  point[tmp] += 1

for i in range(n):
  if point[i] >= 1:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter

N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

c = Counter(A)
for i in range(N):
    if K - (Q - c[i+1]) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
points = [k]*n
win = [0]*n

for i in range(q):
    a = int(input())
    win[a-1] += 1

for i in range(n):
    point = points[i]-q+win[i]
    if point <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
n,k,q =map(int,input().split())
a = [int(input()) for _ 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+1:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())


point_l = [k-q] * n
for _ in range(q):
 ans = int(input())
 point_l[ans-1] += 1

for i in range(n):
  print('Yes' if point_l[i]>0 else 'No')

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
# 全問不正解の場合を初期値にする
l = [K - Q] * N
# 正解者に１ポイント加算
for _ in range(Q):
    A = int(input())
    l[A - 1] += 1

for li in l:
    if li <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]

cnt = [0] * n

for i in a:
    cnt[i - 1] += 1

for c in cnt:
    if k - (q - c) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from sys import stdin

n, k, q = map(int, stdin.readline().rstrip().split())
a = [0] * q
for i in range(q):
    a[i] = int(stdin.readline().rstrip())

l = [0] * (n+1)

for ai in a:
    l[ai] += 1

for i in range(n):
    j = i+1
    point = k - (q-l[j])
    if point <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
users = {i + 1: 0 for i in range(n)}
for i in range(q):
    a = int(input())
    users[a] += 1

output = []
for user in users.values():
    if k - q + user > 0: output.append("Yes")
    else: output.append("No")
print(*output, sep="\n")

Submission status: Accepted

Solution code:
import numpy as np
n, k, q = map(int, input().split())
A = np.array([int(input()) - 1 for _ in range(q)])
score = np.zeros(n)
for i in A:
    score[i] += 1
score = k + score - q
print(*np.where(score > 0, 'Yes', 'No'), sep='\n')

Submission status: Accepted

Solution code:
import sys
import numpy as np


def main(stdin):
    N, K, Q = stdin[:3]
    ans = np.full(N + 1, K - Q, dtype=np.int64)
    for i in stdin[3:]:
        ans[i] += 1
    return ans


if sys.argv[-1] == 'ONLINE_JUDGE':
    import numba
    from numba.pycc import CC
    cc = CC('my_module')
    cc.export('main', 'i8[:](i8[:],)')(main)
    # b1: bool, i4: int32, i8: int64, double: f8, [:], [:, :]
    cc.compile()
else:
    #from my_module import main
    stdin = np.array([int(_) for _ in open(0).read().split()])
    ans = main(stdin)
    print(*np.where(ans > 0, 'Yes', 'No')[1:], sep='\n')

Submission status: Accepted

Solution code:
import sys
import numpy as np


def main(stdin):
    N, K, Q = stdin[:3]
    ans = np.full(N + 1, K - Q, dtype=np.int64)
    for i in stdin[3:]:
        ans[i] += 1
    ans = np.where(ans > 0, 'Yes', 'No')
    return ans[1:]


if sys.argv[-1] == 'ONLINE_JUDGE':
    import numba
    from numba.pycc import CC
    cc = CC('my_module')
    cc.export('main', 'i8[:](i8[:],)')(main)
    # b1: bool, i4: int32, i8: int64, double: f8, [:], [:, :]
    cc.compile()
else:
    #from my_module import main
    stdin = np.array([int(_) for _ in open(0).read().split()])
    print(*main(stdin), sep='\n')

Submission status: Accepted

Solution code:
N,Q,K = map(int,input().split())
Answer_List = {}
for i in range(K):
    Correct = int(input())
    if Correct in Answer_List:
        Answer_List[Correct] = Answer_List[Correct] + 1
    else:
        Answer_List[Correct] = 1

Lose_Status = Q - K
if Lose_Status > 0:
    for j in range(N):
        print("Yes")
else:
    Standard = abs(Lose_Status) + 1
    for j in range(N):
        if j + 1 in Answer_List:
            if Answer_List[j + 1] >= Standard:
                print("Yes")
            else:
                print("No")
        else:
                print("No")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
an = [0] * n
for i in range(q):
    answer = int(input())
    an[answer - 1] += 1

for i in range(n):
    if an[i] + k > q:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

N,K,Q = [int(i) for i in input().split()]
A = [0]*(Q+1)
P = [K-Q]*(N+1)
for i in range(1,Q+1):
    A[i] = int(input())
    P[A[i]] += 1

for p in P[1:]:
    if p <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.readline
import time
import math
import itertools as it
def inp():
    return int(input())
def inpl():
    return list(map(int, input().split()))
start_time = time.perf_counter()
# ------------------------------

n, k, q = inpl()
A = [inp()-1 for i in range(q)]
dp = [0] * n
for a in A:
    dp[a] += 1
cnt = 0
for i in dp:
    if k - q + i > 0:
        print('Yes')
    else:
        print('No')

# -----------------------------
end_time = time.perf_counter()
print('time:', end_time-start_time, file=sys.stderr)

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

points = [K - Q]*N
for i in A:
    points[i - 1] += 1

for i in points:
    if i > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split());a=[k-q for i in range(n)]
for _ in range(q): a[int(input())-1]+=1
print(*['Yes' if i>0 else 'No' for i in a],sep='\n')

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
point=[0 for i in range(n)]
for i in range(q):
    a=int(input())
    point[a-1]+=1


for i in point:
    if 0<k-q+i:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
score_board = [K-Q for _ in range(N)]

for a in A:
  score_board[a-1] += 1
  
for res in score_board:
  if res > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
n, k, q = list(map(int, input().split()))

correct = {}
for parti in range(1, n+1):
    correct[parti] = 0

for i in range(q):
    a = int(input())
    correct[a] += 1

for parti in range(1, n+1):
    if k - q + correct[parti] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
points = [k] * n
a = []
for i in range(q):
    a.append(int(input())-1)
for cand in a:
    points[cand] += 1
points = [i-q for i in points]
ans = ["Yes" if i > 0 else "No" for i in points]
print(*ans, sep="\n")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
p = [0] * n

for ai in a:
    p[ai-1] += 1

ans = 0
for pi in p:
    if k-q+pi > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
a=[]
for _ in range(q):
  a.append(int(input()))

points = [k]*(n+1)
plus = [0]*(n+1)
for i in range(q):
  plus[a[i]] += 1

for i in range(1,n+1):
  points[i] = points[i] - q + plus[i]
  if points[i] >= 1:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
n,k,q=map(int, input().split())
co=[0]*(n+1)
for _ in range(q):
  co[int(input())]+=1
for i in range(1,n+1):
  if co[i]+k>q:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
def readinput():
    n,k,q=map(int,input().split())
    a=[]
    for _ in range(q):
        a.append(int(input()))
    return n,k,q,a

def main(n,k,q,a):
    win=[0]*(n+1)
    for i in range(q):
        win[a[i]]+=1
    ans=[]
    #print(win)
    for i in range(1,n+1):
        point=win[i]-q+k
        if point>0:
            ans.append('Yes')
        else:
            ans.append('No')

    return ans

if __name__=='__main__':
    n,k,q,a=readinput()
    ans=main(n,k,q,a)
    for i in range(n):
        print(ans[i])

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
c = [0] * n
for ai in a:
    c[ai - 1] += 1
ans = ['Yes' if k - q + ci > 0 else 'No' for ci in c]
print(*ans, sep='\n')

Submission status: Accepted

Solution code:
import heapq
t = 1
def max(a,b):
	if a > b:
		return a
	return b
while t > 0:
	t -= 1
	n,k,q = map(int,input().split())	
	v = []
	l = []
	# v = list(map(int,input().strip().split()))[0:n]
	for i in range(q):
		p = int(input().strip())
		v.append(p)
	for i in range(n):
		l.append(0)
	for i in v:
		l[i-1] += 1
	# print(l)
	for i in range(n):
		if(l[i] <= q-k):
			print("No")
		else:
			print("Yes")
	# for i in range(n):
	# 	v[i] = -v[i]
	# heapq.heapify(v)
	# for i in range(m):
	# 	x = heapq.heappop(v)
	# 	x = -x
	# 	x = x//2
	# 	heapq.heappush(v,-x)
	# ans = 0
	# for i in range(n):
	# 	ans += (-heapq.heappop(v))
	# print(ans)

Submission status: Accepted

Solution code:
n,k,q= map(int,input().split())
cnt=[k-q]*n
for i in range(q):
  cnt[int(input())-1]+=1
for i in range(n):
  if cnt[i]>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter
n ,k, q = map(int,input().split())
al = []
for _ in range(q):
    al.append(int(input()))

if k > q:
    for _ in  range(n):
        print('Yes')
    exit()

Ca = Counter(al)

for i in range(1,n+1) :
    if Ca[i] >= q-k + 1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
p=[0]*N
s=0
for x in range(Q):
  A=int(input())
  p[A-1]+=1
  s+=1
for y in range(N):
  if K+p[y]-s>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
n = [K] * N

for i in range(Q):
    A = int(input())
    n[A - 1] += 1

for result in n:
    if result - Q > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
lsN = [K-Q]*N
for i in range(Q) :
    p = int(input())
    lsN[p-1] = lsN[p-1]+1

for i in lsN:
    if i > 0:
        print('Yes')
    elif i <= 0:
        print('No')

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
mem = [0]*N
A_l = [int(input()) for i in range(Q)]
for x in A_l:
  mem[x-1]+=1
for i in mem:
  if K-(Q-i) > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
N,K,Q = [int(i) for i in input().split()]
ppl = [0]*(N + 1)
for _ in range(Q):
    A = int(input())
    if A == 1:
        ppl[1] += 1
        if N != 2:
            ppl[-1] -= 1
    elif A == N:
        ppl[0] += 1
        if N != 2:
            ppl[-2] -= 1
    else:
        ppl[0] += 1
        ppl[A-1] -= 1
        ppl[A] += 1
        ppl[-1] -= 1
ans = ["Yes"] * N
ans[0] = "Yes" if ppl[0] < K else "No"
for i in range(1,N):
    ppl[i] += ppl[i-1]
    if ppl[i] >= K:
        ans[i] = "No"
print("\n".join(ans))

Submission status: Accepted

Solution code:
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]

C = collections.Counter(A)
for i in range(1, n+1):
    tmp = k - q + C[i]
    if tmp > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
A = [int(input()) for i in range(Q)]
num = K-Q
point = [num]*N

for a in A:
  point[a-1] += 1

for po in point:
  if po > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
points = [0 for i in range(N)]
for i in range(Q):
  a = int(input())
  points[a-1] += 1
  
for i in range(N):
  if K-Q+points[i]<=0:
    print('No')
  else:print('Yes')

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
ans = [0] * N
for _ in range(Q):
    A = int(input())
    ans[A-1] += 1
for i in range(N):
     print('Yes' if K - Q + ans[i] > 0 else 'No')

Submission status: Accepted

Solution code:
n,k,q,*a=map(int,open(0).read().split())
import numpy as np
points=np.full(n,k)

for i in range(q):
    points-=1
    points[a[i]-1]+=1

for i in range(n):
    print('NYoe s'[points[i]>0::2])

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
a=[]
for i in range(q):
    a.append(int(input()))
ans=[-1]+[0]*n

for i in range(q):
    ans[a[i]]+=1

for i in range(1,n+1):
    if k-(q-ans[i])>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import sys
from collections import Counter
N, K, Q = map(int, input().split())

result = ["No"]*N
Npoint = [K-Q]*N

Alist = [int(input())-1 for _ in range(Q)]

if K > Q:
    for _ in range(N):
        print("Yes")
    sys.exit()

Alist = Counter(Alist)

for k, v in Alist.items():
    Npoint[k] += v
    if Npoint[k] >= 1:
        result[k] = "Yes"

for i in result:
    print(i)

Submission status: Accepted

Solution code:
import numpy
N, K, Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
p = numpy.full(N, K)
for i in A:
  p -= 1
  p[i-1] += 1
for i in range(N):
  print('Yes' if p[i] > 0 else 'No')

Submission status: Accepted

Solution code:
import numpy as np
N, K, Q = input().split(' ')
N = int(N)
K = int(K)
Q = int(Q)
P = np.ones(N) * K
for i in range(Q):
  A = int(input())
  P[A-1] += 1
P -= Q
for i in range(N):
  if P[i] > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(N, K, Q, As):
    rev_point = [0] * (N + 1)
    for A in As:
        rev_point[A] += 1
    for rp in rev_point[1:]:
        if K - (Q - rp) > 0:
            print('Yes')
        else:
            print('No')


if __name__ == '__main__':
    # S = input()
    # N = int(input())
    N, K, Q = map(int, input().split())
    As = [int(input()) for _ in range(Q)]
    # Bs = [int(i) for i in input().split()]
    solve(N, K, Q, As)

Submission status: Accepted

Solution code:
n, k, q = list(map(int, input().split()))
a = [int(input()) for i in range(q)]
member = [0] * n
for i in a:
    member[i - 1] += 1
for i in member:
    if i > q - k or k > q:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q,*A = map(int, open(0).read().split())
ans = [K] * N

for a in A:
    ans[a-1] += 1

for x in ans:
    y = x - Q
    print('Yes' if y > 0 else 'No')

Submission status: Accepted

Solution code:
#正解者以外のポイントを1減らすことと、全員のポイントを1減らしてから正解者のポイントだけ1増やすのは同じこと
from collections import Counter
n, k, q = map(int, input().split())
point = k - q
participant = [point] * n
answer = [int(input()) for _ in range(q)]
count_a = Counter(answer)


for key, value in count_a.items():
    participant[key-1] += value

for i in participant:
    if i > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# 37
N,K,Q = map(int,input().split())
n = [ 0 for i in range(N)]
for i in range(Q):
    A = int(input()) -1
    n[A] += 1
    
k = K-Q

for i in range(N):
    n[i] = k + n[i]
    
for i in n:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
#
# Created: Jul, 14, 2020 14:47:24 by Nobody
# $Author$
# $Date$
# $URL$
__giturl__ = "$URL$"


from collections import defaultdict
from collections import deque
from collections import OrderedDict
import itertools
from sys import stdin
input = stdin.readline


def main():
  N, K, Q = list(map(int, input().split()))
  A = [int(input())-1 for _ in range(Q)]

  num_ans = [0]*(N)
  for i in range(Q):
    num_ans[A[i]] += 1

  for i in range(N):
    score = max(0, K-Q+num_ans[i])
    if score:
      print('Yes')
    else:
      print('No')


if(__name__ == '__main__'):
  main()

Submission status: Accepted

Solution code:
def resolve():
    N, K, Q = list(map(int, input().split()))
    A = [int(input()) for _ in range(Q)]
    points = [0 for _ in range(N)]
    for a in A:
        points[a-1] += 1
    for p in points:
        print("Yes" if Q-K<p else "No")


    
if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().strip().split())
A=[int(input()) for _ in range(Q)]

dp=[0 for _ in range(N)]
for n in range(Q):
    dp[A[n]-1]+=1

for n in range(N):
    if dp[n]+K-Q>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
from collections import Counter
N,K,Q = map(int,input().split())
A_list = []
for _ in range(Q):
  A = int(input())
  A_list.append(A)
A_Counter = Counter(A_list)
for i in range(1,N+1):
  print("Yes" if K + A_Counter[i] - Q > 0 else "No")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [0] * N
for i in range(Q):
    A[int(input()) - 1] += 1 
for i in range(N):
    if A[i] > Q - K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
player = [0] * n
for i in range(q):
    player[int(input())-1] += 1
result = ['Yes' if k - q + player[i] > 0 else 'No' for i in range(n)]
for i in result:
    print(i)

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = list(int(input()) for i in range(q))
add = [0] * n
def func(x) :
    return k-q+x
for i in range(q) :
    add[a[i]-1] += 1
point = list(map(func, add))
for _ in range(n) :
    if point[_] <= 0 :
        print("No")
    else :
        print("Yes")

Submission status: Accepted

Solution code:
import sys
import numpy as np
input = sys.stdin.readline

def main():
    N, K, Q = map(int, input().split())
    vals = np.array([K for _ in range(N)])
    for _ in range(Q):
        A = int(input())
        vals -= 1
        vals[A-1] += 1
    for v in vals:
        if v > 0:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
a_list = [int(input()) for _ in range(Q)]

point = [0] * N
for a in a_list:
    point[a-1] += 1

for i in point:
    if K - (Q - i) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
A = []
B = []
for j in range(N):
    B.append(K-Q)
for i in range(Q):
    A.append(int(input()))
    B[A[i]-1] += 1
for j in range(N):
    if B[j] >= 1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int,input().split())
a = [int(input()) for _ in range(q)]

cnt = [k-q]*(n+1)
for i in a:
    cnt[i] += 1

ans = []
for i in range(1, n+1):
    if cnt[i] > 0:
        ans.append('Yes')
    else:
        ans.append('No')
print('\n'.join(ans))

Submission status: Accepted

Solution code:
import collections

N, K, Q = map(int, input().split())
A = [int(input()) - 1 for i in range(Q)]
A_count = collections.Counter(A)
A_sum = sum(A_count.values())
for i in range(N):
    if K - (A_sum - A_count[i]) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
lst=[0]*n
for i in range(q):
  person=int(input())
  lst[person-1]+=1
for p in range(n):
  temp=k-q+lst[p]
  if temp<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
score = [0]*N
for _ in range(Q):
  a = int(input())-1
  score[a]+=1
for s in score:
  if K-Q+s>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())

points = [0] * n

for i in range(q):
    points[int(input()) - 1] += 1

for point in points:
    if(point > q - k):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
L=[0]*(N)

for i in range(Q):
    a=int(input())
    L[a-1]+=1

for l in L:
    if K+l-Q >0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
#C
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
people = [0] * n
for i in a:
    people[i-1] += 1
# print(people)
for i in people:
    if k <= q - i:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
l = [k-q] * n
for i in a:
  l[i-1] += 1
for f in l:
  if f <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys

# import bisect
# import numpy as np
from collections import deque
# map(int, sys.stdin.read().split())
# import heapq
#import bisect
#import math

from collections import Counter


def input():
    return sys.stdin.readline().rstrip()


def main():
    N,K,Q =map(int,input().split())
    A =[]
    for i in range(Q):
        A.append(int(input()))
    c = Counter(A)
    for i in range(N):
        if K-Q+c[i+1] >0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    import bisect
    n, k, q = map(int, input().split())
    indic = {}
    for _ in range(q):
        a = int(input())
        if a in indic:
            indic[a] += 1
        else:
            indic[a] = 1
    
    for i in range(n):
        if i+1 not in indic:
            tensuu = k - q
        else:
            tensuu = k - q + indic[i+1]
        if tensuu <= 0:
            print('No')
        else:
            print('Yes')
    


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

def solve():
    dp = [0] * N
    for i in range(Q):
        dp[A[i]-1] += 1
    for j in range(N):
        if K - (Q - dp[j]) > 0:
            print("Yes")
        else:
            print("No")
#    print(dp)

if __name__ == "__main__":
    N,K,Q = list(map(int, input().split()))
    A = [int(input()) for _ in range(Q)]
    solve()

Submission status: Accepted

Solution code:
N, K, Q = list(map(int, input().split()))
A = [K] * N
for i in range(Q):
    a = int(input())
    A[a - 1] += 1
for i in range(N):
    if A[i] - Q <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
point = [0]*N
for i in range(Q):
  a = A[i]
  point[a-1] += 1
for i in range(N):
  point[i] -= (Q-K)
for p in range(N):
  if point[p] <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for A in range(q)]
ans = [k]*(n+1)
for i in range(1,q+1):
	ans[a[i-1]] += 1
for j in range(1,n+1):
	ans[j] -= q
ans.pop(0)
for h in range(n):
	print("Yes" if ans[h] > 0 else "No")

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
ans=[0]*n
for _ in range(q):
    a=int(input())
    ans[a-1]+=1
for i in range(n):
    if ans[i]>q-k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
p=[0 for i in range(n)]
if k>q:
    for i in range(n):
        print("Yes")
else:
    for i in range(q):
        a=int(input())
        p[a-1]+=1
    for i in p:
        if i<q-k+1:
            print("No")
        else:
            print("Yes")

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())

li = [0]*N

for _ in range(Q):
    index = int(input())-1
    li[index]+=1


for num in li:
    if K>Q-num:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())

a_cnt = [0]*n
for _ in range(q):
    a = int(input()) - 1
    a_cnt[a] += 1


for a in a_cnt:
    if k - (q-a) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]

pts = [0 for _ in range(n)]
for i in range(q):
    pts[a[i] - 1] += 1

for i in range(n):
    if k - (q - pts[i]) > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q=map(int, input().split())
l = [k-q for _ in range(n)]
#print(l)
for i in range(q):
  l[int(input())-1]+=1
for s in l:
  if s>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
n,k,q=list(map(int,input().split()))
li=[k for _ in range(n)]

for _ in range(q):
  a=int(input())
  li[a-1] += 1
  
li=[l-q for l in li]

for l in li:
  print("No") if l <= 0 else print("Yes")

Submission status: Accepted

Solution code:
n,k,q, *aa = map(int, open(0).read().split())

scores = [k-q]*n

for a in aa:
    scores[a-1] += 1

for s in scores:
    if s<=0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
from collections import Counter
n, k, q = map(int, input().split())
a = list(int(input()) for _ in range(q))
mycounter = Counter(a)
for i in range(n):
    ans = "Yes" if q - mycounter[i+1] < k else "No"
    print(ans)

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
n_score = [0] * n
for i in range(q):
    n_score[int(input()) - 1] += 1

for j in n_score:
    if k + j - q > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
def resolve():
    n, k, q = map(int, input().split())
    score = [0] * n
    for _ in range(q):
        a = int(input())
        score[a-1] += 1
    for i in range(n):
        s = k + score[i] - q
        if s > 0:
            print("Yes")
        else:
            print("No")
resolve()

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
participant_score = [K] * N
for i in range(Q):
    A_i = int(input())
    participant_score[A_i - 1] += 1
[print('Yes' if participant_score[i] - Q > 0 else 'No') for i in range(N)]