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 collections

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

Submission status: Wrong Answer

Solution code:
#ABC141_C
import numpy as np

N,K,Q=map(int,input().split())
A_list=np.zeros((1,Q),dtype='int32')
HP_list=K*np.ones((1,N),dtype='int32')
for i in range(Q):
    A_list[:,i]=int(input())

for i in range(A_list.shape[1]):
    HP_list-np.ones((HP_list.shape))
    HP_list[:,A_list.tolist()[0][i]-1]+=1

ans=HP_list.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
#ABC141_C
import numpy as np

N,K,Q=map(int,input().split())
A_list=np.zeros((1,Q),dtype='int32')
HP_list=K*np.ones((1,N),dtype='int32')
for i in range(Q):
    A_list[:,i]=int(input())

for i in range(A_list.shape[1]):
    HP_list-np.ones((HP_list.shape))
    HP_list[:,A_list.tolist()[0][i]-1]-=1

ans=HP_list.tolist()[0]
for i in range(len(ans)):
    if ans[i]>0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
#ABC141_C
import numpy as np

N,K,Q=map(int,input().split())
A_list=np.zeros((1,Q),dtype='int32')
HP_list=K*np.ones((1,N),dtype='int32')
for i in range(Q):
    A_list[:,i]=int(input())

for i in range(A_list.shape[1]):
    HP_list-np.ones((HP_list.shape))
    HP_list[:,A_list.tolist()[0][i]-1]-=1

for i in range(HP_list.shape[1]):
    print(HP_list.tolist()[0][i])

Submission status: Wrong Answer

Solution code:
N,K,Q=map(int,input().split())
A = [input() for i in range(Q)]
judgeA=list(set(A))
res=[]
func=(Q-(K-1))

for p in judgeA:
  if A.count(p)>=func:
    res.append(p)
ans=["No"]*N

for q in res:
  ans[int(q)-1]="Yes"
for y in ans:
  print(y)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    import sys
    n,k,q=map(int,input().split())
    if n-k>0:
        for i in range(n):
            print('Yes')
        sys.exit()

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

for p in range(1,N+1):
  if A.count(str(p))>=judge:
    res.append(p)
    
lis = ["No"]*N

#もしresが空でないなら
for u in res:
  lis.insert(u-1,"Yes")
for w in lis:
  print(w)

Submission status: Wrong Answer

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

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

print(a)
for i in range(N):
    if a[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=[]
for i in range(Q):
  a=int(input())
  A.append(a)
score=np.full(N,K)
print(score)
for j in range(Q):
  for k in range(len(score)):
    if k==A[j]-1:
      pass
    else:
      score[k]-=1
  print(score)
for l in range(len(score)):
  if score[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)]
dict = {i:k for i in range(1,n+1)}

for i in range(len(a)):
  dict[a[i]] += 1

for i in range(1,n+1):
  if dict[i]-4 > 0:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
# ABC 141 C
import collections
input_list = list(map(int, input().split()))
n = input_list[0]
k = input_list[1]
q = input_list[2]

pointed_player = []
for i in range(q):
    pointed_player.append(int(input())-1)

if q-k <= 0:
    for i in range(n):
        print("Yes")
else:
    c = collections.Counter(pointed_player)
    c_sorted = sorted(c.items(), key=lambda x: x[1], reverse=True)
    ans_index = []
    for tup in c_sorted:
        if tup[1] > q - k:
            ans_index.append(tup[0])
        else:
            break
    for i in range(n):
        if i in ans_index:
            print("Yes")
        else:
            print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N, K, Q = map(int, input().split())
A = list(map(int, input().split()))
for i in range(1, N + 1):
    if K - Q + A.count(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 = int(input())
    A.append(a)

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

Submission status: Wrong Answer

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

p = [k - q] * n

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

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

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

print(p)

Submission status: Wrong Answer

Solution code:
N, K, Q = (int(i) for i in input().split())
A = [None] * (Q)
for i in range(Q):
    A[i] = int(input())
    
right_cnt = [0] * (N+1)
for a in A:
    right_cnt[a] += 1
 
print(right_cnt)   
for i in range(1, N+1):
    if Q - right_cnt[i] < K:
        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)]
