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:
def main():
    N,K,Q=map(int,input().split())
    sum2=[]
    score=[]
    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:
n, k, q = map(int,input().split())

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

a = q-k+1

for i in range(1,n+1):
    v = A.count(i)
    if v >= a and v > 0:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
import numpy as np
a = np.zeros(N,dtype="int64")
list=[]
N,K,Q=map(int,input().split())
for i in range (0,Q):
  l1=int(input())
  list.append(l1)

for j in range (0,N):
  a[j]=K

for i in range (0,Q):
  for j in range (0,N):
    if j!=list[i]:
      a[j]=a[j]-1

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

Submission status: Runtime Error

Solution code:
import numpy as np
N, K, Q = input().split()
A = np.array([int(input()) for i in range(int(Q))])
T = np.full(int(N), int(K))
unique, counts = np.unique(A, return_counts=True)
s =  dict(zip(unique, counts))
for key, value in s.items():
    T[0:(key-1)] -= value
    T[key:len(T)] -= value
for i in T:
    if i <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Runtime Error

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

import numpy as np
initial_point = np.array([K] * N)

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

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

Submission status: Runtime Error

Solution code:
N, K, Q = map(int, input().split())
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)

Submission status: Runtime Error

Solution code:
ansed = []
for x in range(0,Q):
    ansed.append(int(input()))
for y in range(1,N+1):
    if K - Q + ansed.count(y) > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
hoge = input()
hoge = hoge.split(" ")
N = int(hoge[0])
K = int(hoge[1])
Q = int(hoge[2])

A = [0] * Q

for i in range(Q):
	A[i] = int(input())

point = [K] * N

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

guests = [k] * n
out_number = []

for i in range(q):
    if not i in out_number:
        guests = list(map(lambda x: x - 1, guests))
        guests[a[i] - 1] += 1
        if guests[i] <= 0:
            out_number.append(i)

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

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
6 5 4
3
1
3
2

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N,K,Q = input().split()
for i in range(Q):
  A = input()
  if A == i+1: 
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

Solution code:
hoge = input()

N = int(hoge[0])
K = int(hoge[2])
Q = int(hoge[4])

A = [0] * Q

for i in range(Q):
	A[i] = int(input())

point = [K] * N

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

for i in range(N):
	if point[i] > 0:
		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 = []
for i in range(N):
    a.append(int(input()))

for i in range(N):
    if K > Q - a.count(i):
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

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

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

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

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

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

Submission status: Runtime Error

Solution code:
import numpy as np

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

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

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

arr_evaluate = arr > 0

for go_or_not in arr_evaluate:
    if go_or_not:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
A = list(input().split())
box = []

ii = 0 
while True:
    box.append(K)
    ii += 1
    if ii == N:
        break

for i in range(0, Q): 
    for k in range(1, N + 1): 
        if A[i] == str(k):
            continue
        else:
            box[k - 1] = box[k - 1] - 1 

for t in box:
    if t > 0:
        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)]

a = q-k+1

for i in range(1,n+1):
    v = A.count(i)
    if v >= a:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
import numpy as np

str = input()

list = str.split(" ")
N = int(list[0]) # 人数
K = int(list[1]) # 初期ポイント
Q = int(list[2]) # 正解数

fuman = np.array([])
for n in range(N):
    fuman = np.append(fuman, K)

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
K = int(input())
Q = int(input())

A = [0] * Q

for i in range(Q):
	A[i] = int(input())

point = [K] * N

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

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

Submission status: Runtime Error

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

A=[]
for i in range(Q):
    A.append(int(input()))
    
jud = Q - K

ans_list = [0] * N

c = collections.Counter(A)
key = list(c.keys())
val = list(c.values())
for i in range(len(c)):
    ans_list[key[i]] = val[i]
#print(ans_list)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word-1]+=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)

Submission status: Runtime Error

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

  for i in range(1,n+1):
    x = a_count(i)
    if k-q+x > 0:
      print('Yes')
      else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

if n == 1:
    a = int(input())
    for i in range(m):
        a //= 2
    print(a)
    exit()

a = sorted(list(map(int, input().split())))

for i in range(m):
    mx = max(a)
    a[index(mx)] //= 2
print(sum(a))

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word-1]+=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

Solution code:
import collections

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

