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 = (int(i) for i in input().split())

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

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

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
b=[a[2]]*a[0]
for i in range(a[2]):
  x=int(input())
  b[x-1]-=1
for i in b:
  if a[1]>i:
    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 k-q+c[i]>=1:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
N,K,Q = map(int,input().split())
from collections import defaultdict
d = defaultdict(lambda :K-Q)
for i in range(Q):
  d[int(input())]+=1
for i in range(1,N+1):
  if d[i]>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#全員初期値を問題数分マイナスし正解者に1点足していくようにする

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

for k in members:
    if k < 1:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
from math import *
from itertools import *
INF = 10**10

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

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

Submission status: Accepted

Solution code:
import numpy as np
# 実行時間が遅いのでは早くする

N,K,Q = map(int,input().split())
# Q門について成果した人の番号
ans_list=[int(input()) for _ in range(Q)]
# 参加者ごとに正解した数
answer_num=[0 for _ in range(N)]

for ans_person in ans_list:
    answer_num[ans_person-1] += 1

for an in answer_num:
    # 持ち点から(問題数-正解数)を引いた数が残りの得点である
    if K-(Q-an) > 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())-1 for i in range(q)]
P = np.ones(n) * k - q
for a in A:
    P[a] += 1
P = np.where(P > 0, 'Yes', 'No')
for p in P:
    print(p)

Submission status: Accepted

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

# ポイントの初期値
P = [K - Q] * N
# 正解した人のポイントを1増やす
for i in range(Q):
    P[A[i] - 1] += 1

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = [0 for _ in range(N)]

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

for aa in A:
    if K > Q - aa:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
def solve(string):
    n, k, q, *a = map(int, string.split())
    t, b = [0] * n, q - k
    for _a in a:
        t[_a - 1] += 1
    return "\n".join(["Yes" if _t > b else "No" for _t in t])


if __name__ == '__main__':
    n, m, q = map(int, input().split())
    print(solve('{} {} {}\n'.format(n, m, q) + '\n'.join([input() for _ in range(q)])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter


def solve(string):
    n, k, q, *a = map(int, string.split())
    a = Counter(a)
    return "\n".join(["Yes" if a.get(i + 1, 0) > q - k else "No" for i in range(n)])


if __name__ == '__main__':
    n, m, q = map(int, input().split())
    print(solve('{} {} {}\n'.format(n, m, q) + '\n'.join([input() for _ in range(q)])))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# https://atcoder.jp/contests/abc141/tasks/abc141_c
# 整数の入力
N, K, Q = map(int, input().split())
L = [0] * N
for i in range(Q):
    A = int(input())
    L[A-1] += 1

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

Submission status: Accepted

Solution code:
def solve(string):
    n, k, q, *a = map(int, string.split())
    t = [0] * n
    for _a in a:
        t[_a - 1] += 1
    return "\n".join(["Yes" if _t > q - k else "No" for _t in t])


if __name__ == '__main__':
    n, m, q = map(int, input().split())
    print(solve('{} {} {}\n'.format(n, m, q) + '\n'.join([input() for _ in range(q)])))

Submission status: Accepted

Solution code:
N, K, Q = [int(x) for x in input().split()]
c_ans = [0] * N
for i in range(Q):
  n = int(input())
  c_ans[n-1] += 1
for i in range(N):
  if Q - c_ans[i] < K:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

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

sum_damage = sum(damage)

for j in range(N):
    if sum_damage - damage[j] >= K:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
def main():
    n, k, q = map(int, input().split(' '))
    a_s = [0] * n

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

for p in point:
    if p > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
import sys

n, k, q = map(int, sys.stdin.readline().split())

def solve():
	if k  > q:
		return [1]*n
	S = [k-q]*n
	for _ in range(q):
		i = int(sys.stdin.readline())
		S[i-1] += 1
	return S
S = solve()
for i in range(n):
	if S[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)]
b = [0 for i in range(n)]

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

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

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split(' '))
score = [K for player in range(N)]
answers = [int(input()) - 1 for q in range(Q)]

for answer in answers:
    score[answer] = score[answer] + 1

score = [point - Q for point in score]

for result in score:
    if result > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

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

for p in P:
    if Q + 1 <= p:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

P = [K for _ in range(N)]
D = []
for _ in range(Q):
    A = int(input()) - 1
    P[A] += 1

for x in P:
    if Q + 1 <= x:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
from queue import PriorityQueue
from fractions import gcd
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def _pf(s): return print(s, flush=True)

