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()) for i in range(q)]

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

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

for i in kaisuu:
  if k-q+i>0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
import sys
N,K,Q = (int(x) for x in input().split(" "))
result = [0]*N

for i in range(0, Q):
    result[int(input())-1] += 1
# #A = [int(x) for x in input().split()]
for i in range(0, len(result)):
    if ((K-Q+result[i])<=0):
        print("No")
    else:
        print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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

points = [k-q for i in range(n)]

for i in A:
		points[i-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 i in range(q)]

need_s = q - k + 1

if need_s <= 0:
    for i in range(n):
        print('Yes')
    exit()

a.sort()

per = [0]*(n+1)

#print(need_s)

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

#print(per)

for i in range(1,n+1):
    if per[i] >= need_s:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
## n人の参加者、kポイントを持ち、q回の正解がある
## kは最大で10億あるのでintでok
## n, qは最大で10000なのでリストを持つ
scores = [0] * n
for x in range(q):
  ac_person = int(input())
  scores[ac_person - 1] += 1
## 正解者にスコアを足していって、スコア + k - q > 0ならYesと出力
for x in range(n):
  if scores[x] + k - q > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N, K, Q = [int(v) for v in raw_input().split()]
points = [0] * N
for n in range(Q):
    A = int(raw_input()) -1
    points[A] += 1
for n in range(N):
    res = K + points[n] - Q
    if res > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, deque


def main():
    N, K, Q = map(int, input().split())
    Score = [0] * N

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
li = [K]*N
li = list(map(lambda x: x-Q, li))

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python
# coding: UTF-8


#import scipy.optimize
#import numpy as np

    
##################################################################

if __name__ == "__main__":

    Input1 = [input() for i in range(1)]
    N,K,Q = list(map(int,Input1[0].split()))
    A = [int(input()) for i in range(Q)]

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

Submission status: Accepted

Solution code:
import sys
# a, b = map(int,input().split())

# n,k = map(int,input().split())
# n = int(input())
n,k,q = map(int,input().split())
whocorrect = [int(input()) for _ in range(q)]
points = [0] * n
for who in whocorrect:
        points[who-1] += 1
answer = list(map(lambda x: 'No' if k <= q-x else 'Yes',points))
for a in answer:
        print(a)

Submission status: Accepted

Solution code:
[N, K, Q] = [int(i) for i in 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=[int(input()) for _ in range(Q)]
P=[0]*N
for a in A:
    P[a-1]+=1
for x in P:
    if K-Q+x>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)]
X = [0] * N
Y = K - Q 
for i in range(Q):
  X[A[i]-1] += 1
for j in range(N):
  if Y + X[j] > 0:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
n, k ,q = map(int,input().split())
A = []
for i in range(n):
    A.append(k)
for i in range(q):
    tmp = int(input()) - 1
    A[tmp] += 1
for i in range(n):
    if A[i] - q <= 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)]
Tensu = [K-Q-1] * N

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

for i in range(len(Tensu)):
    if Tensu[i] >= 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
str_list = input().split(' ')
int_list = [int(x) for x in str_list]
N, K, Q = int_list[0], int_list[1], int_list[2]
A = []
for _ in range(Q):
    A.append( int(input()) )
point = [int(K)]*N
import numpy as np
point = np.array(point)
for ii in range(Q):
    point[A[ii]-1] += 1
point -= Q
for ii in range(N):
    if point[ii] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import Counter
INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
sys.setrecursionlimit(10 ** 9)


def main():
    N, K, Q = MAP()
    A = [INT() for _ in range(Q)]
    C = Counter(A)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,k,q=map(int,input().split())
a=[int(input())-1 for i in range(q)]
ans=[k-q]*n
for i in a:
    ans[i]+=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 = []
for i in range(Q):
    array = list(map(int, input().strip().split()))
    A.append(array)
Point = [K-Q]*N
for i in range(Q):  
  a = A[i][0]
  Point[a-1] = Point[a-1] + 1
for j in range(N):
  if Point[j] > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

for i in range(N):
    if Ans[i] >0:
        print("Yes")
    if Ans[i] <=0:
        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)]
c = Counter(a)

for i in range(n):
    if k - q + c.get(i + 1, 0) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# A, B = [int(i) for i in input().split(" ")]
# A = int(input())
# As = [int(i) for i in input().split(" ")]
# Ss = ["".join(sorted(input())) for _ in range(N)]

N, K, Q = [int(i) for i in input().split(" ")]
As = [int(input()) for _ in range(Q)]
buff = [K for _ in range(N)]
for a in As:
  i = a - 1
  buff[i] += 1