if K > Q :
    for i in range(N):
        print('Yes')
    exit(0)
else:
    x = Q - K

#s = set(lst)
c = collections.Counter(lst)

values, counts = zip(*c.most_common(x))

if len(values) == 0 :
    for i in range(N):
        print('No')
    exit(0)
    

#print(values)
#print(type(values))
newlist = sorted(values)
j = 0
l = len(values)
for i in range(N):
    if l-1 >= j :
        if i +1 == values[j] :
            print('Yes')
            j += 1
        else:
            print('No')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
import numpy as np
from sys import stdin
n, k, q = map(int, input().split())
point = np.array([k for _ in range(n)])
a = []
for _ in range(q):
    a.append(int(input()))
for j in range(q):
    point = point - 1
    point[a[j]] += 1
for i in range(len(point)):
    print('No' if point[i] <= 0 else 'Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

  for i in range(1,n+1):
    x = a.count(i)
    if k-q+x > 0:
      print('Yes')
      else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import sys
import os
f = open('input.txt', 'r')
sys.stdin = f

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

point = []
for i in range(n):
    point.append(k)


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

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

Submission status: Runtime Error

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

if K > Q:
    for i in range(N):
        print('Yes')
        sys.exit()

A = [int(input()) for i in range(Q)]

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

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
a=[(input()) for l in range(q)]
if q-k<0:
    for i in range(n):
        print('Yes')
else:
    c = collections.Counter(a)
    for i in range(n):
        if c[str(i)]>q-k:
            print('Yes')
        else:
            print('No')

Submission status: Runtime Error

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

guests = [k] * n

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


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

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k,n)
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

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

mem = [k - len(a)] * n
for i in range(len(a)):
    mem[a[i]] += 1

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

Submission status: Runtime Error

Solution code:
(n,k,q) = [int(i) for i in input().split(' ')]
values = []
for i in range(0, q):
  values.append(int(input())
to = sum(values)
                
for val in values:
  if k + val > q :
     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)]

m = [k-len(a)] * n
for i in a:
    m[a[i]-1] = m[a[i]-1] + 1

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

Submission status: Runtime Error

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

print(A)

for jk in range(0, N): 
    box.append(K)

for i in range(0, Q): 
    for k in range(1, N + 1): 
        if A[i] == str(k):
            continue
        else:
            box[k - 1] = box[k - 1] - 1 

for t in box:
    if t > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
import collections

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

if K > Q :
    for i in range(N):
        print('Yes')
    exit(0)
else:
    x = Q - K

#s = set(lst)
c = collections.Counter(lst)

values, counts = zip(*c.most_common(x))

if len(values) == 0 :
    for i in range(N):
        print('No')
        exit(0)

#print(values)
#print(type(values))
#values.sort()
j = 0
l = len(values)
for i in range(N):
    if l-1 >= j :
        if i +1 == values[j] :
            print('Yes')
            j += 1
        else:
            print('No')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
sn,sk,sq = input().split(" ")
n = int(sn)
k = int(sk)
q = int(sq)

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

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

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

for i in range(n):
  l[i] = l[i] - (q - m[i])
  
  if l[i] > 0:
    print("Yes")
  
  else:

Submission status: Runtime Error

Solution code:
import numpy as np
n, k, q = input().split(' ')
n, k, q = int(n),int(k), int(q)
hum = [k]*n
for i in range(q):
    ind = input()
    hum[int(ind)] += 1
hum_last = np.array(hum)-q
for i in range(len(hum_last)):
    if hum_last[len(hum_last)-i-1] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k-q,n)
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

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

member = np.ones(N) * K

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

res = np.array(['No', 'Yes'])[(member > 0).astype('int')]

for r in res:
    print(r)

Submission status: Runtime Error

Solution code:
import numpy as np
n, k, q = input().split(' ')
n, k, q = int(n),int(k), int(q)
hum = [0]*n
for i in range(q):
    ind = input()
    hum[int(ind)] += 1
hum_last = np.array(hum)-q
for i in range(len(list(hum_last))):
    if hum_last[i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
a=np.repeat(k,n)
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)

Submission status: Runtime Error

Solution code:
import numpy as np
n,k,q = map(int,input().split())
point = np.array([k for _ in range(n)])
ans = []
for i in range(q):
    ans.append(int(input()))