N, K, Q = LI()
A = [_I() for i in range(Q)]

points = [K-Q for _ in range(N)]

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
def input():
    return sys.stdin.readline()[:-1]

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

points = np.array([K - Q for _ in range(N)])

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

for p in points:
    if p < 1:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

# print('input >>')
N, K, Q = map(int, (input().split()))
points = [K] * N
A = []
for _ in range(Q):
    A.append(int(input()))

Acount = collections.Counter(A)

for answerer, times in Acount.items():
    points[answerer - 1] += times

# print('----------output----------')

for answerer in range(N):
    print('Yes') if points[answerer] > Q else print('No')

Submission status: Accepted

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

def main():
    n, k, q = map(int, input().split())
    a_list = []

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

    participant_list = [k-q] * n


    for i in range(q):
        participant_list[a_list[i]-1] += 1

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1, n+1):
    if not i in a.keys():
        a[i] = 0
    if k - (q - a[i]) <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

point = [0] * N

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import math
import sys


DEBUG = False


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


def dprint(*value, sep=' ', end='\n'):
    if DEBUG:
        print(*value, sep=sep, end=end)


def solve(N, K, Q, A):
    solved = [0] * N
    for a in A:
        solved[a] += 1

    def qualified(n):
        return Q - n < K

    return [qualified(n) for n in solved]


def main():
    N, K, Q = [int(e) for e in inp().split()]
    A = [int(input()) - 1 for _ in  range(Q)]

    ans = solve(N, K, Q, A)
    for a in ans:
        print('Yes' if a else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def get_answer(input_list):
    c_list = [int(v) for v in input_list[0].split(" ")]
    n = c_list[0]
    k = c_list[1]
    q = c_list[2]
    a = [int(v) for v in input_list[1:]]
    ns = [k - q] * n
    for aa in a:
        index = aa - 1
        ns[index] += 1
        """
        for i in range(len(ns)):
            if i != index:
                ns[i] -= 1
        """

    nr = [""] * n
    for i in range(len(ns)):
        if ns[i] <= 0:
            nr[i] = "No"
        else:
            nr[i] = "Yes"

    return nr



if __name__ == "__main__":
    input_list = []
    while True:
        try:
            input1 = input()
            if not input1:
                break
            if len(input1) == 0:
                break
            input_list.append(input1)
        except EOFError:
            break
    for a in get_answer(input_list):
        print(a)

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

Submission status: Accepted

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

initial_point = [(K-Q)]*N

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

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

Submission status: Accepted

Solution code:
def solve(n, k, q, a):
    v = [k] * n
    for a_i in a:
        v[a_i-1] += 1
    for v_i in v:
        if v_i > q:
            print("Yes")
        else:
            print("No")

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

Submission status: Accepted

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

Submission status: Accepted

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

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

d = Q - K
ans = []
if d < 0:
    for i in range(N):
        print("Yes")
else :
    for i in range(0, N):
        if point[i] > d:
            print("Yes")
        else:
            print("No")

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

for k in b:
    if k > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
N, K, Q = map(int, input().split())

score = [K-Q]*(N+1)
for _ in range(Q):
  a = int(input())
  score[a] += 1
[print("No" if ans < 1 else "Yes") for ans in score[1:]]

Submission status: Accepted

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

score = [K-Q]*(N+1)
for _ in range(Q):
  a = int(input())
  score[a] += 1
[print("No" if ans < 1 else "Yes") for ans in score[1:]]

Submission status: Accepted

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

scores = [0] * N
for _ in range(Q):
    answerer = int(input())
    answerer -= 1
    scores[answerer] += 1

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

Submission status: Accepted

Solution code:
n,k,q,*a=map(int,open(0).read().split())
l=[k-q]*n
for i in a:l[i-1]+=1
for i in l:print('YNeos'[1>i::2])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
n,k,q = map(int,input().split())
score = [k-q for i in range(n)]
a_i = [int(input())-1 for i in range(q)]


for i in range(len(a_i)):
    score[a_i[i]] += 1



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

Submission status: Accepted

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

point = [0]*nums[0]
question =[nums[2]]*nums[0]
first = [nums[1]]*nums[0]

for i in range(nums[2]):
  a = int(input())
  point[a-1] += 1  
 
diff = [x - y for (x, y) in zip(question, point)]
result = [x - y for (x, y) in zip(first, diff)]
 
for i in result:
  if i >= 1:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
m = list(map(int,input().split()))
n = [0] * m[0]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k, q = [int(x) for x in input().split()]
scores = {i: 0 for i in range(n)}

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

for score in scores.values():
  if k - q + score > 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 i in range(q)]