for b in buff:
    if b - Q > 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) ]

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

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

for i in range(N):
    L[i] = K - Q + L[i]
    if(L[i]>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())
    A[a-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()) 
start = [k-q] * n 
for i in range(q):
    a = int(input())
    start[a-1] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    N,K,Q,*A = map(int, open(0).read().split())

    p = [-Q+K]*N
    for a in A:
        p[a-1] += 1

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

A = list(map(int, [input() for _ in range(q)]))

sc = [k]*n
for a in A:
    sc[a-1] += 1

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

Submission status: Accepted

Solution code:
class ScoreBoard:
    def __init__(self, n, k):
        self.answerd = [0 for i in range(n)]
        self.init_score = k
        self.num_questions = 0

    def answer(self, i):
        ai = i - 1
        self.answerd[ai] += 1
        self.num_questions += 1

    def calc_score(self, i):
        answerd = self.answerd[i]
        return self.init_score - self.num_questions + answerd

    def isWon(self, i):
        return self.calc_score(i) > 0


def main():
    n, k, q = (int(i) for i in input().split(' '))

    score_board = ScoreBoard(n, k)

    for i in range(q):
        ai = int(input())
        score_board.answer(ai)

    for i in range(n):
        if score_board.isWon(i):
            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)]
c=[k-q for i in range(n)]
for i in range(q):
  b=int(input())
  c[b-1]+=1
for i in c:
  if i<=0:
    print("No")
  else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys

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

status = [0]*N

input = sys.stdin.readline

need_win = Q-K+1


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


if need_win<=0:
    for _ in range(N):
        print('Yes')
    exit(0)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import collections

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

def LIST():
    return list(map(int, input().split()))

N,K,Q=LIST()
A = [int(input())-1 for _ in range(Q)]

arr = [K] * N

c = collections.Counter(A)
for i in range(N):
    if i in c.keys():
        arr[i] -= Q - c[i]
    else:
        arr[i] -= Q

for val in arr:
    if 0 < val:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from bisect import *
from collections import *
from copy import deepcopy
from heapq import *
from itertools import *
from math import *
from operator import *
from pprint import *

sys.setrecursionlimit(10**8)

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, K, Q = list(map(int, input().split(' ')))
yes = 'Yes'
no = 'No'

# 誰が何回正解したか保存
A = [0] * N
for i in range(Q):
  a = int(input()) - 1
  A[a]+=1

# K + (正解した回数) - Q > 0 ならYes
for a in A:
  if K + a - Q > 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 = [0] * N

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

n, k, q = map(int, input().split())
point = [0 for _ in range(n)]
for l in sys.stdin:
    point[int(l)-1] += 1

# print(point)


for p in point:
    if p >= (q - k) + 1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

scores = []
for j in range(n):
    scores.append(q)

for p in points:
    scores[p-1] = scores[p-1] - 1
    
for s in scores:
    if s <k:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
points = [K]*N
for a in A:
    points[a-1]+=1
for p in points:
    if p>Q:
        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):
    idx = int(input())
    A[idx-1]+=1
for item in A:
    if item > (Q-K):
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

for _ in range(q):
    a_ = int(input())
    a.append(a_)

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

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

Submission status: Accepted

Solution code:
participants,p,quiz=map(int,input().split())
answer_lst = [0 for _ in range(participants+1)]

for _ in range(quiz):
    answer = int(input())
    answer_lst[answer] = answer_lst[answer]+1

for i in range(1,len(answer_lst)):
    if p-(quiz-answer_lst[i]) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# ABC141c
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

sanka = [0]*n

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

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
A=[0]*a[0]
for i in range(a[2]):
    tmp=int(input())
    A[tmp-1]+=1
ans=['No','Yes']
for i in range(a[0]):
    print(ans[(a[1]+A[i]-a[2])>0])

Submission status: Accepted

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

#print(n, k, q)
#print(lisA)

pointA = [k] * (n+1)
#pointA[0]は無視

for i in lisA:
	pointA[i] += 1

for i in range(1, n+1):
	pointA[i] -= q
	if (pointA[i] <= 0):
		print("No")
	else:
		print("Yes")

Submission status: Accepted

Solution code:
import sys
n,k,q=map(int,input().split())
if k-q>0:
  for i in range(n):
    print('Yes')
  sys.exit()
a=[0]*n
for i in range(q):
  b=int(input())
  a[b-1]+=1
for j in range(n):
  if k-q+a[j]>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)]
P = [-Q+K for _ in range(N)]
for a in A:
    P[a-1] += 1
for p in P:
    if p<=0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
