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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
L = list(map(int, input().split()))

N = L[0]
K = L[1]
Q = L[2]

A = []

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

print(P)
print(A)

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: Wrong Answer

Solution code:
import sys
#import numpy as np
import collections
def main():
    input = sys.stdin.readline
    NKQ = list(map(int, input().split()))
    N = NKQ[0]
    K = NKQ[1]
    Q = NKQ[2]
    As = [int(input()) for _ in range(Q)]
    As.sort()
    c = collections.Counter(As)
    values, counts = zip(*c.most_common())
    values = list(values)
    counts = list(counts)
    #print(values)
    #print(counts)
    #print("===")
    #print(Q - (K-1))
    for i in range(N):
        i += 1
        #print("==")
        #print(i)
        if 0 < K - Q:
            print("Yes")
        else:
            if i in values:
                #print(values.index(i))
                #print(counts[values.index(i)])
                if counts[values.index(i)] > Q - (K-1):
                    print("Yes")
                else:
                    print("No")
            else:
                    print("No")
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
ans = []
limit = q//k
for i in range(q):
    ans.append(int(input()))
for j in range(n):
    if j not in ans:
        print('No')
    else:
        if ans.count(j) < limit:
            print('No')
        else:
            print('Yes')

Submission status: Wrong Answer

Solution code:
import numpy as np

nkq = np.array(list(map(int, input().split())))

p = np.array([0 for i in range(nkq[0])])
p1 = np.array([nkq[1] for i in range(nkq[0])])

#print(p)
a = np.array([int(input()) for i in range(nkq[2])])
for i in range(nkq[2]):
    p[a[i]-1] += 1
    #print(p)

a = [print('Yes') if p[i]-max(p) >= 0 else print('No') for i in range(len(p))]

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, input().split())
list_1 = []
for i in range(c):
    i = int(input())
    list_1.append(i)
list_2 = [b for i in range(a)]
for i in range(c):
    for i in range((len(list_2))):
        e = list_2[i] - 1
        list_2[i] = e
for i in range(c):
    d = list_2[list_1[i]] + 1
    list_2[list_1[i]] = d
list_2.reverse()    
for i in list_2:
    if i >0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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

tmp = []
for i in range(N):
    tmp.append(A.count(i+1))
    
max_point = max(tmp)

for i in range(N):
    if K - max(tmp) < tmp[i]:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np
n,k,q = map(int, input().split())
a = []
for _ in range(q):
    a.append(input())
b = [k-q]*n
i = 1
for _ in range(n):
 s = str(i)
 #print(a.count(s))
 if a.count(s) > 1:
  print("Yes")
 else:
  print("No")
 i = i + 1

Submission status: Wrong Answer

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

for a in set(A):
    if(A.count(a) >= Q - K + 1):
        member[a - 1] = "Yes"

for m in member:
    print(m)

Submission status: Wrong Answer

Solution code:
import sys
#import numpy as np
import collections
def main():
    input = sys.stdin.readline
    NKQ = list(map(int, input().split()))
    N = NKQ[0]
    K = NKQ[1]
    Q = NKQ[2]
    As = [int(input()) for _ in range(Q)]
    As.sort()
    c = collections.Counter(As)
    values, counts = zip(*c.most_common())
    values = list(values)
    counts = list(counts)
    #print(values)
    #print(counts)
    for i in range(N):
        i += 1
        #print(i)
        if i in values:
            #print("==")
            #print(values.index(i))
            #print(counts[values.index(i)])
            if counts[values.index(i)] >= Q -(K-1):
                print("Yes")
            else:
                print("No")
        else:
            print("No")
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

for q in range(Q):
  win=int(input())
  for i in range(N):
    if i!=win:
      A[i]-=1

def hantei(x):
    if x >0:
        return('Yes')
    else:
        return('No')
      
for answer in map(hantei,A):
    print(answer)

Submission status: Wrong Answer

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

def one(n):
    return n - 1

