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:
import sys
import math
import collections
from collections import deque
#n = int(input())
n, k, q = map(int, sys.stdin.readline().split())
#s = input()
#x = list(map(int, sys.stdin.readline().split()))

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


for i in range(1, n+1):
    if k - q + c[i-1] > 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)]
Ap=[k-q]*n
for i in A:
    Ap[i-1]+=1
for j in range(n):
    if Ap[j]>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)]
li = [0 for i in range(N)]
for i in A:
    li[i-1] += 1
for i in li:
    if K - Q + i > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import collections

n, k, q = map(int,input().split())
A = [int(input()) for i in range(q)]
c = collections.Counter(A)

for i in range(1,n+1):
  if c[i] >= q-k+1 :
    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()))
#
point_get = [0] * n
for i in range(q):
    point_get[a[i]-1] += 1
#
for j in range(n):
    if k - q + point_get[j] >= 1:
        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())
    A[a-1] += 1

print('\n'.join(['No' if K-Q+e <= 0 else 'Yes' for e in A]))

Submission status: Accepted

Solution code:
#ABC141.C
N,K,Q = map(int,input().split())
A = [int(input())for i in range(Q)]
La = [(K-Q) for i in range(N)]
for m in range(Q):
    La[A[m]-1]+=1
for j in range(N):
    if La[j] <= 0:
        print('No')
    elif La[j] >0:
        print('Yes')

Submission status: Accepted

Solution code:
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N, K, Q = lr()
points = np.full(N, K - Q)
for _ in range(Q):
    a = ir() - 1
    points[a] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

import collections
dict=collections.Counter(A)
for person in range(1,N+1):
    if K-Q+dict[person]>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)]
player_point = [q]*n

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

for i in range(n):
    if player_point[i] < k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N,K,Q = map(int,input().split())
A = [0] * Q
for i in range(Q):
    A[i] = int(input())
    
judge = [K-Q] * N
for j in A:
    judge[j-1] += 1

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N,K,Q = map(int,input().split())
A = [0] * Q
for i in range(Q):
    A[i] = int(input())
    
judge = [K-Q] * N
for j in A:
    judge[j-1] += 1

for k in judge:
    if k > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys
import math

from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def load_n_times(n, vtype=int):
    r = []
    for _ in range(n):
        r.append(load(vtype=vtype))
    return r
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 
def prime_list(n):
    li = [i for i in range(2, n+1)]
    for i in range(len(li)):
        if li[i] >= int(math.sqrt(n)):
            break
        if li[i] == -1:
            continue
        for j in range(i+1, len(li)):
            if li[j] % li[i] == 0:
                li[j] = -1
    return [n for n in li if n != -1]
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while True:
        r = a % b
        if r == 0: return b
        a, b = b, r
def lcm(a, b):
    return int(a * b / gcd(a,b))
def all_subset(li):
    s = []
    n = len(li)
    for bit in range(0, (1<<(n+1))):
        ss = set()
        for i in range(0, n):
            if (bit & (1 << i)):
                ss.add(li[i])
        s.append(ss)
    return s

n, k, q = load_list()

A = load_n_times(q)

d = defaultdict(int)

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

for i in range(1, n+1):
    if q - d[i] < k:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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


# 勝ち抜けチェック 
for i in range(N):
	if K-Q+score[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)]
pt = [k-q for _ in range(n)]
for i in a:
  pt[i-1] += 1
for i in pt:
  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()) for _ in range(q)]
