Problem:


Score: 300 points

Problem Statement

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

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

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

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

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

Constraints

All values in input are integers.

2 \leq N \leq 10^5

1 \leq K \leq 10^9

1 \leq Q \leq 10^5

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

Input

Input is given from Standard Input in the following format:

N K Q
A_1
A_2
.
.
.
A_Q

Output

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

Sample Input 1

6 3 4
3
1
3
2

Sample Output 1

No
No
Yes
No
No
No

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

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

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

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

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

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

Sample Input 2

6 5 4
3
1
3
2

Sample Output 2

Yes
Yes
Yes
Yes
Yes
Yes

Sample Input 3

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

Sample Output 3

No
No
No
No
Yes
No
No
No
Yes
No



Sample input:
6 3 4
3
1
3
2


Sample output:
No
No
Yes
No
No
No

Submission status: Accepted

Solution code:
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 range(q):
    b[a[i]] += 1

for i in range(n):
    ans = k-q+b[i]
    if ans <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

P = list(map(lambda x:x-Q, P))
for _ in range(Q):
	A = int(input()) -1
	P[A] += 1
			
for i in P:
	if i > 0:
		print('Yes')
	else:
		print('No')

Submission status: Accepted

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

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

ans = list()
for i in range(len(p_list)):
    if p_list[i] > 0:
         ans.append("Yes")
    else:
        ans.append("No")

for p in ans:
    print(p)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np


# noinspection PyShadowingBuiltinsInspection

def main():
    n, k, q = [int(x) for x in input().split()]
    points = [0] * n
    for i in range(q):
        ind = int(input()) - 1
        points[ind] += 1
    # print(points)
    for i in range(n):
        points[i] = -q + points[i]
        # print(points[i], end=" ")
        points[i] += k
        # print(points[i], end=" ")
        if points[i] > 0:
            print("Yes")
        else:
            print("No")
    return


if __name__ == "__main__":
    main()

Submission status: Accepted

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

for a in a_list:
    p_list[a] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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]>q-k:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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 Q - point[i] < K:
		print("Yes")
	else:
		print("No")

Submission status: Accepted

Solution code:
#coding-utf-8

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

I = [0]*N

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

for i in I:
    if i > Q-K:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
#import pysnooper
#import numpy
#import os,re,sys,operator
#from collections import Counter,deque
#from operator import itemgetter
#from itertools import accumulate,combinations,groupby,combinations_with_replacement,permutations
from sys import stdin,setrecursionlimit
#from copy import deepcopy
import heapq
#import math
#import string

setrecursionlimit(10**6)
input=stdin.readline

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

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

Submission status: Accepted

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

for i in range(1,q+1):
    x = int(input())
    if x in a:
        a[x] += 1
    else: 
        a[x] = 1

tot = sum(a.values())
tot = -tot

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

Submission status: Accepted

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

N, K, Q = list(map(int, input().split()))
a_list = []

for _ in range(Q):
    a = int(input().split()[0])
    a_list.append(a)

p_list = [K] * N
a_counter = collections.Counter(a_list)
result_list = []

count_dict = {i + 1: 0 for i in range(N)}
count_dict.update(dict(a_counter))

for winner in range(1, N + 1):
    # 負けた回数
    win_count = count_dict[winner]
    l_count = Q - win_count
    result = "Yes" if l_count < K else "No"
    result_list.append(result)

ans = "\n".join(result_list)
print(ans)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
n,k,q=[int(x) for x in input().split()]
j=0
v=np.zeros(n)
while j<q:
	i=int(input())
	v[i-1]+=1
	j+=1
j=0
while j<n:
	if(k>q-v[j]):
		print('Yes')
	else:
		print('No')
	j+=1

Submission status: Accepted

Solution code:
from collections import deque, defaultdict, Counter

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

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

# Aは正解者のリスト

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

# 正解している人に点数をプラス

cntA = Counter(A)

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

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

Submission status: Accepted

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

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

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

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

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

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

Submission status: Accepted

Solution code:
# coding utf-8
N, K, Q = input().split()
N, K, Q = int(N), int(K), int(Q)

points = [K-Q for _ in range(N)]
for q in range(Q):
    collect = int(input()) - 1
    points[collect] += 1
for p in points:
    if p>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

MOD = 10 ** 9 + 7

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

ans = [0] * N
for a in AQ:
    ans[a - 1] += 1
for i in range(N):
    if K - (Q - ans[i]) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
tmp = input().split(" ")
person = int(tmp[0])
init_pt = int(tmp[1])
questions = int(tmp[2])
points = [0] * (person + 1)
  
for i in range(questions):
  points[int(input())] += 1
  
for i in range(1, person + 1):
  if points[i] > questions - init_pt:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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('No')
    else:
        print('Yes')

Submission status: Accepted

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

#output
from collections import Counter
point = [(K-Q)] * N
C = Counter(A)

for i, j in C.items():
    point[(i-1)] += j

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

Submission status: Accepted

Solution code:
n,k,q = map(int, input().split())
d = [0]*(n+1)
for i 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: Accepted

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

Submission status: Accepted

Solution code:
# ABC141 C - Attack Survival

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

P = []

for i in range(N):
    P.append(K - Q)

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