for i in range(Q):
    P = list(map(one,P))
    P[int(A[i]-1)] = P[int(A[i]-1)] + 1

for j in range(N-1):
    if P[j] <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

ans = [K] * N

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

for i in range(N):
    if ans[i] > Q + 1:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

from collections import defaultdict
n,k,q=map(int,input().split())
d = defaultdict(int)
for i in range(q):
        a = int(input())
        d[a]+=1
for i in range(1,n+1):
        if k-(q-d[i]) <=0:
                print("NO")
        else:
                print("YES")


'''
s = input()
a=s[::2]
b=s[1::2]
for i in a:
        if i == 'L':
                print("NO")
                exit()
for i in b:
        if i == 'R':
                print("NO")
                exit()
print("YES")

'''

Submission status: Wrong Answer

Solution code:
i = input()
d = i.split()
N, K, Q = int(d[0]), int(d[1]), int(d[2])

p = [K]*N

for _ in range(Q):
    a = input()
    for n in range(N):
        if a != n+1:
            p[n] = p[n] - 1

for n in range(N):
    if p[n] > 0:
        print('Yes', end='')
    else:
        print('No', end='')
    if n != N-1:
        print()

Submission status: Wrong Answer

Solution code:
n,k,q=(int(x) for x in input().split())
a=[]
for i in range(q):
    a.append(int(input()))
p=[0]*n
for i in range(k):
    for j in range(n):
        p[j]+=1
print(p)
for i in range(n):
    for j in range(q):
        p[i]-=1
        if a[j]-1 == i:
            p[i]+=1
print(p)


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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
n,k,q=map(int,input().split())
A=[int(input()) for _ in range(q)]

Auniq=list(set(A))
for i in range(n):
  if i+1 in Auniq:
    if q-A.count(i+1)<k:
      print('Yes')
    else:
      print('No')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
from collections import Counter

n, k, q = map(int,input().split())
if (k>q):
    for i in range(n):
        print('Yes')
else:
    A = []
    for i in range(q):
        A.append(int(input()))
    As = list(set(A))
    S=Counter(A)
    B = [k-q]*n
    for k,v in S.items():
        B[k-1]+=v

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K,Q=map(int,input().split())
b=[]
a=list(map(int,input())for i in range(Q))
for i in range(N):
  b.append(K)
for i in a:
  for j in range(N):
    if i!=j:
      b[j]-=1
for k in b:
  if k<=0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
import sys

# def calc_minus1(n):
#     n-=1
#     return n

A = [int(x) for x in input().split()]
#print(AB)
N = A[0]
K = A[1]
Q = A[2]
B = K - Q
if K > Q:
    for i in range(Q):
        n = int(input())
    for i in range(N):
        print('YES')
    sys.exit()
a = [B]*N
#print(a)
for i in range(Q):
 #   print(i)
    n = int(input())
    #print(n)
    #print(a)
    a[n-1]+=1
    #print(a)

for i in a:
    if i > 0:
        print('YES')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np

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

P = [K] * N

P = np.array(P)

for i in range(N):
    j = A.count(i+1)
    if j >= int(Q/2):
        print('Yes')
    else:
        print('No')
    j = 0

Submission status: Wrong Answer

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

menber = [0]*n
if q-k > 0:
    for i in range(q):
        ans = int(input())
        menber[ans-1] += 1
else:
    menber = [100000]*n

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

Submission status: Wrong Answer

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


for answer_num in range(q):
  for person_num in range(n):
    if a[answer_num] is not (person_num + 1):
      score_list[person_num] += 1
    
for i in range(n):
  if score_list[i] >= k:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
import collections
def main():
    input = sys.stdin.readline
    NKQ = list(map(int, input().split()))
    N = NKQ[0]
    K = NKQ[1]
    Q = NKQ[2]
    As = [int(input()) for _ in range(Q)]
    As.sort()
    c = collections.Counter(As)
    values, counts = zip(*c.most_common())
    values = list(values)
    counts = list(counts)
    for i in range(N):
        i += 1
        if i in values:
            if counts[values.index(i)] >= K-1:
                print("Yes")
            else:
                print("No")
        else:
            print("No")
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np

