TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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.

Submission attempts (in order):

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

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


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

B = [0 for i in range(N)]
for a in A:
    B[a-1]+=1

for b in B:
    if K-(Q-b) > 0:
        print("Yes")
    else:
        print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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.

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

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

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

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

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

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

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

anslist = [0 for i in range(N)]
 
for i in range(Q):
  Aperson = int(input())
  anslist[Aperson -1] += 1

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import numpy as np
n, k, q = map(int, input().split())
point = np.array([k for _ in range(n)])


def judge(point):
    ans = []
    for _ in range(q):
        a = int(input())
        point -= 1
        point[a-1] += 1
    if k > q:
        return(['Yes' for _ in range(n)])
    for i in range(n):
        if point[i] > 0:
            ans.append('Yes')
        else:
            ans.append('No')
    return(ans)
            

ans = judge(point)
print(*ans)

import numpy as np
n, k, q = map(int, input().split())
point = np.array([k for _ in range(n)])


def judge(point):
    ans = []
    if k > q:
        return(['Yes' for _ in range(n)])
    for _ in range(q):
        a = int(input())
        point -= 1
        point[a-1] += 1
    for i in range(n):
        if point[i] > 0:
            ans.append('Yes')
        else:
            ans.append('No')
    return(ans)
            

ans = judge(point)
print(*ans)

import sys
input = sys.stdin.readline
n, k, q = map(int, input().split())
def judge():
    val = {}
    for _ in range(q):
        a = int(input())
        val[a-1] = val.get(a-1,0) + 1
    #print(val)
    for i in range(n):
        if val.get(i,k-q) + (k - q) > 0:
            print('Yes')
        else:
            print('No')
if k > q:
    print(*['Yes' for _ in range(n)])
else:
    ans = judge()


Verdicts: Time Limit Exceeded

Time Limit Exceeded

Accepted
Problem: 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.

Submission attempts (in order):
a,b,c=map(int,input().split())
d=[]
e=[]
for i in range(c):
  d.append(int(input()))
for i in range(a):
  e.append(b-c)
for i in d:
  e[i+1]+-1
for i in e:
  if e<=0:
    print('No')
  else:
    print('Yes')
  

a,b,c=map(int,input().split())
d=[]
e=[]
for i in range(c):
  d.append(int(input()))
for i in range(a):
  e.append(b-c)
for i in d:
  e[i-1]+=1
for i in e:
  if i<=0:
    print('No')
  else:
    print('Yes')

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N,K,Q=map(int,input().split(" "))
A=[]
for _ in range(Q):
    A.append(int(input()))

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


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

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N, K, Q = map(int, input().split())
points = [K-Q]*(N)
for i in range(Q):
    A = int(input())
    A -= 1
    points[A] += 1
print(points)
for p in points:
    if p >0:
        print("Yes")
    else:
        print("No")

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N,K,Q = list(map(int,input().split()))
A = []

point = [[K-Q] for _ in range(N)]

for i in range(Q):
    p = int(input())-1
    point[p] += 1
for i in range(N):
    if point[i] <= 0:
        print('No')
    else:
        print('Yes')

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

point = [K-Q for _ in range(N)]

for i in range(Q):
    p = int(input())-1
    point[p] += 1
for i in range(N):
    if point[i] <= 0:
        print('No')
    else:
        print('Yes')


Verdicts: Runtime Error

Accepted
Problem: 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.

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

point = [0]*n

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

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

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

point = [0]*n

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


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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import array


i = list(map(int, input().split()))



points = [i[1]] * i[0]

correntCount = i[2]


for i in range(correntCount):
    correcter = int(input()) - 1    
    
    points = [ n - 1 for n in points]
    
    points[correcter] += 2


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



i = list(map(int, input().split()))



points = [i[1]- i[2]] * (i[0] )

correntCount = i[2]


for i in range(correntCount):
    correcter = int(input()) - 1    
    
    points[correcter] += 1


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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import numpy as np
n,k,q=map(int,input().split()) 
a=[int(input()) for _ in range(q)]

ans=np.zeros(n)

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

for i in range(n):
    if k+ans[i]>q:
        print("yes")
    else:
        print("No")


import numpy as np
n,k,q=map(int,input().split()) 
a=[int(input()) for _ in range(q)]

