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:
from collections import defaultdict


def resolve():
    n, k, q = map(int, input().split())
    scores = defaultdict(int)
    a = list(int(input()) for _ in range(q))
    for ai in a:
        scores[ai - 1] += 1
    for i in range(n):
        if scores[i] + k - q > 0:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
a_c = collections.Counter(A)
cnt = 0
x = ['No'] * n
if q-k < 0:
	for a in range(n):
		print('Yes')
	exit()
for i,j in a_c.items():
  if j > q-k:
    x[i-1] = 'Yes'
for k in x:
	print(k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


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


def main():
    N, K, Q = map(int, input().split())
    score = [K] * N
    num = [0] * N
    ans = ["Yes"] * N
    for i in range(Q):
        i = int(input())
        num[i-1] += 1
    for i in range(N):
        score[i] -= Q - num[i]
        if score[i] <= 0:
            ans[i] = "No"

    for i in range(N):
        print(ans[i])


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
sn,sk,sq = input().split(" ")
n = int(sn)
k = int(sk)
q = int(sq)

l = [k for i in range(n)]

m =[0 for i in range(n)]

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

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

Submission status: Accepted

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

score = []

for i in range(0, N) :
  score.append(int(0))
  
for j in Qlist :
  score[ j - 1 ] += 1

minScore = Q - K
 
len(score)
  
for l in score :
  if l > minScore :
    print("Yes")
  else :
    print("No")

Submission status: Accepted

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

score = [k - q]*n

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

import math
import statistics
import numpy as np

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

cor = np.zeros(n)

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

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter

N,K,Q = list(map(int,input().split()))
A = []
for i in range(Q):
  tmp = int(input())
  A.append(tmp)
  
if K > Q:
  for i in range(N):
    print('Yes')
  sys.exit()
K_Q = K - Q
A_freq = Counter(A)
for i in range(1,N+1):
  if K_Q + A_freq[i] > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
L1 = input().split(" ")
L12 = int(L1[2])
score = [int(L1[1])-L12]*(int(L1[0]))
for i in range(L12):
    A = int(input()) - 1
    score[A] += 1

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

Submission status: Accepted

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

listb=[k-q]*n
for i in range(q):
    listb[lista[i]-1]=listb[lista[i]-1]+1
#print(listb)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
#A_point = np.full((N, 1), K)
A_zero  = np.zeros((N, 1))


for i in range(Q):

        Ai = int(input())
        A_zero[Ai-1][0] += 1

for i in range(N):

        print("Yes" if K-(Q-A_zero[i][0])>=1 else "No")

Submission status: Accepted

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

for i in range(Q):
    P[int(input())-1] += 1
for i in range(N):
    ans = K - Q + P[i]
    if ans > 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)]

w=k-q
e=abs(w)
b=[w]*n

if w>0:
  for _ in range(n):
    print("Yes")
  exit()

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

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

Submission status: Accepted

Solution code:
import numpy as np

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

res = np.zeros(N)
for a in As:
    res[a-1] += 1
    
for i in range(N):
    if res[i] > (Q - K) :
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import numpy as np

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

a = np.full(n, k)
plus_point = np.zeros(n, dtype=np.int)

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


a -= q
a += plus_point

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

Submission status: Accepted

Solution code:
def attackSurvival(n,k,q):
    points = [k]*n
    p = [q]*n

    for i in range(q):
        a = int(input())-1
        p[a]-=1
    
    res = ""
    for j in range(n):
        if points[j]<=p[j]:
            res+="No\n"
        else:
            res+="Yes\n"
    print(res)
(n,k,q) = map(int,input().split(" ")) 
attackSurvival(n,k,q)

Submission status: Accepted

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

Submission status: Accepted

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

correct_num = [0] * n
correct = [int(input()) for _ in range(q)]

for elm in correct:
    correct_num[elm-1] += 1

for elm in correct_num:
    print("Yes") if k > (q - elm) else print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# C - Attack Survival
from collections import Counter

N, K, Q = map(int, input().split())
a = [int(input()) for i in range(Q)]
A = Counter(a)
B = 1 - (K-Q)

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

Submission status: Accepted

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

# print(N)
# print(K)
# print(Q)

scores = []
for i in range(N):
    scores.append(K)

