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 = input().split()
n = int(n)
k = int(k)
q = int(q)
correct = [int(input()) for index in range(q)]
count = np.bincount(np.array(correct))

if k<q or k==q==1:
  min_victory = 1 - (k - q)
  yes_man = np.where(count>=min_victory,1,0)
  yes_man_extend = np.append(yes_man,np.zeros(n-yes_man.size+1))
  yes_man_extend = yes_man_extend[1:]

  for index,value in enumerate(yes_man_extend):
    if value==1:
      print("Yes")
    else:
      print("No")

else:
  for index in range(n):
    print("Yes")

Submission status: Wrong Answer

Solution code:
import numpy as np

n,k,q = input().split()
n = int(n)
k = int(k)
q = int(q)
correct = [int(input()) for index in range(q)]
count = np.bincount(np.array(correct))

if k<q:
  min_victory = 1 - (k - q)
  yes_man = np.where(count>=min_victory,1,0)
  yes_man_extend = np.append(yes_man,np.zeros(n-yes_man.size+1))
  yes_man_extend = yes_man_extend[1:]

  for index,value in enumerate(yes_man_extend):
    if value==1:
      print("Yes")
    else:
      print("No")
else:
  if k==q==1:
    for index in range(n):
      print("No")
  else:
    for index in range(n):
      print("Yes")

Submission status: Wrong Answer

Solution code:
import numpy as np

n,k,q = input().split()
n = int(n)
k = int(k)
q = int(q)
correct = [int(input()) for index in range(q)]
count = np.bincount(np.array(correct))

if k<q:
  min_victory = 1 - (k - q)
  yes_man = np.where(count>=min_victory,1,0)
  yes_man_extend = np.append(yes_man,np.zeros(n-yes_man.size+1))
  yes_man_extend = yes_man_extend[1:]

  for index,value in enumerate(yes_man_extend):
    if value==1:
      print("Yes")
    else:
      print("No")
else:
  for index in range(n):
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
m = {}
mx = 0
for i in range(Q):
    ans = int(input()) - 1
    if ans not in m:
        m[ans] = 1
    else:
        m[ans] += 1
    mx = max(m[ans], mx)
    if mx + K == i:
        break
    

k = list(m.items())
k.sort(reverse = True)
ans = []
for item in k:
    if item[1] + K > Q:
        ans.append(item[0])
    else:
        break

ans = set(ans)
for i in range(N):
    if i in ans:
        print("Yes")
    elif K > Q:
        print("Yes") 
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
m = {}
mx = 0
for i in range(Q):
    ans = int(input()) - 1
    if ans not in m:
        m[ans] = 1
    else:
        m[ans] += 1
    mx = max(m[ans], mx)
    if mx + K == i:
        break

k = list(m.items())
k.sort(reverse = True)
ans = []
for item in k:
    if item[1] + K > Q:
        ans.append(item[0])
    else:
        break

ans = set(ans)
for i in range(N):
    if i not in ans:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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

cnt = 1
while Q >= cnt:
  ans_num = int(input())
  change = [-1]*N
  change[ans_num] = 0
  point_list = point_list + change
  #print(point_list)
  cnt += 1

# print(point_list)
# output = np.where(point_list > 0, "Yes", "No")
for i in range(N):
  if point_list[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)]
p = [k for i in range(n)]
print(a)
print(p)
def judge(x):
    if p[x] <= 0:
        return 'No'
    else:
        return 'Yes'
for j in range(q):
    for i in range(n):
     if i + 1 == a[j]:
        continue
     else:
        p[i] -= 1
print(p)
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Submission status: Wrong Answer

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

score = [K for i in range(N)]
S = []
for _ in range(Q):
    S.append(int(input())-1)

for i in S:
    for j in range(len(score)):
        if i != j:
            score[j]=score[j]-1
print(score)
for ans in score:
  if(ans<=0):
    print('No')
  else:
    print('Yes')