ac_list = [-Q+K-1 for _ in range(N)]
#正解数＞問題数（Q）-持ちポイント数（K）＋1ならばsurviveできる

for i in A:
  ac_list[i-1] += 1 #各者の正解数

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

Submission status: Wrong Answer

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

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

for p in pointList:
    if K-Q+p > 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)]
score = [k-q]*n
print(len(a))
for i in range(q):
    temp = a[i]-1
    score[temp] =  score[temp] + 1
for i in range(n):
    if score[i] > 0:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:




def calculate(n,k,q,arr):
    result = [k]*n
    print(result)
    for index in range(q):
        result[arr[index] - 1] = result[arr[index] - 1] + 1

    for index in range(len(result)):
        if (result[index] - q) > 0:
            print("Yes")
        else:
            print("No")

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

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

calculate(N,K,Q,arr)

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

for s in range(n):
  if a[s]>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(int(input()))
p=[k-q]*n
for num in a:
  p[num-1] += 1
print(p)
for num in p:
  if num > 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(int(input()))
p=[-k]*n
for num in a:
  p[num-1] += 1
for num in p:
  if num > 0:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def main():
    N, K, Q = list(map(int, input().split()))
    S =[K-Q]*N
    A=[]
    for i in range(Q):
        A.append(int(input())-1)
    for i in A:
        S[i] = S[i]+1
        print(S)
    for i in range(N):
        if S[i]<1:
            print('No')
        else:
            print('Yes')
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = [k-q+a.count(i) >0 for i in range(n)]
for i in ans:
    if i:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
def minus(a):
  return a-1

a = input().split(" ")
mem = [int(a[1])] * int(a[0])
print(mem)
for i in range(int(a[2])):
  mem[int(input())-1] += 1
  mem = list(map(minus, mem))
for i in mem:
  if i < 1:
    print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
people_num, first_point, correct = map(int,input().split())
who_correct = [input() for i in range(correct)]
points = [first_point-correct for i in range(people_num)]

for i in range(correct):
  for j in range(people_num):
    points[int(who_correct[i])-1] += 1

for i in range(people_num):
  if points[i] < 0:
  	print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
people_num, first_point, correct = map(int,input().split())
who_correct = [input() for i in range(correct)]
points = [first_point for i in range(people_num)]

for i in range(correct):
  for j in range(people_num):
    if j != int(who_correct[i]):
      points[j] -= 1
      if points[j] == 0:
        points[j] = - 100000000

for i in range(people_num):
  if points[i] < 0:
  	print("No")
  else:
    print("Yes")

Submission status: Wrong Answer

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

points = [0]*n
for i in range(q):
    points[a_r[i]-1] += 1

for i in range(n):
    if points[i] >= k:
        points[i] = 'Yes'
        print(points[i])
    else:
        points[i] = 'No'
        print(points[i])

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N, K, Q = input().split(' ')
n, k, q = int(N), int(K), int(Q)
res = ['No'] * n
p = [k - q] * n
for i in range(q):
    r = int(input()) - 1
    p[r] += 1
    if p[r] > 0:
        res[r] = 'Yes'
for i in res:
    print(i)

Submission status: Wrong Answer

Solution code:
def minus(n):
    return n - 1

n,k,q = map(int,input().split())
a = [0] * q
b = [0] * n

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

print(a)
member = [k]*n

for j in range(q):
    member[a[j]-1] = member[a[j]-1] + 1
    member = list(map(minus,member))
    print(member)

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

Submission status: Wrong Answer

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

for i in range(max(A)):
    if K-A.count(i)>0:
      print("Yes")
    else:
      print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    n, k, q = map(int, args[0].split())
    A = sorted(map(int, args[1:]))
    ret = ''
    p = 0
    s = 0
    for a in A:
        if a == p:
            s += 1
        else:
            ret += ('Yes\n' if 0 < k-q else 'No\n')*(a-p-1)
            if 0 < p:
                ret += ('Yes' if 0 < k-(q-s) else 'No') + '\n'
            s = 1

        p = a

    ret += ('Yes' if 0 < k-(q-s) else 'No') + '\n'
    ret += ('Yes\n' if 0 < k-q else 'No\n')*(n-p)
    return ret.rstrip('\n')