for i in range(Q):
    # print(i)
    A = int(input())
    # print(A)
    
    # for j in range(N):
    #     if j + 1 != A:
    #         scores[j] -= 1
    scores[A - 1] += 1
            
# print(scores)

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

Submission status: Accepted

Solution code:
import collections

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

c = collections.Counter(A)
cnt = [0] * N
for i in c.most_common():
    cnt[i[0]-1] = i[1]

if K > Q:
    for i in range(N):
        print('Yes')
elif K <= Q:
    for i in cnt:
        if i >= Q-K+1:
            print('Yes')
        else:
            print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

pointlist=[0]*N

for i in Alist:
    pointlist[i-1]+=1

for n in pointlist:
    if n>Q-K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

for i in range(Q):
    P[int(input())-1] += 1
for i in range(N):
    ans = K - Q + P[i]
    # print(ans)
    if ans > 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)]
p = [K for j in range(N)]
for n in a:
    p[n-1] = p[n-1] - 1
if K > Q:
    for h in range(N):
        print('Yes')
else:
    for d in p:
        if d <= K-(Q-K+1):
            print('Yes')
        else:
            print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
#N人、持ち点K、問題Q
anss = [0] * n
tmp = 0
for i in range(q):
  tmp = int(input())
  anss[tmp-1] += 1
for i in anss:
  if i > q - k:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

for i in range(Q):
    A = int(input())
    p[A-1] = p[A-1] + 1
for i in p:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

# vec = [K for _ in range(N)]

vec = [0 for _ in range(N)]

for _ in range(Q):
    A = int(input())
#     for i in range(N):
#         vec[i] -= 1
    vec[A-1] += 1

ret = '\n'.join(['Yes' if K-Q+x > 0 else 'No' for x in vec])
print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
person = np.asarray([K] * N)

ok_person = [int(input()) for i in range(Q)]
false_num = len(ok_person)
person -= false_num
#print(person)
for i in ok_person:
    person[i-1] += 1
#    print(person)

#print(person)

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

Submission status: Accepted

Solution code:
from collections import Counter 

N, K, Q = [int(s) for s in input().split(' ')]
A = [int(input()) - 1 for s in range(Q)]

c = Counter(A)

sum = sum(c.values())

for i in range(N):
  
  if sum - c[i] < K:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
A_list = np.array([0] * N)
i = 0
while i < Q:
  A_list[int(input()) - 1] += 1
  i += 1

N_list = np.array([K] * N)
N_list = N_list + A_list - Q

for N in N_list:
  if N <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

for point in points:
    if point > Q:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

ct_lst = [0] * n
for x in win_lst:
  ct_lst[x-1] += 1

ttl = sum(ct_lst)
for y in ct_lst:
  if (k-ttl + y) >= 1:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
member, start, round = list(map(int, input().split()))
answer = [0] * (member+1)
for i in range(round):
    answer[int(input())] += 1
for i in range(member):
    if start - (round - answer[i+1]) <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
N, K ,Q = list(map(int, input().split()))
Point = [K for n in range(N)]
for q in range(Q):
    A = int(input()) - 1
    Point[A] += 1

for n in range(N):
    if Point[n] - Q > 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)]

point = [[] for _ in range(N)]

for x in range(N):
    point[x] = K
    
for y in A:
    point[y-1] = point[y-1] + 1

def result(p):
    return p-Q
    
B = list(map(result, point))

for z in B:
    print("Yes") if z>0 else print("No")

Submission status: Accepted

Solution code:
get = list(map(int, input().split()))

N = get[0]
K = get[1]
Q = get[2]

list = [0]*N

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

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

Submission status: Accepted

Solution code:
import collections

n, k, q = map(int, input().split())
li = [0]*q

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

dic = collections.Counter(li)

if q < k:
    res = ["Yes" for _ in range(n)]
else:
    res = ["No" for _ in range(n)]
    for key, val in dic.items():
        if val > q-k:
            res[key-1] = "Yes"

for s in res:
    print(s)

Submission status: Accepted

Solution code:
x = map(int,raw_input().split())
n=x[0]
k=x[1]
q=x[2]

z=[k-q]*n



for i in range(q):
    y=int(raw_input())
    z[y-1]=z[y-1]+1


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

Submission status: Accepted

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

for i in range(0, N):
    LIST.append(K)

for i in range(0, Q):
    offset = int(input()) - 1
    LIST[offset] += 1
        