import sys
import collections

input = sys.stdin.readline

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

cnt=[0]*N

countA = collections.Counter(A)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
a = []
for i in range(q):
    a.append(int(input()))
# n, k, q = 6, 3, 4
# a = [3, 1, 3, 2]
ans = []
s = []
for i in range(n):
    # ans.append('Yes')
    s.append(k - q)
# print(s, ans)
for i in range(q):
    s[a[i] - 1] += 1
ans = []
for i in s:
    if i > 0:
        ans.append('Yes')
    else:
        ans.append('No')
# print(s)
print('\n'.join(ans))

Submission status: Accepted

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

#print(score)
for i in range(Q):
    score[li[i]-1]+=1
#print(score)
kekka=[]
for i in range(N):
    if score[i]<=0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
import sys


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


def main():
    N, K, Q = map(int, input().split())
    win = [0] * N

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

    for w in win:
        is_win = K - (Q - w) > 0
        if is_win:
            print('Yes')
        else:
            print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import numpy as np

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

for i in A:
    if i <= 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 _ in range(Q)]
ansnum = [0] * N
for a in A:
    ansnum[a - 1] += 1
for n in ansnum:
    if (Q - n < K):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
from collections import Counter

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

cnt = Q-K

res = Counter(A)

for i in range(N):
    if cnt < res[i]:
        print('Yes')
    else:
        print('No')
    # print(cnt,i,res[i])

Submission status: Accepted

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int, K: int, Q: int, A: "List[int]"):
    result = {n:0 for n in range(N)}
    for a in A:
        result[a-1] += 1
    for k, v in result.items():
        if K - Q + result[k] <= 0:
            print('No')
        else:
            print('Yes')
    return


# Generated by 1.1.5 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    Q = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(Q)]  # type: "List[int]"
    solve(N, K, Q, A)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,K,Q = map(int, raw_input().split())
P = [K]*N
for i in range(Q):
    A = int(raw_input())
    P[A-1] += 1
    
P = [p-Q for p in P]

for p in P:
    if p > 0:
        print "Yes"
    else:
        print "No"

Submission status: Accepted

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

points = [k - q] * n

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

Submission status: Accepted

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

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np
N,K,Q = map(int,input().split())
ans = [K-Q]*N
for i in range(Q):
  seikai = int(input())-1 #0~N-1
  ans[seikai] += 1
for i in range(N):
  if ans[i] > 0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
#N人の参加者 全員がＫポイント持っている 
#Q回の正解
#Aは誰が正解したか
N,K,Q=map(int,input().split())
Ans=[]
for _ in range(Q):
    hoge=int(input())
    Ans.append(hoge-1)
# print(Ans) 
person=N*[K-Q]
# print(person)

#問題
for i in range(Q):
    person[Ans[i]]+=1
    # #人
    # for j in range(N):
    #     if Ans[i]==j:
    #         pass
    #     else:
    #         person[j]-=1
    # print(person)
# print(person)

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

Submission status: Accepted

Solution code:
N,K,Q = [int(x) for x in input().split(" ")]
answer_count = [0 for k in range(N)]
for _ in range(Q):
    answer_count[int(input()) - 1] += 1
must_answer = Q - K + 1
for i in answer_count:
    if must_answer <= i:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import collections

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

c=collections.Counter(a)

for i in range(1,n+1):
    if k-q+c[i]>=1:
        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)]

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

point_lim = Q - K
A = [0] * N

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

for i in range(N):
  print('Yes' if point_lim < A[i] else 'No')

Submission status: Accepted

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

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

for i in range(N):
  A.append(i+1)

counter = collections.Counter(A)
counter = [list(e) for e in counter.items()]
for i in range(N):
  counter[i][1] = counter[i][1]-1
  counter[i][1] = Q-counter[i][1]

for i in range(N):
  point = K - counter[i][1]
  
  if(point <= 0): 
    print('No')
  else: 
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

def main():
    N, K, Q = [int(x) for x in input().split()]
    X = np.array([K - Q] * N)
    for _ in range(Q):
        X[int(input())-1] += 1
    
    for x in X:
        if x > 0:
            print("Yes")
        else:
            print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys

def main():
	input = sys.stdin.readline

	N, K, Q = list(map(int,input().strip().split()))
	count = [0]*N
	for i in range(Q):
		Ai = int(input().strip())
		count[Ai-1] += 1

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import defaultdict


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

    l = defaultdict(int)

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

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


if __name__ == '__main__':
    p_c()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

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

for n_win in n_win_list:
    if n_win >= Q-K+1:
        print("Yes")
    else:
        print("No")