for i in range(len(P)):
    if P[i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for a in A_list:
    score_list[a-1] += 1

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

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
r = q-k
c = 1
l = [0 for _ in range(n)]
for _ in range(q):
    a = int(input())
    l[a-1] += 1
for x in l:
    if x <= r:
        print('No')
    else:
        print('Yes')
    c += 1

Submission status: Accepted

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

# 全員終了時はK - Q + （個人の正解数）とする
# K - Q + 正解数 > 0の人は勝ち残る
for i in range(N):
    if K - Q + P[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
d=[0 for i in range(a)]
for i in range(c):
  x=int(input())-1
  d[x]+=1
for i in range(a):
  if c-d[i]<b:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

score=score-Q

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
#Nは参加人数,Kは初期ポイント、Qはクイズ回数
N ,K ,Q = map(int,input().split())

N_case =[]
i =0
while i <N :
  N_case.append(K-Q)
  i+=1

j =0
while j <Q :
  a = int(input())
  N_case[a-1] +=1
  j +=1


for n in N_case:
  if n>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

for a in A:
    P[a-1] -= 1

for p in P:
    if k-p <= 0: print('No')
    else: print('Yes')

Submission status: Accepted

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[i-1] += 1

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

Submission status: Accepted

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: Accepted

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: Accepted

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

cnt_dct = {}
for i in range(Q):
    A = int(input()) - 1
    cnt_dct[A] = cnt_dct.get(A, 0) + 1

for i in range(N):
    cnt = cnt_dct.get(i, 0)
    
    if K + cnt > Q:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time
sys.setrecursionlimit(10**7)
inf = 10**20

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

Submission status: Accepted

Solution code:
# INPUT
N, K, Q = map(int, input().split())
A = []
for i in range(Q):
    A.append(int(input()))
# PROCESS
points = [0 for x in range(N+1)]
for x in A:
    points[x]+=1
threshold = K - Q
# OUPUT
for y in range(1, N+1):
    if threshold + points[y] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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


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

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

Submission status: Accepted

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 a:
    if k-q+i>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

point = [k - q] * n

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

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

Submission status: Accepted

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

list=[(K-Q) for j in range(N)]

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

for score in list:
    if 0<score:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
from collections import Counter

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

cnt = Counter(A)

ans = [0] * N
for i in range(N):
    ans[i] = K + cnt[i+1] - Q

print("\n".join("Yes" if val > 0 else "No" for val in ans))

Submission status: Accepted

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

Submission status: Accepted

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

    for player_answer in A_list:
        # 正解者スコア+1して, その後全体-n
        player_score[player_answer - 1] = player_score[player_answer - 1] + 1

    player_score = list(map(lambda i: i - len(A_list), player_score))
    
    for score in player_score:
        print("Yes" if score > 0 else "No")
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# get initial input parameter
n, k, q = map(int, input().split())
 
# init point
point_list = [ (k - q) for _ in range(n) ]
 
for round in range(q):
    # get correct answer persion
    person_index = int(input()) - 1
    
    # point decrement
    point_list[person_index] += 1
 
for item in point_list:
    if (0 < item):
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

for i in range(N):
    print('Yes' if Q < K + score[i] else 'No')

Submission status: Accepted

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: Accepted

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

scores = [k - q] * n

for index in range(q):
    winner = int(input())
    scores[winner - 1] += 1

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

Submission status: Accepted

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

y = [k]*n
for i in range(n):
  y[i] -= (q-x[i])
  if y[i] <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    num_of_ans = [0 for _ in range(N)]
    for _ in range(Q):
        num_of_ans[int(input())-1] += 1
    
    for i in range(N):
        points = K - (Q - num_of_ans[i])
        if points <= 0:
            print("No")
        else:
            print("Yes")

solve()

Submission status: Accepted

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

Submission status: Accepted

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

score_list = [K - Q] * N

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: Accepted

Solution code:

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

#正解数
A = [0] * N

#残るのに必要なline
line = Q - K + 1

#KがQよりおおきければ全員残れる
if line - 1 < 0:
    for i in range(N):
        print('Yes')
    exit()
#KがQより小さい時、K-Qの値より正解数が多くないと残れない

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
N, K, Q = map(int, input().split())
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * (N + 1)
for a in A:
    score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans)

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = []
for q in range(Q):
    A.append(int(input()))
score = [K - Q] * (N + 1)
for a in A:
    score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

for i in range(q):
  b = int(input())
  a[b-1] += 1
  
for i in range(n):
  if a[i] > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#print(a)

score = [k - q ] * n
#print(score)
for i in range(q):
  score[ a[i]-1 ] += 1
  #print(score)
  
for i in range(n):
  print("Yes" if score[i] > 0 else "No")

Submission status: Accepted

Solution code:
import math
import queue

mod = 1e9+7

def swap(a,b):
    return (b,a)

def gcd(a,b):
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a):
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter as co
h,s,q=map(int,input().split())
l=co([int(input()) for e in range(q)])
for i in range(h+1)[1:]:
  print("Yes") if s-q+l[i]>0 else print("No")

Submission status: Accepted

Solution code:
import numpy as np

n, k, q = [int(nkq) for nkq in input().split()]
arr = np.full(n, k-q, dtype=np.int64)

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

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))

N,K,Q = LI()
A = [0 for i in range(Q)]
for i in range(Q):
    A[i] = int(input()) - 1

cnt = {}

for i in range(N):
    cnt[i] = 0

for a in A:
    cnt[a] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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 K - (Q - A[i+1]) > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

point = [K-Q for i in range(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')