for i in LIST:
    if i - Q >= 1:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
array = []
for i in range(c):
	array.append(int(input()))

point = [b] * a
 
for i in range(c):
	point[array[i]-1] = point[array[i]-1] + 1
            
for i in range(len(point)):
	if (point[i]-c) > 0 :
		print('Yes')
	else:
		print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N, K, Q = [int(n) for n in input().split()]
c = {}
ans = [K]*N
for i in range(Q):
    a = int(input())
    if a not in c:
        c.setdefault(a, 1)
    else:
        c[a] += 1
for j in range(N):
    print('Yes' if ans[j] - (Q-c.get(j+1, 0)) > 0 else 'No')

Submission status: Accepted

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

li = [k]*n
for i in a:
    li[i-1] +=1
ans = list(map(lambda x:x-q,li))

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding:utf-8 -*-


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

win_count = [0] * N
for _ in range(Q):
    A_i = int(input().strip())
    win_count[A_i - 1] += 1

is_ok = [True if Q - cnt < K else False for cnt in win_count]

for i in range(N):
    if is_ok[i]:
        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):
    t=int(input())
    a[t-1]+=1
#print(a)
for i in a:
    if k-(q-i)>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import numpy as np
n, k, q = map(int, input().split())
points = np.full(n, k)
z = np.full(n, 0)
points = points - q
for i in range(q):
    a = int(input())
    z[a - 1] += 1
points = points + z
for point in points:
    if point > 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):
  a[int(input())-1]+=1
for i in range(n):
  if k-(q-a[i])>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

g = k-q

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

Submission status: Accepted

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

motiten = [k]*n
mon_sei = [q]*n
for i in a:
    mon_sei[i-1] -= 1

ans = np.array(motiten) - np.array(mon_sei)
for i in range(len(ans)):
    if ans[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

#初期ポイント
points=[K for _ in range(N)]

# 問題数分、ポイントを引いてしまい、
# あとから正解者にポイントを足す
points=list(map(lambda x: x - Q, points))

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

#print(list(map(lambda x: 'Yes' if x > 0 else 'No', points)))

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

Submission status: Accepted

Solution code:
def solve(N, K, Q, A):
    wincount = [0] * (N + 1)
    win = ['Yes'] * (N + 1)
    for i in range(Q):
        wincount[A[i]] += 1
    for i in range(1, N + 1):
        win[i] = (Q - K) < wincount[i]
    return win[1:]


def main():
    N, K, Q = map(int, input().strip().split())
    A = [0] * Q
    for i in range(Q):
        A[i] = int(input().strip())
    result = solve(N, K, Q, A)
    for r in result:
        print('Yes' if r else 'No')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

sumP = sum(P)
for n in range(N):
    ans = 'No'
    total = sumP - P[n]
    if  K - total > 0:
        ans = 'Yes'
    print(ans)

Submission status: Accepted

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

for i in range(q):
    accepted[As[i]-1] += 1

for i in range(n):

    if k - q + accepted[i] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:

L = input().split(" ")
N = int(L[0])
K = int(L[1])
Q = int(L[2])
correct = []
points =[]
for i in range(N):
    points.append(K-Q)
for i in range(Q):
    correct.append(input())
for i in range(Q):
    win = int(correct[i])
    points[win-1] = points[win-1] + 1
ans = []
for i in range(N):
    if points[i] > 0:
        ans.append("Yes")
    else:
        ans.append("No")
for i in range(N):
    print(ans[i])

Submission status: Accepted

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

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

Submission status: Accepted

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

from collections import Counter

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,k,q = map(int,input().split())
a = [0 for i in range(n)]
for i in range(q):
    aa = int(input()) - 1
    a[aa] = a[aa] + 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())
last = []
initial = [k for x in range(n)]
initial.insert(0, 0)
for i in range(q):
    last.append(int(input()))
for i in last:
    initial[i] += 1
initial = [x - q for x in initial]
initial = initial[1:]
for i in initial:
    if i > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

print(*["Yes" if k + i - q > 0 else "No" for i in t],sep="\n")

Submission status: Accepted

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

sanka = [K] * N

for i in range(Q):
  a = int(input())	
  A.append(a-1)
  
  sanka[A[i]] += 1
  
for i in range(N):
  if sanka[i] > Q:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

a = []

