input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
A = [0] + [int(_) for _ in input().split()]
B = [0]
is_monotone = True
for i in range(N):
if is_monotone:
is_monotone &= A[i + 1] > A[i]
B += [min(A[i + 1], 18)]
if is_monotone:
print((1))
exit()
def is_possible(K):
dp = [0] * 18
for i in range(N):... | eval(input())
A = [int(_) for _ in input().split()]
A = [A[0]] + [j for i, j in zip(A, A[1:]) if i >= j]
N = len(A)
def cut(array, index):
if index < 1:
return []
for _ in range(len(array)):
if index <= array[_][0]:
return array[:_] + [(index, array[_][1])]
def is_p... | p03202 |
import sys
input = sys.stdin.readline
from collections import Counter
N = int(eval(input()))
A = [int(x) for x in input().split()]
x = min(A)
y = max(A)
if x == y:
# 全員がnon-uniqueな色 or 全員がuniqueな色
bl = (x <= N//2) or (x == N-1)
elif y != x + 1:
bl = False
else:
a = A.count(x)
b... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = sorted(map(int, readline().split()))
def main(A):
N = len(A)
if A[0] == A[-1]:
x = A[0]
return x == N - 1 or 2 * x <= N
if A[0] + 1 != ... | p03688 |
import sys
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
mx = max(a)
mn = min(a)
c = mx + 0
b = 0
s = 0
if mx == mn and (mx != N - 1):
mn -= 1
if mx >= N:
print("No")
exit(0)
for i in range(N):
if abs(a[i] - mx) > 1:
print("No")
exit(0)
... | import sys
input = sys.stdin.readline
N = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
if a[-1] - a[0] > 1:
print("No")
exit(0)
if a[0] == a[-1]:
if a[0] == N - 1:
print("Yes")
exit(0)
if N // a[0] >= 2:
print("Yes")
else: print("No")
exit(0)
table = [0] * ... | p03688 |
n = int(eval(input()))
A = list(map(int,input().split()))
B = []
C = []
for num in A:
if num in B:
C[B.index(num)] += 1
else:
B.append(num)
C.append(1)
if len(B) > 2:
print('No')
elif len(B) == 1:
if n == B[0] +1:
print('Yes')
elif n//B[0] >= 2:
... | n = int(eval(input()))
A = list(map(int,input().split()))
B = []
C = []
for num in A:
if len(B) >= 3:
print("No")
break
elif num in B:
C[B.index(num)] += 1
else:
B.append(num)
C.append(1)
if len(B) >= 3:
pass
elif len(B) == 1:
if n == B[0]... | p03688 |
N = int(eval(input()))
a = list(map(int, input().split()))
L = []
def ans(tf):
if tf:
print("Yes")
else:
print("No")
for x in a:
for i in range(len(L)):
if L[i][0] == x:
L[i][1] += 1
break
else:
L.append([x, 1])
if len(L) >= 3:
ans(False)
if len(L) ... | N = int(eval(input()))
a = list(map(int, input().split()))
L = []
def ans(tf):
if tf:
print("Yes")
else:
print("No")
exit()
for x in a:
for i in range(len(L)):
if L[i][0] == x:
L[i][1] += 1
break
else:
L.append([x, 1])
if len(L) >= 3:
ans(False)
... | p03688 |
N=int(eval(input()))
a=list(map(int,input().split()))
if max(a)-min(a)>=2:
print("No")
elif max(a)-min(a)==0:
count=0
for i in range(N):
if a[i]==N-1 or a[i]<=N//2:
count+=1
if count==N:
print("Yes")
else:
print("No")
else:
q=0
p=0
... | N=int(eval(input()))
a=list(map(int,input().split()))
M=max(a)
m=min(a)
if M-m>=2:
print("No")
elif M-m==0:
count=0
for i in range(N):
if a[i]==N-1 or a[i]<=N//2:
count+=1
if count==N:
print("Yes")
else:
print("No")
else:
q=0
p=0
... | p03688 |
import sys
stdin = sys.stdin
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(n... | n = int(eval(input()))
a = list(map(int, input().split()))
unum = min(a)
vnum = max(a)
u = a.count(unum)
v = a.count(vnum)
exist = False
if vnum-unum == 1:
if u+1 <= vnum <= u+v//2:
exist = True
elif vnum == unum:
if vnum == n-1 or vnum <= n//2:
exist = True
print(("Yes" if ... | p03688 |
#https://img.atcoder.jp/agc016/editorial.pdf
def solve():
n = int(eval(input()))
a = list(int(i) for i in input().split())
ans = 'Yes'
alone = 0
group = 0
if max(a) - min(a) >= 2: ans = 'No'
elif max(a) - min(a) == 1:
for i in a:
if i == max(a)-1 : alone += 1
else: group += 1
... | #https://img.atcoder.jp/agc016/editorial.pdf
def solve():
n = int(eval(input()))
a = list(int(i) for i in input().split())
ans = 'Yes'
alone = 0
group = 0
ha = max(a)
la = min(a)
if ha - la >= 2: ans = 'No'
elif ha - la == 1:
for i in a:
if i == ha-1 : alone += 1
else: gr... | p03688 |
N,K,Q = list(map(int, input().split(" "))) #N:参加者 K:ポイント Q:正解数
A = [K]*N
for i in range(0,Q):
A = list([x-1 for x in A])
A[int(eval(input()))-1] += 1
for point in A:
if point<=0:
print("No")
else:
print("Yes") | N,K,Q = list(map(int, input().split(" "))) #N:参加者 K:ポイント Q:正解数
A = [K]*N
for i in range(0,Q):
A[int(eval(input()))-1] += 1
for point in A:
if point - Q <= 0 :
print("No")
else:
print("Yes") | p02911 |
def calc_point(points, n):
for i in range(len(points)):
if i != n:
points[i] -= 1
n, k, q = list(map(int, input().split(" ")))
points = []
for i in range(n):
points.append(k)
for i in range(q):
a = int(eval(input()))
calc_point(points, a-1)
for i in range(len(p... | n, k, q = list(map(int, input().split(" ")))
points = {}
for i in range(q):
a = int(eval(input()))
if a not in points:
points[a] = 0
points[a] += 1
for i in range(n):
p = 0
if (i+1) in points:
p = points[i+1]
if k - q+p >= 1:
print("Yes")
else:
... | p02911 |
n,k,q = list(map(int,input().split()))
Ans = [int(eval(input())) for i in range(q)]
if k > q:
for i in range(n):
print("Yes")
else:
C = ["No"]*n
for j in Ans:
if Ans.count(j) > q - k:
C[j-1] = "Yes"
else:
pass
for l in range(n):
print((C[l])) | n,k,q = list(map(int,input().split()))
points = []
for i in range(n):
points.append(k-q)
for i in range(q):
points[int(eval(input()))-1]+=1
for i in range(n):
if points[i]>0:
print("Yes")
else:
print("No") | p02911 |
n,k,q=list(map(int,input().split()))
d=[k]*n
s=[]
for i in range(q):
s.append(int(eval(input())))
for i in range(q):
for j in range(n):
if s[i]!=(j+1):
d[j]-=1
for i in range(n):
if d[i]<=0:
print("No")
else:
print("Yes")
| n,k,q=list(map(int,input().split()))
d=[k-q]*n
s=[]
for j in range(q):
d[int(eval(input()))-1]+=1
for i in range(n):
if d[i]<=0:
print("No")
else:
print("Yes")
| p02911 |
n,k,q=list(map(int,input().split()))
a=[k]*n
for i in range(q):
t=int(eval(input()))
for i in range((n)):
if i!=t-1:
a[i]-=1
for i in a:
if i>0:
print("Yes")
else:
print("No") | n,k,q=list(map(int,input().split()))
a=[0]*n
for i in range(q):
t=int(eval(input()))
a[t-1]+=1
#print(a)
for i in a:
if k-(q-i)>0:
print("Yes")
else:
print("No") | p02911 |
n,k,q = list(map(int, input().split()))
point_l = [k] * n
for _ in range(q):
point_l = list([x-1 for x in point_l])
ans = int(eval(input()))
point_l[ans-1] += 1
for i in range(n):
if point_l[i] <= 0:
print('No')
else:
print('Yes') | n,k,q = list(map(int, input().split()))
point_l = [k-q] * n
for _ in range(q):
ans = int(eval(input()))
point_l[ans-1] += 1
for i in range(n):
print(('Yes' if point_l[i]>0 else 'No')) | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
P = [K]* N
def calc(n):
return n - 1
for i in range(Q):
P = list(map(calc, P))
P[A[i] - 1] += 1
for p in P:
if p > 0:
print("Yes")
else:
print("No") | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
P = [K - Q]* N
for i in range(Q):
P[A[i] - 1] += 1
for p in P:
if p > 0:
print("Yes")
else:
print("No") | p02911 |
Input = list(map(int,input().split()))
point =[]
for i in range(Input[0]):
point.append(Input[1])
for i in range(Input[2]):
aa = int(eval(input()))-1
for k in range(Input[0]):
point[k] -= 1
point[aa] += 1
gouhi =[]
for i in range(Input[0]):
bb = 0
if point[i] ... | Input = list(map(int,input().split()))
point =[]
for i in range(Input[0]):
point.append(0)
for i in range(Input[2]):
aa = int(eval(input()))
point[aa-1] +=1
gouhi =[]
for i in range(Input[0]):
bb = 0
if Input[1]-Input[2]+point[i] > 0 :
bb = "Yes"
else:
bb = "No"
... | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [K] * N
for i in A:
point[i-1] = point[i-1] + 1
point=list([x-1 for x in point])
for i in range(N):
if point[i] <= 0:
print('No')
else:
print('Yes') | N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [K-Q] * N
for i in A:
point[i-1] = point[i-1] + 1
for i in range(N):
if point[i] <= 0:
print('No')
else:
print('Yes') | p02911 |
from sys import stdin
n,k,q = list(map(int, stdin.readline().split()))
a = [int(stdin.readline()) for _ in range(q)]
points = list([x-q for x in [k for i in range(n)]])
for i in set(a):
points[i-1] += a.count(i)
for i in points:
if i <= 0:
print('No')
else:
print('Yes') | n,k,q=list(map(int,input().split()))
a=[k-q]*n
for i in range(q):
point=int(eval(input()))
a[point-1] += 1
for i in range(len(a)):
if a[i] > 0:
print("Yes")
else:
print("No") | p02911 |
from collections import deque
n,k,q = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(q)]
start = [k-q]*n
points = deque(start)
for i in set(a):
points[i-1] += a.count(i)
for _ in range(len(points)):
x = points.popleft()
if x <= 0:
print('No')
else:
print('Yes') | from collections import deque
n,k,q=list(map(int,input().split()))
a=deque([k-q]*n)
for i in range(q):
point=int(eval(input()))
a[point-1] += 1
for _ in range(len(a)):
if a.popleft() > 0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
la = list()
for i in range(Q):
la.append(int(eval(input())))
for i in range(1,N+1):
if Q-la.count(i) < K:
print("Yes")
else:
print("No")
| N, K, Q = list(map(int, input().split()))
la = list()
for i in range(Q):
la.append(int(eval(input())))
lcount = [0] * N
for i in range(Q):
lcount[la[i]-1] += 1
for i in range(N):
if K+lcount[i]-Q > 0:
print("Yes")
else:
print("No")
| p02911 |
n,k,q = list(map(int,input().split()))
point = [k for i in range(n)]
for _ in range(q):
ans = int(eval(input()))
for i in range(n):
if ans - 1 != i:
point[i]-=1
for i in range(n):
if point[i] > 0:
print("Yes")
else:
print("No") | n,k,q = list(map(int,input().split()))
point = [0 for i in range(n)]
for _ in range(q):
ans = int(eval(input()))
point[ans-1] += 1
for i in range(n):
if k + point[i] - q > 0:
print("Yes")
else:
print("No") | p02911 |
n,k,q=list(map(int,input().split()))
a=[int(eval(input()))for _ in range(q)]
w=k-q
for i in range(n):
if a.count(i+1)+w>0:
print("Yes")
else:
print("No") | n,k,q=list(map(int,input().split()))
a=[int(eval(input()))for _ in range(q)]
w=k-q
e=abs(w)
b=[w]*n
if w>0:
for _ in range(n):
print("Yes")
exit()
for i in a:
b[i-1]+=1
for j in range(n):
if b[j]>0:
print("Yes")
else:
print("No") | p02911 |
N,K,Q = list(map(int,input().split()))
a = [K]*N
for i in range(Q):
a=list([x-1 for x in a])
a[int(eval(input()))-1]+=1
for i in range(N):
if a[i]>0:
print('Yes')
else:
print('No') | N,K,Q = list(map(int,input().split()))
a = [K]*N
for i in range(Q):
a[int(eval(input()))-1]+=1
a=list([x-Q for x in a])
for i in range(N):
if a[i]>0:
print('Yes')
else:
print('No') | p02911 |
from collections import Counter
N, K, Q = list(map(int, input().split()))
ctr = Counter(int(eval(input())) for _ in range(Q))
for i in range(1, N + 1):
if K - Q + ctr[i] > 0:
print("Yes")
else:
print("No")
|
N, K, Q = list(map(int, input().split()))
X = [int(eval(input())) for _ in range(Q)]
cnt = [0] * N
for q in X:
cnt[q - 1] += 1
for i in range(N):
if Q - cnt[i] >= K:
print("No")
else:
print("Yes")
| p02911 |
n, k, q = list(map(int,input().split()))
b = list()
for i in range(q):
a = int(eval(input()))
b.append(a)
for j in range(1,n+1):
c = b.count(j)
if c < q-k+1:
print('No')
else:
print('Yes') | n, k, q = list(map(int,input().split()))
a = []
for i in range(q):
b = int(eval(input()))
a.append(b)
pnt = [0] * n
for x in a:
pnt[x-1] += 1
for j in range(n):
if pnt[j] > q-k:
print('Yes')
else:
print('No') | p02911 |
def resolve():
n,k,q=list(map(int, input().split()))
a=k-q
l=[int(eval(input())) for i in range(q)]
for i in range(1,n+1):
if a+l.count(i)>0:
print('Yes')
else:
print('No')
resolve() | def resolve():
n,k,q=list(map(int, input().split()))
l=[int(eval(input())) for i in range(q)]
a=[k-q for i in range(n)]
for i in l:
a[i-1]+=1
for i in range(n):
if a[i]<=0:
print('No')
else:
print('Yes')
resolve() | p02911 |
n,k,q=list(map(int,input().split()))
l=[k for i in range(n)]
for i in range(q):
l[int(eval(input()))-1]+=1
for i in range(n):
print(('Yes' if l[i]-q>0 else 'No')) | n,k,q=list(map(int,input().split()))
l=[0 for i in range(n)]
for i in range(q):
l[int(eval(input()))-1]+=1
print(('\n'.join('Yes' if l[i]-q+k>0 else 'No' for i in range(n)))) | p02911 |
import sys
input = sys.stdin.readline
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
for j in range(1,n+1):
print(('Yes' if (k + a.count(j) - q)>0 else 'No'))
| import sys
input = sys.stdin.readline
n,k,q = list(map(int,input().split()))
a = [int(eval(input())) for i in range(q)]
ip = [k-q]*(n+1)
for j in a:
ip[j] += 1
ans = '\n'.join('Yes' if p > 0 else 'No' for p in ip[1:])
print(ans) | p02911 |
def main():
N, K, Q = list(map(int, input().split()))
lst_miss = [Q] * N
for _ in range(Q):
A = int(eval(input()))
lst_miss[A - 1] -= 1
for miss in lst_miss:
ans = "Yes" if miss < K else "No"
print(ans)
if __name__ == "__main__":
main() | def main():
N, K, Q = list(map(int, input().split()))
lst_A = [int(eval(input())) for _ in range(Q)]
lst_miss = [K - Q] * N
for A in lst_A:
lst_miss[A - 1] += 1
for miss in lst_miss:
ans = "Yes" if miss > 0 else "No"
print(ans)
if __name__ == "__main__"... | p02911 |
n,k,q = list(map(int,input().split()))
a_list = [int(eval(input())) for i in range(q)]
scores = [a_list.count(i+1) for i in range(n)]
for i,score in enumerate(scores):
if k-q+score > 0:
print('Yes')
else:
print('No') | n,k,q = list(map(int,input().split()))
scores = {}
for i in range(n):
scores[i+1] = k-q
for elem in [int(eval(input())) for i in range(q)]:
scores[elem] += 1
for k,v in list(scores.items()):
if v > 0:
print('Yes')
else:
print('No') | p02911 |
N, K, Q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(Q)]
pt = [K - Q]*(N + 1)
for i in range(Q):
for n in range(len(pt)):
if n == A[i]:
pt[n] += 1
for n in range(1, len(pt)):
if pt[n] > 0:
print("Yes")
else:
print("No")
| n,k,q = list(map(int,input().split()))
ans = [0]*n
for i in range(q):
idx = int(eval(input())) -1
ans[idx] += 1
for i in ans:
print(('Yes' if q-k<i else 'No'))
| p02911 |
n, k, q = [int(i) for i in input().split()]
a = [int(eval(input())) for i in range(q)]
out = [k] * n
for i in a:
out = [i-1 for i in out]
out[i-1] += 1
for i in out:
print(("Yes" if i > 0 else "No")) | n, k, q = [int(i) for i in input().split()]
a = [int(eval(input())) for i in range(q)]
out = [k-q] * n
for i in a:
out[i-1] += 1
for i in out:
print(("Yes" if i > 0 else "No")) | p02911 |
n, k, q = input().split()
N = int(n)
K = int(k)
Q = int(q)
Q_list = []
for i in range(Q):
Q_list.append(int(eval(input())))
for i in range(N):
p = K - (Q - Q_list.count(i + 1))
if p <= 0:
print("No")
else:
print("Yes") | n, k, q = input().split()
N = int(n)
K = int(k)
Q = int(q)
Q_list = [0] * N
for i in range(Q):
num = int(eval(input()))
Q_list[num - 1] += 1
for i in range(N):
p = K - (Q - Q_list[i])
if p <= 0:
print("No")
else:
print("Yes") | p02911 |
N,K,Q=list(map(int, input().split())) #複数数値入力 「A B」みたいなスペース空いた入力のとき
a=[]
for q in range(Q):
a.append(int(eval(input())))
cnt=0
for n in range(N):
if K - (Q - a.count(n+1)) > 0:
print('Yes')
else:
print('No') | N,K,Q=input().split()
N=int(N)
K=int(K)
Q=int(Q)
a=[]
for q in range(Q):
a.append(int(eval(input())))
cnt=[0]*N
for q in range(Q):
cnt[int(a[q])-1]+=1
for n in range(N):
if K - (Q - cnt[n]) > 0:
print('Yes')
else:
print('No') | p02911 |
# ABC141
from collections import Counter
def main():
N, K, Q, *A = map(int, open(0).read().split())
C = Counter(A)
ans = []
for i in range(1, N + 1):
x = "Yes" if K - Q + C[i] > 0 else "No"
ans.append(x)
print(*ans, sep="\n")
if __name__ == "__main__":
main()
| # ABC141
from collections import Counter
def main():
N, K, Q, *A = list(map(int, open(0).read().split()))
C = Counter(A)
ans = []
for i in range(1, N + 1):
x = "Yes" if K - Q + C[i] > 0 else "No"
ans.append(x)
print(("\n".join(ans)))
if __name__ == "__main__":
... | p02911 |
# ABC141
from collections import Counter
def main():
N, K, Q, *A = list(map(int, open(0).read().split()))
C = Counter(A)
ans = []
for i in range(1, N + 1):
x = "Yes" if K - Q + C[i] > 0 else "No"
ans.append(x)
print(("\n".join(ans)))
if __name__ == "__main__":
... | # ABC141C - Attack Survival (w/o Counter)
def main():
N, K, Q, *A = list(map(int, open(0).read().split()))
ans, C = [], [0] * (N + 1)
for i in A:
C[i] += 1
for i in C[1:]:
x = "Yes" if K - Q + i > 0 else "No"
ans.append(x)
print(("\n".join(ans)))
if __name__ ==... | p02911 |
NKQ = list(map(int,input().split()))
point = [NKQ[1]]*NKQ[0]
for i in range(NKQ[2]):
A = int(eval(input()))
for j in range(NKQ[0]):
if j != A-1:
point[j] -= 1
for k in range(NKQ[0]):
if point[k] > 0:
print('Yes')
else:
print('No') | NKQ = list(map(int,input().split()))
point = [0]*NKQ[0]
for i in range(NKQ[2]):
A = int(eval(input()))
point[A-1] += 1
for j in range(NKQ[0]):
if NKQ[1] - NKQ[2] + point[j] > 0:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int,input().split()))
a = [0]*q
score = [k]*n
for i in range(q):
a[i] = int(eval(input()))
for j in range(n):
if j != a[i]-1:
score[j] -= 1
for i in range(n):
if score[i] <= 0:
print('No')
else:
print('Yes') | n,k,q = list(map(int,input().split()))
a = [0]*q
# score = [k]*n
count = [0]*n
for i in range(q):
a[i] = int(eval(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:
... | p02911 |
#!/usr/bin/env python
# coding: utf-8
# In[13]:
N,K,Q = map(int, input().split())
point = [K]*N
for _ in range(Q):
A = int(input())
point = [point[i]-1 if i != A-1 else point[i] for i in range(len(point))]
ans = [print("Yes") if point[i]>0 else print("No") for i in range(len(point))]
# In[ ]:... | #!/usr/bin/env python
# coding: utf-8
# In[14]:
N,K,Q = map(int, input().split())
point = [0]*N
for _ in range(Q):
A = int(input())
point[A-1] += 1
ans = [print("Yes") if point[i] > Q-K else print("No") for i in range(len(point))]
# In[ ]:
| p02911 |
n,k,q=list(map(int,input().split()))
a=[]
for i in range(q):
a.append(int(eval(input())))
#p=[k for _ in range(n)]
w=q-k+1
for i in range(n):
if a.count(i+1) >= w:
print('Yes')
else:
print('No')
| n,k,q=list(map(int,input().split()))
a=[0 for _ in range(n)]
for i in range(q):
x=int(eval(input()))
a[x-1] += 1
w=q-k+1
for i in range(n):
if a[i] >= w:
print('Yes')
else:
print('No')
| p02911 |
N, K, Q = list(map(int, input().split(' ')))
score = [K for player in range(N)]
answers = [int(eval(input())) - 1 for q in range(Q)]
for answer in answers:
for i in range(N):
if i != answer:
score[i] = score[i] - 1
for result in score:
if result > 0:
print('Yes')
el... | N, K, Q = list(map(int, input().split(' ')))
score = [K for player in range(N)]
answers = [int(eval(input())) - 1 for q in range(Q)]
for answer in answers:
score[answer] = score[answer] + 1
score = [point - Q for point in score]
for result in score:
if result > 0:
print('Yes')
else:
... | p02911 |
N,K,Q=list(map(int, input().split()))
m=max(N,Q)
A=[0]*m
for i in range(0,Q):
A[i]=int(eval(input()))
S=[0]*m
T=[0]*m
for k in range(Q,m):
A[k]=-1
S[k]=-1
T[k]=-1
for i in range(0,N):
S[i]=A.count(i+1)
T[i]=Q-S[i]
if T[i]>=K:
print("No")
else:
print("Yes") | N,K,Q=list(map(int, input().split()))
A=[0]*Q
for i in range(0,Q):
A[i]=int(eval(input()))
Score_list=[K]*N
Sum_list=[0]*N
for i in range(0,Q):
Sum_list[A[i]-1]+=1
for i in range(0,N):
if Q-Sum_list[i]>=K:
print("No")
else:
print("Yes") | p02911 |
n,k,q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(q)]
tensu=[]
for i in range(n):
tensu.append(k)
for i in range(q):
for j in range(n):
if j!=A[i]-1:
tensu[j]=tensu[j]-1
for i in range(n):
if tensu[i]>0:
print("Yes")
else:
pr... | n,k,q=list(map(int,input().split()))
A=[int(eval(input())) for i in range(q)]
tokuten=[0]*n
for i in range(q):
tokuten[A[i-1]-1]=tokuten[A[i-1]-1]+1
for i in range(n):
if tokuten[i]>q-k:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
A = []
for i in range(Q):
a = int(eval(input()))
A.append(a)
for i in range(N):
if K - (Q - A.count(i+1))> 0:
print('Yes')
else:
print('No') | N, K, Q = list(map(int, input().split()))
A = [K-Q]*N
for i in range(Q):
a = int(eval(input()))
A[a-1] += 1
for i in range(N):
if A[i]> 0:
print('Yes')
else:
print('No') | p02911 |
def update_points(points, current_ansewr):
return list(
map(
lambda x: x[1] if (x[0] + 1) == current_ansewr else x[1] - 1,
enumerate(points),
)
)
N, K, Q = [int(i) for i in input().split()]
points = [K] * N
for _ in range(Q):
answer = int(eval(input()))
... | N, K, Q = [int(i) for i in input().split()]
points = [(K - Q)] * N
for _ in range(Q):
answer = int(eval(input()))
points[answer - 1] += 1
for p in points:
print(("Yes" if p > 0 else "No"))
| p02911 |
a = list(map(int,input().split()))
results = [int(eval(input())) for i in range(a[2])]
points = [a[1]] * a[0]
for result in results:
points = list([x - 1 for x in points])
points[result - 1] = points[result - 1] + 1
for point in points:
if point > 0:
print('Yes')
else:
... | a = list(map(int,input().split()))
results = [int(eval(input())) for i in range(a[2])]
points = [a[1]] * a[0]
points = list([x - a[2] for x in points])
for result in results:
points[result - 1] = points[result - 1] + 1
for point in points:
if point > 0:
print('Yes')
else:
p... | p02911 |
n,k,q=list(map(int,input().split()))
ls=[k]*n
for _ in range(q):
a=int(eval(input()))
for i in range(n):
if i+1==a:
ls[i]+=1
break
for i in ls:
if i<=q:
print("No")
else:
print("Yes") | n,k,q=list(map(int,input().split()))
ls=[0]*n
for _ in range(q):
a=int(eval(input()))
ls[a-1]+=1
for i in ls:
print(("Yes"if k+i>q else "No")) | p02911 |
def resolve():
N,K,Q = list(map(int,input().split()))
A = [eval(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:
... | def resolve():
N,K,Q = list(map(int,input().split()))
A = [eval(input()) for i in range(Q)]
P = [K] * N
def calc(n):
return n-Q
for i in range(Q):
P[int(A[i])-1] += 1
P = list(map(calc, P))
for i in range(N):
if P[i] <= 0:
print("No")
... | p02911 |
n,k,q = list(map(int,input().split()))
a = [int(input()) for i in range(q)]
t = ["No"]*(n-max(a))
if k - q > 0:
print(*["Yes"]*n,sep="\n")
exit()
for i in range(1,max(a)+1):
if k + a.count(i) - q > 0 :
print("Yes")
else:
print("No")
print(*t,sep="\n")
| n,k,q = list(map(int,input().split()))
t = [0]*n
for i in range(q):
t[int(input())-1] += 1
print(*["Yes" if k + i - q > 0 else "No" for i in t],sep="\n")
| p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
p = [k - q] * n
'''
p = []
for i in range(n):
p.append(k)
for i in range(q):
for j in range(n):
if(j + 1 == a[i]):
pass
else:
p[j] = p[j] - 1
#print(p)
for i in range(n):
... | n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
p = [k - q] * 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') | p02911 |
N,K,Q = list(map(int, input().split()))
a = []
for i in range(0,Q):
x = int(eval(input()))
a.append(x)
l = [K] * N
for i in a:
for n in range(0,N):
if n == (i-1):
pass
else:
l[n] -= 1
for n in range(0, N):
if l[n] <= 0:
print("No")
... | N,K,Q = list(map(int, input().split()))
a = []
for i in range(0,Q):
x = int(eval(input()))
a.append(x)
l = [0] * N
for i in a:
l[i-1] += 1
for n in range(0, N):
if l[n] >= (Q-K+1):
print("Yes")
else:
print("No") | p02911 |
n,k,q = list(map(int, input().split()))
l=[int(eval(input())) for x in range(q)]
x=k-q
if x>=1:
for i in range(n):
print("Yes")
elif x<1:
bd=abs(x)+1
for i in range(n):
if l.count(i+1)>=bd:
print("Yes")
else:
print("No") | n,k,q = list(map(int, input().split()))
l=[int(eval(input())) for x in range(q)]
p=[0]*n
for i in l:
p[i-1]=p[i-1]+1
for i in p:
if i>=(q-k)+1:
print("Yes")
else:
print("No") | p02911 |
N,K,Q=[int(e) for e in input().split(' ')]
lA=[int(eval(input())) for _ in range(Q)]
for i in range(N):
if Q-lA.count(i+1) >= K:
print('No')
else:
print('Yes') | N,K,Q=[int(e) for e in input().split(' ')]
c=[0]*N
for _ in range(Q):
c[int(eval(input()))-1]+=1
for i in range(N):
if Q-c[i] >= K:
print('No')
else:
print('Yes') | p02911 |
import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)
# input = sys.stdin.readline
def main():
n, k, q = list(map(int, input().split()))
winners = []
for w in range(... | import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)
# input = sys.stdin.readline
def main():
n, k, q = list(map(int, input().split()))
winners = []
for w in range(... | p02911 |
def main():
import sys
import collections
n,k,q=list(map(int,input().split()))
a=[int(e) for e in sys.stdin]
point=[k-q]*n
for person,getPoint in list(collections.Counter(a).items()):
point[person-1]+=getPoint
for res in point:
print(("Yes" if res>0 else "No"))
if __nam... | def main():
import collections
n, k, q, *a = list(map(int, open(0).read().split()))
point=[k-q]*n
for person,getPoint in list(collections.Counter(a).items()):
point[person-1]+=getPoint
for res in point:
print(("Yes" if res>0 else "No"))
if __name__=="__main__":
main() | p02911 |
N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [K]*N
for i in range(Q):
a = A[i]
for p in range(N):
if p+1 != a:
point[p] -= 1
for p in range(N):
if point[p] <= 0:
print("No")
else:
print("Yes") | N,K,Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
point = [0]*N
for i in range(Q):
a = A[i]
point[a-1] += 1
for i in range(N):
point[i] -= (Q-K)
for p in range(N):
if point[p] <= 0:
print("No")
else:
print("Yes") | p02911 |
N, K, Q = list(map(int, input().split()))
P = [K]*N
for i in range(Q):
w = int(eval(input()))
P = list([x-1 for x in P])
P[w-1] += 1
for j in P:
if j > 0:
print("Yes")
else:
print("No") | N, K, Q = list(map(int, input().split()))
P = [K-Q]*N
for i in range(Q):
w = int(eval(input()))
P[w-1] += 1
for j in P:
if j > 0:
print("Yes")
else:
print("No") | p02911 |
# -*- coding: utf-8 -*-
n, k, q = list(map(int, input().split()))
point = [k] * n
for _ in range(q):
answer = int(eval(input())) - 1
for i in range(n):
if i != answer:
point[i] -= 1
for j in point:
if j > 0:
print('Yes')
else:
print('No')
| # -*- coding: utf-8 -*-
n, k, q = list(map(int, input().split()))
point = [k - q] * n
for _ in range(q):
answer = int(eval(input())) - 1
point[answer] += 1
for j in point:
if j > 0:
print('Yes')
else:
print('No')
| p02911 |
n, k, q = list(map(int, input().split()))
l = [int(eval(input()))-1 for _ in range(q)]
for i in range(n):
print((('No','Yes')[k > q - l.count(i)])) | n, k, q = list(map(int, input().split()))
l = [int(eval(input()))-1 for _ in range(q)]
l.sort()
for i in range(n):
cnt = 0
if l and l[0] == i:
while l and l[0] == i:
l.pop(0)
cnt += 1
print((('No','Yes')[k > q - cnt])) | p02911 |
n, k, q = list(map(int, input().split()))
l = [k-q]*n
for _ in range(q):
a = int(eval(input()))-1
l[a] += 1
for i in l:
print(('Yes' if i>0 else 'No')) | import sys
input = sys.stdin.readline
n, k, q = list(map(int, input().split()))
l = [k-q]*n
for _ in range(q):
a = int(eval(input()))-1
l[a] += 1
for i in l:
print(('Yes' if i>0 else 'No')) | p02911 |
import sys
input = sys.stdin.readline
n, k, q = list(map(int, input().split()))
l = [k-q]*n
for _ in range(q):
a = int(eval(input()))-1
l[a] += 1
for i in l:
print(('Yes' if i>0 else 'No')) | n,k,q = list(map(int,input().split()))
l = [k-q]*n
for _ in range(q): l[int(eval(input()))-1]+=1
for i in l: print(('YNeos'[i<1::2])) | p02911 |
a = list(map(int, input().split()))
inp = []
for i in range(a[2]):
inp.append(int(eval(input())))
n_dict = {}
for i in range(a[0]):
n_dict[i+1] = a[1]
for i in range(a[2]):
for k , v in list(n_dict.items()):
n_dict[k] -= 1
for i in range(a[2]):
n_dict[inp[i]] += 1
for kk , vv in list... | n = list(map(int , input().split()))
hito_dict = {(i+1) : ((n[2]-n[1])*-1) for i in range(n[0])}
for i in range(n[2]):
d = int(eval(input()))
hito_dict[d] = hito_dict[d] + 1
for j in range(n[0]):
if hito_dict[j + 1] > 0:
print('Yes')
else:
print('No') | p02911 |
data = input().split()
tab = [int(data[1])]*int(data[0])
n = int(data[2])
for i in range(n):
value =int(eval(input()))
tab[value - 1] += 1
j =0
while (j < len(tab)):
tab[j] -= 1
j += 1
for i in tab:
if (i > 0):
print ("Yes")
else:
pri... | data = input().split()
score = int(data[1])
tab = [score]*int(data[0])
n = int(data[2])
for i in range(n):
value =int(eval(input()))
tab[value - 1] += 1
j =0
for i in tab:
if (i > n):
print ("Yes")
else:
print ("No")
| p02911 |
n,k,q=list(map(int,input().split()))
a=[]
for _ in range(q):
a.append(int(eval(input())))
def minus(data):
return data - 1
points = [k]*(n+1)
for i in range(q):
points = list(map(minus, points))
points[a[i]] += 1
for i in range(1,n+1):
if points[i] >= 1:
print('Yes')
else:
print(... | n,k,q=list(map(int,input().split()))
a=[]
for _ in range(q):
a.append(int(eval(input())))
points = [k]*(n+1)
plus = [0]*(n+1)
for i in range(q):
plus[a[i]] += 1
for i in range(1,n+1):
points[i] = points[i] - q + plus[i]
if points[i] >= 1:
print('Yes')
else:
print('No')
| p02911 |
# get initial input parameter
n, k, q = list(map(int, input().split()))
# get answer list
answer_list = [ int(eval(input())) for _ in range(q) ]
# init correct num list
correct_num_list = [ answer_list.count(answer + 1) for answer in range(n) ]
for answer in range(n):
if (0 < (k - (q - correct_num_list... | # get initial input parameter
n, k, q = list(map(int, input().split()))
# init point
point_list = [ (k - q) for _ in range(n) ]
for round in range(q):
# get correct answer persion
person_index = int(eval(input())) - 1
# point decrement
point_list[person_index] += 1
for item in po... | p02911 |
import math
def py():
print("Yes")
def pn():
print("No")
def iin():
x = int(eval(input()))
return x
neko = 0
n,k,q = list(map(int,input().split()))
p = [k-q] * n
for i in range(q):
p[iin()-1]+=1
for i in range(n):
if p[i] > 0:
py()
else:
pn() | n,k,q = list(map(int,input().split()))
player = [0] * n
for i in range(q):
player[int(eval(input()))-1] += 1
result = ['Yes' if k - q + player[i] > 0 else 'No' for i in range(n)]
for i in result:
print(i)
| p02911 |
def A():
w = ['Sunny', 'Cloudy', 'Rainy']
today = eval(input())
index = w.index(today)
if index == 2:
index = -1
print((w[index+1]))
def B():
odd = 'RUD'
even = 'LUD'
s = eval(input())
for i in range(len(s)):
if (i+1)%2 == 0:
if s[i] not i... | def A():
w = ['Sunny', 'Cloudy', 'Rainy']
today = eval(input())
index = w.index(today)
if index == 2:
index = -1
print((w[index+1]))
def B():
odd = 'RUD'
even = 'LUD'
s = eval(input())
for i in range(len(s)):
if (i+1)%2 == 0:
if s[i] not i... | p02911 |
N, K, Q = list(map(int, input().split()))
import sys
input = sys.stdin.readline
A = [K] * N
def calc(n):
return n-1
for i in range(Q):
M = int(input().rstrip())
A = list(map(calc, A))
A[M-1] += 1
for k in A:
if k <= 0:
print("No")
else:
print("Yes") | N, K, Q = list(map(int, input().split()))
import sys
input = sys.stdin.readline
A = [0] * N
for i in range(Q):
s = int(input().rstrip())
A[s-1] += 1
for k in A:
if K - (Q - k) >= 1:
print("Yes")
else:
print("No") | p02911 |
n, k, q = list(map(int, input().split()))
li = [k for _ in range(n)]
for _ in range(q):
i = int(eval(input())) - 1
for j in range(n):
if j != i:
li[j] -= 1
for j in li:
if j > 0 :
print("Yes")
else:
print("No") | n, k, q = list(map(int, input().split()))
li = [0 for _ in range(n)]
for _ in range(q):
li[int(eval(input()))-1] += 1
for j in li:
if k - q + j > 0:
print("Yes")
else:
print("No") | p02911 |
#coding:utf-8
n, k, q = list(map(int, input().split()))
a = [eval(input()) for i in range(q)]
point = [k] * n
#print(point)
for i in range(0, q):
point = [j-1 for j in point]
point[int(a[i])-1] += 1
#print(point)
for i in point:
if i <= 0:
print('No')
else:
print('... | #coding:utf-8
n, k, q = list(map(int, input().split()))
a = [eval(input()) for i in range(q)]
point = [k-q] * n
#print(point)
for i in range(0, q):
point[int(a[i])-1] += 1
#print(point)
for i in point:
if i <= 0:
print('No')
else:
print('Yes') | p02911 |
N, K, Q = list(map(int, input().split()))
ans = [K] * N
for i in range(Q):
n = int(eval(input()))
ans = list([x - 1 for x in ans])
ans[n - 1] += 1
for i in range(N):
if ans[i] > 0:
print("Yes")
else:
print("No") |
N, K, Q = list(map(int, input().split()))
ans = [K] * N
for i in range(Q):
n = int(eval(input()))
ans[n - 1] += 1
for i in range(N):
if ans[i] - Q > 0:
print("Yes")
else:
print("No") | p02911 |
n,k,q=list(map(int,input().split()))
a=[int(eval(input()))-1 for i in range(q)]
point=k-q
for i in range(n):
print(("Yes" if a.count(i)+point>0 else "No")) | n,k,q=list(map(int,input().split()))
a=[int(eval(input()))-1 for i in range(q)]
point=[k-q for i in range(n)]
for i in a:
point[i]+=1
for i in point:
print(("Yes" if i>0 else "No")) | p02911 |
pnum, default, correct = list(map(int, input().split()))
pep = [default]*pnum
a = list()
for i in range(correct):
a.append(int(eval(input())))
for i in a:
for j in range(pnum):
pep[j] -= 1
pep[i-1] += 1
for i in pep:
if i > 0:
print("Yes")
else:
print("No") | n, shoki, correct = list(map(int, input().split()))
b = list()
for i in range(correct):
b.append(int(eval(input())))
a = [shoki]*n
a = [i-correct for i in a]
for i in b:
a[i-1] += 1
for i in range(n):
if a[i] <= 0:
print("No")
else:
print("Yes") | p02911 |
# -*- coding: utf-8 -*-
#入力
N,K,Q=list(map(int,input().split()))
a=[int(eval(input())) for i in range(Q)]
for i in range(1,N+1,1):
l=a.count(i)
if(K+l-Q>0):print("Yes")
else:print("No")
| # -*- coding: utf-8 -*-
#入力
N,K,Q=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(Q)]
b=[0]*N
for i in a:
b[i-1]+=1
for l in range(0,N,1):
if(K+b[l]-Q>0):print("Yes")
else:print("No")
| p02911 |
N,K,Q = (int(x) for x in input().split())
#initialize
score = []
for x in range(N):
score.append(K)
#point
for x in range(Q):
A = int(eval(input()))
for y in range(N):
if y+1 != A:
score[y] -= 1;
for x in range(N):
if score[x] > 0:
print("Yes")
else:
print("No")
| N,K,Q = list(map(int, input().split()))
score = [0] * N
for x in range(Q):
A = int(eval(input()))
score[A-1] += 1;
for x in range(N):
if score[x] > Q - K:
print("Yes")
else:
print("No")
| p02911 |
N,K,Q = [int(i) for i in input().split(' ')]
pointList = [K for _ in range(N)]
for _ in range(Q):
answer = int(eval(input()))
i = 0
for point in pointList:
if answer-1 != i:
pointList[i] = point-1
i += 1
for point in pointList:
if point <= 0:
print('No')
... | N,K,Q = [int(i) for i in input().split(' ')]
pointList = [K-Q for _ in range(N)]
for _ in range(Q):
answer = int(eval(input()))
pointList[answer-1] += 1
for point in pointList:
if point <= 0:
print('No')
else:
print('Yes') | p02911 |
n, k, q = list(map(int, input().split()))
x = [0]*n
for i in range(q):
a = int(eval(input()))
a -= 1
x[a] += 1
y = [k]*n
for i in range(n):
y[i] -= (q-x[i])
if y[i] <= 0:
print('No')
else:
print('Yes')
| n, k, q = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(q)]
B = [k-q]*n
for i in range(q):
B[A[i]-1] += 1
for i in range(n):
if B[i] <= 0:
print('No')
else:
print('Yes')
| p02911 |
n, k, q = (int(x) for x in input().split())
A = [int(eval(input())) for _ in range(q)]
scores = [k-q for _ in range(n)]
for a in A:
scores[a-1] += 1
for score in scores:
print(('Yes' if score > 0 else 'No'))
| n, k, q = (int(x) for x in input().split())
A = [int(eval(input())) for _ in range(q)]
scores = [k-q]*n
for a in A:
scores[a-1] += 1
for score in scores:
print(('Yes' if score > 0 else 'No'))
| p02911 |
n,k,q = list(map(int, input().split()))
p = [k-q]*n
for i in range(q):
a = int(eval(input()))
p[a-1] += 1
for i in p:
if i > 0:
print('Yes')
else:
print('No') | n,k,q = list(map(int, input().split()))
s = [k-q]*n
for i in range(q):
x = int(eval(input()))
s[x-1] += 1
for i in s:
if i > 0:
print('Yes')
else:
print('No') | p02911 |
n,k,q = list(map(int, input().split()))
s = [k-q]*n
for i in range(q):
x = int(eval(input()))
s[x-1] += 1
for i in s:
if i > 0:
print('Yes')
else:
print('No') | n,k,q = list(map(int, input().split()))
l = [k-q]*n
for _ in range(q):
l[int(eval(input()))-1] += 1
for i in l:
print(("Yes" if i > 0 else "No")) | p02911 |
n, k, q = list(map(int, input().split()))
b = [k]*n
for i in range(q):
a = int(eval(input()))
b[a-1] += 1
b = list([x-1 for x in b])
for i in range(len(b)):
if b[i] > 0:
print('Yes')
else:
print('No') | n, k, q = list(map(int, input().split()))
b = [k]*n
for i in range(q):
a = int(eval(input()))
b[a-1] += 1
b = list([x-q for x in b])
for i in range(len(b)):
if b[i] > 0:
print('Yes')
else:
print('No') | p02911 |
N,K,Q = (int(x) for x in input().split())
#参加者全員分の残りポイントが入ったリスト[3,3,3,3,3,3]を作る
point = []
for i in range(N):
point.append(K)
#正解者の入力に応じてpointを減らしていく[3,3,3,3,3,3]→[2,2,3,2,2,2]
for i in range(Q):
currect_person = int(eval(input()))
for j in range(N):
if j != currect_person-1:
p... | N,K,Q = (int(x) for x in input().split())
#参加者全員分の残りポイントが入ったリスト[3,3,3,3,3,3]を作る
point = []
for i in range(N):
point.append(K)
#N人のポイントをはじめに全員分-Qしておく
for i in range(N):
point[i] -= Q
#正解者ごとに+1する
for i in range(Q):
point[int(eval(input()))-1] += 1
#結果を出力
for i in range(N):
if point[i] <= 0:
... | p02911 |
n,k,q = list(map(int,input().split()))
a=[int(eval(input())) for i in range(q)]
b=[k]*n
c=[0]*n
for i in range(q):
b[a[i]-1] +=1
for i in range(n):
b[i] -= 1
for i in range(n):
if b[i]<=0:
c[i]='No'
else:
c[i]='Yes'
for i in range(n):
print((c[i]))
| n,k,q = list(map(int,input().split()))
a=[int(eval(input())) for i in range(q)]
b=[k-q]*n
c=[0]*n
for i in range(q):
b[a[i]-1] +=1
for i in range(n):
if b[i]<=0:
c[i]='No'
else:
c[i]='Yes'
for i in range(n):
print((c[i]))
| p02911 |
N, K, Q = list(map(int, input().split()))
A_i = [int(eval(input())) for _ in range(Q)]
for i in range(N):
a = len(list([x for x in A_i if x == (i+1)]))
if (K-Q+a) > 0:
print('Yes')
else:
print('No')
| N, K, Q = list(map(int, input().split()))
S_i = [0] * N
for i in range(Q):
S_i[int(eval(input()))-1] += 1
for i in range(N):
if (K-Q+S_i[i]) > 0:
print('Yes')
else:
print('No')
| p02911 |
def main():
n,k,q=list(map(int,input().split()))
a=[k-q]*n
for i in range(q):
a[int(eval(input()))-1]+=1
for i in range(n):
print(('Yes' if a[i]>0 else 'No'))
if __name__ == '__main__':
main() | def main():
import sys
n,k,q=list(map(int,input().split()))
if k-q>0:
for i in range(n):
print('Yes')
sys.exit()
a=[k-q]*n
for i in range(q):
a[int(eval(input()))-1]+=1
for i in range(n):
print(('Yes' if a[i]>0 else 'No'))
if __name__ =... | p02911 |
n,k,q=list(map(int,input().split()))
al=[int(eval(input())) for i in range(q)]
pointl=[k for i in range(n)]
for i in range(q):
pointl=[point-1 for point in pointl]
pointl[al[i]-1]+=1
#print(pointl)
#print(pointl)
for p in pointl:
if p <= 0:
print("No")
else :
print("Yes") | n,k,q=list(map(int,input().split()))
#al=[int(input()) for i in range(q)]
d={}
for i in range(q):
s=int(eval(input()))
if not s in list(d.keys()):
d[s]=1
else :
d[s]+=1
#print(d)
pointl=[k-q for i in range(n)]
for k,v in list(d.items()):
pointl[k-1]+=v
for p in pointl:
if p <= 0:
... | p02911 |
n,k,q=list(map(int,input().split()))
pointl=[k-q for i in range(n)]
for i in range(q):
a=int(eval(input()))
pointl[a-1]=pointl[a-1]+1
for i in range(n):
if pointl[i]<=0:
print("No")
else:
print("Yes")
| #n=int(input())
n,k,q=list(map(int,input().split()))
#t=int(input())
#al=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
windic={i:0 for i in range(1,n+1)}
for i in range(q):
a=int(eval(input()))
windic[a]=windic[a]+1
for i in range(1,n+1):
if k-q+windic[i]>=... | p02911 |
n,k,q = list(map(int,input().split()))
points = [k for i in range(n)]
winner = [int(eval(input())) for i in range(q)]
# print(points,winner)
for i in range(q):
# print(i,'番目の問題')
points = [j-1 for j in points]
# print(winner[i])
points[winner[i]-1] += 1
for i in points:
if i <= 0:
... | n,k,q = list(map(int,input().split()))
points = [k for i in range(n)]
winner = [int(eval(input())) for i in range(q)]
points = [i-q for i in points]
for i in range(q):
points[winner[i]-1] += 1
for i in points:
if i <= 0:
print('No')
else:
print('Yes') | p02911 |
# -*- coding: utf-8 -*-
n, k, q= list(map(int, input().split()))
a=[k]*n
for i in range(q):
p = int(eval(input()))
for j in range(n):
if (p-1) != j:
a[j]-=1
for i in range(n):
if a[i] > 0:
print("Yes")
else:
print("No") | # -*- coding: utf-8 -*-
n, k, q= list(map(int, input().split()))
a=[k]*n
for i in range(q):
p = int(eval(input()))
a[p-1]+=1
for i in range(n):
if a[i]-q > 0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
aList = []
for i in range(Q):
aList.append(int(eval(input())))
ptsList = []
handy = Q - K
for i in range(N):
ptsList.append(0)
if K - Q > 0:
for i in range(N):
print("Yes")
else:
for i, Ai in enumerate(aList):
AiPts = ptsList[Ai-1]... | N, K, Q = list(map(int, input().split()))
ptsList = [K-Q]*N
if K - Q > 0:
for i in range(N):
print("Yes")
else:
for i in range(Q):
ptsList[int(eval(input()))-1] += 1
for i, e in enumerate(ptsList):
if e > 0:
print("Yes")
else:
print("... | p02911 |
N,K,Q=list(map(int,input().split()))
A = []
def minus(n):
return n-1
for _ in range(Q):
A.append(int(eval(input())))#縦入力
Nlist = []
for i in range(N):
Nlist.append(K)
for j in range(0,Q):
Nlist = list(map(minus,Nlist))
Nlist[A[j]-1] += 1
for k in range(0,N):
if Nlist[k]>=1:
... | N,K,Q=list(map(int,input().split()))
A = []
for _ in range(Q):
A.append(int(eval(input())))#縦入力
Nlist = []
for i in range(N):
Nlist.append(K-Q)
for j in range(0,Q):
Nlist[A[j]-1] += 1
for k in range(0,N):
if Nlist[k]>=1:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)
A = []
for i in range(Q):
A.append(int(eval(input())))
people = []
for i in range(N):
people.append(K)
for index in A:
for i, p in enumerate(people):
if i != index - 1:
people[i] -= 1
for i in people:
i... | N, K, Q = input().split()
N = int(N)
K = int(K)
Q = int(Q)
A = []
for i in range(Q):
A.append(int(eval(input())))
people = []
for i in range(N):
people.append(K - Q)
for i in A:
people[i-1] += 1
for i in people:
if i <= 0:
print("No")
else:
print("Yes")
| p02911 |
n, k, q = list(map(int, input().split()))
alist = [int(eval(input())) for i in range(q)]
pts = [k for i in range(n)]
for a in alist:
for j in range(n):
if not j == (a-1):
pts[j] -= 1
for b in range(n):
if pts[b] < 1:
print('No')
else:
print('Yes')
| n, k, q = list(map(int, input().split()))
nlist = [0 for i in range(n)]
for i in range(q):
nlist[int(eval(input()))-1] += 1
for n in nlist:
if q - n < k:
print('Yes')
else:
print('No')
| p02911 |
N , K , Q = list(map(int,input().split()))
A = [0] * Q
score = [K] * N
for i in range(Q):
A[i] = int(eval(input()))
for i in range(Q):
score = [score[i] - 1 for i in range(N)]
score[A[i] - 1] += 1
for i in range(N):
if score[i]>0:
print("Yes")
else:
print("No") | N , K , Q = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(Q)]
score = [K-Q] * N
for i in range(Q):
score[A[i] - 1] += 1
for i in range(N):
if score[i]>0:
print("Yes")
else:
print("No") | p02911 |
n, k, q = (int(i) for i in input().split())
a = [k]*n
d = [0]+[a[i]-a[i-1] for i in range(1,n)]+[0]
for i in range(q):
x = int(eval(input()))-1
d[0]-=1
d[x]+=1
d[x+1]-=1
d[n]+=1
a[0]+=d[0]
for i in range(1,n):a[i] = a[i-1]+d[i]
for i in range(n): print(("Yes" if a[i]>0 else "No")) | n, k, q = (int(i) for i in input().split())
t = [0]*n
for i in range(q):
x= int(eval(input()))-1
t[x]+=1
for i in range(n):
print(("Yes" if k>q-t[i] else "No")) | p02911 |
n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
b = [k] * n
for i in a:
b[i - 1] += 1
for i in b:
i -= q
if i <= 0:
print('No')
else: print('Yes')
| n, k, q = list(map(int, input().split()))
a = [int(eval(input())) for i in range(q)]
b = [k-q] * n
for i in a:
b[i - 1] += 1
for i in b:
if i <= 0:
print('No')
else:
print('Yes')
| p02911 |
N,K,Q=list(map(int, input().split()))
M=K-Q
A=[]
for i in range(0,Q):
A.append(int(eval(input())))
for i in range(0,N):
if M+A.count(i+1)>0:
print("Yes")
else:
print("No") | N,K,Q=list(map(int, input().split()))
M=K-Q
A=[M]*N
for i in range(Q):
B=int(eval(input()))
A[B-1]+=1
for i in range(N):
if A[i]<1:
print("No")
else:
print("Yes") | p02911 |
n,k,q=list(map(int,input().split()))
a= []
for _ in range(q):
a.append(int(eval(input())))
ans=[k]*n
for i in range(q):
for j in range(n):
ans[j]=ans[j]-1
ans[a[i]-1]=ans[a[i]-1]+1
for i in range(n):
if ans[i]>0:
print("Yes")
else:
print("No") | n,k,q=list(map(int,input().split()))
a= []
for _ in range(q):
a.append(int(eval(input())))
ans=[0]*n
for i in range(q):
ans[a[i]-1]=ans[a[i]-1]+1
for i in range(n):
if ans[i]>q-k:
print("Yes")
else:
print("No") | p02911 |
n,k,q=list(map(int, input().split()))
a=[k-q]*n
for i in range(q):
b=int(eval(input()))
a[b-1]+=1
for i in range(n):
if a[i]<1:
print('No')
else:
print('Yes')
| n,k,q=list(map(int,input().split()))
a=[k-q]*n
for i in range(q):
a[int(eval(input()))-1]+=1
for i in a:
if i>0:
print("Yes")
else:
print("No") | p02911 |
N, K, Q = list(map(int, input().split()))
P = [0] * N
for i in range(Q):
tmp = int(eval(input())) - 1
P[tmp] += 1
for n in range(N):
ans = 'No'
total = sum(P) - P[n]
if K - total > 0:
ans = 'Yes'
print(ans)
| N, K, Q = list(map(int, input().split()))
P = [0] * N
for i in range(Q):
tmp = int(eval(input())) - 1
P[tmp] += 1
sumP = sum(P)
for n in range(N):
ans = 'No'
total = sumP - P[n]
if K - total > 0:
ans = 'Yes'
print(ans) | p02911 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.