c = collections.Counter(a)
for i in range(1, n + 1):
    if k - q + c[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
aq = [int(input()) for i in range(q)]
point = [k for i in range(n)]
correct_ans = [0] * n

for i in range(q):
    correct_ans[aq[i] - 1] += 1
    
point = ['Yes'  if p - (q - ca) > 0 else 'No' for (p, ca) in zip(point, correct_ans)]

for p in point:
    print(p)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
C - Attack Survival
https://atcoder.jp/contests/abc141/tasks/abc141_c

"""
import sys


def solve(N, K, Q):
    scores = {n: K for n in range(1, N+1)}
    for _ in range(Q):
        a = int(input())
        scores[a] += 1
    ans = ['Yes' if scores[i] - Q > 0 else 'No' for i in range(1, N+1)]
    return ans


def main(args):
    N, K, Q = map(int, input().split())
    ans = solve(N, K, Q)
    print(*ans, sep='\n')


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

def main():
    N, K, Q = input_nums()

    score = {}
    for i in range(N):
        score[i] = 0

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

    for k, v in score.items():
        # print(k, v)
        if K + v - Q > 0:
            print('Yes')
        else:
            print('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):
    a = int(input())
    p[a-1] += 1
for i in range(n):
    print("Yes" if k - q + p[i] > 0 else "No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# import scipy as scp

# 入力の受け取り
n,k,q = map(int,input().split())
correct_member = [int(input())-1 for _ in range(q)]

ans = [k-q for _ in range(n)]

cormem_count = Counter(correct_member)

for k,v in cormem_count.items():
    ans[k] += v

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

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 range(n):
    if q - a[i] < k:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import numpy as np

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

B =[K] * N
#print(A,B)

for i in A:
    B[i-1] =B[i-1] + 1
    #print(B)

B = np.array(B)
C = [Q] * N
C = np.array(C)
ans = B - C
ans =ans.tolist()
#print(ans)

for i in ans:
    if 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)]

points = [K - Q] * N

for i in A:
    points[i - 1] += 1
for p in points:
    if p > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#141_C
n, k, q = map(int, input().split())
score = [k - q for _ in range(n)]

for _ in range(q):
    a = int(input())
    score[a-1] += 1
    
for s in score:
    print('Yes' if s > 0 else 'No')

Submission status: Accepted

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

points = [K-Q] * N

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

Submission status: Accepted

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

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

    scores = [K - Q] * N

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

    for s in scores:
        if s > 0:
            print('Yes')
        else:
            print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
quiz = [int(input()) for i in range(q)]
point = [k-q]*n
for i in quiz:
  point[i-1] += 1
[print("Yes") if i > 0 else print("No") for i in point]
'''
1. あらかじめ全員のポイントを Q 減らしておく (つまり，開始時点のポイントは K − Q)．
2. Q 回の正解それぞれに対して，正解者のポイントを 1 増やす．

リストの中身すべてに計算すると「リスト要素」＊「ループ回数」の計算量になる
'''

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
mylist=[]
pointlist=[]
for i in range(Q):
    mylist.append(int(input()))
    
for i in range(N):
    #全員にKポイント与えるが、Qポイント引く
    pointlist.append(K-Q)
    
#正解者に1ぽいんとずつ足す。

for i in range(Q):
    #mylist[i]をjとしたら、j番目の人が勝者ということ。pointlist[j-1]に1を足す。
    j=mylist[i]
    pointlist[j-1]+=1
    
for i in range(N):
    if pointlist[i]>0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

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

    S=[0]*N
    for i in A:
        S[i-1]+=1

    for i in S:
        if K-(Q-i)<=0:
            print('No')
        else:
            print('Yes')


resolve()

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
nl = [0]*n
for i in range(q):
  num = int(input())
  nl[num-1] += 1
for j in nl:
  if k - q + j > 0:
    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 i in range(Q)]
count = Counter(A)
f_p = [K-Q]*N
for k,v in count.items():
  f_p[k-1] += v
  
for ans in f_p:
  if ans >= 1:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

Solution code:
import sys
N,K,Q = map(int,input().split())
input = sys.stdin.readline
A = [K-Q]*N
for i 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:
n, k, q = map(int, input().split())
ans_cnt = []

for i in range(n): ans_cnt.append(0)

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

for i in range(n):
    had_point = k - (q-ans_cnt[i])
    if had_point > 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=[0]*N
for i in A:
  point[i-1]+=1
for j in range(N):
  print("Yes" if Q-point[j]<K else "No")

Submission status: Accepted

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

Submission status: Accepted

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

point = [K - Q] * N
for _ in range(0, Q, 1):
	A = int(input()) - 1
	point[A] += 1

for i in point:
	if i <= 0 :
		print("No\n")
	else :
		print("Yes\n")

Submission status: Accepted

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

# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np


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

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




if __name__ == "__main__":
	main()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    n, k, q = map(int, input().split())
    a = list()

    point = [0] * n

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = [k-q]*n
for i in range(q):
  x = int(input())
  s[x-1] += 1
  
for i in s:
  if i > 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
s = sum(a)
for i in range(n): print("YNeos"[s-a[i]>=k::2])

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

N, K, Q = map(int, input().split())
counter = Counter(int(input()) - 1 for _ in range(Q))
for i in range(N):
    if K - (Q - counter[i]) > 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)]
score=[k-q]*n
for i in a:
    score[i-1]+=1
for i in score:
    if i>=1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
mod = 10**9 + 7

def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))

N, K, Q = na()
A = [0 for _ in range(N)]
for _ in range(Q):
    a = ni()
    A[a-1] += 1
sumA = sum(A)
for a in A:
    if sumA - a < K:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# 2020/03/14
# AtCoder Beginner Contest 141 - C

# Input
n, k, q = map(int,input().split())
a = list()
plist = [0] * n

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

# Output
for i in range(n):
    if k - q + plist[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
from collections import Counter
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

Solution code:
n, k, q = map(int, input().split())
A = [int(input()) for _ 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('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

for idx,pt in enumerate(pts):
    if pt >= 1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

n, k, q = MAP()
b = [0 for _ in range(n)]
for _ in range(q):
    a = INT()
    b[a - 1] += 1
ans = 0
for i in range(n):
    if k + b[i] - q > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
d = {}
for i in range(Q):
    A = int(input())
    d.setdefault(A,0)
    d[A] += 1
for i in range(1,N+1):
    pt = K-Q
    d.setdefault(i,0)
    pt += d[i]
    print('YNeos'[pt<1::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

    # count point for each users
    score = {i + 1: 0 for i in range(n)}
    for _ in range(q):
        a = int(input())
        score[a] += 1

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


if __name__ == "__main__":
    submit()

Submission status: Accepted

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

Submission status: Accepted

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

# print(solve())

# def solve()が@return voidのとき
solve()

Submission status: Accepted

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

@author: Kanaru Sato
"""

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

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

points = []

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

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

Submission status: Accepted

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

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

base = K - Q
for n in A:
  print("Yes" if base + n > 0 else "No")

Submission status: Accepted

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

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