if __name__ == "__main__":
    nkq = input()
    _, _, q = map(int, nkq.split())
    print(solve(*([nkq]+[input() for _ in range(q)])))

Submission status: Wrong Answer

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    n, k, q = map(int, args[0].split())
    A = sorted(map(int, args[1:]))
    p = A[0]
    ret = ('Yes\n' if 0 < k-q else 'No\n')*(p-1)
    s = 0
    for a in A:
        if a == p:
            s += 1
        else:
            ret += ('Yes\n' if 0 < k-q else 'No\n')*(a-p-1)
            ret += ('Yes' if 0 < k-(q-s) else 'No') + '\n'
            s = 1

        p = a

    ret += ('Yes' if 0 < k-(q-s) else 'No') + '\n'
    ret += ('Yes\n' if 0 < k-q else 'No\n')*(n-p)
    return ret.rstrip('\n')


if __name__ == "__main__":
    nkq = input()
    _, _, q = map(int, nkq.split())
    print(solve(*([nkq]+[input() for _ in range(q)])))

Submission status: Wrong Answer

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    n, k, q = map(int, args[0].split())
    A = sorted(map(int, args[1:]))
    ret = ''
    p = A[0]
    s = 0
    for a in A:
        if a == p:
            s += 1
        else:
            ret += ('Yes\n' if 0 < k-q else 'No\n')*(a-p-1)
            ret += ('Yes' if 0 < k-(q-s) else 'No') + '\n'
            s = 1

        p = a

    ret += ('Yes' if 0 < k-(q-s) else 'No') + '\n'
    ret += ('Yes\n' if 0 < k-q else 'No\n')*(n-p)
    return ret.rstrip('\n')


if __name__ == "__main__":
    nkq = input()
    _, _, q = map(int, nkq.split())
    print(solve(*([nkq]+[input() for _ in range(q)])))

Submission status: Wrong Answer

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

for i in range(n):
  if a_list.count(i) > q-k:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

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

for _,q in enumerate(A):
    for n,p in enumerate(point):
        if q == n:
            continue
        else:
            point[n] = p-1

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

Submission status: Wrong Answer

Solution code:
N,K,Q = [int(i) for i in input().split()]
mem_point = [K for i in range(N)]
_points = [-1 for i in range(N)]
for rounds in range(Q):
  temp = _points.copy()
  anser = int(input())
  temp[anser] = 0
  mem_point = [mem_point[i]+temp[i] for i in range(len(temp))]
      
[print("Yes") if point >0 else print("No")  for point in mem_point ]

Submission status: Wrong Answer

Solution code:
N,K,Q = [int(i) for i in input().split()]
mem_point = [K for i in range(N)]
for rounds in range(Q):
  anser = int(input())
  for i in range(len(mem_point)):
    if anser == (i+1):
      pass
    else:
      mem_point[i] -= 1
      
for point in mem_point:
  if point > 0:
    print("YES")
  else:
    print("NO")

Submission status: Wrong Answer

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

for i in range(q):
    ans[i] = int(input())
    point=list(map(lambda x:x-1,point))
    point[ans[i]-1] += 1
    
print(point)
for i in range(n):
    if(point[i] <= 0):
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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

cnt = 1
memo = [0]*N
for i in range(len(A_lis)-1):
    if A_lis[i]==A_lis[i+1]:
        cnt+=1
    else:
        if K-(Q-cnt)>0:
            memo[A_lis[i]-1]=1
        else:
            memo[A_lis[i]-1]=-1
        cnt=1
if K-(Q-cnt)>0:
    memo[A_lis[i]-1]=1
else:
    memo[A_lis[i]-1]=-1

if K-Q>0:
    no_ans = 1
else:
    no_ans = 0

