problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
⌀ | fixed_code
stringlengths 12
526k
⌀ | labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
⌀ | fixed_submission_id
int64 2
1.54M
⌀ | user_id
stringlengths 10
10
⌀ | language
stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02802
|
n, m = map(int, input().split())
ac = [0]*n
wa = [0]*n
for i in range(m):
p, s = input().split()
if s == 'WA' and ac[int(p)-1] == 0:
wa[int(p)-1] += 1
elif s == 'AC' and ac[int(p)-1] == 0:
ac[int(p)-1] += 1
print('%d %d' % (sum(ac), sum([wa[k] for k in [i for i,j in enumerete(ac) if j != 0]])))
|
n, m = map(int, input().split())
ac = [0]*n
wa = [0]*n
for i in range(m):
p, s = input().split()
if s == 'WA' and ac[int(p)-1] == 0:
wa[int(p)-1] += 1
elif s == 'AC' and ac[int(p)-1] == 0:
ac[int(p)-1] += 1
print('%d %d' % (sum(ac), sum([wa[k] for k in [i for i, j in enumerate(ac) if j != 0]])))
|
[
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 605,145
| 605,144
|
u380669795
|
python
|
p02802
|
n, m = map(int, input().split())
ac = [0]*n
wa = [0]*n
for i in range(m):
p, s = input().split()
if s == 'WA' and ac[int(p)-1] == 0:
wa[int(p)-1] += 1
elif s == 'AC' and ac[int(p)-1] == 0:
ac[int(p)-1] += 1
print('%d %d' % (sum(ac), sum([wa[k] for k in [i for i,j in enumerete(ac) if j != 0]])))
|
n, m = map(int, input().split())
ac = [0]*n
wa = [0]*n
for i in range(m):
p, s = input().split()
if s == 'WA' and ac[int(p)-1] == 0:
wa[int(p)-1] += 1
elif s == 'AC' and ac[int(p)-1] == 0:
ac[int(p)-1] += 1
print('%d %d' % (sum(ac), sum([wa[k] for k in [i for i, j in enumerate(ac) if j != 0]])))
|
[
"identifier.change",
"call.function.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 605,146
| 605,144
|
u380669795
|
python
|
p02802
|
N,M = map(int,input().split())
a = 0
w = 0
lis = [[] for _ in range(N)]
for i in range(M):
p,s = map(int,input().split())
p = int(p)
lis[p - 1].append(s)
for j in range(N):
if lis[j].count("AC") > 0:
a += 1
w += lis[j].index("AC")
print(a,w)
|
N,M = map(int,input().split())
a = 0
w = 0
lis = [[] for _ in range(N)]
for i in range(M):
p,s = map(str,input().split())
p = int(p)
lis[p - 1].append(s)
for j in range(N):
if lis[j].count("AC") > 0:
a += 1
w += lis[j].index("AC")
print(a,w)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 605,160
| 605,161
|
u425834921
|
python
|
p02802
|
N,M = map(int,input().split())
a = 0
w = 0
lis = [[] for i in range(N)]
for i in range(M):
p,s = map(int,input().split())
p = int(p)
lis[p - 1].append(s)
for j in range(N):
if lis[j].count("AC") > 0:
a += 1
w += lis[j].index("AC")
print(a,w)
|
N,M = map(int,input().split())
a = 0
w = 0
lis = [[] for _ in range(N)]
for i in range(M):
p,s = map(str,input().split())
p = int(p)
lis[p - 1].append(s)
for j in range(N):
if lis[j].count("AC") > 0:
a += 1
w += lis[j].index("AC")
print(a,w)
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 605,162
| 605,161
|
u425834921
|
python
|
p02802
|
#C
N,M=map(int,input().split())
re=[0 for i in range(N+1)]
P=[0 for i in range(N+1)]
x=0
y=0
for i in range(M):
p,S=input().split()
p=int(p)
if re[p]=="AC":
continue
elif S=="WA":
P[p]+=1
elif S=="AC":
re[p]="AC"
y+=1
for i in range(1,N+1):
if re[p]=="AC":
x+=P[p]
print(y,x)
|
#C
N,M=map(int,input().split())
re=[0 for i in range(N+1)]
P=[0 for i in range(N+1)]
x=0
y=0
for i in range(M):
p,S=input().split()
p=int(p)
if re[p]=="AC":
continue
elif S=="WA":
P[p]+=1
elif S=="AC":
re[p]="AC"
y+=1
for i in range(1,N+1):
if re[i]=="AC":
x+=P[i]
print(y,x)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 605,163
| 605,164
|
u330728443
|
python
|
p02802
|
N,M = input().split()
l = [0]*int(N) #flg
m = [0]*int(N) #counter
c =0
for i in range(int(M)+1):
p,s = input().split()
if s =="AC":
if l[int(p)-1]==1:
pass
else:
l[int(p)-1] = 1
c += m[int(p)-1]
elif s == "WA":
m[int(p)-1] += 1
print(l.count(1),c)
|
N,M = input().split()
l = [0]*int(N) #flg
m = [0]*int(N) #counter
c =0
for i in range(int(M)):
p,s = input().split()
if s =="AC":
if l[int(p)-1]==1:
pass
else:
l[int(p)-1] = 1
c += m[int(p)-1]
elif s == "WA":
m[int(p)-1] += 1
print(l.count(1),c)
|
[
"expression.operation.binary.remove"
] | 605,165
| 605,166
|
u912867658
|
python
|
p02802
|
N, M = list(map(int, input().split()))
ACflg = [0] * N
WAflg = [0] * N
WAcnt = 0
for _ in range(M):
p, S = list(input().split())
p = int(p)
if(S == "AC"):
if(ACflg[p-1] == 0):
ACflg[p - 1] = 1
WAcnt += WAflg[p-1]
else:
if(ACflg[p - 1] == 0):
WAflg[p - 1] += 1
# print(ACflg)
# print(WAflg)
print(sum(ACflg), sum(WAflg))
|
N, M = list(map(int, input().split()))
ACflg = [0] * N
WAflg = [0] * N
WAcnt = 0
for _ in range(M):
p, S = list(input().split())
p = int(p)
if(S == "AC"):
if(ACflg[p-1] == 0):
ACflg[p - 1] = 1
WAcnt += WAflg[p-1]
else:
if(ACflg[p - 1] == 0):
WAflg[p - 1] += 1
# print(ACflg)
# print(WAflg)
print(sum(ACflg), WAcnt)
|
[
"call.arguments.change",
"io.output.change"
] | 605,167
| 605,168
|
u655663334
|
python
|
p02802
|
n,m = map(int,input().split())
ac,wa = 0,0
number=[0]*n
for _ in range(m):
p,s = input().split()
p = int(p) - 1
if number[p]!=1:
if s == "WA":
number[p]+=1
elif s == "AC":
ac+=1
wa+=number[p]
number[p]=-1
print(ac,wa)
|
n,m = map(int,input().split())
ac,wa = 0,0
number=[0]*n
for i in range(m):
p,s = input().split()
p = int(p) - 1
if number[p]!=-1:
if s == "WA":
number[p]+=1
elif s == "AC":
ac+=1
wa+=number[p]
number[p]=-1
print(ac,wa)
|
[
"identifier.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 605,175
| 605,176
|
u566574814
|
python
|
p02802
|
n,m = map(int,input().split())
ac,wa = 0,0
number=[0]*n
for m in range(m):
p,s = input().split()
p = int(p) - 1
if number[p]!=1:
if s == "WA":
number[p]+=1
elif s == "AC":
ac+=1
wa+=number[p]
number[p]=-1
print(ac,wa)
|
n,m = map(int,input().split())
ac,wa = 0,0
number=[0]*n
for i in range(m):
p,s = input().split()
p = int(p) - 1
if number[p]!=-1:
if s == "WA":
number[p]+=1
elif s == "AC":
ac+=1
wa+=number[p]
number[p]=-1
print(ac,wa)
|
[
"identifier.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 605,177
| 605,176
|
u566574814
|
python
|
p02802
|
n,m = map(int,input().split())
ac,wa = 0,0
number=[0]*N
for m in range(m):
p,s = input().split()
p = int(p) - 1
if number[p]!=1:
if s == "WA":
number[p]+=1
elif s == "AC":
ac+=1
wa+=number[p]
number[p]=-1
print(ac,wa)
|
n,m = map(int,input().split())
ac,wa = 0,0
number=[0]*n
for i in range(m):
p,s = input().split()
p = int(p) - 1
if number[p]!=-1:
if s == "WA":
number[p]+=1
elif s == "AC":
ac+=1
wa+=number[p]
number[p]=-1
print(ac,wa)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 605,178
| 605,176
|
u566574814
|
python
|
p02802
|
n, m = map(int, input().split())
ac = [0]*(n+1)
wa = [0]*(n+1)
for _ in range(m):
a, b = input().split()
a = int(a)
if b == 'AC':
ac[a] = 1
else:
if ac[a] == 0:
wa[a] = wa[a] + 1
for i in range(n+1):
wa[a] = wa[a] * ac[a]
print(sum(ac), sum(wa))
|
n, m = map(int, input().split())
ac = [0]*(n+1)
wa = [0]*(n+1)
for _ in range(m):
a, b = input().split()
a = int(a)
if b == 'AC':
ac[a] = 1
else:
if ac[a] == 0:
wa[a] = wa[a] + 1
for i in range(n+1):
wa[i] = wa[i] * ac[i]
print(sum(ac), sum(wa))
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 605,187
| 605,188
|
u167647458
|
python
|
p02802
|
N, M = map(int, input().split())
AC = [0]*N
WA = [0]*N
L = []
for m in range(M):
p, S = map(str, input().split())
p = int(p)
L.append([p, S])
for m in range(M):
if not AC[L[m][0]-1] == 0:
continue
if L[m][1] == 'AC':
AC[L[m][0]-1] = 1
elif L[m][1] == 'WA':
WA[L[m][0]-1] += 1
A = sum(AC)
W = 0
for n in range(N):
if AC[n] == 1:
W += AC[n]
print(A, W)
|
N, M = map(int, input().split())
AC = [0]*N
WA = [0]*N
L = []
for m in range(M):
p, S = map(str, input().split())
p = int(p)
L.append([p, S])
for m in range(M):
if not AC[L[m][0]-1] == 0:
continue
if L[m][1] == 'AC':
AC[L[m][0]-1] = 1
elif L[m][1] == 'WA':
WA[L[m][0]-1] += 1
A = sum(AC)
W = 0
for n in range(N):
if AC[n] == 1:
W += WA[n]
print(A, W)
|
[
"identifier.change"
] | 605,193
| 605,194
|
u718949306
|
python
|
p02802
|
n, m = map(int, input().split())
ac = 0
pena = 0
isac = [0] * n
wa = [0] * n
for i in range(m):
p, s = input().split()
p = int(p)
p -= 1
print(p, s)
if (s == "AC"):
if (isac[p] != 1):
ac += 1
pena += wa[p]
isac[p] = 1
else:
if (isac[p] == 0):
wa[p] += 1
# print(ac, pena, isac[p], wa[p])
print(ac, pena)
|
n, m = map(int, input().split())
ac = 0
pena = 0
isac = [0] * n
wa = [0] * n
for i in range(m):
p, s = input().split()
p = int(p)
p -= 1
# print(p, s)
if (s == "AC"):
if (isac[p] != 1):
ac += 1
pena += wa[p]
isac[p] = 1
else:
if (isac[p] == 0):
wa[p] += 1
# print(ac, pena, isac[p], wa[p])
print(ac, pena)
|
[
"call.remove"
] | 605,195
| 605,196
|
u061320712
|
python
|
p02802
|
from collections import defaultdict
n, m = map(int, input().split())
ps = []
for _ in range(m):
ps.append(input().split())
sub_st = defaultdict(list)
for p, s in ps:
sub_st[p].append(s)
solved = 0
error = 0
for k, v in sub_st.items():
temp_error = 0
for history in v:
if 'AC' in v:
error += temp_error
solved += 1
break
temp_error += 1
print(solved, error)
|
from collections import defaultdict
n, m = map(int, input().split())
ps = []
for _ in range(m):
ps.append(input().split())
sub_st = defaultdict(list)
for p, s in ps:
sub_st[p].append(s)
solved = 0
error = 0
for k, v in sub_st.items():
temp_error = 0
for history in v:
if 'AC' in history:
error += temp_error
solved += 1
break
temp_error += 1
print(solved, error)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 605,203
| 605,204
|
u888092736
|
python
|
p02802
|
N, M = [int(s) for s in input().split(' ')]
ac = 0
wa = 0
result = dict()
fail = dict()
for m in range(M):
p, s = input().split(' ')
if p in result and result[p] == 'AC':
continue
if s == 'WA':
fail[p] = fail.get(p, 0) + 1
result[p] = s
elif s == 'AC': # AC
ac += 1
wa += fail[p]
result[p] = s
print(str(ac) + ' ' + str(wa))
|
N, M = [int(s) for s in input().split(' ')]
ac = 0
wa = 0
result = dict()
fail = dict()
for m in range(M):
p, s = input().split(' ')
if p in result and result[p] == 'AC':
continue
if s == 'WA':
fail[p] = fail.get(p, 0) + 1
result[p] = s
elif s == 'AC': # AC
ac += 1
wa += fail.get(p, 0)
result[p] = s
print(str(ac) + ' ' + str(wa))
|
[
"call.add",
"call.arguments.add"
] | 605,205
| 605,206
|
u099450021
|
python
|
p02802
|
N, M = map(int, input().split())
ac = [False] * N
wa_cnt = [0] * N
ac_cnt = 0
for i in range(M):
p, s = input().split()
p_i = int(p) - 1
if s == 'WA':
if not ac[p_i]:
wa_cnt[p_i] += 1
else:
if not ac[p_i]:
ac[p_i] = True
ac_cnt += 1
wa_cnt_sum = 0
for i in range(N):
if ac_cnt[i]:
wa_cnt_sum += wa_cnt[i]
print(ac_cnt,wa_cnt_sum)
|
N, M = map(int, input().split())
ac = [False] * N
wa_cnt = [0] * N
ac_cnt = 0
for i in range(M):
p, s = input().split()
p_i = int(p) - 1
if s == 'WA':
if not ac[p_i]:
wa_cnt[p_i] += 1
else:
if not ac[p_i]:
ac[p_i] = True
ac_cnt += 1
wa_cnt_sum = 0
for i in range(N):
if ac[i]:
wa_cnt_sum += wa_cnt[i]
print(ac_cnt,wa_cnt_sum)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 605,209
| 605,210
|
u732061897
|
python
|
p02802
|
N, M = map(int, input().split())
# [ACしたかどうか, 初ACは何回目の提出か]
prob = [[0] * 2 for _ in range(N + 1)]
# print(prob)
ps_list = [[0, 0]]
for i in range(1, M + 1):
p, s = input().split()
p = int(p)
ps_list.append([p, s])
if s == "AC" and prob[p] != [0, 0]:
prob[p] = [1, i]
# print(prob)
# この段階でACは数えられる
ac = 0
for item in prob:
if item[0] == 1:
ac += 1
penalty = 0
for i in range(1, M + 1):
p = ps_list[i][0]
s = ps_list[i][1]
if s == "WA" and i < prob[p][1]:
penalty += 1
print(ac, penalty)
|
N, M = map(int, input().split())
# [ACしたかどうか, 初ACは何回目の提出か]
prob = [[0] * 2 for _ in range(N + 1)]
# print(prob)
ps_list = [[0, 0]]
for i in range(1, M + 1):
p, s = input().split()
p = int(p)
ps_list.append([p, s])
if s == "AC" and prob[p] == [0, 0]:
prob[p] = [1, i]
# print(prob)
# この段階でACは数えられる
ac = 0
for item in prob:
if item[0] == 1:
ac += 1
penalty = 0
for i in range(1, M + 1):
p = ps_list[i][0]
s = ps_list[i][1]
if s == "WA" and i < prob[p][1]:
penalty += 1
print(ac, penalty)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 605,227
| 605,228
|
u285681431
|
python
|
p02802
|
N,M = map(int,input().split())
correct = [0]*N
penalty = [0]*N
ans_c,ans_p = 0,0
for i in range(M):
p,s = input().split()
p = int(p)
if s=="AC":
if correct[p-1]==0:
correct[p-1]+=1
if s=="WA":
if correct[p-1]==0:
penalty[p-1]+=1
ans_penalty = 0
for i in range(N):
if correct[i]!=1:
ans_penalty+=penalty[i]
print(sum(correct),ans_penalty)
|
N,M = map(int,input().split())
correct = [0]*N
penalty = [0]*N
ans_c,ans_p = 0,0
for i in range(M):
p,s = input().split()
p = int(p)
if s=="AC":
if correct[p-1]==0:
correct[p-1]+=1
if s=="WA":
if correct[p-1]==0:
penalty[p-1]+=1
ans_penalty = 0
for i in range(N):
if correct[i]>=1:
ans_penalty+=penalty[i]
print(sum(correct),ans_penalty)
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 605,229
| 605,230
|
u695474809
|
python
|
p02802
|
n,m=map(int,input().split())
lst=[list(input().split()) for i in range(m)]
x,y=0,0
cnt=['?']+[0]*n
cnt2=[0]+[0]*n
for i in lst:
if i[1]=='WA':
pin=int(i[0])
if cnt[pin]!='AC':
cnt2[pin]+=1
elif i[1]=='AC':
cnt[int(i[0])]='AC'
x=cnt.count('AC')
for i in range(len(cnt)+1):
if cnt[i]=='AC':
y+=cnt2[i]
print(x,y)
|
n,m=map(int,input().split())
lst=[list(input().split()) for i in range(m)]
x,y=0,0
cnt=['?']+[0]*n
cnt2=[0]+[0]*n
for i in lst:
if i[1]=='WA':
pin=int(i[0])
if cnt[pin]!='AC':
cnt2[pin]+=1
elif i[1]=='AC':
cnt[int(i[0])]='AC'
x=cnt.count('AC')
for i in range(len(cnt)):
if cnt[i]=='AC':
y+=cnt2[i]
print(x,y)
|
[
"expression.operation.binary.remove"
] | 605,235
| 605,236
|
u350093546
|
python
|
p02802
|
N,M = map(int,input().split())
ls2 = []
for i in range(M):
A,B = map(str,input().split())
ls = [int(A)-1,B]
ls2.append(ls)
Pena = 0
corr = 0
#ls3 = sorted(ls2, key=lambda x: x[0])
lsans = [[] for i in range(N)]
for i in range(M):
lsans[ls2[i][0]].append(ls2[i][1])
for i in range(N):
if bool(lsans[i]):
for ans in lsans[i]:
if ans == 'WA':
Pena += 1
if ans == 'AC':
corr += 1
break
print(corr,Pena)
|
N,M = map(int,input().split())
ls2 = []
for i in range(M):
A,B = map(str,input().split())
ls = [int(A)-1,B]
ls2.append(ls)
Pena = 0
corr = 0
#ls3 = sorted(ls2, key=lambda x: x[0])
lsans = [[] for i in range(N)]
for i in range(M):
lsans[ls2[i][0]].append(ls2[i][1])
for i in range(N):
if 'AC' in lsans[i]:
for ans in lsans[i]:
if ans == 'WA':
Pena += 1
if ans == 'AC':
corr += 1
break
print(corr,Pena)
|
[
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 605,239
| 605,240
|
u875769753
|
python
|
p02802
|
N,M=map(int,input().split())
L=[list(input().split()) for i in range(M)]
W=[0]*N
A=[0]*N
a=0
w=0
for i in range(M):
if L[i][1]=="AC":
A[int(L[i][0])-1]=1
elif L[i][1]=="WA" and A[int(L[i][0])-1]==0:
W[int(L[i][0])-1]+=1
#for i in A:
#a+=i
#for i in W:
#w+=i
for i in range(n):
if A[i]>0:
a+=1
w+=W[i]
print(a,w)
|
N,M=map(int,input().split())
L=[list(input().split()) for i in range(M)]
W=[0]*N
A=[0]*N
a=0
w=0
for i in range(M):
if L[i][1]=="AC":
A[int(L[i][0])-1]=1
elif L[i][1]=="WA" and A[int(L[i][0])-1]==0:
W[int(L[i][0])-1]+=1
#for i in A:
#a+=i
#for i in W:
#w+=i
for i in range(N):
if A[i]>0:
a+=1
w+=W[i]
print(a,w)
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 605,241
| 605,242
|
u029000441
|
python
|
p02802
|
n,m=map(int,input().split())
aa=[[] for i in range(n)]
for x in range(m):
a,b=input().split()
d=int(a)-1
aa[d].append(b)
print(aa)
ans_ac=0
ans_wa=0
for y in range(n):
ans1=0
ans2=0
for z in range(len(aa[y])):
if aa[y][z]=='WA':
ans1+=1
else:
ans2+=1
break
if ans2==1:
ans_wa+=ans1
ans_ac+=1
print(str(ans_ac)+' '+str(ans_wa))
|
n,m=map(int,input().split())
aa=[[] for i in range(n)]
for x in range(m):
a,b=input().split()
d=int(a)-1
aa[d].append(b)
ans_ac=0
ans_wa=0
for y in range(n):
ans1=0
ans2=0
for z in range(len(aa[y])):
if aa[y][z]=='WA':
ans1+=1
else:
ans2+=1
break
if ans2==1:
ans_wa+=ans1
ans_ac+=1
print(str(ans_ac)+' '+str(ans_wa))
|
[
"call.remove"
] | 605,250
| 605,251
|
u516554284
|
python
|
p02802
|
N, M = map(int, input().split())
t_ans = []
for _ in range(M):
t_ans.append(list(map(str,input().split())))
ans_num = [0]*(N+1)
ans_pe = [0]*(N+1)
for i in range(M):
result = t_ans[i][1]
question = int(t_ans[i][0])
print(question)
if result == 'AC' and ans_num[question] == 0:
ans_num[question] = 1
elif result == 'WA' and ans_num[question] == 0:
ans_pe[question] += 1
for i in range(N):
if ans_num[i] != 1:
ans_pe[i] = 0
print(f'{sum(ans_num)} {sum(ans_pe)}')
|
N, M = map(int, input().split())
t_ans = []
for _ in range(M):
t_ans.append(list(map(str,input().split())))
ans_num = [0]*(N+1)
ans_pe = [0]*(N+1)
for i in range(M):
result = t_ans[i][1]
question = int(t_ans[i][0])
if result == 'AC' and ans_num[question] == 0:
ans_num[question] = 1
elif result == 'WA' and ans_num[question] == 0:
ans_pe[question] += 1
for i in range(N+1):
if ans_num[i] != 1:
ans_pe[i] = 0
print(f'{sum(ans_num)} {sum(ans_pe)}')
|
[
"call.remove"
] | 605,259
| 605,258
|
u616542081
|
python
|
p02802
|
n,m=map(int,input().split())
AC=[0]*n
cnt=[0]*n
ans=0
for i in range(m):
p,s=input().split()
p=int(p)
s=str(s)
if s=='WA' and AC[p-1]==0:
cnt[p-1]+=1
if s=='AC' and AC[p-1]==0:
AC[p-1]=1
ans+=cnt[p-1]
print(sum(AC),sum(cnt))
|
n,m=map(int,input().split())
AC=[0]*n
cnt=[0]*n
ans=0
for i in range(m):
p,s=input().split()
p=int(p)
s=str(s)
if s=='WA' and AC[p-1]==0:
cnt[p-1]+=1
if s=='AC' and AC[p-1]==0:
AC[p-1]=1
ans+=cnt[p-1]
print(sum(AC),ans)
|
[
"call.arguments.change",
"io.output.change"
] | 605,265
| 605,266
|
u371409687
|
python
|
p02802
|
N,M=map(int,input().split())
ACL=[0]*N
PL=[0]*N
AC=0
P=0
for i in range(M):
p,S=input().split()
p=int(p)
if S =='AC':
if ACL[p]==0:
AC+=1
P+=PL[p]
ACL[p]=1
else:
PL[p]+=1
print(AC,P)
|
N,M=map(int,input().split())
ACL=[0]*N
PL=[0]*N
AC=0
P=0
for i in range(M):
p,S=input().split()
p=int(p)
p-=1
if S =='AC':
if ACL[p]==0:
AC+=1
P+=PL[p]
ACL[p]=1
else:
PL[p]+=1
print(AC,P)
|
[] | 605,267
| 605,268
|
u506858457
|
python
|
p02802
|
N,M = map(int,input().split())
judge = [False]*N
WAcnt = [0] * N
ACcnt = 0
for i in range(M):
p,S = (x for x in input().split())
p = int(p)
if judge[p-1] == False:
if S == "AC":
judge[p-1] = True
ACcnt += 1
else:
WAcnt[p-1] += 1
WAans = 0
for i in range(N):
if judge[i] == True:
WAans += WAans[i]
print(ACcnt,WAans)
|
N,M = map(int,input().split())
judge = [False]*N
WAcnt = [0] * N
ACcnt = 0
for i in range(M):
p,S = (x for x in input().split())
p = int(p)
if judge[p-1] == False:
if S == "AC":
judge[p-1] = True
ACcnt += 1
else:
WAcnt[p-1] += 1
WAans = 0
for i in range(N):
if judge[i] == True:
WAans += WAcnt[i]
print(ACcnt,WAans)
|
[
"identifier.change"
] | 605,269
| 605,270
|
u145915236
|
python
|
p02802
|
N,M = map(int,input().split())
judge = [False]*N
WAcnt = [0] * N
ACcnt = 0
for i in range(M):
p,S = (x for x in input().split())
p = int(p)
if judge[p-1] == False:
if S == "AC":
judge[p-1] = True
ACcnt += 1
else:
WAcnt[p-1] += 1
WAans = 0
for i in range(N):
if judge[i-1] == True:
WAans += WAans[i-1]
print(ACcnt,WAans)
|
N,M = map(int,input().split())
judge = [False]*N
WAcnt = [0] * N
ACcnt = 0
for i in range(M):
p,S = (x for x in input().split())
p = int(p)
if judge[p-1] == False:
if S == "AC":
judge[p-1] = True
ACcnt += 1
else:
WAcnt[p-1] += 1
WAans = 0
for i in range(N):
if judge[i] == True:
WAans += WAcnt[i]
print(ACcnt,WAans)
|
[
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change"
] | 605,271
| 605,270
|
u145915236
|
python
|
p02802
|
N,M = map(int,input().split())
A = [0 for _ in range(N+1)]
B = [0 for _ in range(N+1)]
for _ in range(M):
p,S = input().split()
p = int(p)
if S=="AC":
if A[p]==0:
A[p]=1
else:
if A[p]==0:
B[p] += 1
for i in range(N+1):
if A[p]==0:
B[p]=0
print(sum(A),sum(B))
|
N,M = map(int,input().split())
A = [0 for _ in range(N+1)]
B = [0 for _ in range(N+1)]
for _ in range(M):
p,S = input().split()
p = int(p)
if S=="AC":
if A[p]==0:
A[p]=1
else:
if A[p]==0:
B[p] += 1
for i in range(N+1):
if A[i]==0:
B[i]=0
print(sum(A),sum(B))
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 605,284
| 605,285
|
u644907318
|
python
|
p02802
|
N,M=map(int,input().split())
L=[0]*N
R=[0]*N
right=0
pena=0
for _ in range(M):
p,s=input().split()
p=int(p)
p-=1
if R[p]==0:
if s=='AC':
right+=1
R[p]==1
pena+=L[p]
else:
L[p]+=1
print(right,pena)
|
N,M=map(int,input().split())
L=[0]*N
R=[0]*N
right=0
pena=0
for _ in range(M):
p,s=input().split()
p=int(p)
p-=1
if R[p]==0:
if s=='AC':
right+=1
R[p]=1
pena+=L[p]
else:
L[p]+=1
print(right,pena)
|
[
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 605,294
| 605,295
|
u640922335
|
python
|
p02802
|
import collections
n, m = map(int, input().split())
list_ac = set()
dic = collections.defaultdict(lambda:0)
ac = 0
wa = 0
for _ in range(m):
p, s = input().split()
if s == "WA" and p not in list_ac:
dic[p] += 1
elif s =="AC" and p not in list_ac:
list_ac.append(p)
ac += 1
if p in dic:
wa += dic[p]
print(ac, wa)
|
import collections
n, m = map(int, input().split())
list_ac = set()
dic = collections.defaultdict(lambda:0)
ac = 0
wa = 0
for _ in range(m):
p, s = input().split()
if s == "WA" and p not in list_ac:
dic[p] += 1
elif s =="AC" and p not in list_ac:
list_ac.add(p)
ac += 1
if p in dic:
wa += dic[p]
print(ac, wa)
|
[
"identifier.change"
] | 605,299
| 605,300
|
u498136917
|
python
|
p02802
|
N, M = map(int, input().split())
AC = [0]*(N+1)
WA = [0]*(N+1)
for i in range (0, M):
A, B = map(str, input().split())
A = int(A)
if B == 'WA':
if AC[A] == 0:
WA[A]+=1
else:
if AC[A] == 0:
AC[A] = 1
Wronganswer = 0
for i in range (0, N):
Wronganswer+=(AC[i]*WA[i])
print(sum(AC), Wronganswer)
|
N, M = map(int, input().split())
AC = [0]*(N+1)
WA = [0]*(N+1)
for i in range (0, M):
A, B = map(str, input().split())
A = int(A)
if B == 'WA':
if AC[A] == 0:
WA[A]+=1
else:
if AC[A] == 0:
AC[A] = 1
Wronganswer = 0
for i in range (0, N+1):
Wronganswer+=(AC[i]*WA[i])
print(sum(AC), Wronganswer)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 605,318
| 605,319
|
u024340351
|
python
|
p02802
|
from collections import defaultdict as dic
n, m = map(int, input().split())
ac = 0
pena = 0
d = dic(list)
for i in range(m):
pi, si = input().split()
d[pi].append(si)
print(d)
for (k, v) in d.items():
pe = 0
flag = False
for aw in v:
if aw == 'WA':
pe += 1
else:
ac += 1
flag = True
break
if flag:
pena += pe
print(ac, pena)
|
from collections import defaultdict as dic
n, m = map(int, input().split())
ac = 0
pena = 0
d = dic(list)
for i in range(m):
pi, si = input().split()
d[pi].append(si)
for (k, v) in d.items():
pe = 0
flag = False
for aw in v:
if aw == 'WA':
pe += 1
else:
ac += 1
flag = True
break
if flag:
pena += pe
print(ac, pena)
|
[
"call.remove"
] | 605,340
| 605,341
|
u643679148
|
python
|
p02802
|
n,m=map(int,input().split())
p=[0]*m
s=[0]*m
for i in range(m):
pi,si=input().split()
p[i]=int(pi)
s[i]=si
judge=[0]*(n+1)
ac=0
wa=0
for i in range(m):
if judge[p[i]]==-1:
continue
if judge[p[i]]==0:
if s[i]=='WA':
judge[p[i]]+=1
else:
wa+=judge[p[i]]
judge[p[i]]=-1
ac+=1
print(ac,wa)
|
n,m=map(int,input().split())
p=[0]*m
s=[0]*m
for i in range(m):
pi,si=input().split()
p[i]=int(pi)
s[i]=si
judge=[0]*(n+1)
ac=0
wa=0
for i in range(m):
if judge[p[i]]==-1:
continue
if judge[p[i]]!=-1:
if s[i]=='WA':
judge[p[i]]+=1
else:
wa+=judge[p[i]]
judge[p[i]]=-1
ac+=1
print(ac,wa)
|
[
"control_flow.loop.for.condition.change",
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 605,348
| 605,349
|
u954153335
|
python
|
p02802
|
from collections import defaultdict
N,M = map(int,input().split())
AC_List = defaultdict(int)
WA_List = defaultdict(int)
for i in range(M):
Num,Sta = map(str,input().split())
if Num in AC_List:
continue
else:
if Sta == "WA":
WA_List[Num] += 1
else:
AC_List[Num] += 1
ansct = 0
for k,v in WA_List:
if k in AC_List:
ansct += v
print(str(len(AC_List))+" " +str(ansct))
|
from collections import defaultdict
N,M = map(int,input().split())
AC_List = defaultdict(int)
WA_List = defaultdict(int)
for i in range(M):
Num,Sta = map(str,input().split())
if Num in AC_List:
continue
else:
if Sta == "WA":
WA_List[Num] += 1
else:
AC_List[Num] += 1
ansct = 0
for k,v in WA_List.items():
if k in AC_List:
ansct += v
print(str(len(AC_List))+" " +str(ansct))
|
[
"call.add"
] | 605,350
| 605,351
|
u773686010
|
python
|
p02802
|
import sys
def resolve(in_):
N, M = map(int, next(in_).split())
PS = tuple(line.strip().split() for line in in_)
ac = set()
wa = {}
for p, s in PS:
if s == 'AC':
ac.add(p)
if s == 'WA' and p not in ac:
wa[p] = wa.setdefault(p, 0) + 1
penalties = 0
for k, v in wa.items:
if k in ac:
penalties += v
return '{} {}'.format(len(ac), penalties)
def main():
answer = resolve(sys.stdin)
print(answer)
if __name__ == '__main__':
main()
|
import sys
def resolve(in_):
N, M = map(int, next(in_).split())
PS = tuple(line.strip().split() for line in in_)
ac = set()
wa = {}
for p, s in PS:
if s == 'AC':
ac.add(p)
if s == 'WA' and p not in ac:
wa[p] = wa.setdefault(p, 0) + 1
penalties = 0
for k, v in wa.items():
if k in ac:
penalties += v
return '{} {}'.format(len(ac), penalties)
def main():
answer = resolve(sys.stdin)
print(answer)
if __name__ == '__main__':
main()
|
[
"call.add"
] | 605,352
| 605,353
|
u317423698
|
python
|
p02802
|
import numpy as np
N, M = map(int,input().split())
AC = np.array([0 for i in range(N)])
WA = np.array([0 for i in range(N)])
for _ in range(M):
p, S = map(str,input().split())
p = int(p)
if AC[p-1] == 0 and S == 'AC':
AC[p-1] += 1
elif AC[p-1] == 0 and S == 'WA':
WA[p-1] += 1
for i in range(N):
if AC[i] == 1:
WA[i] = 0
print(AC.sum(),WA.sum())
|
import numpy as np
N, M = map(int,input().split())
AC = np.array([0 for i in range(N)])
WA = np.array([0 for i in range(N)])
for _ in range(M):
p, S = map(str,input().split())
p = int(p)
if AC[p-1] == 0 and S == 'AC':
AC[p-1] += 1
elif AC[p-1] == 0 and S == 'WA':
WA[p-1] += 1
for i in range(N):
if AC[i] == 0:
WA[i] = 0
print(AC.sum(),WA.sum())
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 605,355
| 605,356
|
u720558413
|
python
|
p02802
|
import numpy as np
N, M = map(int,input().split())
AC = np.array([0 for i in range(N)])
WA = np.array([0 for i in range(N)])
for _ in range(M):
p, S = map(str,input().split())
p = int(p)
if AC[p-1] == 0 and S == 'AC':
AC[p-1] += 1
elif AC[p-1] == 0 and S == 'WA':
WA[p-1] += 1
for i in range(N):
if AC[i] >= 1:
WA[i] = 0
print(AC.sum(),WA.sum())
|
import numpy as np
N, M = map(int,input().split())
AC = np.array([0 for i in range(N)])
WA = np.array([0 for i in range(N)])
for _ in range(M):
p, S = map(str,input().split())
p = int(p)
if AC[p-1] == 0 and S == 'AC':
AC[p-1] += 1
elif AC[p-1] == 0 and S == 'WA':
WA[p-1] += 1
for i in range(N):
if AC[i] == 0:
WA[i] = 0
print(AC.sum(),WA.sum())
|
[
"control_flow.loop.for.condition.change"
] | 605,357
| 605,356
|
u720558413
|
python
|
p02802
|
N, M = map(int, input().split())
ac = 0
wa = 0
arr = [0] * N
if M == 0:
print(0)
exit()
for i in range(M):
p, s = list(input().split())
p = int(p)
if arr[p-1] != "AC":
if s == "AC":
wa += arr[p-1]
arr[p-1] = "AC"
ac += 1
else:
arr[p-1] += 1
print(ac, wa)
|
N, M = map(int, input().split())
ac = 0
wa = 0
arr = [0] * N
if M == 0:
print("0 0")
exit()
for i in range(M):
p, s = list(input().split())
p = int(p)
if arr[p-1] != "AC":
if s == "AC":
wa += arr[p-1]
arr[p-1] = "AC"
ac += 1
else:
arr[p-1] += 1
print(ac, wa)
|
[
"call.arguments.change",
"io.output.change"
] | 605,367
| 605,368
|
u329319441
|
python
|
p02802
|
N, M = map(int, input().split())
count = [0]*N
ans = 0
ok = 1
for _ in range(M):
p, s = input().split()
if count[int(p)-1] >= 0 and s == "WA":
count[int(p) - 1] += 1
elif count[int(p)-1] >= 0 and s == "AC":
ans += count[int(p)-1]
count[int(p)-1] = -1
ok += 1
print(ok, ans)
|
N, M = map(int, input().split())
count = [0]*N
ans = 0
ok = 0
for _ in range(M):
p, s = input().split()
if count[int(p)-1] >= 0 and s == "WA":
count[int(p) - 1] += 1
elif count[int(p)-1] >= 0 and s == "AC":
ans += count[int(p)-1]
count[int(p)-1] = -1
ok += 1
print(ok, ans)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 605,374
| 605,375
|
u600261652
|
python
|
p02802
|
n,m = map(int, input().split())
pena=[0]*(n+1)
seitou=[0]*(n+1)
for i in range(m):
p,s = map(str,input().split())
p=int(p)
if s=="WA" and seitou[p]==0:
pena[p]+=1
if s=="AC":
seitou[p]=1
pena_kazu=0
for i in range(n):
if seitou[i]==1:
pena_kazu+=pena[i]
seitou_kazu=sum(seitou)
print(str(seitou_kazu)+" "+str(pena_kazu))
|
n,m = map(int, input().split())
pena=[0]*(n+1)
seitou=[0]*(n+1)
for i in range(m):
p,s = map(str,input().split())
p=int(p)
if s=="WA" and seitou[p]==0:
pena[p]+=1
if s=="AC":
seitou[p]=1
pena_kazu=0
for i in range(1,n+1):
if seitou[i]==1:
pena_kazu+=pena[i]
seitou_kazu=sum(seitou)
print(str(seitou_kazu)+" "+str(pena_kazu))
|
[
"call.arguments.add"
] | 605,386
| 605,387
|
u812354010
|
python
|
p02802
|
N,M = map(int, input().split())
r = {}
a = {}
for i in range(M):
l = input().split()
p = int(l[0])
q = l[1]
w = q + str(p)
if r.get(p) == 'AC':
pass
else:
r.update([(p, q)])
if a.get(w) != None:
a[w] += 1
else:
a.update([(w, 1)])
ks = [k for k, v in r.items() if v == 'AC']
wa = 0
ac = 0
for i in ks:
wk = 'WA' + str(i)
ak = 'AC' + str(i)
if a.get(wk) != None:
wa += a[wk]
ac += a[ak]
print(wa, ac)
|
N,M = map(int, input().split())
r = {}
a = {}
for i in range(M):
l = input().split()
p = int(l[0])
q = l[1]
w = q + str(p)
if r.get(p) == 'AC':
pass
else:
r.update([(p, q)])
if a.get(w) != None:
a[w] += 1
else:
a.update([(w, 1)])
ks = [k for k, v in r.items() if v == 'AC']
wa = 0
ac = 0
for i in ks:
wk = 'WA' + str(i)
ak = 'AC' + str(i)
if a.get(wk) != None:
wa += a[wk]
ac += a[ak]
print(ac, wa)
|
[
"call.arguments.change",
"call.arguments.add"
] | 605,397
| 605,398
|
u978789527
|
python
|
p02802
|
N,M=map(int,input().split())
acs=[0 for i in range(N)]
wa=[0 for i in range(N)]
for i in range(M):
p,S=map(str,input().split())
p=int(p)
if S=='AC':
acs[p-1]=1
elif S=='WA' and acs[p-1]==0:
wa[p-1]+=1
for i in range(N):
if acs[i]==0:
wa[i]=0
ans=[sum(acs),sum(wa)]
|
N,M=map(int,input().split())
acs=[0 for i in range(N)]
wa=[0 for i in range(N)]
for i in range(M):
p,S=map(str,input().split())
p=int(p)
if S=='AC':
acs[p-1]=1
elif S=='WA' and acs[p-1]==0:
wa[p-1]+=1
for i in range(N):
if acs[i]==0:
wa[i]=0
ans=[sum(acs),sum(wa)]
print(*ans)
|
[
"call.add"
] | 605,411
| 605,412
|
u942051624
|
python
|
p02802
|
N,M=map(int,input().split())
acs=[0 for i in range(N)]
wa=[0 for i in range(N)]
for i in range(M):
p,S=map(str,input().split())
p=int(p)
if S=='AC':
acs[p-1]=1
elif S=='WA' and acs[p-1]==0:
wa[p-1]+=1
for i in range(M):
if acs[i]==0:
wa[i]=0
ans=[sum(acs),sum(wa)]
|
N,M=map(int,input().split())
acs=[0 for i in range(N)]
wa=[0 for i in range(N)]
for i in range(M):
p,S=map(str,input().split())
p=int(p)
if S=='AC':
acs[p-1]=1
elif S=='WA' and acs[p-1]==0:
wa[p-1]+=1
for i in range(N):
if acs[i]==0:
wa[i]=0
ans=[sum(acs),sum(wa)]
print(*ans)
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.add"
] | 605,413
| 605,412
|
u942051624
|
python
|
p02802
|
n,m = map(int,input().split())
a = [0]*n
ac = 0
wa = 0
for i in range(m):
p,s = map(str,input().split())
p = int(p)
if s == "AC" and a[p-1] != -1:
ac +=1
wa += a[p-1]
a[p-1] = -1
elif s == "WA" and a[p-1] != -1:
wa += 1
print(ac,wa)
|
n,m = map(int,input().split())
a = [0]*n
ac =0
wa = 0
for i in range(m):
p,s = map(str,input().split())
p = int(p)
if s == "AC" and a[p-1] !=-1:
ac +=1
wa += a[p-1]
a[p-1] = -1
elif s =="WA" and a[p-1] != -1:
a[p-1] += 1
print(ac,wa)
|
[] | 605,414
| 605,415
|
u175590965
|
python
|
p02802
|
n,m = map(int,input().split())
a = [0]*n
ac = 0
wa = 0
for i in range(m):
p,s = map(str,input().split())
p = int(p)
if s == "AC" and a[p-1] != -1:
ac +=1
wa += a[p-1]
a[p-1] = -1
elif s == "WA" and a[p-1] != -1:
wa += 1
print(ac,wa)
|
n,m = map(int,input().split())
a = [0]*n
ac = 0
wa = 0
for i in range(m):
p,s = map(str,input().split())
p = int(p)
if s == "AC" and a[p-1] != -1:
ac +=1
wa += a[p-1]
a[p-1] = -1
elif s == "WA" and a[p-1] != -1:
a[p-1] += 1
print(ac,wa)
|
[] | 605,414
| 605,416
|
u175590965
|
python
|
p02802
|
N,M=map(int,input().split())
PS=[list(input().split()) for _ in range(M)]
miss=[[0,False] for _ in range(N)]
for p,s in PS:
p=int(p)
if miss[p-1][1]==False and s=="WA":
miss[p-1][0]+=1
if s=="AC":
miss[p-1][1]=True
pena=0
ac=0
for m,tf in miss:
pena+=m*tf
ac+=tf
print(str(pena)+" "+str(ac))
|
N,M=map(int,input().split())
PS=[list(input().split()) for _ in range(M)]
miss=[[0,False] for _ in range(N)]
for p,s in PS:
p=int(p)
if miss[p-1][1]==False and s=="WA":
miss[p-1][0]+=1
if s=="AC":
miss[p-1][1]=True
pena=0
ac=0
for m,tf in miss:
pena+=m*tf
ac+=tf
print(str(ac)+" "+str(pena))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 605,425
| 605,426
|
u093861603
|
python
|
p02802
|
N,M=map(int,input().split())
PS=[list(input().split()) for _ in range(M)]
miss=[[0,False] for _ in range(N)]
for p,s in PS:
p=int(p)
if miss[p-1][1]==False and s=="WA":
miss[p-1][0]+=1
if s=="AC":
miss[p-1][1]=True
pena=0
ac=0
for m,tf in miss:
pena+=m
ac+=tf
print(str(pena)+" "+str(ac))
|
N,M=map(int,input().split())
PS=[list(input().split()) for _ in range(M)]
miss=[[0,False] for _ in range(N)]
for p,s in PS:
p=int(p)
if miss[p-1][1]==False and s=="WA":
miss[p-1][0]+=1
if s=="AC":
miss[p-1][1]=True
pena=0
ac=0
for m,tf in miss:
pena+=m*tf
ac+=tf
print(str(ac)+" "+str(pena))
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 605,427
| 605,426
|
u093861603
|
python
|
p02802
|
n,m= list(map(int, input().split()))
ans_box=[0]*n
wa=[0]*m
ac=0
wa_cnt=0
for j in range(m):
k,l=input().split()
h=int(k)-1
if ans_box[h]==0:
if l=="AC":
ac+=1
ans_box[h]+=1
wa_cnt+=wa[h]
else:
wa[h]+=1
print(ac,wa_cnt)
|
n,m= list(map(int, input().split()))
ans_box=[0]*n
wa=[0]*n
ac=0
wa_cnt=0
for j in range(m):
k,l=input().split()
h=int(k)-1
if ans_box[h]==0:
if l=="AC":
ac+=1
ans_box[h]+=1
wa_cnt+=wa[h]
else:
wa[h]+=1
print(ac,wa_cnt)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 605,448
| 605,449
|
u185405877
|
python
|
p02802
|
n,m= list(map(int, input().split()))
ans_box=[0]*n
wa=[0]*m
ac=0
wa_cnt=0
for j in range(m):
k,l=input().split()
h=int(k)-1
if ans_box[h]==0:
if l=="AC":
ac+=1
ans_box[h]+=1
wa_cnt+=wa[h]
else:
wa[h]+=1
print(ac,wa_cnt)
|
n,m= list(map(int, input().split()))
ans_box=[0]*n
wa=[0]*n
ac=0
wa_cnt=0
for j in range(m):
k,l=input().split()
h=int(k)-1
if ans_box[h]==0:
if l=="AC":
ac+=1
ans_box[h]+=1
wa_cnt+=wa[h]
else:
wa[h]+=1
print(ac,wa_cnt)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 605,450
| 605,449
|
u185405877
|
python
|
p02802
|
n,m = map(int,input().split())
pS_list = [list(input().split())
for nesya in range(m)]
ac = 0
wa = 0
q_list = [0]*n
for ps in ps_list:
p = int(ps[0])-1
s = ps[1]
if q_list[p] == 1:
continue
if s == 'WA':
q_list[p] -= 1
else:
a = q_list[p]
wa -= a
ac += 1
q_list[p] = 1
print(ac,wa)
|
n,m = map(int,input().split())
pS_list = [list(input().split())
for nesya in range(m)]
ac = 0
wa = 0
q_list = [0]*n
for ps in pS_list:
p = int(ps[0])-1
s = ps[1]
if q_list[p] == 1:
continue
if s == 'WA':
q_list[p] -= 1
else:
a = q_list[p]
wa -= a
ac += 1
q_list[p] = 1
print(ac,wa)
|
[
"identifier.change"
] | 605,461
| 605,462
|
u227085629
|
python
|
p02802
|
n,m = map(int,input().split())
cor = set()
pens = {}
for i in range(m):
p,s = input().split()
if s=="AC":
cor.add(p)
else:
if not p in cor:
if p in pens:
pens[p] += 1
else:
pens[p] = 1
pen = 0
for x in cor:
if x in pens:
pen += pens(x)
print(str(len(cor))+" "+str(pen))
|
n,m = map(int,input().split())
cor = set()
pens = {}
for i in range(m):
p,s = input().split()
if s=="AC":
cor.add(p)
else:
if not p in cor:
if p in pens:
pens[p] += 1
else:
pens[p] = 1
pen = 0
for x in cor:
if x in pens:
pen += pens[x]
print(str(len(cor))+" "+str(pen))
|
[
"call.arguments.change"
] | 605,466
| 605,467
|
u443996531
|
python
|
p02802
|
N, M = map(int, input().split())
accepted = [0] * N
penalties = [0] * N
for _ in range(M):
p, ac = input().split()
p, ac = int(p), ac == "AC"
accepted[p] |= ac
penalties[p] += not accepted[p]
print(sum(accepted), sum(p for ac, p in zip(accepted, penalties) if ac))
|
N, M = map(int, input().split())
accepted = [0] * N
penalties = [0] * N
for _ in range(M):
p, ac = input().split()
p, ac = int(p) - 1, ac == "AC"
accepted[p] |= ac
penalties[p] += not accepted[p]
print(sum(accepted), sum(p for ac, p in zip(accepted, penalties) if ac))
|
[
"assignment.change"
] | 605,468
| 605,469
|
u638282348
|
python
|
p02802
|
n,m = map(int,input().split())
ac,wa = 0,0
d = {}
for i in range(m):
p,s = input().split()
if p in d:
if d[p][1]:
pass
else:
if s=="WA":
d[p][0]+=1
elif s=="AC":
d[p][1]=True
ac+=1
wa+=d[p][0]
else:
if s=="WA":
d[p]=[1,False]
wa+=1
elif s=="AC":
d[p]=[0,True]
ac+=1
print(ac,wa)
|
n,m = map(int,input().split())
ac,wa = 0,0
d = {}
for i in range(m):
p,s = input().split()
if p in d:
if d[p][1]:
pass
else:
if s=="WA":
d[p][0]+=1
elif s=="AC":
d[p][1]=True
ac+=1
wa+=d[p][0]
else:
if s=="WA":
d[p]=[1,False]
elif s=="AC":
d[p]=[0,True]
ac+=1
print(ac,wa)
|
[] | 605,470
| 605,471
|
u867826040
|
python
|
p02802
|
n, m = map(int, input().split())
scores = [[0, False] for _ in range(n)]
for _ in range(m):
p, S = input().split()
p = int(p)
if scores[p][1]:
continue
if S == "AC":
scores[p][1] = True
continue
if S == "WA":
scores[p][0] += 1
score = pena = 0
for count, ac in scores:
if ac:
score += 1
pena += count
print(score, pena)
|
n, m = map(int, input().split())
scores = [[0, False] for _ in range(n+1)]
for _ in range(m):
p, S = input().split()
p = int(p)
if scores[p][1]:
continue
if S == "AC":
scores[p][1] = True
continue
if S == "WA":
scores[p][0] += 1
score = pena = 0
for count, ac in scores:
if ac:
score += 1
pena += count
print(score, pena)
|
[
"control_flow.loop.range.bounds.upper.change",
"assignment.change"
] | 605,472
| 605,473
|
u560867850
|
python
|
p02802
|
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
def I(): return int(input()) # '123' -> 123
def Is(): return map(int, input().split()) # '123 456' -> 123, 456
def LI(): return list(map(int, input().split())) # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split())) # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split() # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input()) # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')
n, m = Is()
li = [[0]*2 for _ in range(n)]
for _ in range(m):
p_, s = Ss()
p = int(p_) - 1
if s == "AC":
li[p][0] = 1
elif s == "WA" and li[p][0] == 1:
li[p][1] += 1
ac = 0
wa = 0
for i in range(n):
ac += li[i][0]
wa += li[i][1] if li[i][0] == 1 else 0
print("{} {}".format(ac, wa))
|
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from math import gcd
import sys
def I(): return int(input()) # '123' -> 123
def Is(): return map(int, input().split()) # '123 456' -> 123, 456
def LI(): return list(map(int, input().split())) # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split())) # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split() # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input()) # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')
n, m = Is()
li = [[0]*2 for _ in range(n)]
for _ in range(m):
p_, s = Ss()
p = int(p_) - 1
if s == "AC":
li[p][0] = 1
elif s == "WA" and li[p][0] == 0:
li[p][1] += 1
ac = 0
wa = 0
for i in range(n):
ac += li[i][0]
wa += li[i][1] if li[i][0] == 1 else 0
print("{} {}".format(ac, wa))
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 605,480
| 605,481
|
u279460955
|
python
|
p02802
|
N,M=map(int,input().split())
if M==0 :
print(0,0)
exit()
ACCNT=[False]*N
Asum=0
WACNT=[0]*N
for i in range(M):
PI,SI=input().split()
iii=int(PI)-1
if ACCNT[iii]==False:
if SI=="WA" :
WACNT[iii]=WACNT[iii]+1
elif SI=="AC" :
ACCNT[iii]=True
Asum=Asum+1
Wsum=0
for i in range(N):
if ACCNT[i]==True:
Wsum=Wsum+WACNT[iii]
print(Asum,Wsum)
|
N,M=map(int,input().split())
if M==0 :
print(0,0)
exit()
ACCNT=[False]*N
Asum=0
WACNT=[0]*N
for i in range(M):
PI,SI=input().split()
iii=int(PI)-1
if ACCNT[iii]==False:
if SI=="WA" :
WACNT[iii]=WACNT[iii]+1
elif SI=="AC" :
ACCNT[iii]=True
Asum=Asum+1
Wsum=0
for i in range(N):
if ACCNT[i]==True:
Wsum=Wsum+WACNT[i]
print(Asum,Wsum)
|
[
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 605,491
| 605,492
|
u576432509
|
python
|
p02802
|
N,M=map(int,input().split())
if M==0 :
print(0,0)
exit()
ACCNT=[False]*N
Asum=0
WACNT=[0]*N
for i in range(M):
PI,SI=input().split()
iii=int(PI)-1
if ACCNT[iii]==False:
if SI=="WA" :
WACNT[iii]=WACNT[iii]+1
elif SI=="AC" :
ACCNT[iii]=True
Asum=Asum+1
Wsum=0
for i in range(N):
if ACCNT[iii]==True:
Wsum=Wsum+WACNT[iii]
print(Asum,Wsum)
|
N,M=map(int,input().split())
if M==0 :
print(0,0)
exit()
ACCNT=[False]*N
Asum=0
WACNT=[0]*N
for i in range(M):
PI,SI=input().split()
iii=int(PI)-1
if ACCNT[iii]==False:
if SI=="WA" :
WACNT[iii]=WACNT[iii]+1
elif SI=="AC" :
ACCNT[iii]=True
Asum=Asum+1
Wsum=0
for i in range(N):
if ACCNT[i]==True:
Wsum=Wsum+WACNT[i]
print(Asum,Wsum)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 605,493
| 605,492
|
u576432509
|
python
|
p02802
|
n,m = (int(x) for x in input().split())
memo = [0]*n
pena = [0]*n
ans2 = 0
for i in range(m):
p,s = (str(x) for x in input().split())
p = int(p)
if s=="AC":
memo[p-1] = 1
elif s=="WA":
if memo[p-1]==0:
pena[p-1] += 1
for j in range(p):
if memo[j]==1:
ans2 += pena[j]
print("{} {}".format(sum(memo),ans2))
|
n,m = (int(x) for x in input().split())
memo = [0]*n
pena = [0]*n
ans2 = 0
for i in range(m):
p,s = (str(x) for x in input().split())
p = int(p)
if s=="AC":
memo[p-1] = 1
elif s=="WA":
if memo[p-1]==0:
pena[p-1] += 1
for j in range(n):
if memo[j]==1:
ans2 += pena[j]
print("{} {}".format(sum(memo),ans2))
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 605,494
| 605,495
|
u970082363
|
python
|
p02802
|
n,m = map(int,input().split())
p = [0]* m
s = ["a"] * m
for i in range(m):
p[i],s[i] = input().split()
p[i] = int(p[i])
ac_num = [0] * n
wa_num = [0] * n
for i in range(m):
if s[i] == "AC":
ac_num[p[i]-1] = 1
elif s[i] == "WA":
if ac_num[p[i]-1] == 0:
wa_num[p[i]-1] += 1
for i in range(n):
if ac_num[i] == 0:
wa_num[i] == 0
print(sum(ac_num),sum(wa_num))
|
n,m = map(int,input().split())
p = [0]* m
s = ["a"] * m
for i in range(m):
p[i],s[i] = input().split()
p[i] = int(p[i])
ac_num = [0] * n
wa_num = [0] * n
for i in range(m):
if s[i] == "AC":
ac_num[p[i]-1] = 1
elif s[i] == "WA":
if ac_num[p[i]-1] == 0:
wa_num[p[i]-1] += 1
for i in range(n):
if ac_num[i] == 0:
wa_num[i] = 0
#print(ac_num,wa_num)
print(sum(ac_num),sum(wa_num))
|
[
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 605,502
| 605,503
|
u312158169
|
python
|
p02802
|
#C
n,m=map(int,input().split())
f=False
ps=[]
AC=[0]*n
WA=[0]*n
for i in range(m):
ps.append(list(input().split()))
for i in range(m):
if ps[i][1]=='AC'and AC[int(ps[i][0])-1]==0:
AC[int(ps[i][0])-1]=1
if ps[i][1]=='WA'and WA[int(ps[i][0])-1]==0:
WA[int(ps[i][0])-1]+=1
wasum=0
for i in range(n):
if AC[i]==1:
wasum+=WA[i]
print(sum(AC),wasum)
|
#C
n,m=map(int,input().split())
f=False
ps=[]
AC=[0]*n
WA=[0]*n
for i in range(m):
ps.append(list(input().split()))
for i in range(m):
if ps[i][1]=='AC'and AC[int(ps[i][0])-1]==0:
AC[int(ps[i][0])-1]=1
if ps[i][1]=='WA'and AC[int(ps[i][0])-1]==0:
WA[int(ps[i][0])-1]+=1
wasum=0
for i in range(n):
if AC[i]==1:
wasum+=WA[i]
print(sum(AC),wasum)
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 605,508
| 605,509
|
u490489966
|
python
|
p02802
|
N, M = list(map(int, input().split()))
submits = [[] for i in range(M)]
for i in range(M):
submits[i] = input().split()
submits[i][0] = int(submits[i][0])
AC_number = [0 for i in range(N)] #バケット
WA_number = [0 for i in range(N)] #バケット
for i in range(M):
#WAが出て、まだ終わってない問題なら
if submits[i][1] != 'AC' and AC_number[submits[i][0] - 1] != 1:
WA_number[submits[i][0] - 1] += 1
#ACが出たら
if submits[i][1] == 'AC':
AC_number[submits[i][0] - 1] = 1
AC_count = 0
WA_count = 0
for i in range(N):
if AC_number[i] == 1:
AC_count += 1
WA_count = WA_number[i]
print(AC_count, WA_count)
|
N, M = list(map(int, input().split()))
submits = [[] for i in range(M)]
for i in range(M):
submits[i] = input().split()
submits[i][0] = int(submits[i][0])
AC_number = [0 for i in range(N)] #バケット
WA_number = [0 for i in range(N)] #バケット
for i in range(M):
#WAが出て、まだ終わってない問題なら
if submits[i][1] != 'AC' and AC_number[submits[i][0] - 1] != 1:
WA_number[submits[i][0] - 1] += 1
#ACが出たら
if submits[i][1] == 'AC':
AC_number[submits[i][0] - 1] = 1
AC_count = 0
WA_count = 0
for i in range(N):
if AC_number[i] == 1:
AC_count += 1
WA_count += WA_number[i]
print(AC_count, WA_count)
|
[
"assignment.value.change"
] | 605,510
| 605,511
|
u572122511
|
python
|
p02802
|
#!/usr/bin/env python3
n, m = list(map(int, input().split()))
flag = [0 for _ in range(n)]
wa_num_list = [0 for _ in range(n)]
for i in range(m):
p, s = list(map(str, input().split()))
p = int(p)
if flag[p-1] == 0:
if s == "WA":
wa_num_list[p-1] += 1
else:
flag[p-1] = 1
pen = 0
for i in range(m):
if flag[i] == 1:
pen += wa_num_list[i]
print(sum(flag), pen)
|
#!/usr/bin/env python3
n, m = list(map(int, input().split()))
flag = [0 for _ in range(n)]
wa_num_list = [0 for _ in range(n)]
for i in range(m):
p, s = list(map(str, input().split()))
p = int(p)
if flag[p-1] == 0:
if s == "WA":
wa_num_list[p-1] += 1
else:
flag[p-1] = 1
pen = 0
for i in range(n):
if flag[i] == 1:
pen += wa_num_list[i]
print(sum(flag), pen)
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 605,535
| 605,536
|
u239528020
|
python
|
p02802
|
n, m = map(int,input().split())
a = [[0,0] for i in range(n)]
ac = 0
wa = 0
for i in range(m):
p, s = input().split()
p = int(p-1)
if s == "WA" and a[p][1] == 0:
a[p][0] += 1
elif s == "AC" and a[p][1] == 0:
ac += 1
a[p][1] = 1
for i in a:
if i[1] == 1:
wa += i[0]
print(ac,wa)
|
n, m = map(int,input().split())
a = [[0,0] for i in range(n)]
ac = 0
wa = 0
for i in range(m):
p, s = input().split()
p = int(p)-1
if s == "WA" and a[p][1] == 0:
a[p][0] += 1
elif s == "AC" and a[p][1] == 0:
ac += 1
a[p][1] = 1
for i in a:
if i[1] == 1:
wa += i[0]
print(ac,wa)
|
[
"call.arguments.change"
] | 605,541
| 605,542
|
u169350228
|
python
|
p02802
|
N,M=map(int,input().split())
keep=[]
lis=[]
ac=[0]*N
wa=[0]*N
WA=0
for i in range(M):
ps=input().split()
keep.append(ps)
for j in range(M):
if keep[j][1]=="AC":
ac[int(keep[j][0])-1]=1
elif ac[int(keep[j][0])-1]==0:
wa[int(keep[j][0])-1]+=1
AC=sum(ac)
for j in range(M):
WA+=ac[j]*wa[j]
print(AC,WA)
|
N,M=map(int,input().split())
keep=[]
lis=[]
ac=[0]*N
wa=[0]*N
WA=0
for i in range(M):
ps=input().split()
keep.append(ps)
for j in range(M):
if keep[j][1]=="AC":
ac[int(keep[j][0])-1]=1
elif ac[int(keep[j][0])-1]==0:
wa[int(keep[j][0])-1]+=1
AC=sum(ac)
for k in range(N):
WA+=ac[k]*wa[k]
print(AC,WA)
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 605,555
| 605,556
|
u419963262
|
python
|
p02802
|
N,M = map(int,input().split())
PS = [list(map(str,input().split())) for i in range(M)]
A_num = [0]*N
W_num = [0]*N
w=0
#print(PS)
for j in range(M):
#print(A_num)
if PS[j][1] == 'WA'and A_num[int(PS[j][0])-1]==0:
W_num[int(PS[j][0]-1)]=1
if PS[j][1]== 'AC' and A_num[int(PS[j][0])-1]==0:
A_num[int(PS[j][0])-1]=1
s = sum(A_num)
for k in range(N):
if A_num[k] == 0:
W_num[k]=0
w = sum(W_num)
print(s,w)
|
N,M = map(int,input().split())
PS = [list(map(str,input().split())) for i in range(M)]
A_num = [0]*N
W_num = [0]*N
w=0
#print(PS)
for j in range(M):
#print(A_num)
if PS[j][1] == 'WA'and A_num[int(PS[j][0])-1]==0:
W_num[int(PS[j][0])-1]+=1
if PS[j][1]== 'AC' and A_num[int(PS[j][0])-1]==0:
A_num[int(PS[j][0])-1]=1
s = sum(A_num)
for k in range(N):
if A_num[k] == 0:
W_num[k]=0
w = sum(W_num)
print(s,w)
|
[
"call.arguments.change",
"assignment.value.change"
] | 605,563
| 605,562
|
u863964720
|
python
|
p02802
|
n,m=map(int,input().split())
p=[list(input().split()) for _ in range(m)]
a=[0]*(n+1)
w=[0]*(n+1)
for i in range(m):
if a[int(p[i][0])]==0 and p[i][1]=='AC':
a[int(p[i][0])]+=1
if a[int(p[i][0])]==0 and p[i][1]=='WA':
w[int(p[i][0])]+=1
a=np.array(a)
w=np.array(w)
aw=a*w
print(sum(a),sum(aw))
|
import numpy as np
n,m=map(int,input().split())
p=[list(input().split()) for _ in range(m)]
a=[0]*(n+1)
w=[0]*(n+1)
for i in range(m):
if a[int(p[i][0])]==0 and p[i][1]=='AC':
a[int(p[i][0])]+=1
if a[int(p[i][0])]==0 and p[i][1]=='WA':
w[int(p[i][0])]+=1
a=np.array(a)
w=np.array(w)
aw=a*w
print(sum(a),sum(aw))
|
[] | 605,592
| 605,593
|
u440129511
|
python
|
p02802
|
n,m = map(int,input().split())
L = [0]*n
AC = 0
WA = 0
tmp = [0]*n
for i in range(m):
x,y = input().split()
x = int(x)
if L[x-1] == 0:
if y == "WA":
tmp[x-1] += 1
else:
AC += 1
WA += tmp[x-1]
L[x-1]=1
print(A,W)
|
n,m = map(int,input().split())
L = [0]*n
AC = 0
WA = 0
tmp = [0]*n
for i in range(m):
x,y = input().split()
x = int(x)
if L[x-1] == 0:
if y == "WA":
tmp[x-1] += 1
else:
AC += 1
WA += tmp[x-1]
L[x-1]=1
print(AC,WA)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 605,598
| 605,599
|
u652656291
|
python
|
p02802
|
n,m=map(int,input().split())
a=[0]*n
b=[0]*n
for i in range(m):
p,s=input().split()
p=int(p)-1
if a[p]==0:
if s=="AC":
a[p]=1
else:
b[p]+=1
for i in range(n):
if a[i]==0:
b[i]==0
print(sum(a),sum(b))
|
n,m=map(int,input().split())
a=[0]*n
b=[0]*n
for i in range(m):
p,s=input().split()
p=int(p)-1
if a[p]==0:
if s=="AC":
a[p]=1
else:
b[p]+=1
for i in range(n):
if a[i]==0:
b[i]=0
print(sum(a),sum(b))
|
[
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 605,603
| 605,604
|
u345483150
|
python
|
p02802
|
n,m=map(int,input().split())
a=[0]*(n+1)
b=[0]*(n+1)
for i in range(m):
p,s=input().split()
p=int(p)
if a[p]==0:
if s=="AC":
a[p]=1
else:
b[p]+=1
for i in range(n+1):
if a[i]==0:
b[i]==0
print(sum(a),sum(b))
|
n,m=map(int,input().split())
a=[0]*(n+1)
b=[0]*(n+1)
for i in range(m):
p,s=input().split()
p=int(p)
if a[p]==0:
if s=="AC":
a[p]=1
else:
b[p]+=1
for i in range(n+1):
if a[i]==0:
b[i]=0
print(sum(a),sum(b))
|
[
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 605,606
| 605,607
|
u345483150
|
python
|
p02802
|
n,m=map(int,input().split())
a=[0]*(n+1)
b=[0]*(n+1)
for i in range(m):
p,s=input().split()
p=int(p)
if a[p]==0:
if s=="AC":
a[p]=1
else:
b[p]+=1
for i in range(n):
if a[i]==0:
b[i]==0
print(sum(a),sum(b))
|
n,m=map(int,input().split())
a=[0]*(n+1)
b=[0]*(n+1)
for i in range(m):
p,s=input().split()
p=int(p)
if a[p]==0:
if s=="AC":
a[p]=1
else:
b[p]+=1
for i in range(n+1):
if a[i]==0:
b[i]=0
print(sum(a),sum(b))
|
[
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 605,608
| 605,607
|
u345483150
|
python
|
p02802
|
n,m=map(int,input().split())
ps=[list(input().split()) for i in range(m)]
pen=[0]*n
rig=[0]*n
for i in range(m):
if ps[i][1] == "AC":
rig[int(ps[i][0])-1]=1
else:
if rig[int(ps[i][0]-1)] == 0:
pen[int(ps[i][0]-1)]+=1
cnt1,cnt2=0,0
for i in range(n):
if rig[i]==1:
cnt1+=rig[i]
cnt2+=pen[i]
print(str(cnt1)+" "+str(cnt2))
|
n,m=map(int,input().split())
ps=[list(input().split()) for i in range(m)]
pen=[0]*n
rig=[0]*n
for i in range(m):
if ps[i][1] == "AC":
rig[int(ps[i][0])-1]=1
else:
if rig[int(ps[i][0])-1] == 0:
pen[int(ps[i][0])-1]+=1
cnt1,cnt2=0,0
for i in range(n):
if rig[i]==1:
cnt1+=rig[i]
cnt2+=pen[i]
print(str(cnt1)+" "+str(cnt2))
|
[
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 605,616
| 605,617
|
u995419623
|
python
|
p02802
|
N, M = map(int, input().split())
data = {}
ps = [0] * N
ACs = []
num_ac = 0
num_wa = 0
for i in range(M):
p, S = input().split()
p = int(p)
if ps[p] == 0:
ps[p] = 1
data[p] = {'AC':0, 'WA':0}
if S == 'AC' and data[p]['AC'] == 0:
ACs.append(p)
data[p]['AC'] += 1
num_ac += 1
num_wa += data[p]['WA']
if S == 'WA' and data[p]['AC'] == 0:
data[p][S] += 1
print(num_ac, num_wa)
|
N, M = map(int, input().split())
data = {}
ps = [0] * N
ACs = []
num_ac = 0
num_wa = 0
for i in range(M):
p, S = input().split()
p = int(p) - 1
if ps[p] == 0:
ps[p] = 1
data[p] = {'AC':0, 'WA':0}
if S == 'AC' and data[p]['AC'] == 0:
ACs.append(p)
data[p]['AC'] += 1
num_ac += 1
num_wa += data[p]['WA']
if S == 'WA' and data[p]['AC'] == 0:
data[p][S] += 1
print(num_ac, num_wa)
|
[
"assignment.change"
] | 605,625
| 605,626
|
u265154666
|
python
|
p02802
|
n, m = map(int, input().split())
l = list("")
ac, wa = 0, 0
for i in range(m):
p, s = input().split()
p = int(p)
if l[p - 1] != -1 and s == "AC":
ac += 1
wa += l[p - 1]
l[p - 1] = -1
if l[p - 1] != -1 and s == "WA":
l[p - 1] += 1
print(ac, wa)
|
n, m = map(int, input().split())
l = [0] * n
ac, wa = 0, 0
for i in range(m):
p, s = input().split()
p = int(p)
if l[p - 1] != -1 and s == "AC":
ac += 1
wa += l[p - 1]
l[p - 1] = -1
if l[p - 1] != -1 and s == "WA":
l[p - 1] += 1
print(ac, wa)
|
[
"call.arguments.change"
] | 605,636
| 605,637
|
u026862065
|
python
|
p02802
|
n,m=[int(i) for i in input().split()]
ac=[0]*n
wa=[0]*n
for i in range(m):
p,s=input().split()
p=int(p)-1
if s=="AC":
if check[p]==0:
check[p]=1
else:
if check[p]==0:
wa[p]+=1
for i in range(n):
wa[i]=wa[i]*ac[i]
print(sum(ac),sum(wa))
|
n,m=[int(i) for i in input().split()]
ac=[0]*n
wa=[0]*n
for i in range(m):
p,s=input().split()
p=int(p)-1
if s=="AC":
if ac[p]==0:
ac[p]=1
else:
if ac[p]==0:
wa[p]+=1
for i in range(n):
wa[i]=wa[i]*ac[i]
print(sum(ac),sum(wa))
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 605,640
| 605,641
|
u235210692
|
python
|
p02802
|
import sys
a,b=map(int,input().split())
account=0
wacount=0
acbox=[0]*(a+1)
wabox=[0]*(a+1)
for i in range(b):
p,q=input().split()
p=int(p)
if q=="WA":
if acbox[p]==0:
wabox[p]+=1
else:
if acbox[p]!=0:
account+=1
wacount+=wabox[p]
acbox[p]=+1
print(account,wacount)
|
a,b=map(int,input().split())
account=0
wacount=0
acbox=[0]*(a+1)
wabox=[0]*(a+1)
for i in range(b):
p,q=input().split()
p=int(p)
if q=="WA":
if acbox[p]==0:
wabox[p]+=1
else:
if acbox[p]==0:
account+=1
wacount+=wabox[p]
acbox[p]=+1
print(account,wacount)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 605,642
| 605,643
|
u453815934
|
python
|
p02802
|
d = [0]*10**5
a = set()
w = 0
for t in open(0):
p, s = t.split
p = int(p)
if "AC" == s and p not in a:
w += d[p]
a.add(p)
if "WA" == s:
d[p] += 1
print(len(a), w)
|
d = [0]*10**5
a = set()
w = 0
for t in open(0):
p, s = t.split()
p = int(p)
if "AC" == s and p not in a:
w += d[p]
a.add(p)
if "WA" == s:
d[p] += 1
print(len(a), w)
|
[
"call.add"
] | 605,649
| 605,650
|
u373047809
|
python
|
p02802
|
from collections import deque
N, M = map(int,input().split())
ac = [0] * M
pena = [0] * M
for a in range(M):
p,s = input().split()
p = int(p) - 1
if ac[p]:
continue
if s == 'AC':
ac[p] = 1
else:
pena[p] += 1
AC = 0
PENA = 0
for a in range(N):
AC += ac[a]
if ac[a]:
PENA += pena[a]
print(AC,PENA)
|
from collections import deque
N, M = map(int,input().split())
ac = [0] * N
pena = [0] * N
for a in range(M):
p,s = input().split()
p = int(p) - 1
if ac[p]:
continue
if s == 'AC':
ac[p] = 1
else:
pena[p] += 1
AC = 0
PENA = 0
for a in range(N):
AC += ac[a]
if ac[a]:
PENA += pena[a]
print(AC,PENA)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 605,667
| 605,668
|
u806403461
|
python
|
p02802
|
from collections import deque
N, M = map(int,input().split())
ac = [0] * M
pena = [0] * M
for a in range(M):
p,s = input().split()
p = int(p) - 1
if ac[p]:
continue
if s == 'AC':
ac[p] = 1
else:
pena[p] += 1
AC = 0
PENA = 0
for a in range(M):
AC += ac[a]
if ac[a]:
PENA += pena[a]
print(AC,PENA)
|
from collections import deque
N, M = map(int,input().split())
ac = [0] * N
pena = [0] * N
for a in range(M):
p,s = input().split()
p = int(p) - 1
if ac[p]:
continue
if s == 'AC':
ac[p] = 1
else:
pena[p] += 1
AC = 0
PENA = 0
for a in range(N):
AC += ac[a]
if ac[a]:
PENA += pena[a]
print(AC,PENA)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 605,669
| 605,668
|
u806403461
|
python
|
p02802
|
#C - Welcome to AtCoder
N, M = map(int, input().split())
Score = [[]*i for i in range(N)]
Count_AC = 0
Count_WA = 0
#小問毎の正誤リスト作成
for i in range(M):
p, S = input().split()
Score[int(p)-1].append(S)
for i in range(N):
for j in range(len(Score[i])):
if Score[i][j] == "WA":
continue
else:
Count_AC += 1
Count_WA += j
print(Count_AC, Count_WA)
|
#C - Welcome to AtCoder
N, M = map(int, input().split())
Score = [[]*i for i in range(N)]
Count_AC = 0
Count_WA = 0
#小問毎の正誤リスト作成
for i in range(M):
p, S = input().split()
Score[int(p)-1].append(S)
for i in range(N):
for j in range(len(Score[i])):
if Score[i][j] == "WA":
continue
else:
Count_AC += 1
Count_WA += j
break
print(Count_AC, Count_WA)
|
[
"control_flow.break.add"
] | 605,675
| 605,676
|
u692453235
|
python
|
p02802
|
N, M = map(int, input().split())
l = [[] for i in range(N)]
old_p = 0
for i in range(M):
tmp = list(input().split())
# if tmp[0] != str(old_p + 1):
# old_p += 1
# l[old_p].append(tmp[1])
l[int(tmp[0]) - 1].append(tmp[1])
ac = 0
wa = 0
print(l)
for i in range(N):
wa_tmp = 0
for j in range(len(l[i])):
if l[i][j] == 'WA':
wa_tmp += 1
else:
ac += 1
wa += wa_tmp
break
print('{} {}'.format(ac, wa))
|
N, M = map(int, input().split())
l = [[] for i in range(N)]
old_p = 0
for i in range(M):
tmp = list(input().split())
# if tmp[0] != str(old_p + 1):
# old_p += 1
# l[old_p].append(tmp[1])
l[int(tmp[0]) - 1].append(tmp[1])
ac = 0
wa = 0
#print(l)
for i in range(N):
wa_tmp = 0
for j in range(len(l[i])):
if l[i][j] == 'WA':
wa_tmp += 1
else:
ac += 1
wa += wa_tmp
break
print('{} {}'.format(ac, wa))
|
[
"call.remove"
] | 605,677
| 605,678
|
u024442309
|
python
|
p02802
|
n,m = map(int,input().split())
ac = [0]*(n+1)
wa = [0]*(n+1)
for i in range(m):
p,s = input().split()
p = int(p)
if s=="AC":
ac[p]=1
else:
if ac[p] ==0:
wa[p]+=1
w = 0
for i in range(n):
if ac[i] ==1:
w+=wa[i]
print(sum(ac),w)
|
n,m = map(int,input().split())
ac = [0]*(n+1)
wa = [0]*(n+1)
for i in range(m):
p,s = input().split()
p = int(p)
if s=="AC":
ac[p]=1
else:
if ac[p] ==0:
wa[p]+=1
w = 0
for i in range(n+1):
if ac[i] ==1:
w+=wa[i]
print(sum(ac),w)
|
[
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 605,681
| 605,682
|
u401487574
|
python
|
p02802
|
from collections import Counter
N, M = list(map(int, input().split()))
results = []
for _ in range(M):
p, s = input().split()
results.append((int(p), s))
wa_counter = Counter()
is_active = [True for _ in range(N)]
for p, s in results:
p -= 1
if s == 'WA':
if is_active[p]:
wa_counter[p] += 1
else:
pass
elif s == 'AC':
if is_active[p]:
is_active[p] = False
else:
pass
correct = 0
incorrect = 0
for i in range(N):
if is_active[i] is False:
correct += 1
incorrect += wa_counter[p]
print(correct, incorrect)
|
from collections import Counter
N, M = list(map(int, input().split()))
results = []
for _ in range(M):
p, s = input().split()
results.append((int(p), s))
wa_counter = Counter() # ACされていない問題についてのWAのカウンタ
is_active = [True for _ in range(N)] # ACしたかどうか。Trueのとき、まだACされてない。
for p, s in results:
p -= 1
if s == 'WA':
if is_active[p]:
wa_counter[p] += 1
else:
pass
elif s == 'AC':
if is_active[p]:
is_active[p] = False
else:
pass
correct = 0 # ACした問題の数
incorrect = 0 # ACした問題のACするまでのWAの数
for i in range(N):
if is_active[i] is False: # ACされている
correct += 1
incorrect += wa_counter[i]
print(correct, incorrect)
|
[
"identifier.change",
"variable_access.subscript.index.change"
] | 605,683
| 605,684
|
u219180252
|
python
|
p02802
|
N, M = map(int, input().split())
WA = [0] * N
AC = [0] * N
for i in range(M):
p,s = input().split()
p = int(p)
if AC[p-1] == 0:
if s == "AC":
AC[p-1] = 1
else:
WA[p-1] += 1
wa = 0
for j in range(M):
if AC[j] == 1:
wa += WA[j]
print(sum(AC),wa)
|
N, M = map(int, input().split())
WA = [0] * N
AC = [0] * N
for i in range(M):
p,s = input().split()
p = int(p)
if AC[p-1] == 0:
if s == "AC":
AC[p-1] = 1
else:
WA[p-1] += 1
wa = 0
for j in range(N):
if AC[j] == 1:
wa += WA[j]
print(sum(AC),wa)
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 605,685
| 605,686
|
u503111914
|
python
|
p02802
|
N,M = map(int, input().split())
f=[0]*(N+1)
ans_a=[0]*(N+1)
ans_w=0
for i in range(M):
p,s = map(str, input().split())
if s=='WA' and ans_a[int(p)]==0:
f[int(p)]+=1
else:
if ans_a[int(p)]==0:
ans_a[int(p)]+=1
ans_w+=f[int(p)]
print(sum(ans_a),sum(f))
|
N,M = map(int, input().split())
f=[0]*(N+1)
ans_a=[0]*(N+1)
ans_w=0
for i in range(M):
p,s = map(str, input().split())
if s=='WA' and ans_a[int(p)]==0:
f[int(p)]+=1
else:
if ans_a[int(p)]==0:
ans_a[int(p)]+=1
ans_w+=f[int(p)]
print(sum(ans_a),ans_w)
|
[
"call.arguments.change",
"io.output.change"
] | 605,687
| 605,688
|
u531813438
|
python
|
p02802
|
mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
_NUMINT_ALL = list(range(10))
def main():
ans = solve()
if ans is True or ans is False:
YesNo(ans)
elif ans is not None:
print(ans)
def solve():
N, M = iip(False)
A = iipt(M)
d = {}
for p, s in A:
d[p] = [0, 0]
for p, s in A:
if d[p][1] == 1:
continue
elif s == "WA":
d[p][0] += 1
else:
d[p][1] = 1
e = 0
f = 0
for a, b in d.values():
if b == 0:
continue
e += a
f += b
split_print_space([e, f])
#####################################################ライブラリ集ここから
def kiriage_warizan(a, b):
return -(-a//b)
def iip(listed=True): # 数字のinputをlistで受け取る
d = input().split()
try:
ret = [int(i) for i in d]
except:
ret = [int(i) if i in _NUMINT_ALL else i for i in d]
if len(ret) == 1:
return ret[0]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def iipt(l, listed=False, num_only=True): # 縦向きに並んでいるデータをリストに落とし込む(iip利用)
ret = []
for i in range(l):
ret.append(iip(listed=listed))
return ret
def saidai_kouyakusuu(A): # 最大公約数
l = len(A)
while True:
m = min(A)
mx = max(A)
if m == mx:
return m
for i in range(l):
if A[i] % m == 0:
A[i] = m
else:
A[i] %= m
def make_graph_edge_flat(N): # グラフ作成のための辺をリストで返す
ret = []
for i in range(N-1):
a, b, c = iip()
a -= 1
b -= 1
ret[a].append((b, c))
ret[b].append((a, c))
return ret
def sort_tuples(l, index): # タプルのリストを特定のインデックスでソートする
if isinstance(l, list):
l.sort(key=lambda x: x[index])
return l
else:
l = list(l)
return sorted(l, key=lambda x: x[index])
def count_elements(l): # リストの中身の個数を種類分けして辞書で返す
d = {}
for i in l:
if i in d:
d[i] += 1
else:
d[i] = 1
return d
def safeget(l, index, default="exception"): # listの中身を取り出す時、listからはみ出たり
if index >= len(l): # マイナスインデックスになったりするのを防ぐ
if default == "exception":
raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。配列の長さは", len(l), "です"]))
else:
return default
elif index < 0:
if default == "exception":
raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。負の値は許可されていません"]))
else:
return default
else:
return l[index]
def sortstr(s): # 文字列をソートする
return "".join(sorted(s))
def iip_ord(startcode="a"): # 文字列を数字の列に変換する(数字と文字は1:1対応)
if isinstance(startcode, str):
startcode = ord(startcode)
return [ord(i) - startcode for i in input()]
def YesNo(s): # TrueFalseや1, 0をYesNoに変換する
if s:
print("Yes")
else:
print("No")
def fprint(s): # リストを平たくしてprintする(二次元リストを見やすくしたりとか)
for i in s:
print(i)
def bitall(N): # ビット全探索用のインデックスを出力
ret = []
for i in range(2 ** N):
a = []
for j in range(N):
a.append(i % 2)
i //= 2
ret.append(a)
return ret
def split_print_space(s): # リストの中身をスペース区切りで出力する
print(" ".join([str(i) for i in s]))
def split_print_enter(s): # リストの中身を改行区切りで出力する
print("\n".join([str(i) for i in s]))
def soinsuu_bunkai(n): # 素因数分解
ret = []
for i in range(2, int(n ** 0.5) + 1):
while n % i == 0:
n //= i
ret.append(i)
if i > n:
break
if n != 1:
ret.append(n)
return ret
def conbination(n, r, mod, test=False): # nCrをmodを使って計算する
if n <= 0:
return 0
if r == 0:
return 1
if r < 0:
return 0
if r == 1:
return n
ret = 1
for i in range(n - r + 1, n + 1):
ret *= i
ret = ret % mod
bunbo = 1
for i in range(1, r + 1):
bunbo *= i
bunbo = bunbo % mod
ret = (ret * inv(bunbo, mod)) % mod
if test:
# print(f"{n}C{r} = {ret}")
pass
return ret
def inv(n, mod): # modnにおける逆元を計算
return power(n, mod - 2)
def power(n, p, mod_=mod): # 繰り返し二乗法でn**p % modを計算
if p == 0:
return 1
if p % 2 == 0:
return (power(n, p // 2, mod_) ** 2) % mod_
if p % 2 == 1:
return (n * power(n, p - 1, mod_)) % mod_
def nibutan_func(func, target, left, right, side="left"): # 関数を二分探索
l = left
r = right
while r-l > 1:
x = (l+r)//2
if func(x) == target:
return x
elif func(x) > target:
r = x
else:
l = x
if side == "left" or func(x) == target:
return l
else:
return r
def nibutan_list(list_, target, side="left"): # リストを二分探索
if not isinstance(list_, list):
list_ = list(list_)
l = 0
r = len(list_)
while r-l > 1:
x = (l+r)//2
if list_[x] == target:
return x
elif list_[x] > target:
r = x
else:
l = x
if side == "left" or list_[x] == target:
return l
else:
return r
if __name__ == "__main__":
main()
|
mod = 10 ** 9 + 7
mod2 = 2 ** 61 + 1
from collections import deque
import heapq
from bisect import bisect_left, insort_left, bisect_right
_NUMINT_ALL = list(range(10))
def main():
ans = solve()
if ans is True or ans is False:
YesNo(ans)
elif ans is not None:
print(ans)
def solve():
N, M = iip(False)
A = iipt(M)
d = {}
for p, s in A:
d[p] = [0, 0]
for p, s in A:
if d[p][1] == 1:
continue
elif s == "WA":
d[p][0] += 1
else:
d[p][1] = 1
e = 0
f = 0
for a, b in d.values():
if b == 0:
continue
e += a
f += b
split_print_space([f, e])
#####################################################ライブラリ集ここから
def kiriage_warizan(a, b):
return -(-a//b)
def iip(listed=True): # 数字のinputをlistで受け取る
d = input().split()
try:
ret = [int(i) for i in d]
except:
ret = [int(i) if i in _NUMINT_ALL else i for i in d]
if len(ret) == 1:
return ret[0]
if len(ret) == 1 and not listed:
return ret[0]
return ret
def iipt(l, listed=False, num_only=True): # 縦向きに並んでいるデータをリストに落とし込む(iip利用)
ret = []
for i in range(l):
ret.append(iip(listed=listed))
return ret
def saidai_kouyakusuu(A): # 最大公約数
l = len(A)
while True:
m = min(A)
mx = max(A)
if m == mx:
return m
for i in range(l):
if A[i] % m == 0:
A[i] = m
else:
A[i] %= m
def make_graph_edge_flat(N): # グラフ作成のための辺をリストで返す
ret = []
for i in range(N-1):
a, b, c = iip()
a -= 1
b -= 1
ret[a].append((b, c))
ret[b].append((a, c))
return ret
def sort_tuples(l, index): # タプルのリストを特定のインデックスでソートする
if isinstance(l, list):
l.sort(key=lambda x: x[index])
return l
else:
l = list(l)
return sorted(l, key=lambda x: x[index])
def count_elements(l): # リストの中身の個数を種類分けして辞書で返す
d = {}
for i in l:
if i in d:
d[i] += 1
else:
d[i] = 1
return d
def safeget(l, index, default="exception"): # listの中身を取り出す時、listからはみ出たり
if index >= len(l): # マイナスインデックスになったりするのを防ぐ
if default == "exception":
raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。配列の長さは", len(l), "です"]))
else:
return default
elif index < 0:
if default == "exception":
raise Exception("".join(["safegetに不正な値 ", index, "が渡されました。負の値は許可されていません"]))
else:
return default
else:
return l[index]
def sortstr(s): # 文字列をソートする
return "".join(sorted(s))
def iip_ord(startcode="a"): # 文字列を数字の列に変換する(数字と文字は1:1対応)
if isinstance(startcode, str):
startcode = ord(startcode)
return [ord(i) - startcode for i in input()]
def YesNo(s): # TrueFalseや1, 0をYesNoに変換する
if s:
print("Yes")
else:
print("No")
def fprint(s): # リストを平たくしてprintする(二次元リストを見やすくしたりとか)
for i in s:
print(i)
def bitall(N): # ビット全探索用のインデックスを出力
ret = []
for i in range(2 ** N):
a = []
for j in range(N):
a.append(i % 2)
i //= 2
ret.append(a)
return ret
def split_print_space(s): # リストの中身をスペース区切りで出力する
print(" ".join([str(i) for i in s]))
def split_print_enter(s): # リストの中身を改行区切りで出力する
print("\n".join([str(i) for i in s]))
def soinsuu_bunkai(n): # 素因数分解
ret = []
for i in range(2, int(n ** 0.5) + 1):
while n % i == 0:
n //= i
ret.append(i)
if i > n:
break
if n != 1:
ret.append(n)
return ret
def conbination(n, r, mod, test=False): # nCrをmodを使って計算する
if n <= 0:
return 0
if r == 0:
return 1
if r < 0:
return 0
if r == 1:
return n
ret = 1
for i in range(n - r + 1, n + 1):
ret *= i
ret = ret % mod
bunbo = 1
for i in range(1, r + 1):
bunbo *= i
bunbo = bunbo % mod
ret = (ret * inv(bunbo, mod)) % mod
if test:
# print(f"{n}C{r} = {ret}")
pass
return ret
def inv(n, mod): # modnにおける逆元を計算
return power(n, mod - 2)
def power(n, p, mod_=mod): # 繰り返し二乗法でn**p % modを計算
if p == 0:
return 1
if p % 2 == 0:
return (power(n, p // 2, mod_) ** 2) % mod_
if p % 2 == 1:
return (n * power(n, p - 1, mod_)) % mod_
def nibutan_func(func, target, left, right, side="left"): # 関数を二分探索
l = left
r = right
while r-l > 1:
x = (l+r)//2
if func(x) == target:
return x
elif func(x) > target:
r = x
else:
l = x
if side == "left" or func(x) == target:
return l
else:
return r
def nibutan_list(list_, target, side="left"): # リストを二分探索
if not isinstance(list_, list):
list_ = list(list_)
l = 0
r = len(list_)
while r-l > 1:
x = (l+r)//2
if list_[x] == target:
return x
elif list_[x] > target:
r = x
else:
l = x
if side == "left" or list_[x] == target:
return l
else:
return r
if __name__ == "__main__":
main()
|
[] | 605,705
| 605,706
|
u946996108
|
python
|
p02802
|
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
problems = [False] * N
AC = [0] * N
WA = [0] * N
for _ in range(M):
p, S = sr().split(); p = int(p) - 1
if not problems[p] and S == 'WA':
WA[p] += 1
if not problems[p] and S == 'AC':
problems[p] = True
AC += 1
AC_total = sum(AC)
WA_total = sum(y for x, y in zip(AC, WA) if x)
print(AC_total, WA_total)
|
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
problems = [False] * N
AC = [0] * N
WA = [0] * N
for _ in range(M):
p, S = sr().split(); p = int(p) - 1
if not problems[p] and S == 'WA':
WA[p] += 1
if not problems[p] and S == 'AC':
problems[p] = True
AC[p] += 1
AC_total = sum(AC)
WA_total = sum(y for x, y in zip(AC, WA) if x)
print(AC_total, WA_total)
|
[] | 605,720
| 605,721
|
u600402037
|
python
|
p02802
|
n, m = map(int, input().split())
lst = []
for _ in range(n):
lst.append([0, 0])
for _ in range(m):
p, s = input().split()
p = int(p)
if s == 'AC':
lst[p-1][0] = 1
elif lst[p-1][0] == 0:
lst[p-1][1] += 1
correct = 0
wrong = 0
for i in range(n):
correct += lst[i][0]
if lst[i][0] == 1:
wrong += lst[i][1]
print(correct, wrong)
print(lst)
|
n, m = map(int, input().split())
lst = []
for _ in range(n):
lst.append([0, 0])
for _ in range(m):
p, s = input().split()
p = int(p)
if s == 'AC':
lst[p-1][0] = 1
elif lst[p-1][0] == 0:
lst[p-1][1] += 1
correct = 0
wrong = 0
for i in range(n):
correct += lst[i][0]
if lst[i][0] == 1:
wrong += lst[i][1]
print(correct, wrong)
|
[
"call.remove"
] | 605,724
| 605,725
|
u745812846
|
python
|
p02802
|
n, m = [int(i) for i in input().split()]
ac = [0] * n
wa = [0] * n
for i in range(m):
p, s = input().split()
p = int(p)
if ac[p-1] == 0:
if s == "AC":
ac[p-1] = 1
elif s == "WA":
wa[p-1] += 1
wa_sum = 0
for i in range(n):
if ac[i] >= 1: wa_sum += wa[i]
print(sum(ac), sum_wa)
|
n, m = [int(i) for i in input().split()]
ac = [0] * n
wa = [0] * n
for i in range(m):
p, s = input().split()
p = int(p)
if ac[p-1] == 0:
if s == "AC":
ac[p-1] = 1
elif s == "WA":
wa[p-1] += 1
wa_sum = 0
for i in range(n):
if ac[i] >= 1: wa_sum += wa[i]
print(sum(ac), wa_sum)
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 605,729
| 605,730
|
u067694718
|
python
|
p02802
|
N,M=map(int,input().split())
AC =[0]*(N+1)
WA =[0]*(N+1)
for i in range(M):
p,q = input().split()
p = int(p)
if q == 'AC':
AC[p]=1
elif q =='WA'and AC[p]==0:
WA[p]+=1
for m in range(N+1):
if AC[m]==0:
WA[m]=0
print(sum(WA),sum(AC))
|
N,M=map(int,input().split())
AC =[0]*(N+1)
WA =[0]*(N+1)
for i in range(M):
p,q = input().split()
p = int(p)
if q == 'AC':
AC[p]=1
elif q =='WA'and AC[p]==0:
WA[p]+=1
for m in range(N+1):
if AC[m]==0:
WA[m]=0
print(sum(AC),sum(WA))
|
[
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 605,743
| 605,744
|
u016323272
|
python
|
p02802
|
N,M=map(int,input().split())
L=[0]*N
A=0
W=0
tmp=[0]*M
for i in range(M):
x,y=input().split()
t=int(x)
if L[t-1]==0:
if y=="WA":
tmp[t-1]+=1
else:
A+=1
W+=tmp[t-1]
L[t-1]=1
print(A,W)
|
N,M=map(int,input().split())
L=[0]*N
A=0
W=0
tmp=[0]*N
for i in range(M):
x,y=input().split()
t=int(x)
if L[t-1]==0:
if y=="WA":
tmp[t-1]+=1
else:
A+=1
W+=tmp[t-1]
L[t-1]=1
print(A,W)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 605,753
| 605,754
|
u527993431
|
python
|
p02802
|
N,M = list(map(int,input().split()))
A = ['a']*N
B = [0]*N
ans1 = 0
ans2 = 0
for i in range(M):
C,D = input().split()
C = int(C)-1
if A[C] == D == 'WA':
ans1 += 1
B[C] += 1
if A[C] == 'a' and D == 'WA':
ans1 += 1
B[C] += 1
if A[C] == 'WA' and D == 'AC':
ans2 += 1
A[C] = 'AC'
if A[C] == 'a' and D == 'AC':
ans2 += 1
A[C] = 'AC'
for i in range(N):
if A[i] == 'a':
ans1 -= B[i]
print('{0} {1}'.format(ans1,ans2))
|
N,M = list(map(int,input().split()))
A = ['a']*N
B = [0]*N
ans1 = 0
ans2 = 0
for i in range(M):
C,D = input().split()
C = int(C)-1
if A[C] == D == 'WA':
ans1 += 1
B[C] += 1
if A[C] == 'a' and D == 'WA':
ans1 += 1
B[C] += 1
if A[C] == 'WA' and D == 'AC':
ans2 += 1
A[C] = 'AC'
if A[C] == 'a' and D == 'AC':
ans2 += 1
A[C] = 'AC'
for i in range(N):
if A[i] == 'a':
ans1 -= B[i]
print('{0} {1}'.format(ans2,ans1))
|
[
"call.arguments.change",
"call.arguments.add"
] | 605,759
| 605,760
|
u514118270
|
python
|
p02802
|
n, m = list(map(int, input().split()))
ac_list = [0] * n
wa_list = [0] * n
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == "AC":
ac_list[p] = 1
if s == "WA":
if ac_list[p] == 0:
wa_list[p] += 1
for k in range(m):
if ac_list[k] == 0:
wa_list[k] = 0
print(sum(ac_list), sum(wa_list))
|
n, m = list(map(int, input().split()))
ac_list = [0] * n
wa_list = [0] * n
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if s == "AC":
ac_list[p] = 1
if s == "WA":
if ac_list[p] == 0:
wa_list[p] += 1
for k in range(n):
if ac_list[k] == 0:
wa_list[k] = 0
print(sum(ac_list), sum(wa_list))
|
[
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 605,769
| 605,770
|
u242196904
|
python
|
p02802
|
n,m=list(map(int,input().split()))
ac,wa=0,0
aclis=[0]*n
walis=[0]*n
for i in range(m):
p,s=input().split()
p = int(p)
if s == "AC" and aclis[p-1] == 0:
aclis[p-1] = 1
ac += 1
wa += wa[p-1]
elif s == "WA" and aclis[p-1] == 0:
wa[p-1] += 1
print(ac,wa)
|
n,m=list(map(int,input().split()))
ac,wa=0,0
aclis=[0]*n
walis=[0]*n
for i in range(m):
p,s=input().split()
p = int(p)
if s == "AC" and aclis[p-1] == 0:
aclis[p-1] = 1
ac += 1
wa += walis[p-1]
elif s == "WA" and aclis[p-1] == 0:
walis[p-1] += 1
print(ac,wa)
|
[
"identifier.change"
] | 605,771
| 605,772
|
u368579103
|
python
|
p02802
|
N, M = map(int, input().split())
Counted = [0 for _ in range(N)]
num1 = 0
num2 = 0
subnum2 = [0 for l in range(N)]
for j in range(M):
p, S = input().split()
p_ = int(p)
if S == "AC" and Counted[p_] == 0:
num1 += 1
num2 += subnum2[p_ - 1]
Counted[p_] = 1
elif S == "WA" and Counted[p_] == 0:
subnum2[p_ - 1] += 1
print("{} {}".format(num1, num2))
|
N, M = map(int, input().split())
Counted = [0 for _ in range(N)]
num1 = 0
num2 = 0
subnum2 = [0 for l in range(N)]
for j in range(M):
p, S = input().split()
p_ = int(p)
if S == "AC" and Counted[p_ -1] == 0:
num1 += 1
num2 += subnum2[p_ - 1]
Counted[p_ -1] = 1
elif S == "WA" and Counted[p_-1] == 0:
subnum2[p_ - 1] += 1
print("{} {}".format(num1, num2))
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 605,773
| 605,774
|
u870559097
|
python
|
p02802
|
n, m = map(int, input().split())
query = [tuple(input().split()) for _ in range(m)]
wa = [0] * n
ac = [0] * n
for p, result in query:
p = int(p) - 1
if result == 'AC':
ac[p] = 1
if result == 'WA':
if ac[p] == 0:
wa[p] += 1
accept = 0
penalty = 0
for i in range(n):
if ac[i]:
penalty += wa[p]
accept += 1
print(accept, penalty)
|
n, m = map(int, input().split())
query = [tuple(input().split()) for _ in range(m)]
wa = [0] * n
ac = [0] * n
for p, result in query:
p = int(p) - 1
if result == 'AC':
ac[p] = 1
if result == 'WA' and ac[p] == 0:
wa[p] += 1
accept = 0
penalty = 0
for i in range(n):
if ac[i]:
penalty += wa[i]
accept += 1
print(accept, penalty)
|
[
"identifier.change",
"variable_access.subscript.index.change"
] | 605,779
| 605,780
|
u955251526
|
python
|
p02802
|
n,m = map(int,input().split())
l=list(input().split() for _ in range(m))
w=[0]*n
a=[0]*n
seitou=0
pena=0
for i in l:
k=int(i[0])-1
if a[k]==0:
if i[1]=="AC":
a[k]+=1
else:
w[k]+=1
seitou=sum(a)
for j in range(n):
if a[i]==1:
pena+=w[i]
print(seitou,pena)
|
n,m = map(int,input().split())
l=list(input().split() for _ in range(m))
w=[0]*n
a=[0]*n
seitou=0
pena=0
for i in l:
k=int(i[0])-1
if a[k]==0:
if i[1]=="AC":
a[k]+=1
else:
w[k]+=1
seitou=sum(a)
for j in range(n):
if int(a[j])==1:
pena+=w[j]
print(seitou,pena)
|
[
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"identifier.change",
"variable_access.subscript.index.change"
] | 605,793
| 605,794
|
u449473917
|
python
|
p02802
|
N,M = map(int,input().split(" "))
L = [0] * M
for i in range(M):
L[i] = input().split(" ")
memoAC = [0] * N
memoWA = [0] * N
for list in L:
if list[1] == "AC":
memoAC[int(list[0])-1] = 1
else:
if memoAC[int(list[0])-1] != 1:
memoWA[int(list[0])-1] += 1
for j in range(N):
if memoAC[j] != 0:
memoWA[j] = 0
AC = sum(memoAC)
WA = sum(memoWA)
print(AC,WA)
|
N,M = map(int,input().split(" "))
L = [0] * M
for i in range(M):
L[i] = input().split(" ")
memoAC = [0] * N
memoWA = [0] * N
for list in L:
if list[1] == "AC":
memoAC[int(list[0])-1] = 1
else:
if memoAC[int(list[0])-1] != 1:
memoWA[int(list[0])-1] += 1
for j in range(N):
if memoAC[j] == 0:
memoWA[j] = 0
AC = sum(memoAC)
WA = sum(memoWA)
print(AC,WA)
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 605,809
| 605,810
|
u273496671
|
python
|
p02802
|
N,M = map(int,input().split())
AC = 0
penalty = 0
AC_list = [0]*N
WA_list = [0]*N
for i in range(M):
p,s = map(str,input().split())
p = int(p-1)
if s == "AC" and AC_list[p] == 0:
AC += 1
AC_list[p] = 1
penalty += WA_list[p]
elif s == "WA":
WA_list[p] += 1
if AC == N:
break
print(AC,penalty)
|
N,M = map(int,input().split())
AC = 0
penalty = 0
AC_list = [0]*N
WA_list = [0]*N
for i in range(M):
p,s = map(str,input().split())
p = int(p)-1
if s == "AC" and AC_list[p] == 0:
AC += 1
AC_list[p] = 1
penalty += WA_list[p]
elif s == "WA":
WA_list[p] += 1
if AC == N:
break
print(AC,penalty)
|
[
"call.arguments.change"
] | 605,811
| 605,812
|
u442877951
|
python
|
p02802
|
N, M = map(int, input().split())
PS = [input().split() for _ in range(M)]
AC = [False] * (N+1)
WA_cnt = [0] * (N+1)
ans = 0
pena = 0
print(PS)
for p, s in PS:
p = int(p)
if AC[p]:
continue
elif s == "WA":
WA_cnt[p] += 1
# pena = 1 これだと、AC確定時にpenalty加算されるというルールが守られない
elif s == "AC":
ans += 1
pena += WA_cnt[p]
AC[p] = True
print(ans, pena, sep=' ')
|
N, M = map(int, input().split())
PS = [input().split() for _ in range(M)]
AC = [False] * (N+1)
WA_cnt = [0] * (N+1)
ans = 0
pena = 0
for p, s in PS:
p = int(p)
if AC[p]:
continue
elif s == "WA":
WA_cnt[p] += 1
# pena = 1 これだと、AC確定時にpenalty加算されるというルールが守られない
elif s == "AC":
ans += 1
pena += WA_cnt[p]
AC[p] = True
print(ans, pena, sep=' ')
|
[
"call.remove"
] | 605,823
| 605,824
|
u362771726
|
python
|
p02802
|
N,M = map(int,input().split())
p = ['0']*M
S = ['0']*M
for i in range(M):
p[i],S[i]= map(str,input().split())
AC = [0]*(N+1)
WA = [0]*(N+1)
i = 0
for i in range(M):
if S[i] == 'WA':
if AC[int(p[i])] == 0:
WA[int(p[i])] = WA[int(p[i])]+1
else:
None
else:
AC[int(p[i])]=1
count = 0
for i in range(N+1):
if AC[i]==0:
count = count+WA[i]
print(sum(AC),sum(WA))
|
N,M = map(int,input().split())
p = ['0']*M
S = ['0']*M
for i in range(M):
p[i],S[i]= map(str,input().split())
AC = [0]*(N+1)
WA = [0]*(N+1)
i = 0
for i in range(M):
if S[i] == 'WA':
if AC[int(p[i])] == 0:
WA[int(p[i])] = WA[int(p[i])]+1
else:
None
else:
AC[int(p[i])]=1
count = 0
for i in range(N+1):
if AC[i]==0:
count = count+WA[i]
print(sum(AC),sum(WA)-count)
|
[
"expression.operation.binary.add"
] | 605,827
| 605,828
|
u119947188
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.