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 sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
from collections import deque
import collections
import itertools
import bisect
mod = 10 ** 9 + 7
N, K, Q = list(map(int, input().split()))
A = [0]*Q
for q in range(Q):
    A[q] = int(input())
# 自分以外の人がK回答えたら敗退
seikai_num = [0]*(N+1)

for a in A:
    seikai_num[a] += 1
print(seikai_num)

for seikai in seikai_num[1:]:
    if (Q - seikai >= K):
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import defaultdict


def main():
    N, K, Q = map(int, input().split())
    d = defaultdict(int)
    for i in range(Q):
        a = int(input())
        d[a-1] += 1
    print(d)
    for i in range(N):
        if Q - d[i] < K:
            print("Yes")
        else:
            print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

A = [int(input()) for _ in range(Q)]
c = dict(Counter(A))
print(c)
for i in range(1,N+1):
    if i in c:
        t = Q - c[i]
        print('Yes' if t < K else 'No')
    else:
        print('Yes' if Q < K else 'No')

Submission status: Wrong Answer

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

dat = dict(zip(range(1, n+1), [k]*n))
cnt = 0

for i in range(1, n+1):
    for j in a:
        if i != j:
            dat[i] -= 1

for k in range(1, n+1):
    if dat[k] <= 0:
        print('No')
    else:
        print('yes')

Submission status: Wrong Answer

Solution code:
n, k ,q = map(int, input().split())
list_q = []
ans = ['Yes']*n
for _ in range(q):
  list_q.append(int(input()))
print(ans)

Submission status: Wrong Answer

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

la = list()
for i in range(Q):
    la.append(int(input()))

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

Submission status: Wrong Answer

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

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

C = [str(i+1) for i, s in enumerate(S) if s > 0]

print("\n".join(C))

Submission status: Wrong Answer

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

res = []
for i in range(1, N + 1):
  if K - Q + A.count(str(i)) > 0:
    res.append("Yes")
  else:
    res.append("No")

for r in res:
  print(r)

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
points = [k]*n
for i in range(q):
    winner = int(input())
    for j in range(n):
        points[j] -= 1
    points[winner - 1] += 1
for i in points:
    if i > 0:
        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)]
ans=[-q]*n
for i in range(q):
    ans[int(input())-1] += 2
print(ans)
for i in ans:
    if i>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
# 初期入力
import numpy as np
N,K,Q = (int(x) for x in input().split())
A = [int(input()) for i in range(Q)] 


#
point_i =np.full(N,K) #参加者ごとのポイント　要素数、N   初期値,K

for i in A: #正解した人のポイント加算する
    #point_i = point_i -1
    point_i[i-1] +=1
print(point_i)

point_i -= Q #全員、全問題数分のポイント減算

for i in point_i:
    if 0 < i:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import itertools
##print(ord("A"))
#n = int(input())
n,k,q = map(int,input().split())
#h = list(map(int,input().split()))	
ans_list=[input() for i in range(q)]
pnt_list = [k]*n
#print(pnt_list)
for i in range(q):
    print(pnt_list)
    for j in range(n):
    
        if ans_list[i]==str(j+1):
            pass
        else:
            pnt_list[j]=pnt_list[j]-1
for i in range(len(pnt_list)):
    if pnt_list[i]>0:
        print("Yes")
    else:
        print("No")
#print(pnt_list)

Submission status: Wrong Answer

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

print(score_list)
for j in score_list:
    if j > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np
n,k,q = map(int,input().split())
A = []
for i in range(q):
    A.append(int(input()))

for i in range(1,n+1):
    if A.count(i) > k-q:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

for i in a:
    point[i-1]+=1
    
for i in point:
    if i>0:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import collections
n,k,q=map(int,input().split())
a=list(map(int,input().split()))
c=collections.Counter(a)

for i in range(n):
  if k-q+c[i+1]>0:
    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)]
N_array = [K] * N
for x in A:
    for y in range(len(N_array)):
        if y != x - 1:
            N_array[y] -= 1
for z in N_array:
    if z > 0:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
#C
#入力
N,K,Q=map(int,input().split())
A=[int(input())-1 for i in range(Q)]

#処理
B=[0 for i in range(N)]

for i in A:
    B[i]+=1

print(B)
for i in B:
    if Q-i<K:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

#print(score)
 
for i in range(n):
	if score[i] > 0:
		print("Yes")
	else:
		print("No")

Submission status: Wrong Answer

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

score = [k-q]*n

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

print(score)

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

Submission status: Wrong Answer

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

score = [-q]*n

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

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
N,K,Q = map(int,input().split())
A = [int(input()) for _ in range(Q)]
data = [K-Q]*N
C = Counter(A)
for i,j in C.items():
  data[i-1] += j
  print(i,j)
