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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    if i - Q > 0:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

Solution code:
import sys

n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]

if k>q:
    for i in range(n):
        print('Yes')
    sys.exit()

d=[0]*n

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

print(d)

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

Submission status: Wrong Answer

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

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

for m in M:
  if m<=0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

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

ans = ['yes' if K + v - Q > 0 else 'No' for v in l]

for a in ans:
    print(a)

Submission status: Wrong Answer

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

score = [K-Q]*N

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

for j in score:
    if j > 0:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

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

correct = [0]*N

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

print(correct)

for i in range(N):
    score = K - (Q-correct[i])
    if score <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
N, K, Q = map(int, input().split())
A = [int(input().rstrip()) for i in range(Q)]
#print(A)
score =[0]*(N)


for i in range(Q):
    score[A[i]-1] += 1
#print(score)

for i in range(N):
    if K+score[i]-Q >0:
        print('yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
N, K, Q = map(int, input().split())
A = [int(input().rstrip()) for i in range(Q)]
print(A)
score =[0]*(N)


for i in range(Q):
    score[A[i]-1] += 1
print(score)


for i in range(N):
    if K+score[i]-Q >0:
        print('yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
N, K, Q = map(int,input().split())
d = defaultdict(int)
for _ in range(Q):
  a = int(input())
  d[a]+=1
for i in range(1,N+1):
  if K-Q+d[i]>=0:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

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

cnt_list = [(k-q)]*n
if q < k:
    for _ in range(n):
        print('Yes')
else:
    for i in answers:
        cnt_list[i-1] += 1

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

Submission status: Wrong Answer

Solution code:
X = list(map(int, input().split()))
A = []
B=[]
C=[]
for _ in range(X[2]):
    A.append(int(input()))
for _ in range(X[0]):
    B.append(X[1]-X[2])
for i in range(0,X[2]):
    B[A[i]-1]=B[A[i]-1]+1
for j in range(0,X[0]):
    if B[j]>0:
        C.append("Yes")
    else:
        C.append("No")
print(C)

Submission status: Wrong Answer

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


a = [0] * n

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

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

Submission status: Wrong Answer

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


a = [k] * n

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

count = np.zeros(N)

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

ans = K - (Q - count)

print(ans)

for answer in ans:
    if answer <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
X = list(map(int, input().split()))
A = []
B=[]
for _ in range(X[2]):
    A.append(int(input()))
for i in range(0,X[0]):
    count=0
    for j in range(0,X[2]):
        if j<X[2]-1 and A[j]!=i+1:
            count=count+1
        elif j==X[2]-1:
            if A[j]!=i+1:
                count=count+1
                if count < X[1]:
                    B.append("Yes")
                else:
                    B.append("No")
            else:
                if count < X[1]:
                    B.append("Yes")
                else:
                    B.append("No")
            
print(B)

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 dict(c).items():
        if v >(Q - K):
            l.append(i-1)
    l.sort()
    for j in range(N):
        print('Yes')
#         if j in l:
#             print('Yes')
#             l.pop(0)
#             if l == []:
#                 for _ in range(N-j-1):
#                     print('No')
#                 break
#         else:
#             print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 dict(c).items():
        if v >(Q - K):
            l.append(i-1)
#     l.sort()
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop(0)
            if l == []:
                for _ in range(N-j-1):
                    print('No')
                break
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 sorted(dict(c).items(),reverse=True, key=lambda x:x[1]):
        if v >(Q - K):
            l.append(i-1)
        else:
            break
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop(0)
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 dict(c).items():
        if v >(Q - K):
            l.append(i-1)
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop(0)
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 dict(c).items():
        if v >(Q - K):
            l.append(i-1)
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop()
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 dict(c).items():
        if v >(Q - K):
            l.append(i-1)
        else:
            break
    for j in range(N):
        if j in l:
            print('Yes')
#             l.pop()
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 dict(c).items():
        if v >(Q - K):
            l.append(i-1)
        else:
            break
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop()
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 sorted(dict(c).items(),reverse = True, key=lambda x:x[1]):
        if v >(Q - K):
            l.append(i-1)
        else:
            break
    for j in range(N):
        if j in l:
            print('Yes')
            l.pop() 
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(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 sorted(dict(c).items(),reverse = True, key=lambda x:x[1]):
        if v >(Q - K):
            l.append(i-1)
        else:
            break
    for j in range(N):
        print('Yes')
#         if j in l:
#             print('Yes')
#         else:
#             print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(input()) for i in range(Q)]
c = collections.Counter(A)

if (K - Q) > 0:
    for _ in range(N):
        print('Yes')
else:
    l = [i for i,v in dict(c).items() if v >(Q - K)]
    for j in range(N):
        if j in l:
            print('Yes')
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import collections

N,K,Q = map(int,input().split())
A = [int(input()) for i in range(Q)]
c = collections.Counter(A)

l = []
for i,v in dict(c).items():
    if v > (Q-K):
        l.append(i-1)
for j in range(N):
    if j in l:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

if K - Q > 0:
    for _ in range(N):
        print('Yes')
else:
    l = [K] * N
    for i,v in enumerate(A):
        l[v-1] = l[v-1] + 1
    for i in l:
        if i > (K+1):
            print('Yes')
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
N, K, Q = list(map(lambda n: int(n), input().split(" ")))
point = [K - Q] * N
for i in range(Q):
  c = int(input())
  point[c - 1] += 1

print("\n".join(["YES" if p > 0 else "NO" for p in point]))

Submission status: Wrong Answer

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

S=[0]*n
for i in range(q):
    a = int(input())
    S[a-1]+=1
    
print( S, max(S) )

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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)
for i in range(N):
    B[i-1] = c[i]

# print(B)
ans = (B - B.sum()) > - K
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: Wrong Answer

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)
for i in range(N):
    B[i-1] = c[i]

print(B)
ans = (B - B.sum()) > - K
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: Wrong Answer

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
print(point)

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

Submission status: Wrong Answer

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 - 4
print(*np.where(score > 0, 'Yes', 'No'), sep='\n')

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

I = np.array([int(_) for _ in open(0).read().split()])
N, K, Q = I[:3]
ans = I[3:] + K - Q
print(*np.where(ans > 0, 'Yes', 'No')[1:], sep='\n')

Submission status: Wrong Answer

Solution code:
import numpy as np
I = np.array([int(_) for _ in open(0).read().split()])
N, K, Q = I[:3]
ans = I[3:] + K - Q
print(np.where(ans > 0, 'Yes', 'No')[1:], sep='\n')

Submission status: Wrong Answer

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: Wrong Answer

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'), sep='\n')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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: Wrong Answer

Solution code:
import sys
from collections import Counter
N, K, Q = map(int, input().split())
if K > Q:
    for _ in range(N):
        print("Yes")
        sys.exit()

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

Alist = [int(input())-1 for _ in range(Q)]
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: Wrong Answer

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 x > 0 else 'No')