Submission status: Wrong Answer

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


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


winner_point = max(points)
winners = [i for i in range(n) if points[i]==winner_point]
for i in range(n):
    if i in winners:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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


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


winner = points.index(max(points))
for i in range(n):
    if i == winner:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
num, poi, ans = [int(x) for x in input().split()]

list01 = [poi for x in range(num)]
list02 = [0 for x in range(num)]

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

for i in range(num):
  list02[i] = list02[i] + list01[i] - poi

for k in list02:
  if k <= 0:
    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)]

b = [k for _ in range(n)]
list = [0 for _ in range(n)]

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

for i in list:
    if q -k < i:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for Ai in alist:
    ans[Ai - 1] += 1

for Ai in alist:
    print('Yes') if Ai > 0 else print('No')

Submission status: Wrong Answer

Solution code:
N, K, Q = input().strip().split()
N, K, Q = [int(N), int(K), int(Q)]
A = [0] * (Q+1)  # index調整のため、長さQ+1のリストとする
for i in range(1, Q+1):
    A[i] = int(input())

#print(A)
points = [K] * (N+1) # 参加者iのポイントはpoints[i] i=1, 2, ..N
for i in range(1, Q+1): # 各ラウンドについて
    for j in range(1, N+1): # 各参加者について
        if j is not A[i]: # 正解者でなければ
            points[j] -= 1

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

Submission status: Wrong Answer

Solution code:
l = raw_input().split()
N = int(l[0])
K = int(l[1])
Q = int(l[2])


A = []
for i in range(Q):
    A.append(input())

for i in range(N):
    print A.count(i+1)
    if Q-A.count(i+1) < K:
        print "Yes"
    else:
        print "No"

Submission status: Wrong Answer

Solution code:
# coding: utf-8

def reader(N):
    for n in range(N):
        yield input()

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

main()

Submission status: Wrong Answer

Solution code:
n , k , q = map(int, input().split())
a = [int(input()) for i in range(q)]
points = [k for i in range(n)]
for i in range(n):
    for j in range(n):
        if i == j:
            continue
        else:
            points[j] -= a.count(i)
for i in range(n):
    if points[i] >= 1:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
INPUT = [int(i) for i in input().split(" ")]

N = INPUT[0]
K = INPUT[1]
Q = INPUT[2]
#print(INPUT)
A = []
for i in range(Q):
        A.append(int(input()))
print(A)

P = [K]*N
print(P)
for a in A:
    for i in range(len(P)):
        P[i] = P[i] - 1
    P[a-1] = P[a-1] + 1

#print(P)

for i in P:
    if(i >= 1):
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import array

# 入力の取得(1行目。数値)
i = list(map(int, input().split()))

# 変数セット
# 1.配列[添字=人数、値=初期の点数]
points = [i[1]] * i[0]
# 2.正解数(引数の数)
correntCount = i[2]

# 正解数ループ
for i in range(correntCount):
    correcter = int(input()) - 1    
    #全てを1減算
    points = [ n - 1 for n in points]
    #正解者に2加算(直前の処理で1減算しているため)
    points[correcter] += 2

# 値が0以下の参加者は敗退(No)、1以上なら勝ち抜け(Yes)
for point in points:
    if point <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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

godness = [k] * n
dd = [0] * n
for i in [int(input(x)) for x in range(q)]:
    dd[i-1] += 1

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

Submission status: Wrong Answer

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

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

for i, item in enumerate(ans):
    if (k - q + item) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

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

member = [k - q] * n
for i in [int(input(x)) for x in range(q)]:
    member[i-1] += 1

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

Submission status: Wrong Answer

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

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

for i, item in enumerate(ans):
    if (member[i] - q + item) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

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

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

for i in range(n):
    if k - q + rui[i] > 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 - q] * n