for i in range(N):
  if data[i] > 0:
    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)]
point=[K]*N
for i in A:
  i=int(i)
  point=list(map(lambda x: x-1,point))
  point[i]+=1
for i in point:
  if i>0:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

#print(N,K,Q,A)

score=[K]*N

for answer in A:
    score=[point-1 for point in score]
    score[answer-1]+=1
    #print(score)

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

Submission status: Wrong Answer

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

print(N,K,Q,A)

score=[K]*N

for answer in A:
    score=[point-1 for point in score]
    score[answer-1]+=1
    print(score)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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 p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")
print(points)

Submission status: Wrong Answer

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 p in points:
    if p > 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()) for _ in range(Q)]

points = [K - Q] * N

for i in A:
    points[i - 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())
mylist=[]
pointlist=[]
for i in range(Q):
    mylist.append(int(input()))
    
#print(N,K,Q)    
#print(mylist)

def mins1(n):
    return n-1

for i in range(N):
    pointlist.append(K)

i=0
while i<Q:
    winner=mylist[i]-1
    #winner以外のポイントを減らす
    #この部分の計算量を改善できないか？
    #全体均一で1を引いて、正解者だけ1足すとか。
    
    #map関数でpointlist全体から1を引く
    pointlist=list(map(mins1,pointlist))
    #winnerだけ足す1する。
    pointlist[winner]+=1
    
    print(i)
    print(pointlist)
    i+=1
    
for i in range(N):
    if pointlist[i]<=0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int, input().split())
A = [int(input()) for i in range(Q)]
B = [0 for i in range(N)]
for x in A:
  B[x-1] += 1
print(B)
for x in B:
  k = Q - x
  if K - k > 0:
    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)]
B = [0 for i in range(N)]
for x in A:
  B[x-1] += 1
for x in B:
  k = Q - x
  if K - k + x > 0:
    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)]
B = [K for i in range(N)]
for x in A:
  B[x-1] += 1
for x in B:
  k = Q - x
  if K - k + x > 0:
    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)]
B = [K for i in range(N)]
for x in A:
  B[x-1] += 2
for x in B:
  if x > K+Q:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

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

for e in a:
    res[e]-=1

for e in res:
    print('Yes' if e<0 else 'NO')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu Mar 12 22:54:45 2020

@author: Kanaru Sato
"""

n,k,q = list(map(int, input().split()))
dict = {}

for i in range(q):
    ans = input()
    if ans not in dict:
        dict[ans] = 1
    else:
        dict[ans] += 1

points = []

for i in range(1,n+1):
    if str(i) in dict and dict[str(i)]+k-q>0:
        points.append("Yes")
    else:
        points.append("No")

for i in range(n):
    print(points[i])

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
A = [int(input())-1 for _ in range(Q)]
Point = [K]*N
print(A)
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')

Submission status: Wrong Answer

Solution code:
import numpy as np

num = list(map(int,input().split()))
num_list = np.ones(num[0])*num[1]
penalty = np.ones(num[0])

if num[1] > num[2]:
  for i in range(0,num[0]):
    print("Yes")
else:
  for i in range(0,num[1]):
    temp = int(input())
    penalty[temp-1] = 0 
    num_list = num_list - penalty
    penalty[temp-1] = 1
  
  for j in range(num[1],num[2]):
    temp = int(input())
    penalty[temp-1] = 0 
    num_list = num_list - penalty
    penalty[temp-1] = 1
    if np.max(num_list) == 1:
      break
    
  num_list_last = num_list

  if j < num[2]-1:
    temp = int(input())
    penalty = np.ones(num[0])
    penalty[temp-1] = 0
    num_list_last = num_list - penalty

  if np.max(num_list_last) < 1:
    num_list_last = num_list

  for i in range(0,num[0]):
    if num_list_last[i] < 1:
      print("No")
    elif num_list[i] >= 1:
      print("Yes")

Submission status: Wrong Answer

Solution code:
import numpy as np

num = list(map(int,input().split()))
num_list = np.ones(num[0])*num[1]
penalty = np.ones(num[0])

for i in range(0,num[2]):
  temp = int(input())
  penalty[temp-1] = 0 
  num_list = num_list - penalty
  penalty[temp-1] = 1
  
  if np.max(num_list) == 1:
    break
    
num_list_last = num_list

if i < num[2]-1:
  temp = int(input())
  penalty = np.ones(num[0])
  penalty[temp-1] = 0
  num_list_last = num_list - penalty
  
if np.max(num_list_last) < 1:
  num_list_last = num_list
  
for i in range(0,num[0]):
  if num_list_last[i] < 1:
    print("No")
  elif num_list[i] >= 1:
    print("Yes")

Submission status: Wrong Answer

Solution code:
import numpy as np

num = list(map(int,input().split()))
num_list = np.ones(num[0])*num[1]

for i in range(0,num[2]):
  temp = int(input())
  penalty = np.ones(num[0])
  penalty[temp-1] = 0
  
  num_list = num_list - penalty
  
  if np.max(num_list) == 1:
    break
    
num_list_last = num_list

if i < num[2]-1:
  temp = int(input())
  penalty = np.ones(num[0])
  penalty[temp-1] = 0
  num_list_last = num_list - penalty
  
if np.max(num_list_last) < 1:
  num_list_last = num_list
  
for i in range(0,num[0]):
  if num_list_last[i] < 1:
    print("No")
  elif num_list[i] >= 1:
    print("Yes")

Submission status: Wrong Answer

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


ans = ["No"] * n
for key,val in Counter(a).items():
    if val + k - q > 0:
        ans[key-1] = "Yes"

[print(i) for i in ans];

Submission status: Wrong Answer

Solution code:
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]
_a = set(a)
points = list(map(lambda x: x-q, [k for i in range(n)]))
print(points)
for i in _a:
    points[i-1] += a.count(i)
print(points)
for i in points:
  if i <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

ans=0

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

Submission status: Wrong Answer

Solution code:
import collections

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

p = []
max_v = 0

if k > q:
    for i in range(n):
        print("Yes")
else:
    count = collections.Counter(a)
    max_v = max(count.values())
 
    result = [key for key, val in count.items() if val == max_v]

    for i in range(n):
        if str(i + 1) in result:
            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)]
p = {}
[p.update({i:k}) for i in range(1, n+1)]

print(p)
for i in a:
    for j in p:
        if i != j:
            p.update({j:p[j] - 1})

for i in p:
    if p[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
"""
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 = np.zeros(N + 1)