for j in range(q):
    point = point -1
    point[int(ans[j])] += 1
for k in range(q):
    print('No' if point[k] <= 0 else 'Yes')

Submission status: Runtime Error

Solution code:
import numpy as np
n, k, q = input().split(' ')
n, k, q = int(n),int(k), int(q)
hum = [0]*n
for i in range(q):
    ind = input()
    hum[int(ind)] += 1
hum_last = np.array(hum)-1
for i in range(len(list(hum_last))):
    if hum_last[i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np
N, K, Q = map(int, input().split())
S = []
for _ in range(H):
    S.append(int(input())) 
P=np.array([K]*N)
for i in range(Q):
  a=[-1]*N
  a[S[i]]=0
  P +=a
for i in range(N):
  if P[i] <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())	
listA=[] #appendのために宣言が必要
while True:
    try:
        listA.append(list(map(int,input().split())))
    except:
        break;
for word in listA:
    a[word]-=1
result=[]
for i in range(len(a)):
    if a[i]<=0:
        result.append('No')
    else:
        result.append('Yes')
print(result)

Submission status: Runtime Error

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

point = [K] * N

for i in range(Q):
    if A[i] == i:
        break
    else:
        point[i] -= 1

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

Submission status: Runtime Error

Solution code:
import numpy as np

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

points = [K] * N

for value in A:
    for i in range(len(points)):
        if i != value - 1:
            points[i] = points[i] - 1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
L1 = input().split(" ")
score = [int(L1[1])-int(L1[2])]*(int(L1[0])-1)
for i in range(int(L1[2])):
    A = int(input()) - 1
    score[A] += 1

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

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
array = []
for i in range(c):
	array.append(int(input()))

point = [b] * a
 
for i in range(c):
	point[int(array[i])] = point[int(array[i])] + 1
            
for i in range(len(point)):
	if point[i]-c > 0 :
		print('Yes')
	else:
		print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

n, k, q = input().split(' ')
n, k, q = int(n),int(k), int(q)
hum = [0]*n
for i in range(q):
    ind = input()
    hum[int(ind)] += 1
hum_last = np.array(hum)-1
for i in range(len(hum_last)):
    if hum_last[i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

Solution code:
import numpy as np
n, k, q = input().split(' ')
n, k, q = int(n),int(k), int(q)
hum = [0]*n
for i in range(q):
    ind = input()
    hum[int(ind)] += 1
hum_last = np.array(hum)-1
for i in range(len(hum_last)):
    if hum_last[len(hum_last)-1-i] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

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

for jk in range(0, N):
    box.append(K)

for i in range(0, N):
    for k in range(0, N):
        if int(A[i]) == k:
            continue
        else:
            box[k] = box[k] - 1

for t in box:
    if t > 0:
        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)]

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

def calc_minus(n):
    return n - 1

for i in range(len(A)):
  lst = list(map(calc_minus, lst))
  lst[i-1] = lst[i-1]+1

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

Submission status: Runtime Error

Solution code:
N, K, Q =　map(int, input().split(" "))
 
pointlist = [K for i in range(N)]
 
for i in range(Q):
  Aperson = int(input())
  for j in range(N):
    if j+1 != Aperson:
      pointlist[j] -= 1

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

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
A=[0]*q
B=[k]*n
for i in range(q):
    A[i]=int(input())
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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import numpy as np

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

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

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

for n in range(N):
    if points[n] < 1:
        print('No')
    else:
        print('Yes')

Submission status: Runtime Error

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

if K > Q:
  for i in range(N):
    print("Yes")
else:
  hoge = Q - K + 1
  goods = sorted(set([i for i in A if A.count(i) >= hoge]))
  j = 0
  max_j = len(goods)
  for i in range(1,N+1):
    if i == goods[j]:
      print("Yes")
      if j + 1 == len(goods):
        for k in range(i,N):
          print("No")
        break
      else:
        j += 1
    else:
      print("No")

Submission status: Runtime Error

Solution code:
N, K, Q = list(map(int, input().split()))
A = [int(input()) for i in range(Q)]
plus = np.array([A.count(n+1) for n in range(N)])
scores = plus+K-Q
for score in scores:
    if score>0:
        print('Yes') 
    else:
        print('No')

Submission status: Runtime Error