for elem in memo:
    if elem==-1:
        print("No")
    elif elem==0:
        if no_ans:
            print("Yes")
        else:
            print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    result = ['Yes']*n
    for i in range(q):
        print(life)
        for j in range(n):
            if a[i] == j+1:
                continue
            life[j] -= 1
            if life[j] <= 0:
                result[j] = 'No'
    for i in range(n):
        print(result[i])

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import numpy as np

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


def winner_or_loss(point):
    return 'Yes' if point > 0 else 'No'


def solve():
    point = np.array(
        [K-Q] * N
    )

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

    return '\n'.join(list(map(winner_or_loss, point)))


print(solve())

Submission status: Wrong Answer

Solution code:
import numpy as np

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


def winner_or_loss(point):
    return 'Yes' if point > 0 else 'No'


def solve():
    point = np.array(
        [K] * N
    )

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

    if len(A) < Q:
        point = point - (Q - len(A))

    return '\n'.join(list(map(winner_or_loss, point)))


print(solve())

Submission status: Wrong Answer

Solution code:
import numpy as np

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


def winner_or_loss(point):
    return 'Yes' if point > 0 else 'No'


def solve():
    point = np.array(
        [K] * N
    )

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

    return '\n'.join(list(map(winner_or_loss, point)))


print(solve())

Submission status: Wrong Answer

Solution code:
import collections
def main():
    li = list(map(int,input().split()))
    respondents = [int(input()) for i in range(li[2])]
    number_of_respondes = respondes_number_of_participants(respondents)
    print(number_of_respondes)
    check_surviver(number_of_respondes,li[0],li[1],li[2])


def respondes_number_of_participants(respondents):
    return collections.Counter(respondents)


def check_surviver(number_of_respondes,number_of_participants,gived_points,number_of_questions):
    for i in range(number_of_participants):
        if number_of_respondes[i+1]:
            if gived_points - number_of_questions + number_of_respondes[i+1] > 0:
                print("Yes")
            else:
                print("No")
        else:
            if gived_points - number_of_questions > 0:
                print("Yes")
            else:
                print("No")

main()

Submission status: Wrong Answer

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

for j in range(0,N):
    score[j]=score[j]-(Q-A.count(j))

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

Submission status: Wrong Answer

Solution code:
def participants_maker(number_of_participates,point):
    return [point]*number_of_participates



def point_getter(participates,respondents):
    for i in range(len(respondents)):
        participates = list(map(lambda x : x-1, participates))
        participates[respondents[i]-1] += 1
    return participates

def discriminate_serviver(result_score):
    for i in range(len(result_score)):
        if result_score[i] <= 0:
            print("NO")
        else:
            print("YES")

def main():
    li = list(map(int,input().split()))
    respondents = [int(input()) for i in range(li[2])]
    participates = participants_maker(li[0],li[1])
    result_score = point_getter(participates,respondents)
    discriminate_serviver(result_score)

main()

Submission status: Wrong Answer

Solution code:
def participants_maker(number_of_participates,point):
    return [point]*number_of_participates



def point_getter(participates,respondents):
    for i in range(len(respondents)):
        participates = list(map(lambda x : x-1, participates))
        participates[respondents[i]-1] += 1
    return participates

def discriminate_serviver(result_score):
    for i in range(len(result_score)):
        if result_score[i] <= 0:
            print("NO")
        else:
            print("YES")


def main():
    li = list(map(int,input().split()))
    respondents = [int(input()) for i in range(li[2])]
    participates = participants_maker(li[0],li[1])
    result_score = point_getter(participates,respondents)
    discriminate_serviver(result_score)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
S = input()
if all(c in 'RUD' for c in S[::2]) and all(c in 'LUD' for c in S[1::2]):
  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)]
B = [0 for i in range(N)]
for i in range(Q):
    j=A[i]-1
    B[j]+=1
for j in range(N):
    if K - Q + B[j]>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)]
B = [0 for i in range(N)]
for i in range(Q):
    j=A[i]-1
    B[j]+=1
for j in range(N):
    if (Q- B[j] )<K:
        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)]
for i in range(1,N+1):
    j =A.count(i)
    if (Q-j)<K:
        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)]
for i in range(1,N+1):
    j =A.count(i)
    if (Q- j )<K:
        print('Yes')
    else :
        print('NO')