for i in range(0,Q):
    x = int(input())
    a.append(x)

l = [0] * N

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

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

Submission status: Accepted

Solution code:
import numpy as np

# N=>参加者人数　K=>参加時点の全員の所持ポイント　Q=>正解が出た回数
N, K, Q = map(int, input().split())

# 各参加者のポイント
# points = [K] * N
points = np.full(N, K, np.int64) - Q

# 正解者リスト
# ans_list = [input() for i in range(Q)]
#
# for ans in ans_list:
#     points[int(ans)-1] += 1

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

# print(points)

for point in points:
    if point > 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)]
lena = len(a)
p = [k-lena for i in range(n)]
for i in a:
  p[i-1] += 1
for i in p:
  if i > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
import collections
N, K, Q = map(int, input().split())
A = [int(input()) - 1 for _ in range(Q)]
c = collections.Counter(A)
# print(c)
for i in range(N):
  nokori = K - (Q - c[i])
#   print(nokori)
  if (nokori <= 0):
    print("No")
  else:
    print("Yes")

Submission status: Accepted

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

Kl = [K]*N

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

Co=0
for j in range(N):
  if Kl[j]>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

P_list = list(map(lambda x:x-Q, P_list))


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

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

Submission status: Accepted

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

point=[K-Q]*N

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

Submission status: Accepted

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

for p in pts:
    if p>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
p = [K] * N
s = [-Q] * N
for n in A:
  s[n-1] += 1
sum = np.array(p) + np.array(s)
for num in sum:
  if num>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

diff = k-q
solution = [diff]*n    
for i in range(q):
    solution[arr[i]-1] += 1
    
bool_solution = [True if solution[i] > 0 else False for i in range(n)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

for j in range(N):
    if P[j]-(Q-K)>0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]

dp = [K] * N


def calc_dp(n):
    return n - Q


for i in A:
    # dp = list(map(calc_dp, dp))
    dp[i - 1] += 1

dp = list(map(calc_dp, dp))

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

Submission status: Accepted

Solution code:
#coding:utf-8

n, k, q = map(int, input().split())
a = [input() for i in range(q)]
point = [k-q] * n
#print(point)

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

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

Submission status: Accepted

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

dp = {p:0 for p in range(N)}

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

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

Submission status: Accepted

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

Submission status: Accepted

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

    player_scores = [(K-Q) for i in range(N)]
    for player in solve_player:
        player_scores[player-1]+=1
    
    for score in player_scores:
        if(score>0):
            print('Yes')
        else:
            print('No')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

dicA = {}

for a in A:
    if a in dicA.keys():
        dicA[a] += 1
    else:
        dicA[a] = 1

for n in range(1, N+1):
    if K - Q > 0:
        print("Yes")
    elif n in dicA.keys() and K - Q + dicA[n] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
participant, initial, quiz = map(int, input().split())
# 初期点-クイズ数を初期点数として正解ごとに点数を足し最終スコアを出す．
point = [initial - quiz]*participant
for i in range(quiz):
  a = int(input())
  point[a-1] += 1
for i in range(participant):
  if point[i] < 1:
    print('No')
  else:
    print('Yes')

Submission status: Accepted

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

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

people = []
for i in range(N):
    people.append(K - Q)

for i in A:
    people[i-1] += 1

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

Submission status: Accepted

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

for i in range(n):
    m.append(k-q)

for j in a:
    m[j-1] += 1

for k in m:
    if k <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def solve(N, K, Q, A):
    num_correct = [0 for _ in range(N)]
    for a in A:
        num_correct[a - 1] += 1
    threshold_to_survive = Q - K
    for c in num_correct:
        if c > threshold_to_survive:
            print('Yes')
        else:
            print('No')


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

    answer = solve(N, K, Q, A)

Submission status: Accepted

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

Ap = []
for i in range(N):
    Ap.append(0)

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

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

Submission status: Accepted

Solution code:
import collections
n, k, q = map(int, input().split())
u = [int(input()) for jjj in range(q)]
c = collections.Counter(u)
m = {h: hh for h, hh in c.most_common()}
u = set(u)
for x in range(1, n+1):
    if x not in u:
        if k - q > 0:
            print('Yes')
        else:
            print('No')
        continue
    if k - (q - m[x]) > 0:
        print('Yes')
    else:
        print('No')