for i in A:
    point[i] += 1
point += K - Q
print(*['Yes' if i > 0 else 'No' for i in point], sep='\n')

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

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

for j in range(N):
    sanka[j]=sanka[j]+K-Q

print(sanka)

for k in range(N):
    if sanka[k]>=1:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
x,y,z = map(int,input().split())
 
dp = [y-z for i in range(x)]

for j in range(z):
    k = int(input())
    dp[k-1] =+ 1

for l in dp:
    if l >= 1:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
a = [0 for  _ in range(q)]
point = [k for _ in range(n)]
for i in range(q):
    a[i] = int(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")
    else:
        print("No")
print(point)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

scores = {i: 0 for i in range(1, n+1)}
for _ in range(q):
    n = int(input())
    scores[n] += 1

for i, score in sorted(scores.items()):
    if k + score - q > 0:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

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

scores = {i: 0 for i in range(1, n+1)}
for _ in range(q):
    n = int(input())
    scores[n] += 1

print(scores)
for i, score in sorted(scores.items()):
    if k + score - q > 0:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

Solution code:
import numpy as np
n,k,q = map(int,input().split())
ls = []
lp = []
def mai(n):
    return n-1

for i in range(q):
    ls.append(int(input()))

for i in range(n):
    lp.append(k)

print(lp)

for i in range(len(ls)):
    for j in range(len(lp)):
        lp[j] = lp[j] - 1
    lp[ls[i]-1] = lp[ls[i]-1] + 1



for i in lp:
    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 i in range(q)]
#cnt = [0 for _ in range(n)]
win = [0 for _ in range(n)]
#p = np.array([k for _ in range(n)])
for ai in a:
  win[ai-1] += 1
print(win)

for w in win:
  if k-q+w<=0: print('No')
  else: print('Yes')

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
#print(n,k,q)
l = [0] * n
#print(l)
katen = [0] * q
my_append = katen.append
for i in range(q):
    my_append(int(input()))
#print(katen)

my_pop = l.pop
my_insert = l.insert
for j in katen:
    x = my_pop(j-1)
    my_insert(j-1, x+1) 
#print(l)

for y in range(n):
    if l[y] > q-k:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

for i in range(q):
    p = list(map(lambda x:x-1, p))
    p[a[i]] += 1

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

Submission status: Wrong Answer

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

for i in a:
  for j,val in enumerate(p):
    if j != i:
      p[j] -= 1

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

Submission status: Wrong Answer

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

for i in a:
  for j,val in enumerate(p):
    if j != i:
      p[j] -= 1

      
for n in p:
  if n>0:
    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)]

res = ['No'] * n
for i in range(n):
  if k - q + a.count(n+i) > 0:
    res[i] = 'Yes'
print('\n'.join(map(str, res)))

Submission status: Wrong Answer

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

res = ['No'] * n
for i in range(1, q+1):
  if k - q + a.count(i) > 0:
    res[i-1] = 'Yes'
print('\n'.join(map(str, res)))

Submission status: Wrong Answer

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

res = 0
for i in range(1, q+1):
  if k - q + a.count(i) > 0:
    res += 1