nkq = np.array(list(map(int, input().split())))

p = np.array([0 for i in range(nkq[0])])

#print(p)
a = np.array([int(input()) for i in range(nkq[2])])
for i in range(nkq[2]):
    p[a[i]-1] += 1
    #print(p)

p = [print('Yes') if p[i]-max(p) >= 0 else print('No') for i in range(len(p))]

Submission status: Wrong Answer

Solution code:
__author__ = 'Esfandiar'
from collections import defaultdict
n,k,q=map(int,input().split())
d = defaultdict(int)
for i in range(q):
        a = int(input())
        d[a]+=1
for i in range(1,n+1):
        if k-(q-d[i]) <=0:
                print("NO")
        else:
                print("YES")

Submission status: Wrong Answer

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

cur_k = [k] * n

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

for i in cur_k:
  if (i > q):
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
#ABC141_B
S = list(input())
flag1 = 1
flag2 = 1
for i in range(len(S)):
    if i % 2 == 1:
        if S[i] != "L"and S[i] != "U"and S[i] != "D":
            flag1 = 0
            break
    else:
        if S[i] != "R"and S[i] != "U"and S[i] != "D":
            flag2 = 0
            break

if flag1 == 1 and flag2 == 1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys

info = input().split(" ")
N = int(info[0])
K = int(info[1])
Q = int(info[2])

if K > Q:
  for i in range(N):
    print("YES")
  sys.exit()
  
point = [K]*N
  
for i in range(1, Q+1):
  person = input()
  for index, p in enumerate(point):
    if int(person) != index+1:
      point[index] = point[index] - 1
      
      
for p in point:
  if p <= 0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def showoutput(p_list):
    for i in p_list.values():
        if i <= 0:
            print("No")
        else:
            print("Yes")


if __name__ == "__main__":
    del N, K, Q
    for i in A:
        # for loc, val in players.items():
        #    if (int(loc) + 1) != int(i):
        #        print(val - 1)
        players = {
            str(loc): val - 1 if (int(loc) + 1) != int(i) else val
            for loc, val in players.items()
        }

    del A
    showoutput(players)

Submission status: Wrong Answer

Solution code:
n = input().split()
p = []

for i in range(int(n[0])):
    p.append(int(n[1]))

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

print(p)