ans=np.zeros(n)

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n, k, q = map(int, input().split())
alist = [int(input()) for i in range(q)]
ans = [k - q] * n

for Ai in alist:
    ans[Ai - 1] += 1

for Ai in alist:
    print('Yes') if Ai > 0 else print('No')

n, k, q = list(input())
alist = [int(input()) for i in range(n)]

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


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

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


n, k, q = map(int, input().split())
alist = [int(input()) for i in range(q)]
ans = [k - q] * n

for Ai in alist:
    ans[Ai - 1] += 1

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


Verdicts: Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N,K,Q = map(int,input().split())
A = []
lst_2 = [0] * N
for i in range(Q):
    A.append(int(input()))
for i in range(Q):
    p = A[i]
    lst_2[p-1] += 1
print(lst_2)
for i in range(N):
    if lst_2[i] > -K+Q:
        print("Yes")
    else:
        print("No")

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N,K,Q = map(int,input().split())
A = [0]*N
for i in range(N):
    a = int(input())
    A[a-1] += 1
for i in range(N):
    x = K+A[i]-Q
    if X > 0:
        print('Yes')
    else:
        print('No')
    

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

Verdicts: Runtime Error

Accepted
Problem: 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.

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


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

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

dat = dict(zip(range(1, n+1), [k]*n))
cnt = 0

for i in range(1, n+1):
    for j in a:
        if i != j:
            dat[i] -= 1

for k in range(1, n+1):
    if dat[k] <= 0:
        print('No')
    else:
        print('yes')



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

cin =[0]*n
ans=[0]*n
cnt =0

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

cnt = max(cin)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N, K, Q=map(int,input().split())
K -= Q
nP = [ K for i in range(N)]

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

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


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

nP = [ K for i in range(N)]
 
for i in range(Q):
  Tmp = int(input())
  nP[Tmp - 1] += 1

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

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

P=[k-q for i in rage(n)]

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

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

n,k,q = map(int,input().split())
A=[int(input()) for i in range(q)]
P=[k-q for i in rage(n)]

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

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

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

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

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n, k, q = map(int, input().split())
L = [k for i in range(n)]
a = [int(input()) for i in range(q)]

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

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

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

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

points = [k] * n
for i in range(q):
    points = map(lambda x: x - 1, points)
    points[l[i] - 1] += 2
for i in points:
    if i <= 0:
        print('No')
    else:
        print('Yes')

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

points = [k - q] * n
for i in range(q):
    points[l[i] - 1] += 1
for i in points:
    if i <= 0:
        print('No')
    else:
        print('Yes')


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
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())


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


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


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

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

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


print(solve())


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())


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())


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


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


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

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

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


print(solve())


Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import numpy as np

n,k,q = map(int, input().split())
a = np.zeros(n)
for i in range(0,k):
  b = int(input())
  a[b-1] += 1

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

import numpy as np

n,k,q = map(int, input().split())
a = np.zeros(n)
for i in range(0,q):
  b = int(input())
  a[b-1] += 1

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

Verdicts: Runtime Error

Accepted
Problem: 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.

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


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n,k,q = map(int,input().split())
a = []
points = []
for i in range(q):
    a.append(int(input()))
print('-------')
for i in range(1,n+1):
    points.append(a.count(i))
tot = sum(points)
tot = -tot
for i in range(n):
    if tot + points[i] + k > 0:
        print('Yes')
    else:
        print('No')

n,k,q = map(int,input().split())
a = {i: 0 for i in range(1,n+1)}
points = []

for i in range(1,q+1):
    x = int(input())
    if x in a:
        a[x] += 1
    else: 
        a[x] = 1

tot = sum(a.values())
tot = -tot

for i in range(1,n+1):
    if tot + a[i] + k > 0:
        print('Yes')
    else:
        print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N,K,Q = map(int,input().split())
ANS = [0] * N
A = [int(input()) for _ in range(Q)]
for a in A:
  ANS[a-1] += 1
  
for i in range(N):
  p = K - Q + A[i]
  if p <= 0:
    print('No')
  else:
    print('Yes')
    
exit()


N,K,Q = map(int,input().split())
ANS = [0] * N
A = [int(input()) for _ in range(Q)]
for a in A:
  ANS[a-1] += 1
  