score = [k - q]*(n+1)

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

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

Submission status: Accepted

Solution code:
aten_num, sta_poi, corect_num = tuple(int(i) for i in input().split(" "))
aten_list = []
for i in range(aten_num):
    aten_list.append(0)
for i in range(corect_num):
    corect_aten = int(input())
    aten_list[corect_aten - 1] += 1
for i in range(aten_num):
    if sta_poi - corect_num + aten_list[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

note = [0] * N

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

s = sum(note)

ans = 0
for i in range(N):
    if K - (s - note[i]) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
from collections import Counter
N, K, Q = map(int, input().split())
answers = [int(input()) for i in range(Q)]
counts = Counter(answers)
for i in range(1,N+1):
  if K-(Q-counts[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
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())

lst = [0] * N

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

x = Q - K 

for i in range(len(lst)):
    if lst[i] - 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)]
nman=[]
for i in range(n):
    nman.append(k-q)
for j in a:
    nman[j-1]+=1
for l in range(n):
    if(nman[l]<=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)]
pnts = [0] * N

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

for i in pnts:
    if K - Q + i > 0:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
def splitter(type,input):
    return list(map(lambda x:type(x),input.split()))

s1 = splitter(int,input())
N = s1[0]
K = s1[1]
Q = s1[2]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

A=[K-Q]*N

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

answers = []
for i in range(q):
    a = int(input())
    answers.append(a)

players = []
for i in range(n):
    players.append(0)

for i in range(q):
    players[answers[i] - 1] += 1


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

Submission status: Accepted

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

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

for i in range(N):
    result = point[i] - player[i]
    if K - result >= 1:
        print("Yes")

    else:
        print("No")

Submission status: Accepted

Solution code:
n, k, q, *a = map(int, open(0).read().split())

p = k - q
ans = [p]*n

for i in range (0,q):
  ans[a[i]-1] = ans[a[i]-1] + 1

for i in range (0,n):
  if ans[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)]

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

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

Submission status: Accepted

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


def main():
    n, k, q = map(int, input().split())
    ac = [0 for _ in range(n)]

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

Solution code:
answer = []


def point_check(num):
    for i in A_dic.keys():
        A_dic[i] -= num


N, K, Q = map(int, input().split())
A_dic = {i: K for i in range(1, N + 1)}

for j in range(Q):
    answer.append(int(input()))

point_check(Q)

for l in answer:
    A_dic[l] += 1

for k in A_dic.values():
    if k <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
N,K,Q=map(int,input().split())
ans=[]
L=[]
for _ in range(N):
    L.append(0)
for _ in range(Q):
  ans.append(int(input()))
for k in range(Q):
  L[ans.pop()-1]+=1
for j in range(N):
  if K-(Q-L[j])>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 for i in range(n)]
minus_ones = [-1 for i in range(n)]

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

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

Submission status: Accepted

Solution code:
def c_attack_survival():
    N, K, Q = [int(i) for i in input().split()]
    A = [int(input()) - 1 for _ in range(Q)]

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

print(c_attack_survival())

Submission status: Accepted

Solution code:
N, K, Q = map(int, input().split())
Safe = [0] * N
for q in range(Q):
    Ai = int(input())
    Ai -= 1
    Safe[Ai] += 1


for s in Safe:
    if K + s - Q > 0:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:


class Quiz(object):
    def __init__(self, n, k, answers):
        self._n = n
        self._k = k
        self._answers = answers

    def _solve(self):
        points = [0 for _ in range(self._n)]

        for a in self._answers:
            points[a - 1] = points[a - 1] + 1

        return points

    def get_answers(self):
        points = self._solve()
        q = len(self._answers)
        return ['Yes' if self._k - q + p > 0 else 'No' for p in points]


def main():
    conditions = input()
    c = conditions.split(' ')

    n = int(c[0])
    k = int(c[1])
    q = int(c[2])

    answers = []
    for i in range(q):
        answers.append(int(input().strip()))

    p = Quiz(n, k, answers)
    print('\n'.join(p.get_answers()))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c=input().strip().split(' ')
a,b,c=[int(a),int(b),int(c)]
g=[0]*200000
for i in range(c):
  f=int(input())
  g[f]+=1
for i in range(1,a+1):
  p=b+g[i]
  p-=c
  if p>0:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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