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:
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=[-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:
N,K,Q = map(int, input().split())
anser = []
for i in range(Q):
    a = int(input())
    anser.append(a)
dic = {}
name = "name"
for i in range(N):
    af = name + str(i)
    dic[af] = K
for i in anser:
    for key,value in dic.items():
        if int(key[-1])  != i-1:
            dic[key] = value - 1
            
for key,value in dic.items():
        if value <= 0:
            print("No")
        else:
            print("Yes")

Submission status: Wrong Answer

Solution code:
import numpy as np

N, K, Q = map(int, input().split())
#A_point = np.full((N, 1), K)
A_zero  = np.zeros((N, 1))


for i in range(Q):

        Ai = int(input())
        A_zero[Ai-1][0] += 1

for i in range(len(A_zero)):

        print("Yes" if K-(4-A_zero[i][0])>=1 else "No")

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
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 = np.ones(N) * K
    for i in range(Q):
        a = As[i]
        print(a)
        points[np.delete(np.arange(start=0,step=1,stop=N), a-1)] -= 1
        print(points)
    #print(points)
    res = points
    ans = np.array(['Yes' for _ in range(N)])
    #print(ans)
    #print(res)
    #ans[res<=0] = "Yes"
    ans[res<=0] = "No"
    #print(ans)
    print("\n".join(list(ans)))
if __name__ == '__main__':
    main()

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:
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]
a = [K]*N
#print(a)
for i in range(Q):
 #   print(i)
    n = int(input())
    #print(n)
    for x in range(len(a)):
        a[x] = a[x] -1
    #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:
member, start, round = list(map(int, input().split()))
answer = [0] * (member+1)
for i in range(round):
    answer[int(input())] += 1
print(answer)
for i in range(member):
    if start - (round - answer[i+1]) <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np
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 = np.ones(N) * K
    for i in range(Q-1):
        a = As[i]
        #print(a)
        points[np.delete(np.arange(start=0,step=1,stop=N), a-1)] -= 1
        #print(points)
    #print(points)
    res = points
    ans = np.array(['Yes' for _ in range(N)])
    #print(ans)
    #print(res)
    #ans[res<=0] = "Yes"
    ans[res<=0] = "No"
    #print(ans)
    print("\n".join(list(ans)))
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import Counter
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q)]
a_cnt = Counter(a)
ans = [k+a_cnt[i+1]-q for i in range(n)]
print(ans)
for i in range(n):
    if ans[i] > 0:
        print('Yes')
    else:
        print('No')

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N,K,Q = input().split()
N=int(N)
K=int(K)
Q=int(Q)
 
seikai_list = [K - Q] * N
for i in range(Q):
  num = int(input()) -1
  seikai_list[num] = seikai_list[num] +1

for n in seikai_list:
  if n > 0:
    print("yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
import collections
n, k, q = map(int, input().split())
A = [int(input()) for _ in range(q)]
a_c = collections.Counter(A)
x = ['No'] * n
for i,j in a_c.items():
  if j > q-k:
    x[i-1] = 'Yes'
for k in x:
	print(k)

Submission status: Wrong Answer

Solution code:
import numpy as np

def echo(x):
    if x < 1:
        print("No")
    else:
        print("Yes")

N, K, Q = input().split(" ")
N = int(N)
K = int(K)
Q = int(Q)
score = np.array([K]*N)

for i in range(Q):
    ans = int(input())
    score -= 1
    score[ans-1] += 1
np.vectorize(echo)(score)

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int, input().split())
anser = []
for i in range(Q):
    a = int(input())
    anser.append(a)
dic = {}
name = "name"
for i in range(N):
    af = name + str(i)
    dic[af] = K
   
for i in anser:
    for key,value in dic.items():
        if int(key[-1])  != i-1:
            dic[key] = value - 1
  
for key,value in dic.items():
        if value <= 0:
            print("No")
        else:
            print("Yes")

Submission status: Wrong Answer

Solution code:
N, K ,Q = list(map(int, input().split()))
Point = [K for n in range(N)]
'''
for q in range(Q):
    A = int(input()) - 1
    for n in range(N):
        if n == A:
            Point[n] += 0
        else:
            Point[n] -= 1
'''
for q in range(Q):
    A = int(input()) - 1
    Point[A] += 1

print(Point)
for n in range(N):
    if Point[n] - Q > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import sys