Submission status: Wrong Answer

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-1]
  if temp<=0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

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: Wrong Answer

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
print(ans)
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: Wrong Answer

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):
	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: Wrong Answer

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

for i in range(n):
    ans = "Yes" if q - a.count(i+1) < k else "No"
    print(ans)

Submission status: Wrong Answer

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

for i in range(n):
    point = k - (q - a.count(i))
    ans = "Yes" if point > 0 else "No"
    print(ans)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

n, k, q = [int(w) for w in input().split()]


score = [0] * n

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

for s in score:
    cond = k - q + a > 0
    print("Yes" if cond else "No")

Submission status: Wrong Answer

Solution code:
"""
- N players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in open(0).read().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(ans)

Submission status: Wrong Answer

Solution code:
"""
- N players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in input().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(ans)

Submission status: Wrong Answer

Solution code:
"""
- N players, K points each player has, Q correct answers
- Substruct Q from K and add score to each players
"""

N,K,Q = map(int,input().split())
A = (int(x) for x in input().split())

score = [K-Q] * (N+1) 
for x in A:
    score[x] += 1

ans = '\n'.join('No' if x <= 0 else 'Yes' for x in score[1:])
print(ans)

Submission status: Wrong Answer

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

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

p=[0]*n

for a in A:
    p[a-1]+=1
    
for P in p:
    if q-P < k:
        print("yes")
    else:
        print("no")

Submission status: Wrong Answer

Solution code:
N, K, Q = [int(x) for x in input().split()]

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

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

Submission status: Wrong Answer

Solution code:

N,K,Q = map(int,input().split(" "))


ans = [K - Q for i in range(N)]


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

for a in ans:
    if a > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np

N,K,Q = map(int,input().split(" "))
ans=np.full(N, K)

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

for a in ans:
    if a > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np

N, K, Q = map(int, input().split()) 
score = np.array([0]*N)

def change_score(N ,A, score):
    score = score - np.array([1]*N)
    score[A-1] = score[A-1] + 1
    return score

for i in range(Q):
    A = int(input())
    score = change_score(N, A, score)
    print(score)
    f_score = score