R = []
for i in range(N):
  p = K - Q + ANS[i]
  if p <= 0:
    R.append('No')
  else:
	R.append('Yes')
    
print('\n'.join(R))


N,K,Q = map(int,input().split())
ANS = [0] * N
A = [int(input()) for _ in range(Q)]
for a in A:
  ANS[a-1] += 1
  
R = []
for i in range(N):
  p = K - Q + ANS[i]
  if p <= 0:
    R.append('No')
  else:
	R.append('Yes')
    
print('\n'.join(R))


N,K,Q = map(int,input().split())
ANS = [0] * N
A = [int(input()) for _ in range(Q)]
for a in A:
  ANS[a-1] += 1
  
R = []
for i in range(N):
  p = K - Q + ANS[i]
  if p <= 0:
    R.append('No')
  else:
    R.append('Yes')
    
print('\n'.join(R))


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
print(a)
print(p)
def judge(x):
    if p[x] <= 0:
        return 'No'
    else:
        return 'Yes'
for j in range(q):
    for i in range(n):
     if i + 1 == a[j]:
        continue
     else:
        p[i] -= 1
print(p)
b = [judge(i) for i in range(n)]
print('\n'.join(b))

n, k, q = map(int, input().split())
a = [int(input()) for i in range(q)]
p = [k for i in range(n)]
def judge(x):
    if p[x] - q <= 0:
        return 'No'
    else:
        return 'Yes'
for i in range(q):
    p[a[i] - 1] += 1
b = [judge(i) for i in range(n)]
print('\n'.join(b))

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n,k,q = map(int, input().split())
 
score = [k-q]*n
 
for i in range(q):
	dat = int(input())-1
	score[dat] = score[dat] + k + 1

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

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

score = [k-q]*n

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

print(score)

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

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

score = [k-q]*n

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

#print(score)

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import numpy as np

N,K,Q = map(int,input().split(" "))
ans=np.full(N, K)

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

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

N,K,Q = map(int,input().split(" "))
ans=np.full(N, K)


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


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

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


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


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


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

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
def resolve():
    N, K, Q = map(int, input().split())
    A = [Q-K]*N
    for _ in range(Q):
        a = int(input())
        A[a-1] += 1
    for i in range(N):
        if A[i] > 0:
            print("Yes")
        else:
            print("No")
resolve()

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n, k, q  = list(map(int, input().split()))
a = []
for i in range(q):
    a.append(int(input()))
 
point = [0]*n
for i in range(q):
    point[a[i]-1] += 1
    print([a[i]-1])

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

n, k, q  = list(map(int, input().split()))
a = []
for i in range(q):
    a.append(int(input()))
 
point = [0]*n
for i in range(q):
    point[a[i]-1] += 1

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I()
N,K,Q = LI()
A = [I() for _ in range(Q)]

c = collections.Counter(A)
# print(c)

B = np.zeros(N)
for i in range(N):
    B[i-1] = c[i]

print(B)
ans = (B - B.sum()) > - K
for b in ans:
    # print(b)
    if b:
        print('Yes')
    else:
        print('No')


# A = np.array(_A)





# B_sum = np.sum(B)
# C = B - B_sum
# print(C)
# print(np.where(B > -K, True, False))


# if ans:
#     print('Yes')
# else:
#     print('No')

import bisect,collections,copy,heapq,itertools,math,string
import numpy as np
from numba import njit
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

# N = I()
N,K,Q = LI()
A = [I() for _ in range(Q)]

c = collections.Counter(A)
# print(c)

B = np.zeros(N,dtype='int')
for i in range(1,N+1):
    B[i-1] = c[i]


ans = (B - Q + K) > 0
for b in ans:
    # print(b)
    if b:
        print('Yes')
    else:
        print('No')


# A = np.array(_A)





# B_sum = np.sum(B)
# C = B - B_sum
# print(C)
# print(np.where(B > -K, True, False))


# if ans:
#     print('Yes')
# else:
#     print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import sys

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



def input2():
	return map(int,input().split())
  
n,k,q=input2()
A=[int(input()) for _ in range(q)]

P=[0]*n


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

for p in P:
	if p >q-k:
		print("Yes")
	else:
		print("No")

Verdicts: Runtime Error

Accepted