ss = input().split()
N = int(ss[0])
K = int(ss[1])
Q = int(ss[2])
As = []
for i in range(Q):
  As.append(int(input()))
SCORE = [K] * N
for i in range(Q):
  XX = map(lambda x: x - 1, SCORE)
  SCORE = list(XX)
  SCORE[As[i]-1] += 1
print(SCORE)
for i in range(N):
  if(SCORE[i]<1):
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

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

g = k-q

for i in range(n):
    if g >= 0:
        print('Yes')
    else:
        if count[i] > abs(g):
            print('Yes')
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
 
members_p = [3 for _ in range(n)]
 
for _ in range(q):
  a = int(input())
  for i in range(n):
    if i != a-1:
      members_p[i] -= 1
  
result = ['Yes' if member_p > 0 else 'No' for member_p in members_p]
print(*result, sep = '\n')

Submission status: Wrong Answer

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

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

#初期ポイント
points=[K for _ in range(N)]

# 問題数分、ポイントを引いてしまい、
# あとから正解者にポイントを足す
points=list(map(lambda x: x - Q, points))

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

print(list(map(lambda x: 'Yes' if x > 0 else 'No', points)))

Submission status: Wrong Answer

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

score = [k]*n

for i in a:
    score[i-1] += 1
    for x in range(len(score)):
         score[x] = score[x] - 1
    print(score)

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

Submission status: Wrong Answer

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

    def calc(n):
        return n-1

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

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

Submission status: Wrong Answer

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

members_p = [3 for _ in range(n)]

for _ in range(q):
  a = int(input())
  for i in range(n):
    if i != a-1:
      members_p[i] -= 1
  print(members_p)
  
result = ['Yes' if member_p > 0 else 'No' for member_p in members_p]
print(*result, sep = '\n')

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

# In[22]:


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

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


# In[40]:


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

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


# In[ ]:

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
a = [int(input()) for i in range(q)]
d = k - q
count = [d]*n
for j in range(q):
  count[a[j]-1] += 1
print(count)
for l in range(n):
  if count[l] > 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)]
P = [K] * N

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

Submission status: Wrong Answer

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

if K>0:
  print(N)
  exit()

Kl = [K]*N

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

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

Submission status: Wrong Answer

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:
    import collections
    c = collections.Counter(a)
    
    l=([int(i[0]) for i in c.items() if i[1] > q-k])
    #print(l)
    for i in range(n):
        if (i in l):
            print('Yes')
        else:
            print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np
import math
import subprocess
import random
import os
import sys

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

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

arr=np.zeros(N)
arr+=K
A=np.array(A)
for i in A:
	arr-=1
	arr[i-1]+=1
for j in arr:
	if j>0:
		print("yes")
	else:
		print("No")

Submission status: Wrong Answer

Solution code:
x = list(map(int, input().split()))
a = [int(input()) for i in range(x[2])]
tc=0
for i in range(x[0]):
    c=a.count(i+1)
    tc+=c
    p=x[1]-x[2]+c
    if p>0:
        print("Yes")
    else:
        print("No")
    if tc==x[2]:
        cc=i
        break
for i in range(x[0]-cc-1):
    print("No")

Submission status: Wrong Answer

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 index, value in enumerate(people):
    for i in A:
        if index - 1 == i:
            people[index] += 1

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

Submission status: Wrong Answer

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

if k > 0:
    for i in range(n):
        print('Yes')
    exit()

a = [int(input()) for i in range(q)]
n_a = [k] * n

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

ans = 0
print(*n_a)
for i in n_a:
    if i <= 0:
        print('No')
    else:
        print('Yes')

Submission status: Wrong Answer

Solution code:
import collections
n, k, q = map(int, input().split())
u = [int(input()) for jjj in range(q)]
c = collections.Counter(u)
m = {h: hh for h, hh in c.most_common()}
u = set(u)
for x in range(1, n+1):
    if x not in u:
        print('Yes')
        continue
    if k > m[x]:
        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]