for i in f_score:
    if i + K> 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#-*- coding:utf-8 -*-

n, k, q = map(int, input().split())
a_li = [int(input()) for i in range(q)]

pt_li = [] #所持点数のリストを作る
for i in range(n):
    pt_li.append(k)

#print(pt_li)
#
# for t in range(q): #t回目について
#     for u in range(n): #u人に対して
#         pt_li[u] -= 1 #とりあえずマイナス1
#     pt_li[a_li[t]-1] += 1
#
#
# #print(pt_li)
#
#
# for v in range(n):
#     if pt_li[v] <= -1:
#         pt_li[v] = 0
#
# #print(pt_li)
#
# for s in range(n):
#      if pt_li[s] == 0:
#          print("No")
#      else:
#          print("Yes")

for t in range(q):
    for u in range(n):
        pt_li[u] -= 1
    pt_li[a_li[t]-1] += 1

print(pt_li)

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

A = []
for _ in range(q):
    a = int(input())
    A.append(a)

ans = [0]*n

from collections import Counter
cnt = Counter(A)
for key,v in cnt.items():
    if v >= q-k+1:
        ans[key-1] = 1

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

Submission status: Wrong Answer

Solution code:
import sys

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

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

A = []
for _ in range(q):
    a = int(input())
    A.append(a)

ans = [0]*n

from collections import Counter
cnt = Counter(A)
for key,v in cnt.items():
    if v >= q-k+1:
        ans[key-1] = 1

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

Submission status: Wrong Answer

Solution code:
import numpy as np
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with

#A = int(input())
N,K,Q= map(int,input().split())
#A = list(map(int,input().split()))
#B = list(map(int,input().split()))
#S= str(input())
l=np.zeros(N)
l+=K
print(l)
for m in range(Q):
    A = int(input())
    l-=1
    l[A-1]+=1
    print(l)
for i in l:
    if i<=0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
import numpy as np

N,K,Q = map(int, input().split())
A = [K] * N

A_np = np.array(A)

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


for j in range(N):
	if A_np[j] > 0:
		print("Yes")
	else:
		print("No")

Submission status: Wrong Answer

Solution code:
import collections
n,s,m = map(int, raw_input().split(' '))
cc = collections.Counter()
cumul = 0
for _ in range(m):
	cc[int(raw_input()) - 1] += 1
	cumul += 1
for u in range(n):
	q = 0
	q += cc[u] - cumul
	if q > 0:
		print 'Yes'	
	else:
		print 'No'

Submission status: Wrong Answer

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

for i in range(q):
    a[i] = int(input())
a_copy = [0] * n

for i in a:
    a_copy[i-1] += 1
print(a)
print(a_copy)
for i in a_copy:
    if q - i < k:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N, point, Q = map(int, input().split())
ans = [int(input()) for i in range(Q)]
ans = [n-1 for n in ans]
# participants = [i for i in range(N)]
points = [point for i in range(N)]

points = [n-len(ans) for n in points]

for i in ans:
    points[i] += 1

print(N, point, Q, ans, points)

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
n,k,q = map(int,input().split())
l = [int(input()) for _ in range(q)] #複数行1文字をintでリストに
d = defaultdict(int)
for i in l:
    if i in d:
        d[i] += 1
    else:
        d[i] =1

for i in range(n):
    a = q-d[i]
    b = k-a
    if b >=0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

p = [k]*n
a = [0]*q

for i in range(0,q):
  a[i] = int(input())

for i in range(0,n):
  p[i] = p[i] - q
for i in range(0,q):
  p[a[i]-1] += 1
#print(p)

for i in range(0,n):
  if(p[i] <= 0):
    print("No")
  else:
    print("yes")

Submission status: Wrong Answer

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

p = [k]*n
a = [0]*q

for i in range(0,q):
  a[i] = int(input())

for i in range(0,q):
  for j in range(0,n):
    p[j] -= 1
  p[a[i]-1] += 1
  #print(a[i])
  
for i in range(0,n):
  if(p[i] <= 0):
    print("No")
  else:
    print("yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for q in range(Q):
    A = int(input())

    # check
    for k in points.keys():
        if k != A:
            points[k] -= 1

# output
for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

    # check
    map(lambda x: x - 1, points)
    points[A - 1] += 1

for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
n,k,q=map(int,input().split())
life=[k-q]*n
for i in range(q):
    tem=int(input())
    life[tem-1]+=1
for j in life:
    print('YNEOS'[j<=0::2])