'''
p = []
for i in range(n):
    p.append(k)
for i in range(q):
    for j in range(n):
        if(j + 1 == a[i]):
            pass
        else:
            p[j] = p[j] - 1
#print(p)
for i in range(n):
    if(p[i] > 0):
        print('Yes')
    else:
        print('No')
'''
for i in range(q):
    for j in range(n):
        if(j + 1 == a[i]):
            p[j] += 1
print(p)
for i in range(n):
    if(p[i] > 0):
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

import numpy as np

Nwin = np.zeros(N)

#print(Nwin)

A = []

for q in range(Q):
  a = int(input())
  #A.append(a)
  Nwin[a-1] += 1

print(Nwin)

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

Submission status: Wrong Answer

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


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

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

Submission status: Wrong Answer

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



a=[]
nScore=[]

for x in range(N):
    nScore.append(0)

for x in range(Q):
    nScore[int(input())-1]+=1

if(K>Q):
    for x in range(N):
        print("Yes")

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

Submission status: Wrong Answer

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



a=[]
nScore=[]

for x in range(N):
    nScore.append(0)

for x in range(Q):
    nScore[int(input())-1]+=1

if(K>Q):
    for x in range(N):
        print("Yes")
        
for x in range(N):

    if K-Q+nScore[x]>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

if(K>Q):
    for x in range(N):
        print("Yes")

a=[]
nScore=[]

for x in range(N):
    nScore.append(0)

for x in range(Q):
    nScore[int(input())-1]+=1

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

Submission status: Wrong Answer

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

a=[]
nScore=[]
for x in range(Q):
    a.append(input())

for x in range(N):
    nScore.append(K)

for x in range(Q):
    print("----Scores-----")
    
    for y in range(N):
        if(y+1 !=int(a[x])):
            nScore[y]-=1
            print("{}: {}".format(y,str(nScore[y])))
        else:
            print("{}: {} Scored".format(y,str(nScore[y])))

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

Submission status: Wrong Answer

Solution code:
def update (winner):
    for i in range(len(points)):
        if i != winner-1:
            points[i]-=1
n,k,q=map(int,input().split())
points=[k]*n

for i in range(q):
    a=int(input())
    update(i)
for i in range(len(points)):
    if points[i]<=0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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

for a in a_list:
    for i in range(n):
        p_list[i] -= 1
    p_list[a] += 1

print(p_list)

for p in p_list:
    if p <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
a_list = [int(input())-1 for _ in range(q)]
# > インデックスでとる
p_list = [k for _ in range(n)]

for a in a_list:
    for i in range(n):
        p_list[i] -= 1
    p_list[a] += 1

print(p_list)

for p in p_list:
    if p <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
import numpy as np

N, K, Q = map(int,input().split())
A = []
for i in range(0, Q):
    A.append(int(input()))
a = np.array([K] * N)
for i in A:
    a[i-1] += 1
    a = a - 1
print(a)

for i in a:
    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 = [int(input()) for i in range(q)]

p = [0]*(n+1)

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

for i in range(1,n+1):
  if p[i]>k-q:
    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()))
  
m = list([k]*n)
 
for i in a:
  for j in range(n):
    m[j]-=1
    m[i-1]+=1
  
for i in range(n):
  if m[i]>0:
    print("Yes\n")
  else:
    print("No\n")

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()))
  
m = list([k]*n)
 
for i in a:
  for j in range(n):
    m[j]-=1
    m[i-1]+=1
  