Submission status: Wrong Answer

Solution code:
from collections import Counter
N, K, Q = map(int, input().strip().split())
ansl = [int(input().strip()) for _ in range(Q)]
countl = Counter(ansl)
for i in range(N):
    pid = i+1
    print(sum([v for k,v in countl.items() if k != pid]), K)
    if sum([v for k,v in countl.items() if k != pid]) < K:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
n, k, q = map(int, input().split())
a_list = [int(input()) for _ in range(q)]
if k > q:
    for _ in range(n):
        print('Yes')
else:
    point_list = [k for _ in range(n)]
    for a in a_list:
        one_list = [1 for _ in range(n)]
        one_list[a-1] = 0
        point_list = [point - one_list[i] for i, point in enumerate(point_list)]

        print(point_list)

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

Submission status: Wrong Answer

Solution code:
n,k,q =  map(int,input().split())
scores = [0]*n
b = 0
while b < q:
    ans = int(input()) - 1 #0からにする
    scores[ans] += 1
    b += 1
for x in scores:
    if k-(q-x):
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
s = input()

a = 0

for i in range(len(s)):
    if i%2 == 0:
       if s[i] == 'L':
          a = a-1
       else:
          a = a
    else :
        if s[i] == 'R':
            a = a-1
        else:
            a = a
if a<0:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
N,K,Q = map(int,input().split())
A = []
for _ in range(Q):
  A.append(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
  
print (point_list)
for ii in range(N):
  if point_list[ii] > 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(int(input()))
point_list = [K-Q] * N
for i in range(Q):
  point_list[A[i]-1] += 1
for ii in range(N):
  if point_list[ii] > 0 :
    print('yes')
  else :
    print('No')

Submission status: Wrong Answer

Solution code:
n,k,q = map(int,input().split())
correctAnswer = [0]*q
participant = [k]*n


for i in range(q): # q = 正解者のかず
	correctAnswer[i] = int(input())

for correct in correctAnswer:
	for i in participant:# n = 参加者の人数
		i -= 1 
	participant[correct-1] += 1



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

Submission status: Wrong Answer

Solution code:
num_line=input().rstrip().split(" ")

num=int(num_line[0])
firstpoint=int(num_line[1])
times=int(num_line[2])

pointlist=[0 for i in range(num)]
#print(pointlist)

for i in range(times):
    win=int(input())-1
    pointlist[win]+=1

#print(pointlist)
for i in range(num):
    if pointlist[i]>=times-firstpoint+1:
        print("YES")
    else:
        print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [ k-q+L.count(i) for i in range(1,n+1) ]
for i in N:
    print('YES' if i>0 else 'NO')

Submission status: Wrong Answer

Solution code:
n,k,q=map(int,input().split())
N= [k]*n
L = [-q]*n
for _ in range(q): L[int(input())-1] += 1 
N= map(lambda x,y: x+y, N,L)
for i in N:
    print('YES' if i>0 else 'NO')

Submission status: Wrong Answer

Solution code:
n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [ k+q-L.count(i) for i in range(1,n+1) ]
for i in N:
    print('YES' if i>0 else 'NO')

Submission status: Wrong Answer

Solution code:
n,k,q=map(int,input().split())
L= [ int(input()) for i in range(q)]
N = [k]*n
j = 0
while(j<len(L)):
    for i in range(len(N)):
        if i+1 != L[j]:
            N[i] -= 1
    j +=1
print(N)

Submission status: Wrong Answer

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

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

points = [K-Q] * (N+1)

for ans in A:
    points[ans] += 1

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())
if k>q:
    for i in range(n):
        print("Yes")
        exit()
ans=[k-q for i in range(n)]
for i in range(q):
    ans[int(input())-1]+=1
for i in range(n):
    if ans[i]>0:
        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):
  A[int(input()) - 1] += 1
print(A)

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

Submission status: Wrong Answer

Solution code:
N, k, Q = map(int, input().split())
A =[]
i = 0
j = 0
c = 0

def calc_de(n):
    return n - 1

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

S = [k]*N

for j in A:
    S = list(map(calc_de, S))
    S[j] =+ 1

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