Solution code:
import numpy as np
from sys import stdin
n,k,q = map(int,input().split())
point = np.array([k for _ in range(n)])
ans = []
for i in range(q):
    ans.append(int(input()))
for j in range(q):
    point = point -1
    point[int(ans[j])] += 1
point[point <= 0] = 'No'
point[point > 0] = 'Yes'
print(*point,sep='\n')

Submission status: Runtime Error

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N,K,Q=map(int,input().split())

A=[int(input()) for _ in range(Q)]
S=[K-Q]*N


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

Submission status: Runtime Error

Solution code:
n,k,q=map(int,input().split())
A=[0]*q
B=[k]*n
for i in range(q):
    A[i]=int(input)
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: Runtime Error

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

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

people = []
for i in range(N):
    people.append(K-Q)

for i in A:
    people[i+1] += 1

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

Submission status: Runtime Error

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

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

for i in range(Q):
  Aperson = int(input())
  for j in range(N):
    if j+1 != Aperson:
      pointlist[j] -= 1

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

Submission status: Runtime Error

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N,K,Q=map(int,input().split())

A=[int(input()) for _ in range(Q)]
S=[K-Q]*N


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

Submission status: Runtime Error

Solution code:
n,k,q = [int(x) for x in input().split()]
li = []
score = [k]*n
for i in range(q):
    a = int(input())
    li.append(a)
    score = [x-1 for x in score]
    score[pe-1] = score[pe-1]+1
result = []
for i in range(len(score)):
    if score[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(input())
    
a = 1 - (K - Q)
score = [0] * N

for i in range(len(A)):
  b = A[i]
  score[b-1] += 1

for j in range(len(score)):
  if score[j] >= a:
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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

for i in range(Q):
    Ai = input()
    score_lst[Ai - 1] += 1

def_socre = K - Q
for j in score_lst:
    if def_socre + j > 0:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
N, K, Q = list(map(int, input().split()))
A = [int(input()) for i in range(Q)]
plus = np.array([A.count(n+1) for n in range(N)])
scores = plus+K-Q
result = [print('Yes') if score>0 else print('No') for score in scores]

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>

using namespace  std;

#define ll long long

#define DEBUG(x) cerr << '>' << #x << ':' << x << endl;





int main(){
    
  
ll n,k,q,t;
cin>>n>>k>>q;
ll a[n+1];
for (int i = 0; i < n; ++i)
{
    a[i]=k;
}
for (int i = 0; i < q; ++i)
{
    cin>>t;

    for (int i = 0; i < n; ++i)
    {
        if ((i+1)!=t and a[i]>0)
        {

            a[i]=a[i]-1;
        }
    }
}
for (int i = 0; i < n; ++i)
{

    if (a[i]==0)
    {
        cout<<"No"<<endl;
    }
    else{
        cout<<"Yes"<<endl;
    }
}
 //cerr<<"\nTime Elapsed: " << 1.0*clock() / CLOCKS_PER_SEC << " sec\n";
    return 0;
}

Submission status: Runtime Error

Solution code:
#coding: utf-8
N, K = map(int, input().split())
Smoji = input()

answer = 0
preword = ''
for s in Smoji:
  if s == preword:
    answer += 1
  preword = s

answer = min(answer + K*2,N-1)

print(answer)

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>

using namespace  std;

#define ll long long

#define DEBUG(x) cerr << '>' << #x << ':' << x << endl;





int main(){
      #ifndef ONLINE_JUDGE
    freopen("input.txt","r",stdin);
    freopen("output.txt","w",stdout);
    freopen("error.txt","w",stderr);
    #endif
ll n,k,q,t;
cin>>n>>k>>q;
ll a[n+1];
for (int i = 0; i < n; ++i)
{
    a[i]=k;
}
for (int i = 0; i < q; ++i)
{
    cin>>t;

    for (int i = 0; i < n; ++i)
    {
        if ((i+1)!=t and a[i]>0)
        {

            a[i]=a[i]-1;
        }
    }
}
for (int i = 0; i < n; ++i)
{

    if (a[i]==0)
    {
        cout<<"No"<<endl;
    }
    else{
        cout<<"Yes"<<endl;
    }
}
 //cerr<<"\nTime Elapsed: " << 1.0*clock() / CLOCKS_PER_SEC << " sec\n";
    return 0;
}

Submission status: Runtime Error

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