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: Runtime Error

Solution code:
tmp = input().split(" ")
person = int(tmp[0])
init_pt = int(tmp[1])
questions = int(tmp[2])

ans = ""
for i in range(questions):
  ans = ans + input()

for i in range(1, len(person) + 1):
  if ans.count(str(i)) > questions - init_pt:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

# 全員終了時はK - Q + （個人の正解数）とする
# K - Q + 正解数 > 0の人は勝ち残る
for i in range(Q):
    if K - Q + P[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
x = input().split()
pointdict = {}
y = []
for i in x[0]:
    pointdict[i] = x[1]

for i in x[2]:
    ans = input()
    y.append(ans)

for i in y:
    for e in x[0]:
        if e != i:
            pointdict[e] -= 1

for p in pointdict:
    if pointdict[p] is not 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

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

for i in range(len(L)):
    if q<L[i]:
        print("YES")
    else:
        print("NO")

Submission status: Runtime Error

Solution code:
n=int(input())
k=int(input())
q=int(input())
l=range(n)
l=[]
for j in range(n):
  l.append( k )
for i in range (q):
    a=int(input())
    for k in range(n):
        if a != k+1:
            l[k]=l[k]-1
        else:
            continue
for m in range(n):
    if l[i]<=0:
        print('no')
    else:
        print('yes')

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

list=[(K-Q) for i in range(N)]

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

for q in range(Q):
  if(K - (Q - players[q]) > 0):
    print("YES")
  else:
    print("NO")

Submission status: Runtime Error

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

scores = [k - q] * n

for index in range(q):
    winner = int(input())
    scores[winner] += 1

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

Submission status: Runtime Error

Solution code:
N, K, Q = map(int, input().split())
A = []
A = (int(x) for x in sys.stdin.read().split())
score = [K - Q] * (N + 1)
for a in A:
    score[a] += 1
ans = "\n".join("No" if s <= 0 else "Yes" for s in score[1:])
print(ans)

Submission status: Runtime Error

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

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

for j in range(len(points)):
  if points[j] <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Runtime Error

Solution code:
n = input()
k = input()
q = input()
a = [k-q for i in range(n)]

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#N人　参加者
#Kポイント持ってスタート
#正解者以外のポイントは1づつ減る
#Q回正解者がでる
#得点が0以下で敗退
lst = input().split()

N = int(lst[0])
K = int(lst[1])
Q = int(lst[2])

if N < 2 or N > 100000:
    print('参加人数エラー')
    exit()

if K < 1 or K > 1000000000:
    print('ポイントエラー')
    exit()

if Q < 1 or Q > 100000:
    print('正解数エラー')
    exit()

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

#得点計算
for i in range(N):
    #正解者の入力を受け取って1マイナス
    collect = int(input()) - 1
    j = 0
    for j in range(N):
        if not j  == collect:
            p_list[j] = int(p_list[j]) - 1
        j += 1
#勝敗出力
k = 0
for k in range(N):
    if p_list[k] > 0:
        print('Yes')
    else:
        print('No')
    k += 1

Submission status: Runtime Error

Solution code:
#N人　参加者
#Kポイント持ってスタート
#正解者以外のポイントは1づつ減る
#Q回正解者がでる
#得点が0以下で敗退
lst = input().split()

N = int(lst[0])
print(N)
K = int(lst[1])
print(K)
Q = int(lst[2])
print(Q)

if N < 2 or N > 100000:
    print('参加人数エラー')
    exit()

if K < 1 or K > 1000000000:
    print('ポイントエラー')
    exit()

if Q < 1 or Q > 100000:
    print('正解数エラー')
    exit()

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

for i in range(N):
    #正解者の入力を受け取って1マイナス
    collect = int(input()) - 1
    j = 0
    for j in range(N):
        if not j  == collect:
            p_list[j] = int(p_list[j]) - 1
        j += 1
print(p_list)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

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

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

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

Submission status: Runtime Error

Solution code:
import numpy as np

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

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

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

Submission status: Runtime Error

Solution code:
from fractions import gcd

from math import factorial as f

from math import ceil,floor,sqrt

from sys import exit

from copy import deepcopy
import numpy as np

import bisect
import re


ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    n,k,q = mi()
    alist = [0 for i in range(100005)]
    for i in range(q):
        a = ii()
        alist[a]+=1
	for i in range(1,n+1):
        if alist[i] > q-k:
            print('Yes')
        else:
            print('No')
    


main()

Submission status: Runtime Error

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

tokuten=[0]*n

for i in range(q):
    tokuten[A[i-1]-1]=tokuten[A[i-1]-1]+1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
N, K, Q  = map(int, input().split())
score = np.zeros(N)
for i in range(Q):
  num = int(input())
  score[num] += 1

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

Submission status: Runtime Error

Solution code:
import heapq
N, M = [int(_) for _ in input().split()]
H = [-int(_) for _ in input().split()]
heapq.heapify(H)
ans = 0
for _ in range(M):
    a = heapq.heappop(H)
    heapq.heappush(H, a / 2)
print(-sum(int(a) for a in H))

Submission status: Runtime Error

Solution code:
import numpy as np

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

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]

