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: Time Limit Exceeded

Solution code:
#!/usr/bin/env python3
N,K,Q=(int(x) for x in input().split())
a=[int(input()) for i in range(Q)]#正解者
l=[]
for j in range(N):
    l.append(K)
for k in range(Q):
    for m in range(N):
        l[m]-=1
        if m+1==a[k]:
            l[m]+=1
for n in range(N):
    if(l[n]>=1):
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
import sys

def happyo(n,each_point):
  for x in range(n):
    if (each_point[x] < 1):
      print("No")
    else:
      print("Yes")

inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])

if(k>100000):
  for x in range(n):
    print("Yes")
  sys.exit()
 
each_point = []
for i in range(n):
  each_point.append(k)
 
for j in range(q):
  ans = int(input())
  each_point = list(map(lambda x: x - 1,each_point))
  each_point[ans-1] += 1
 
happyo(n,each_point)

Submission status: Time Limit Exceeded

Solution code:
inp1 = input()
n = int(inp1.split(" ")[0])
k = int(inp1.split(" ")[1])
q = int(inp1.split(" ")[2])
 
each_point = []
for i in range(n):
  each_point.append(k)
 
for j in range(q):
  ans = int(input())
  for m in range(n):
    each_point[m] -= 1
  each_point[ans-1] += 1
 
for x in range(n):
  if (each_point[x] < 1):
    print("No")
  else:
    print("Yes")

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
I=list(map(int,open(0).read().split()))
n,k,q=I[:3]
a=I[3:]
p=np.array([k]*n)
for i in a:
    p-=1
    p[i-1]+=1
for i in p:
    if i<=0:
        print('No')
    else:
        print('Yes')

Submission status: Time Limit Exceeded

Solution code:
a, b, c = map(int, input().strip().split())
X = [b for _ in range(a)]

for _ in range(c):
    n = int(input().strip()) - 1
    for i in range(a):
        if not n == i:
            X[i] -= 1

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

players = [k for _ in range(n)]

for i in a:
    for p in range(len(players)):
        if p != i-1:
            players[p] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int, input().split())
li = [int(input()) for i in range(Q)]
member = [x+1 for x in range(N)]
for i in member:
    ans = K
    for j in li:
        if i != j:
            ans -= 1
    if ans <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int, input().strip().split())
# A=[0]*Q
score=[K]*N
for i in range(Q):
    A=int(input().strip())
    score[A-1]+=1
    score=list(map(lambda x: x-1,score))

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

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int, input().strip().split())
# A=[0]*Q
score=[K]*N
for i in range(Q):
    A=int(input().strip())
    for j in range(N):
        if j==A-1:
            continue
        else:
            score[j]-=1

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

Submission status: Time Limit Exceeded

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

ls_p = [k] * n

for i in range(n):
    num = 0
    num = ls_a.count(i+1)
    ls_p[i] += (num - q)

for j in range(n):
    if ls_p[j] > 0:
        print("Yes")
    elif ls_p[j] <= 0:
        print("No")

Submission status: Time Limit Exceeded

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

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

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

for j in range(N):
    if points[j] >= 1:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

score = [k] * n
for i in a:
    for j in range(n):
        if j+1 == i:
            continue
        else:
            score[j] -= 1

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

B = [K]*N

for a in A:
    B = list(map(lambda x:x-1,B))
    B[a-1] += 1
for b in B:
    if b>0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
n,k,q = map(int,input().split())

a = np.zeros(q,dtype = int)

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


score = np.array([k]*n)

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np 

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

member = np.array([K]*N)

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import sys	

num1 = list(map(int, input().split()))
N = num1[0] #参加者数
K = num1[1] #初期ポイント
Q = num1[2] #出た正解の数
ans_list = []
for index0 in range(Q):
	ans_list.append(int(input()))
for index1 in range(1,N+1):
	point = 0
	point=ans_list.count(index1)

	fin=K+point-Q

	
	if fin <=0:
		print("No")
	else:
		print("Yes")

Submission status: Time Limit Exceeded

Solution code:
import sys	

num1 = list(map(int, input().split()))
N = num1[0] #参加者数
K = num1[1] #初期ポイント
Q = num1[2] #出た正解の数
ans_list = []
for index1 in range(Q):
	ans_list.append(int(input()))
for index1 in range(1,N+1):
	point = 0
	for index2 in range(Q):
		if index1==ans_list[index2]:
			point +=1

	fin=K+point-Q

	
	if fin <=0:
		print("No")
	else:
		print("Yes")

Submission status: Time Limit Exceeded

Solution code:
import sys	

num1 = list(map(int, input().split()))
N = num1[0] #参加者数
K = num1[1] #初期ポイント
Q = num1[2] #出た正解の数
ans_list = []
for index1 in range(Q):
	ans_list.append(int(input()))