for i in p:
    i -= int(n[2])
    if 0 < i:
        print("yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
jouken = [int(n) for n in input().split()]

n, k, q = jouken

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

points = [k] * n

Submission status: Wrong Answer

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(newlist)
for i in range(N):
    if l-1 >= j :
        if i +1 == newlist[j] :
            print('Yes')
            j += 1
        else:
            print('No')
    else:
        print('No')

Submission status: Wrong Answer

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

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

for x in a:
	p[x-1] += 1
	p = [ y-1 for y in p ]

ans = []

for z in p:
	if z > 0:
		ans.append('Yes')
	else:
		ans.append('No')

print(ans)

Submission status: Wrong Answer

Solution code:
from collections import Counter

n, k, q = map(int,input().split())
if (k>q):
    for i in range(n):
        print('Yes')
A = []
for i in range(q):
    A.append(int(input()))
As = list(set(A))
S=Counter(A)
B = [k-q]*n
for k,v in S.items():
  B[k-1]+=v

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

Submission status: Wrong Answer

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

menber = [0]*n
if q-k > 0:
    for i in range(q):
        ans = int(input())
        menber[ans-1] += 1
else:
    menber = [100000]*n

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

Submission status: Wrong Answer

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('Nox')
    exit(0)


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

Submission status: Wrong Answer

Solution code:
n, k, q = map(int,input().split())
a = [int(input()) for i in range(q)]
point = [k]*n
for i in range(len(a)):
  for j in range(len(point)):
    if a[i] == j+1:
      continue
    point[j] -= 1
for b in range(len(point)):
  if point[b] <= 0:
    print('NO')
  else:
    print('YES')

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
listt=[]
for i in range(0,N):
    listt.append(K-Q)
print(listt)

for i in range (0,Q):
    n=int(input())
    listt[n-1]+=1
print(listt)
for i in range(0,N):
    if listt[i]>0:
        print ("Yes")
    else :
        print("No")

Submission status: Wrong Answer

Solution code:
N,K,Q=map(int,input().split())
a=[]
b=[]
for i in range(Q):
  x=int(input())
  a.append(x)
for i in range(N):
  b.append(K)
for i in a:
  for j in range(N):
    if i!=j:
      b[j]-=1
for k in b:
  if k<=0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
n,k,q=(int(x) for x in input().split())
a=[]
for i in range(q):
    a.append(int(input()))
p=[0]*n
for i in range(k):
    for j in range(n):
        p[j]+=1
print(p)
for i in range(n):
    for j in range(q):
        p[i]-=1
        if a[j]-1 == i:
            p[i]+=1
print(p)


for i in range(n):
    if p[i]>=1:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

import sys

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: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

for i in point_list:
  i -= Q

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

Submission status: Wrong Answer

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

members_p = list(k-q for _ in range(n))
a_list = []

for _ in range(q):
  a_list.append(int(input()))
  
for i in range(q):
  members_p[a_list[i]-1] += 1

res = ['Yes' if member > 0 else 'No' for member in members_p]  
  
print(members_p)

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
l = [int(input()) for _ in range(q)]
l.sort()
ll = set(l)
l2 = []

for _ in ll:
	l2.append(l.count(_))

lll = list(ll)

if k-q > 0:
	print('Yes\n'*n)

for _ in range(1,n+1):
	if _ in lll:
		if k - q + l2[lll.index(_)] > 0:
			print('Yes')
		else:
			print('No')
	else:
		print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

point_list = [K]*N
d_point = [1]*N

for i in range(0,Q):
  t = input()
  d_point[int(t)] = 0
  point_list = list(map(lambda x,y :x-y, point_list, d_point))
  d_point = [1]*N

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

Submission status: Wrong Answer

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

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

for i in range(max(t)):
    score = i + 1
    ans[i] += t.count(score) - q

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

SCORE = [0] * N

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

Submission status: Wrong Answer

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)
val = list(c.values())
key = list(c.keys())

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] >= jud:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

test = {}
for i in A:
  if i in test:
    test[i]+=1
  else:
    test[i]=1

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

Submission status: Wrong Answer

Solution code:
import sys
def main():
    input = sys.stdin.readline
    NKQ = list(map(int, input().split()))
    N = NKQ[0]
    K = NKQ[1]
    Q = NKQ[2]
    As = [int(input()) for _ in range(Q)]
    #print(As)
    points = [0 for _ in range(N)]
    for i in range(Q):
        a = As[i]
        points[a-1] += 1
        #print(points)
    ans = ["Yes" if points[i]>=K-1 else "No" for i in range(N)]
    #res = np.ones(N) * K - points - 1
    #print(res)
    #ans[res>0] = "Yes"
    #ans[res<=0] = "Yes"
    #print(ans)
    print("\n".join(list(ans)))
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

N, K, Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)
A = []
for _ in range(Q):
    A.append(int(input()))
dic = {}
for a in A:
    if not a in dic:
        dic[a] = 1
    else:
        dic[a] += 1

sum = len(A)

result = {}
for p in range(1, N + 1):
    if p in dic:
        if sum - dic[p] >= K:
            result[p] = "No"
        else:
            result[p] = "Yes"
    else:
        result[p] = "No" if sum >= K else "No"

keys = list(result.keys())
for key in keys:
    print(result[key])

Submission status: Wrong Answer

Solution code:
inp = input ()

no_of_players, initial_point, no_of_matches = inp.split(' ')