a = [K]*N
#print(a)
for i in range(Q):
 #   print(i)
    n = int(input())
  #  print(n)
    a = list(map(calc_minus1,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 collections
n, k, q = map(int, input().split())
u = [int(input()) for jjj in range(q)]
c = collections.Counter(u)
m = {h: hh for h, hh in c.most_common()}
u = set(u)
for x in range(1, n+1):
    if x not in u:
        print('Yes')
        continue
    if n > m[x]:
        print('Yes')

Submission status: Wrong Answer

Solution code:
from collections import Counter
N, K, Q = map(int, input().split())
A = [int(input()) for _ in range(Q)]
C = Counter(A)
ans = ["No"] * N
ok = Q - K
if ok < 1:
  ans = ["Yes"] * N
  for ANS in ans:
    print(ANS)
  exit()

c = [key - 1 for key,val in C.items() if val > ok]
for i in c:
  ans[i] = "Yes"
for ANS in ans:
  print(ANS)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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())
    mask = [True] * n
    mask[q_i - 1] = False
    arr[mask] = arr[mask] - 1

arr_evaluate = arr > 0

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

Submission status: Wrong Answer

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

for i in range(Q):
    answer = int(input()) - 1
    for idx in range(N):
        if idx == answer:
            continue
        score[idx] -= 1
    print(score)

for i in range(N):
    if score[i] <= 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]
#print(n,k,q)
n_list = [k]*n
#print(n_list[0]+100)
#print(n_list)
for i in range(q):
  #print('Q',i)
  seikaisha = int(input())
  #print('seikaishaha',seikaisha)
  for j in range(n):
    if j == seikaisha:
      n_list[j] += 0
    else:
      n_list[j] -= 1
  #print(n_list)
for k in range(n):
  if n_list[k] > 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)]
P = [K] * N

boader = K - 2
for i in range(N):
    ans = A.count(i+1)
    if ans > boader:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""
# 標準入力取得
## 文字列
 =  sys.stdin.readline().rstrip()
 =  list(sys.stdin.readline().rstrip())