for i in range(n):
  if m[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
I = input()
I = I.split(" ")
N = int(I[0])
K = int(I[1])
Q = int(I[2])

A = [0] * Q

for i in range(Q):
	A[i] = int(input())

point = [0] * N

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

for i in range(N):
	if point[i] > 0:
		print("yes")
	else:
		print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
# N人がK点持っており、Q回クイズが行われた

A = [int(input()) for i in range(q)]
# Aは正解者のリスト

### 最終的に１点以上持っている人がＯＫ

# 正解している人に点数をプラス
score = [0]*n
for i in range(q):
    score[A[i]-1] += 1

### 出力は i さんが ＯＫ ならYes, Fail なら NO

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

Submission status: Wrong Answer

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

lista = []
for i in range(n):
    lista.append(k-q)
print(lista)
for i in range(q):
    num = int(input())-1
    lista[num] = lista[num] +1
    #print(lista)
#print(lista)
for i in range(n):
    if lista[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

lista = []
for i in range(n):
    lista.append(k-q)
print(lista)
for i in range(q):
    num = int(input())-1
    lista[num] = lista[num] +1
    #print(lista)
print(lista)
for i in range(n):
    if lista[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
tmp = input().split(" ")
person = int(tmp[0])
init_pt = int(tmp[1])
questions = int(tmp[2])

ans = ""
for i in range(questions):
  ans = ans + input()

for i in range(1, person + 1):
  if ans.count(str(i)) > questions - init_pt:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import numpy as np

N, point, q = [int(x) for x in input().split()]
r_list = [q] * N
p_list = [point] * N
reduce_list = np.array(r_list)
points_list = np.array(p_list)

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

points_list = points_list - reduce_list
print(points_list)

for p in points_list:
    if p <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import numpy as np

N, point, q = [int(x) for x in input().split()]
r_list = [q] * N
p_list = [point] * N
reduce_list = np.array(r_list)
points_list = np.array(p_list)

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

points_list = points_list - reduce_list

for p in points_list:
    if p <= 0:
        print('N0')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import numpy as np

N, point, correct = [int(x) for x in input().split()]
r_list = [int(1) for x in range(1, N + 1)]
p_list = [point for x in range(1, N + 1)]
range_list = np.array(r_list)
points_list = np.array(p_list)

for i in range(correct):
    answer = int(input()) - 1
    points_list = points_list - range_list
    points_list[answer] += 1
#    print(points_list)

for p in points_list:
    if p <= 0:
        print('N0')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
L=list(map(int,input().split()))
N=L[0]
K=L[1]
Q=L[2]
S=[]
for i in range(Q):
  S.append(input())
S.sort()
point=[0]*N
num_ans=[0]*N
for i in range(N):
  num_ans[i]=S.count(i)
  point[i]=K-Q+num_ans[i]
  if point[i]>0 :
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
x = input().split()
plist = [int(x[1]) for i in range(int(x[0]))]
y = []
l = 0
while l < int(x[2]):
    ans = input()
    y.append(int(ans))
    l += 1

for i in y:
    plist[1] += 1

for p in plist:
    if p - int(x[2]) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
x = input().split()
plist = list(range(1, int(x[0])+1))
pointdict = {}
y = []
i = 1
while i < int(x[0]) + 1:
    pointdict[i] = int(x[1])
    i += 1

l = 0
while l < int(x[2]):
    ans = input()
    y.append(ans)
    l += 1

print(y)

for i in y:
    for e in plist:
        if e != int(i):
            pointdict[e] -= 1

print(pointdict)

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

Submission status: Wrong Answer

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

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

for i in range(len(L)):
    if q<L[i]:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

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

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

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

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

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

for i in range(len(L)):
    if Q<L[i]:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

Solution code:
N,K,Q=list(map(int,input().split()))
a=[K for _ in range(N)]
b=[0 for _ in range(Q)]
for i in range(Q):
    b[i]=int(input())

for i in range(Q):
    for j in range(N):
        if (b[i]-1)!=j:
            a[j]-=1

for i in range(N):
    if a[i]<=0:
        print("NO")
    else:
        print("YES")

Submission status: Wrong Answer

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

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

print(L)
for i in range(len(L)):
    if q  < L[i]:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
# INPUT
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
print(A)
# PROCESS
points = [0 for x in range(N+1)]
for x in A:
    points[x]+=1
print(points)
threshold = K - Q
# OUPUT
for y in range(1, N+1):
    if threshold + points[y] > 0:
        print("Yes")
    else:
        print("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):
    a[int(input())-1]+=1
for i in range(n):
    if i>k-q:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

players = [0 for n in range(N)]
for q in range(Q):
  players[int(input())-1] += 1

for n in range(N):
  if(K - (Q - players[n]) > 0):
    print("YES")
  else:
    print("NO")

Submission status: Wrong Answer

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

scores = [k] * n

for index in range(q):
    winner = int(input())
    for participant in range(n):
        if not participant == winner:
            scores[participant] -= 1

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

Submission status: Wrong Answer

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

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

# 参加者の得点一覧を作成
point_dic = {}
for i in range(1, n + 1):
    point_dic[i] = 0
#print(point_dic)


for i in range(1, q + 1):
    ans = int(input())
    for j in range(1, n + 1):
        if ans == j:
            pass
        else:
            point_dic[j] -= 1

for i, j in point_dic.items():
    if j - k > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
N, K, Q = map(int, input().split(" "))

score_list = np.ones(N) * -K

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

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

Submission status: Wrong Answer

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

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

for j in range(len(points)):
  if points[j] <= 0:
    print('NO')
  else:
    print('YES')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
#N人　参加者
#Kポイント持ってスタート
#正解者以外のポイントは1づつ減る
#Q回正解者がでる
#得点が0以下で敗退
lst = input().split()

N = int(lst[0])
K = int(lst[1])
Q = int(lst[2])

if N < 2 or N > 100000:
    print('参加人数エラー')
    exit()

if K < 1 or K > 1000000000:
    print('ポイントエラー')
    exit()

if Q < 1 or Q > 100000:
    print('正解数エラー')
    exit()

p_list = np.linspace(K,K,num=N)

#得点計算
for i in range(Q):
    #正解者の入力を受け取って1マイナス
    collect = int(input()) - 1

    K -= 1
    p_list = np.linspace(K,K,num=N)

    p_list[collect] = p_list[collect] + 1


#勝敗出力
l = 0
for l in range(N):
    if p_list[l] > 0:
        print('Yes')
    else:
        print('No')

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)
for i in range(n):
	if s[i] > q - k:
		print('Yes')
	else:
		print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

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

Submission status: Wrong Answer

Solution code:
# C - Attack Survival
n,k,q= map(int, input().split())

if q - k > 0:

    list = [k] * n
    list2 = [k] * n

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

    list2.sort(reverse=True)

    for j in range(n):
        if(list[j] == list2[0]):
            print('Yes')
        else:
            print('No')
else:
    for k in range(n):
        print('Yes')

Submission status: Wrong Answer

Solution code:
# C - Attack Survival
n,k,q= map(int, input().split())

if q - k > 0:

    list = [k] * n
    list2 = [k] * n

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

    list2.sort(reverse=True)

    value = list2[q - k]

    for j in range(n):
        if(list[j] > value):
            print('Yes')
        else:
            print('No')
else:
    for k in range(n):
        print('Yes')

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
result = {}
for i in range(Q):
    winner = int(input())
    result[winner] = result.get(winner, 0) + 1
print(result)

for i in range(N):
#    print("No.{0} won {1} times".format(i + 1, result.get(i + 1)))
#    print("No.{0}'s losted point is {1} ".format(i + 1, Q - result.get(i + 1, 0)))
#    print("No.{0}'s result point is {1} ".format(i + 1, K - (Q - result.get(i + 1, 0))))
    if K - (Q - result.get(i + 1, 0)) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
#入力
N, K, Q = map(int, input().split()) #参加者,初期ポイント,回数
A = []
for _ in range(int(Q)) :
    A.append(input())

#処理、出力
for i in range(int(N)) :
    point = K - (Q - A.count(i+1))
    if point > 0 :
        print("Yes")
    else :
        print("No")