initial_point = int(initial_point)

score_board = {}

winners = [int(no_of_matches)]

for k in range(0, int(no_of_matches)):
    # print(k)
    winners.append(int(input()))

#setup
for i in range(0, int(no_of_players)):
    score_board[i+1] = initial_point

# print(score_board)

for n in range(0, int(no_of_matches)):
    winner = winners[n]
    for key, value in score_board.items():
        if key != winner:
            if value > 0:
                score_board[key] -= 1
            # else:
            #     score_board.pop(key)
    # print(score_board)

#finally
for j in range(0, int(no_of_players)):
    if score_board[j+1] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import sys

# def calc_minus1(n):
#     n-=1
#     return n

A = [int(x) for x in input().split()]
#print(AB)
N = A[0]
K = A[1]
Q = A[2]
B = K - Q
a = [B]*N
#print(a)
for i in range(Q):
 #   print(i)
    n = int(input())
    #print(n)
    #print(a)
    a[n-1]+=1
    #print(a)

for i in a:
    if i > 0:
        print('YES')
    else:
        print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

n,k,q = map(int, raw_input().split())
import numpy as np

vec = np.full(n, k, dtype=int)
for i in range(q):
  ind = np.full(n, 1, dtype=int)
  a = int(raw_input())
  ind[a-1] = 0
  vec = vec - ind
  
print('Yes' if i > 0 in vec else 'No')

Submission status: Wrong Answer

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

for i in range(len(a)):
  for j in range(len(point)):
    if a[i] == j+1:
      continue
    point[j] -= 1
for b in range(len(point)):
  if point[b] <= 0:
    print('NO')
  else:
    print('YES')

Submission status: Wrong Answer

Solution code:
import time
start = time.time()


n,k,q = map(int, raw_input().split())
import numpy as np

vec = np.full(n, k, dtype=int)
for i in range(q):
  ind = np.full(n, 1, dtype=int)
  a = int(raw_input())
  ind[a-1] = 0
  vec = vec - ind
  
print('Yes' if i > 0 in vec else 'No')


elapsed_time = time.time() - start
print ("elapsed_time:{0}".format(elapsed_time) + "[sec]")

Submission status: Wrong Answer

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)
val = list(c.values())
key = list(c.keys())

for i in range(len(c)):
    if val[i] > jud:
        ans_list[key[i]-1] +=1
for i in range(N):
    if ans_list[i] > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
NKQ = list(map(int, input().split()))
A = []
for i in range(NKQ[2]):
    A.append(int(input()))
print(A)

#参加者
for j in range(NKQ[0]):
    point = NKQ[1]
    l = j+1
    #正解した問題ごとに点数を引く
    for k in range(NKQ[2]):

        if A[k] == l:
            point = point
        else:
            point = point - 1
    if point > 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
inp = input ()

no_of_players, initial_point, no_of_matches = inp.split(' ')

initial_point = int(initial_point)

score_board = {}

#setup
for i in range(0, int(no_of_players)):
    score_board[i+1] = initial_point

print(score_board)

for n in range(0, int(no_of_matches)):
    print(n)
    winner = int(input())
    for key, value in score_board.items():
        if key != winner:
            if value > 0:
                score_board[key] -= 1
            # else:
            #     score_board.pop(key)
    print(score_board)

#finally
for j in range(0, int(no_of_players)):
    if score_board[j+1] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np

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

a = np.full(n, k)
plus_point = np.zeros(n, dtype=np.int)

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


print(plus_point)
a -= q
a += plus_point

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

Submission status: Wrong Answer

Solution code:
import collections

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

if K>Q:
  for j in range(N):
    print('Yes')
else:    
 A=list()
 for j in range(Q):
   A.append(int(input()))

 for k in range(N):
  score=K
  cond=0
  for j in range(Q):
   if k != A[j]:
    score=score-1
   if score<=0:
      print('No')
      cond=1
      break
  if cond==0:
    print('Yes')