for i in indict:
    print(i)

Submission status: Runtime Error

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

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)

Submission status: Runtime Error

Solution code:
import numpy as np

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

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)

Submission status: Runtime Error

Solution code:
import numpy as np

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

players_score = np.array([k for i in range(n)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)

Submission status: Runtime Error

Solution code:
import numpy as np

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

players_score = np.array([k for i in range(k)])
# correct_ans = np.array([1 for i in range(q)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)

Submission status: Runtime Error

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

import numpy as np

players_score = np.array([k for i in range(k)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)

Submission status: Runtime Error

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

players_score = np.array([k for i in range(k)])
for item in a:
    players_score -= 1
    players_score[item-1] += 1

indict = ['No' if i <= 0 else 'Yes' for i in players_score ]
for i in indict:
    print(i)

Submission status: Runtime Error

Solution code:
ans_list =[]
point = []
for i in range(n):
  point.append(k)
#print(point)      
for j in range(q):
  ans_list.append(int(input()))
#print(ans_list)
for k in ans_list:
  point[k-1] += 1
#print(point)
for l in range(n):
  point[l] -= q
  if point[l]>0:
    print("Yes")
  else:
    print("No")
#print(point)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(input())

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

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

Submission status: Runtime Error

Solution code:
V = input().split()
N = int(V[0])
K = int(V[1])
Q = int(V[2])
A = [0 for i in range(Q)]
P = [K for i in range(N)]
for i in range(Q):
    A[i] = int(input())

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

for i in range(N):
    if P[i] <= Q:
        print("No")
    if P[i] > Q:
        print("Yes")

Submission status: Runtime Error

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(Q):
  if points[i] <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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: Runtime Error

Solution code:
import sys

t = input()
n = t[3::]
point = range(len(n))
point = t[1]
for i in t[2]:
  point[n[i]]-=1
for j in point:
  if point[j]>0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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 = [p - times for p in points]
    points[answerer - 1] += times

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

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

Submission status: Runtime Error

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
  
for i in range(n):
  if q - answer[i] < k:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

n_member, init_point, n_correct = map(int,input().split())
answerer = [int(input())-1 for i in range(n_correct)]

point = np.array([init_point for i in range(n_member)])

for i in range(n_correct):
  point -= 1
  point[answerer[i]] += 1
  
win = [point>0]

for i in range(n_member):
  if win[i]:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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 len(range(Q)):
    ar[int(input())] += 1
for j in len(range(N)):
    if K-Q+ar[j] <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

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

n = [m[1]] * m[2]

for i in range(m[2]):
    n = [i-1 for i in n]
    n[a[i]-1] +=1

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

Submission status: Runtime Error

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

n = [m[1]] * m[2]
print(n)

for i in range(m[2]):
    n = [i-1 for i in n]
    n[a[i]-1] +=1

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

Submission status: Runtime Error

Solution code:
N, K, Q=[int(v) for v in str.split()]
li=[K for n in range(N)]
for i in range(Q):
    A=int(input())-1
    li=[k if j==A else k-1 for j, k in enumerate(li)]
for i in range(N):
    if li[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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

for s in scores:
    if q - s >= k:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

Solution code:
sankaNum, scoreMax, ansCnt = map(int, input().split())

score = [0]*sankaNum

for n in range(ansCnt):
    ansSanka = input()
    score[int(input()) - 1] +=  1
    
for m in range(sankaNum):

    if scoreMax - score[m] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = []
for i in l:
    if k- q + i > 0:
        ans.append("Yes")
    else:
        ans.append("No")
print("\n".join(ans))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
sankaNum, scoreMax, ansCnt = input().split()

score = []

for i in int(sankaNum):
    score.append(scoreMax)



for n in ansCnt.int():
    ansSanka = input()

    isOk = False
    
    for k in sankaNum.int():
        if ansSanka - 1 != k:
            score[k] -= score[k] -1
            if score[k] < 0:
                isOk = True
    
    

if isOk:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

for j in range(n):
  a = l.count(j+1)
  b = k - q + a
  
  if b <= 0:
    print('No')
  else:
    print('Yes')

Submission status: Runtime Error

Solution code:
import sys
pos=input()
pos=pos.split()
N=int(pos[0])
P=int(pos[1])
T=int(pos[2])
point={P}*N

for i in range(0,T):
    c=input()
    point={p-1 for p in point}
    point{int(c)-1}+=1

for i in range(0,N):
    if(point{i}>0):
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

def attackSurvival(n, k, q, a):
    ans = []
    import collections
    c = collections.Counter(a)
    for i in range(n):
        if c[i+1] > q - k: ans.append('Yes')
        else: ans.append('No')
    return ans

def main():
    n, k, q = filter(int, input().split())
    a = []
    for _ in range(q):
        a.append(int(input()))
    attackSurvival(n, k, q, a)

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

def attackSurvival(n, k, q, a):
    ans = []
    import collections
    c = collections.Counter(a)
    for i in range(n):
        if c[i+1] > q - k: ans.append('Yes')
        else: ans.append('No')
    return ans

def main():
    n, k, q = filter(int, input().split())
    a = []
    for _ in range(q):
        a.append(int(input()))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

point=[k]*n
for i in range(q):
	point[a[i-1]]+=1
for i in range(n):
    if point[i]==max(point):
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

import numpy as np

N, K, Q = map(int, input().split())
a = np.full(N, K-Q, dtype=int)

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

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

Submission status: Runtime Error

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

point=[k]*n
for i in range(q):
	point[a[i]]+=1
for i in range(n):
    if point[i]==max(point):
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

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

import numpy as np

N, K, Q = map(int, input().split())
a = np.full(N, K-Q, dtype=int)

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

a=[]
for i in range(Q):
  a.append(int(input()))
cnt=[K-Q]*N
for i in range(1,N+1):
  a.count(i) += cnt[i-1]
  if cnt[i] > 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
n=[int(i) for i in input().split()]
array=[]
for i in range(n[0]):
  array.append(n[1])
for i in range(n[2]):
  array[int(input())-1]+=1
for i in range(n[2]):
  for i in range(n[0]):
    array[i]-=n[2]
	if(array[i]<=0):
      print("No")
    else:
      print("Yes")

Submission status: Runtime Error

Solution code:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q

if zone<1:
    for v in c.values():
        if abs(zone)+1<=v:
            points[v-1]='Yes'
for h in points:
  print(h)

Submission status: Runtime Error

Solution code:
def main():
    N,K,Q=map(int,input().split())
    sum2=[]
    score=[K]*N
    for i in range(Q):
        num=int(input())
        comp[i][:num-1]=[-1]*[num-1]
        comp[i][num-1]=[0]
        comp[i][num:N]=[-1]*[N-num]
    for i in range(N):
        sum2.append(sum(comp[i]))
    for i,j in zip(score,sum2):
        score.append(i+j)
    for s in score:
        if s>0:
            print('Yes')
        else:
            print('No')

if __name__=='__main__':
    main()

Submission status: Runtime Error

Solution code:
def main():
    N,K,Q=map(int,input().split())
    sum2=[]
    score=[K]*N
    for i in range(Q):
        num=int(input())
        comp[i][:num-1]=[-1]*[num-1]
        comp[i][num-1]=[0]
        comp[i][num:N]=[-1]*[N-num]
    for i in range(N):
        sum2.append(sum(comp[i]))
    for i,j in score,sum2:
        score.append(i+j)
    for s in score:
        if s>0:
            print('Yes')
        else:
            print('No')

if __name__=='__main__':
    main()

Submission status: Runtime Error

Solution code:
import numpy as np
def python_list_sub(in1, in2):
    wrk = np.array(in1) - np.array(in2)
    return wrk.tolist()


n, k, q = map(int,input().split())
#A = []
Po = []
De = [1 for i in range(n)]

A = [int(input()) for i in range(q)]
#print(A)

for i in range(n):
    Po.append(int(k))
print(Po)
# 入力はOK

#計算
for i in range(q):
    #De = [1 for i in range(n)]
    ans = python_list_sub(Po, De)
print(ans)

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

Submission status: Runtime Error

Solution code:
import sys
RAW = sys.stdin.readlines()
N, K, Q = RAW[0].split()
def score(i):
  for i in range(N):
    int(K) - int(Q) + RAW.count(i)
for i in range(int(N)):
  if score(i) > 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys
RAW = sys.stdin.readlines()
N, K, Q = RAW[0].split()
def score(i):
  for i in range(int(N)):
    K - Q + RAW.count(i)
for i in range(int(N)):
  if score(i) > 0:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

if __name__ == "__main__":
    solve()

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
a = [int(i) for i in input().split()]
for i in range(m):
  b = max(a)
  c = a.index(b)
  a[c] = b//2
  if sum(a) == 0:
    print(0)
    exit()
print(sum(a))

Submission status: Runtime Error

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

for i in range(0,N,1):
    j=re.findall(i,a)
    if(K+len(j)-Q>0):print("Yes")
    else:print("No")

Submission status: Runtime Error

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

Answers = [int(input()) for i in range(Q)]
Points = [K] * N

for i in Answers:
    for j in range(1, N+1):
        print(i, j)
        if i != j:
            Points[j-1] -= 1
            print(Points)

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

Submission status: Runtime Error

Solution code:
N, K, Q = map(int, input().split())
if K < Q:
  a = {i:K for i in range(N)}
  b = [int(input()) for i in range(Q)]
  for i in b:
    a[i] = a[i]+1
  for v in a.values():
    ans = 'Yes'
    if v-Q <= 0:
      ans = 'No'
    print(ans)
else:
  for i in range(N):
    print('Yes')

Submission status: Runtime Error

Solution code:
import collections
n,k,q=map(int,input().split())
a=[int(input()) for i in range(q)]
points=['No' for i in range(n)]
c = collections.Counter(a)

zone=k-q

if zone<1:
    for v in c.values():
        if abs(zone)+1=<v:
            points[v-1]='Yes'
        
    
    
    
        
    

print(points)