## 数値
 =  int(sys.stdin.readline())
 =  map(int, sys.stdin.readline().split())
 =  list(map(int, sys.stdin.readline().split()))
 =  [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""
n,k,q =  map(int, sys.stdin.readline().split())
l=[0]*n
def penalty(b):
    return b + 1

for i in range(q):
    a =  int(sys.stdin.readline())
    l=list(map(penalty, l))
    l[a-1]-=1
    print(l)
for e in l:
    if e >=k:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

members_p = np.array([3 for _ in range(n)])

for _ in range(q):
  a = int(input()) 
  temp = np.zeros(n)
  temp[a-1] = 1
  members_p = members_p - 1 + temp

  # print(members_p)

res_list = ['Yes' if member_p > 0 else 'No' for member_p in members_p]
print(*res_list, sep = '\n')

Submission status: Wrong Answer

Solution code:
from collections import Counter
n, k, q = map(int, input().split())
a = [int(input()) for _ in range(q-1)]
a_cnt = Counter(a)
ans = [k+a_cnt[i+1]-q for i in range(n)]
for i in range(n):
    if ans[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
round_data = input().split(" ")
member_count = int(round_data[0])
member = []

for i in range(member_count):
    member.append(int(round_data[1]))
    
print(member)

for i in range(1,int(round_data[2])+1):
    correct = int(input())
    for i in range(member_count):
        if correct-1 != i:
            member[i] -= 1
    print(member)

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

Submission status: Wrong Answer

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

sei = [0] * n
for i in range(q):
    sei[int(input()) -1] += 1

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

Submission status: Wrong Answer

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

if k >= 0:
    for i in range(n):
        print('Yes')
        exit()

a = [int(input()) for i in range(q)]
n_a = [k] * n

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

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

Submission status: Wrong Answer

Solution code:
def main():
    N, K, Q = [int(i) for i in input().split()]
    L_score = [0] * N
    L_chk = [True] * N
    Submits = [int(input()) for _ in range(Q)]
    cnt = 0
    for s in Submits:
        cnt += 1
        L_score[s] = L_score[s] + 1
        for i in range(N):
            if K - cnt + L_score[i] <= 0:
                L_chk[i] = False

    for chk in L_chk:
        if chk:
            print("Yes")
        else:
            print("No")



if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():

    N, K, Q = map(int, input().split())
    player = [K] * N
    A = []
    for _ in range(Q):
        a = int(input())
        A.append(a)
    for i in range(Q):
        player[A[i] - 1] += 1
        player = [j - 1 for j in player]
    for k in range(N):
        if player[k] <= 0:
            print("NO")
        else:
            print("Yes")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
str = input()

split = str.split(" ")

Member = int(split[0])
Point = int(split[1])
Ans = int(split[2])
MemPoint = [0 for i in range(Member)]

for i in range(Ans):
  MemPoint[int(input())-1] += 1

for i in range(Member):
  if Point - (Ans - MemPoint[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]=b[j]-1
for k in b:
  if k<=0:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import sys
# import random
# import bisect
import collections

# import math
# import numpy as np
# from fractions import gcd
# import itertools

"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)

    def lcm(self, x, y):
        return (x * y) // self.gcd(x, y)


"""ここからメインコード"""


def make_divisors(n):
    # divisors = []
    for i in range(2, int(n ** 0.5) + 1):
        if n % i == 0:
            # divisors.append(i)
            return i
            # if i != n // i:
            #     divisors.append(n//i)


def n_to_10(X, n):
    if int(X / n):
        return n_to_10(int(X / n), n) + str(X % n)
    return str(X % n)


def main():
    ip = IP()
    id = Idea()
    """この下から書いてね"""
    n, k, q = ip.IL()
    a = ip.ILS(q)
    keys = [k for k, v in collections.Counter(a).items() if v > 0]
    for i in range(n):
        if i in keys:
            print("Yes")
        else:
            print("No")


main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from collections import Counter
input = sys.stdin.readline
N,K,Q = map(int,input().split())
QCounter = Counter([int(input()) for _ in range(Q)]).most_common()
defult_over = Q-K #突破に必要な正解数

if defult_over>0:
    s = set()
    for win in QCounter:
        if win[1]>defult_over:
            s.add(win[0])
    for i in range(N):
        if i+1 in s:
            print("Yes")
        else:
            print("No")
else:
    for _ in range(N):
        print("Yes")

Submission status: Wrong Answer

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

for _ in range(Q):
    win = int(input())-1
    for i in range(N):
        P_list[i] -= 1
        P_list[win] += 1

ans = ['' for _ in range(Q)]
for i in range(N):
    if P_list[i] >= 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import sys

N, K, Q = map(int, input().split())
a = list(int(input()) for i in range(Q))

anslst = ['YES'] * N
plst = [0] * N

if K > Q:
    for i in anslst:
        print(i)
    sys.exit()

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

for i in range(N):
    if K - (Q - plst[i]) > 0:
        anslst[i] = 'Yes'
    else:
        anslst[i] = 'No'

for i in anslst:
    print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    N,K,Q = map(int,input().split())
    A=[int(input()) for i in range(Q)]
    Ns = []
    for _ in range(N):
        Ns.append(K)
    print(N,K,Q,A,Ns)
    for i in A:
        for j in range(N):
            if i != j+1:
                Ns[j] -= 1
    for k in Ns:
        if k > 0:
            print('Yes')
        else:
            print('No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

points = [0 for i in range(l[0])]

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

for p in points:
    if p < l[1] - 1:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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


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

for j in range(n):
    points[j] -= q

    if points[j] > 0:
        print('yes')
    else:
        print('no')

Submission status: Wrong Answer

Solution code:
str = input()

split = str.split(" ")

Member = int(split[0])
Point = int(split[1])
Ans = int(split[2])
MemPoint = [0 for i in range(Member)]

for i in range(Ans):
  MemPoint[int(input())-1] += 1

maxNum = max(MemPoint)
for i in range(Member):
  if maxNum == MemPoint[i]:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
import numpy as np

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

A = []
answer = np.array([0]*N)
score = np.array([K]*N)

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

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

print(answer)
answer = K - (Q - answer)

print(answer)
ans = np.where(answer>0, True, False)

print(ans)
for x in ans:
    if x:
        print("Yes")

    else:
        print("No")

Submission status: Wrong Answer

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

P=[K]*N
P1=np.array(P)
for i in A:
    P1=P1-1
    P1[i-1]=P1[i-1]+1
    print(P1)
for i in range(len(P1)):
    if P1[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

if q < k:
    for i in range(n):
        print('Yes')

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

Submission status: Wrong Answer

Solution code:
from sys import stdin


def main():
    N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(stdin.readline().rstrip()) for _ in range(Q)]
    score = [0] * N
    for A in As:
        score[A - 1] += 1
    for s in score:
        x = K - (Q - s)
        print('Yse' if 0 < x else 'No')


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
import sys

num = input().split()
participant = int(num[0])
init_point = int(num[1])
correct = int(num[2])

tmp = [0]*participant

for i in range(correct):
  answer_person = int(input())-1
  tmp[answer_person] += 1
print(tmp)

for i in tmp:
  if i<=correct-init_point:
    print("No")
  else:
    print("Yes")