for index1 in range(1,N+1):
	point = 0
	for index2 in range(len(ans_list)):
		if index1==ans_list[index2]:
			point +=1
	#print(point)
	fin=K+point-Q
	#print(fin)
	
	if fin <=0:
		print("No")
	else:
		print("Yes")

Submission status: Time Limit Exceeded

Solution code:
L=input().split()
N=int(L[0])
K=int(L[1])
Q=int(L[2])
A=[]
for m in range(Q):
    A.append(int(input()))
for m in range(N):
    if  K-Q+A.count(m+1)>0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
L=input().split()
N=int(L[0])
K=int(L[1])
Q=int(L[2])
A=[]
B=[]
for m in range(Q):
    s=int(input())
    A.append(s)
#print(A)
for m in range(N):
    if  K-Q+A.count(m+1)>0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
A=[int(input()) for _ in range(Q)]
if K>Q:
    for n in range(N):
        print("Yes")
else:
    N_dic={n+1:K for n in range(N)}
    for a in A:
        for k,v in N_dic.items():
            if a!=k:
                N_dic[k]=v-1
    for v in N_dic.values():
        if v>0:
            print("Yes")
        else:
            print("No")

Submission status: Time Limit Exceeded

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

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

for i in range(len(point)):
    ans = K - (sum(point) - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

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

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

for i in range(len(point)):
    ans = K - (sum(point) - point[i])
    if ans > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

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

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

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

point2 = []
for i in range(len(point)):
    point2.append(K - (sum(point) - point[i]))

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

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
A=[int(input()) for _ in range(Q)]
Point=[K for _ in range(N)]
len_Point=len(Point)
for a in A:
    for i in range(len_Point):
        if i!=a-1:
            Point[i]=Point[i]-1
for p in Point:
    if p<=0:
        print("No")
    else:
        print("Yes")

Submission status: Time Limit Exceeded

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

A = []
point = [K]*N
#print(point)

for i in range(Q):
  A.append(int(input()))
  i += 1
#print(A)

for i in A:
  for j in range(N):
    if point[j] > 0 and j != (i - 1):
      point[j] -= 1
    else:
      continue

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

Submission status: Time Limit Exceeded

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

A = []
point = []

for i in range(N):
  point.append(K)
  i += 1
#print(point)

for i in range(Q):
  A.append(int(input()))
  i += 1
#print(A)

for i in A:
  for j in range(N):
    if j != (i - 1):
      point[j] -= 1
    else:
      continue

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

score=[]
answer=[]

for i in range(N):
    score.append(K)

for j in range(Q):
    for k in range(N):
        if k+1==A[j]:
            pass
        else:
            score[k]-=1


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

Submission status: Time Limit Exceeded

Solution code:
n=list(map(int,input().split()))
men=list([n[1]]*n[0])
for i in range(n[2]):
    men=[j-1 for j in men]
    men[int(input())-1]+=1
y = ["Yes" if i > 0 else "No" for i in men]
print('\n'.join(map(str, y)))

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

score=[]
answer=[]

for i in range(N):
    score.append(K)

for l in range(N):
    answer.append("Yes")

for j in range(Q):
    for k in range(N):
        if k+1==A[j]:
            pass
        else:
            score[k]-=1
            if score[k]==0:
                answer[k]="No"

for m in range(N):
    print(answer[m])

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
num_of_candidate, start_point, num_of_questions = map(int, input().split())
winner_list = [int(input()) for i in range(num_of_questions)]

if start_point > num_of_questions:
	for i in range(num_of_candidate):
		print("Yes")
	exit()


point_list = [start_point for i in range(num_of_candidate)]

for i in range(num_of_questions):
	winner_id = winner_list[i]
	for j in range(num_of_candidate):
		if j != winner_id - 1:
			point_list[j] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
num_of_candidate, start_point, num_of_questions = map(int, input().split())
winner_list = [int(input()) for i in range(num_of_questions)]

point_list = [start_point for i in range(num_of_candidate)]

for i in range(num_of_questions):
	winner_id = winner_list[i]
	for j in range(num_of_candidate):
		if j != winner_id - 1:
			point_list[j] -= 1

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

Submission status: Time Limit Exceeded

Solution code:
from numpy import array
l=list(map(int,input().split()))
ans=[int(input()) for i in range(l[2])]
n=l[0]
k=l[1]
q=l[2]
p=array([k]*n)
for num in ans:
  minus=[-1]*(num-1)+[0]+[-1]*(n-num)
  v2=array(minus)
  p=p+v2
for m in p:
  if(m<=0):
    print("No")
  else:
    print("Yes")

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
A = [input() for i in range(Q)]
judgeA=list(set(A))
res=[]
func=(Q-(K-1))
if K>Q:
  ans = ["Yes"]*N
else:
  for p in judgeA:
    if A.count(p)>=func:
      res.append(p)
  ans=["No"]*N
  for q in res:
    ans[int(q)-1]="Yes"
for y in ans:
  print(y)

Submission status: Time Limit Exceeded

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

for i in a:
    score[i-1] += 1
    score = list(map(lambda y: y-1,score))

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
a = np.array([K for i in range(N)])

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N,K,Q=map(int,input().split())
A=[]
for i in range(Q):
  a=int(input())
  A.append(a)
score=np.full(N,K)
for j in range(Q):
  for k in range(len(score)):
    if k==A[j]-1:
      pass
    else:
      score[k]-=1
for l in range(len(score)):
  if score[l]>0:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
B=[K]*N
def minu(n):
  return n-1
for i in range(Q):
  A=int(input())
  if A==1:
    B[1:]=map(minu,B[1:])
  elif A==N:
    B[:-2]=map(minu,B[:-2])
  else:
    B[:A-1]=map(minu,B[:A-1])
    B[A:]=map(minu,B[A:])
for i in range(N):
  if B[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

Solution code:
N,K,Q=map(int,input().split())
import numpy as np
B=np.array([K]*N)
for i in range(Q):
  A=int(input())
  if A==1:
    B[1:]-=1
  elif A==N:
    B[:-2]-=1
  else:
    B[:A-1]-=1
    B[A:]-=1
for i in range(N):
  if B[i]>0:
    print("Yes")
  else:
    print("No")

Submission status: Time Limit Exceeded

Solution code:
N, K, Q = map(int, input().split())
#print(N, K, Q)
listq = []
for i in range(Q):
    ai = int(input())
    listq.append(ai)
#print(listq)    
for n in range(N):
    num = listq.count(n+1)
    ansn = K - Q + num
    if ansn>0:
        print('Yes')
    else:
        print('No')

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
Nn, Kk, Qq = input().split()
N, K, Q = int(Nn), int(Kk), int(Qq)
a = []
for q in range(Q):
    a.append(int(input()))
r = (np.ones(N) * K).astype(int)
for i in a:
    b = np.ones(N)
    b[i-1] = 0
    r = r - b
print("\n".join(["Yes" if rr > 0 else "No" for rr in r]))

Submission status: Time Limit Exceeded

Solution code:
a = list(map(int,input().split()))
results = [int(input()) for i in range(a[2])]

points = [a[1]] * a[0]

for result in results:
    points = list(map(lambda x: x - 1, points))
    points[result - 1] = points[result - 1] + 1


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

Submission status: Time Limit Exceeded

Solution code:
def update_points(points, current_ansewr):
    return list(
        map(
            lambda x: x[1] if (x[0] + 1) == current_ansewr else x[1] - 1,
            enumerate(points),
        )
    )


N, K, Q = [int(i) for i in input().split()]
points = [K] * N
for _ in range(Q):
    answer = int(input())
    points = update_points(points, answer)
for p in points:
    print("Yes" if p > 0 else "No")

Submission status: Time Limit Exceeded

Solution code:
n,k,q = (int(i) for i in input().split())
p =[k]*(n+1)
for i in range(q):
    v = int(input())
    for j in range(len(p)) :
      
      if j != v :
        p[j] -= 1 
        

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

Submission status: Time Limit Exceeded

Solution code:
point = []
yes_no = []
minus = []
output = []

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

for _ in range(Q):
    A.append(input())

A = [int(a) for a in A]

for _ in range(N):
    point.append(K)

for _ in range(N):
    minus.append(Q)

for i in range(N):
    point[i] = point[i] - minus[i]

for j in range(N):
    point[j-1] = point[j-1] + A.count(j)

for p in point:
    if p >= 1:
        yes_no.append('Yes')
    else:
        yes_no.append('No')

s = '\n'.join(yes_no)
print(s)

Submission status: Time Limit Exceeded

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

p = [k]*n
for i in range(len(A)):
    ele = A[i]-1
    for j in range(len(p)):
        if j != ele:
            p[j] = p[j]-1
    
for l in range(len(p)):
    if p[l] > 0:
        print('Yes')
    elif p[l] <= 0:
        print('No')

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

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

Submission status: Time Limit Exceeded

Solution code:
i = 0
p = list(map(int, input().split()))
n = p[0]
k = p[1]
q = p[2]
a = []
point = []
for i in range(q):
    a.append(int(input()))
j = 0
u = 0
for u in range(n):
    point.append(k)
while (j < q):
    m = 0
    while(m < n):
        if (m != a[j-1]):
            point[m-1] -= 1
        m += 1
    j += 1
g = 0
while(g < n):
    if(point[g] > 0):
        print("Yes")
    else:
        print("No")
    g += 1

Submission status: Time Limit Exceeded

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

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

point = [k] * n

for i in range(q):
    win = a[i - 1]
    point = list(map(lambda x: x - 1, point))
    point[win - 1] += 1

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

Submission status: Time Limit Exceeded

Solution code:
pnum, default, correct = map(int, input().split())
pep = [default]*pnum
a = list()
for i in range(correct):
    a.append(int(input()))
for i in a:
    for j in range(pnum):
        pep[j] -= 1
    pep[i-1] += 1
for i in pep:
    if i > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
import sys

import numpy as np

# n人 初期ポイントk q回正解する
n, k, q = tuple(map(int, input().split()))

members = np.ones(n, dtype=int) * k

input = sys.stdin.readline

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

for member in members:
    if member > 0:
        print("Yes")
    else:
        print("No")

Submission status: Time Limit Exceeded

Solution code:
import sys

import numpy as np

# n人 初期ポイントk q回正解する
n, k, q = tuple(map(int, input().split()))

members = np.ones(n) * k

input = sys.stdin.readline

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

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

# n人 初期ポイントk q回正解する
n, k, q = tuple(map(int, input().split()))

members = np.ones(n) * k

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

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

Submission status: Time Limit Exceeded

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

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

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

for i in A:
    B[i-1] = B[i-1] + 1
    for j in range(n):
        B[j] = B[j] - 1


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

Submission status: Time Limit Exceeded

Solution code:
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
border=-k+q

res = '\n'.join('Yes' if a.count(j+1)> border else 'No' for j in range(0,n))

print(res)

Submission status: Time Limit Exceeded

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

#print(p)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
for j in range(0,n):
    p.append(a.count(j+1))
for m in range(0,n):
    c=k+(-1)*q+p[m]
    #print('No %d point is %d'% (m,c))
    if c >0:
        print('Yes')
    else:
        print('No')
#print(p)

Submission status: Time Limit Exceeded

Solution code:
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
for j in range(0,n):
    p.append(a.count(j+1))
for m in range(0,n):
    c=k+(-1)*(sum(p))+p[m]
    #print('No %d point is %d'% (m,c))
    if c >0:
        print('Yes')
    else:
        print('No')
#print(p)

Submission status: Time Limit Exceeded

Solution code:
n,k,q=(int(x) for x in input().split())
a=[]
p=[]
for i in range(0,q):
    temp=int(input())
    a.append(temp)
for j in range(0,n):
    p.append(a.count(j+1))
for m in range(0,n):
    c=k
    for l in range(0,n):
        if l!=m:
            c +=-1*p[l]
    #print('No %d point is %d'% (m,c))
    if c >0:
        print('Yes')
    else:
        print('No')
#print(p)

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np

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

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

Submission status: Time Limit Exceeded

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

A = []

score = [K] * N
for _ in range(Q):
    A.append(int(input()))

for i in A:
    for j in range(N):
        if i - 1 != j:
            score[j] -= 1

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

Submission status: Time Limit Exceeded

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

A_ans = [input() for i in range(Q)]

A_pt = [K for i in range(N)]

for i in range(Q):
  for j in range(N):  
    if (j+1) != int(A_ans[i]):
      A_pt[j] -= 1
      
for j in range(N):
  if A_pt[j] > 0:
    print('Yes')
  else:
  	print('No')

Submission status: Time Limit Exceeded

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

xA = [input() for i in range(Q)]

A_ans = []
for i in range(Q):
  A_ans.append(int(xA[i]))

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

for i in range(Q):
  for j in range(N):  
    if (j+1) != A_ans[i]:
      A_pt[j] -= 1
      
for j in range(N):
  if A_pt[j] > 0:
    print('Yes')
  else:
  	print('No')

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N,K,Q=map(int,input().split(' '))
A=[]
for i in range(Q):
  A.append(int(input()))
  
scores=np.array([K for x in range(N)])
for x in A:
  scores-=1
  scores[x-1]+=1

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

Submission status: Time Limit Exceeded

Solution code:
import numpy as np
N,K,Q=map(int,input().split(' '))
A=[]
for i in range(Q):
  A.append(int(input()))
  
scores=np.array([K for x in range(N)])
for x in A:
  scores-=1
  scores[x-1]+=1

for i,xx in enumerate(scores):
  if xx>0:
    print('Yes')
  else:
    print('No')

Submission status: Time Limit Exceeded

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

for _ in range(q):
  ans = int(input())
  for i in range(n):
    if ans - 1 != i:
      point[i]-=1

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

Submission status: Time Limit Exceeded

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

for i in range(Q):
    B.append(int(input()))

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