print(res)

Submission status: Wrong Answer

Solution code:
import numpy as np
n,k,q = map(int, input().split())
a = [int(input()) for _ in range(q)]
point_list  = np.array([k] * n)

for i in a:
    print(point_list)
    point_list -= 1
    point_list[i-1] += 1

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
n,k,q = map(int,input().split()) 
a=[]
for i in range(q):
    a.append(int(input()))

count = [k - q] * n #みんなからｑポイント引いとく
for i in range(q):
    count[a[i] - 1] += 1 #正解者に１ポイント足す
print(count)
for i in range(n):
    if count[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
 
ai = [int(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] != s:
            bi[s] -= 1
        
for i in range(n):
    if bi[i] > 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())
point=[0]*n
for a in range(q):
    a=int(input())
    point[a-1]+=1
print(point)
for i in point:
    if i>q-k:
        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)]

import collections
c = collections.Counter(A)
c_i=c.items()

m=[K-Q]*N
print(m)
for i in c_i:
    m[i[0]-1]=m[i[0]-1]+i[1]
o=[]

for i in m:
    if i<=0:
        o.append('No')
    else:
        o.append('Yes')
print('\n'.join(o))

Submission status: Wrong Answer

Solution code:
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

if(k>100000):
  for x in range(n):
    print("Yes")
  sys.exit()

each_point = []
for i in range(n):
  each_point.append(k-q)
 
print(each_point)
for j in range(q):
  ans = int(input())
  each_point[ans-1] += 1
 
happyo(n,each_point)

Submission status: Wrong Answer

Solution code:
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

if(k>10000):
  for x in range(n):
    print("Yes")
  sys.exit()
 
each_point = []
for i in range(n):
  each_point.append(k)
 
for j in range(q):
  ans = int(input())
  each_point = list(map(lambda x: x - 1,each_point))

  each_point[ans-1] += 1

 
happyo(n,each_point)

Submission status: Wrong Answer

Solution code:
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

if(k>10000):
  for x in range(n):
    print("Yes")
  sys.exit()
 
each_point = []
for i in range(n):
  each_point.append(k)
 
for j in range(q):
  ans = int(input())
  for m in range(n):
    each_point[m] -= 1
  each_point[ans-1] += 1
 
happyo(n,each_point)

Submission status: Wrong Answer

Solution code:
inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

each_point = []
for i in range(n):
  each_point += str(k)
int_point = [int(s) for s in each_point]

for j in range(q):
  ans = int(input())
  for m in range(n):
    int_point[m] -= 1
  int_point[ans-1] += 1

for x in range(n):
  if (int_point[x] < 1):
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

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

ans=np.zeros(n)

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

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

Submission status: Wrong Answer

Solution code:
# 自分以外なら引かれるので
n, k, q = map(int, input().split())
d = {}
for _ in range(q):
    x = int(input())
    if x in d:
        d[x] += 1
    else:
        d[x] = 1

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

Submission status: Wrong Answer

Solution code:
# 自分以外なら引かれるので
n, k, q = map(int, input().split())
d = {}
for _ in range(q):
    x = int(input())
    if x in d:
        d[x] += 1
    else:
        d[x] = 1
print(d)
for i in range(n):
    if k >= q:
        print("Yes")
        continue
    if i + 1 in d and q - d[i + 1] < k:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

A = [0]*n
ans = 0
for i in range(q):
    A[int(input())-1] += 1

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

Submission status: Wrong Answer

Solution code:
corr=[]#正解した人
n,k,q=input().split()
n=int(n)#n人の人がいる
k=int(k)#もともとのポイント
q=int(q)#正解した数
for i in range(q):
	a=input()
	corr.append(int(a)-1)
ptcp=[]#それぞれのポイント
for i in range(n):
	ptcp.append(k-q)
for i in range(q):
	ptcp[corr[i]]+=1
win=[]
for i in range(n):
	if ptcp[i]<=0:
		win.append("No")
	else:
		win.append("Yes")
print(win)

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

score = [k] * n
for i in a:
    for j in range(n):
        if j == i:
            continue
        else:
            score[j] -= 1

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

Submission status: Wrong Answer

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

for a_i in a:
    score[a_i] += 1

for i in range(n):
    result = k - q + score[i]
    print("YES" if result > 0 else "NO")

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
p = [k] * n
for t in range(q):
    for j in range(0,n):
        if j == a[t]-1:
            pass
        else:
            p[j]-=1
    print(p)
for r in p:
    if r <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    n, k, q = map(int, input().split())
    qk = q - k
    l = [0] * (n+1)
    for _ in range(q):
        l[int(input())] += 1
    print('\n'.join(['YES' if (i > qk) else 'NO' for i in l][1:]))

if __name__ == '__main__':
    main()