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 8
values |
|---|---|---|---|---|---|---|---|
p02689 | n, m = map(int, input().split())
high = list(map(int, input().split()))
judge = ["ok" for i in range(n)]
for i in range(m):
a, b = [int(s) - 1 for i in input().split()]
if high[a] < high[b]:
judge[a] = "ng"
elif high[a] > high[b]:
judge[b] = "ng"
else:
judge[a] = "ng"
... | n, m = map(int, input().split())
high = list(map(int, input().split()))
judge = ["ok" for i in range(n)]
for i in range(m):
a, b = [int(s) - 1 for s in input().split()]
if high[a] < high[b]:
judge[a] = "ng"
elif high[a] > high[b]:
judge[b] = "ng"
else:
judge[a] = "ng"
... | [
"assignment.value.change",
"identifier.change"
] | 422,829 | 422,830 | u126146165 | python |
p02689 | n, m = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
hs = [[] for i in range(n)]
for i in range(m):
a, b = [int(i) for i in input().split()]
hs[a-1].append(h[b-1])
hs[b-1].appned(h[a-1])
c = 0
for i in range(n):
if len(hs[i]) == 0:
c += 1
elif h[i] > max(hs[i]):
c += 1
print(... | n, m = [int(i) for i in input().split()]
h = [int(i) for i in input().split()]
hs = [[] for i in range(n)]
for i in range(m):
a, b = [int(i) for i in input().split()]
hs[a-1].append(h[b-1])
hs[b-1].append(h[a-1])
c = 0
for i in range(n):
if len(hs[i]) == 0:
c += 1
elif h[i] > max(hs[i]):
... | [
"identifier.change"
] | 422,833 | 422,834 | u711143961 | python |
p02689 | N, M = map(int, input().split())
O = list(map(int, input().split()))
B = [[] for i in range(N)]
for j in range(M):
o_1, o_2 = map(int, input().split())
B[o_1-1].append(o_2-1)
B[o_2-1].append(o_1-1)
print(B)
ans = 0
for node in range(N):
flag =1
for l in B[node]:
if O[node] <= O[l]:
flag = 0
... | N, M = map(int, input().split())
O = list(map(int, input().split()))
B = [[] for i in range(N)]
for j in range(M):
o_1, o_2 = map(int, input().split())
B[o_1-1].append(o_2-1)
B[o_2-1].append(o_1-1)
ans = 0
for node in range(N):
flag =1
for l in B[node]:
if O[node] <= O[l]:
flag = 0
if flag ==1... | [
"call.remove"
] | 422,837 | 422,838 | u471503862 | python |
p02689 | n, m = map(int, input().split())
H = list(map(int, input().split()))
ans = [1] * n
for i in range(m):
a, b = map(int, input().split())
if H[a-1]<H[b-1]:
ans[a-1] = 0
elif H[b-1]>H[a-1]:
ans[b-1] = 0
else:
ans[a-1], ans[b-1] = 0, 0
print(sum(ans))
| n, m = map(int, input().split())
H = list(map(int, input().split()))
ans = [1] * n
for i in range(m):
a, b = map(int, input().split())
if H[a-1]<H[b-1]:
ans[a-1] = 0
elif H[b-1]<H[a-1]:
ans[b-1] = 0
else:
ans[a-1], ans[b-1] = 0, 0
print(sum(ans))
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 422,842 | 422,843 | u641406334 | python |
p02689 | n,m = map(int, input().split())
hs = list(map(int, input().split()))
d = [1]*n
for i in range(m):
a,b = map(int, input().split())
if hs[a-1] <= hs[b-1]:
d[a-1] = 0
if hs[a-1] >= hs[b-1]:
d[b-1] = 0
print(hs,d)
print(d.count(1)) | n,m = map(int, input().split())
hs = list(map(int, input().split()))
d = [1]*n
for i in range(m):
a,b = map(int, input().split())
if hs[a-1] <= hs[b-1]:
d[a-1] = 0
if hs[a-1] >= hs[b-1]:
d[b-1] = 0
print(d.count(1)) | [
"call.remove"
] | 422,844 | 422,845 | u712322283 | python |
p02689 | N,M = map(int, input().split())
H = list(map(int,input().split()))
route = []
for i in range(N):
route.append([])
more_high = []
for i in range(N):
more_high.append([])
result = 0
for m in range(M):
a,b = map(int, input().split())
route[a-1].append(b-1)
route[b-1].append(a-1)
c = 0
f... | N,M = map(int, input().split())
H = list(map(int,input().split()))
route = []
for i in range(N):
route.append([])
more_high = []
for i in range(N):
more_high.append([])
result = 0
for m in range(M):
a,b = map(int, input().split())
route[a-1].append(b-1)
route[b-1].append(a-1)
c = 0
f... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 422,866 | 422,867 | u655833110 | python |
p02689 | import numpy as np
N, M = map(int, input().split())
H = list(map(int, input().split()))
yoi = np.ones(M)
for i in range(M):
A, B = map(int, input().split())
if H[A-1] > H[B-1]:
yoi[B-1] = 0
elif H[B-1] > H[A-1]:
yoi[A-1] = 0
elif H[A-1]==H[B-1]:
yoi[A-1] = 0
yoi[B-1] = 0
... | import numpy as np
N, M = map(int, input().split())
H = list(map(int, input().split()))
yoi = np.ones(N)
for i in range(M):
A, B = map(int, input().split())
if H[A-1] > H[B-1]:
yoi[B-1] = 0
elif H[B-1] > H[A-1]:
yoi[A-1] = 0
elif H[A-1]==H[B-1]:
yoi[A-1] = 0
yoi[B-1] = 0
... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 422,874 | 422,875 | u095384238 | python |
p02689 | n, m = (int(each) for each in input().split())
h = [int(each) for each in input().split()]
pathlist = list()
for i in range(m):
pathlist.append([int(each) for each in input().split()])
# print(pathlist)
score = 0
decklist = set(range(1, n+1))
for path in pathlist:
# もし道のうち前者が高ければ
if h[path[0]-1] >= h[path[... | n, m = (int(each) for each in input().split())
h = [int(each) for each in input().split()]
pathlist = list()
for i in range(m):
pathlist.append([int(each) for each in input().split()])
score = 0
decklist = set(range(1, n+1))
for path in pathlist:
# もし道のうち前者が高ければ
if h[path[0]-1] >= h[path[1]-1]:
# p... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 422,876 | 422,877 | u564655959 | python |
p02689 | n,m=map(int,input().split())
h=input().split()
r=[]
for i in range(m):
r.append([])
r[i]=input().split()
a=[1]*n
for i in range(m):
if int(h[int(r[i][0])-1])>int(h[int(r[i][1])-1]):
a[int(r[i][1])-1]="0"
elif int(h[int(r[i][0])-1])<int(h[int(r[i][1])-1]):
a[int(r[i][0])-1]="0"
elif int(h[int(r[i][0])-1])==int(... | n,m=map(int,input().split())
h=input().split()
r=[]
for i in range(m):
r.append([])
r[i]=input().split()
a=[1]*n
for i in range(m):
if int(h[int(r[i][0])-1])>int(h[int(r[i][1])-1]):
a[int(r[i][1])-1]="0"
elif int(h[int(r[i][0])-1])<int(h[int(r[i][1])-1]):
a[int(r[i][0])-1]="0"
elif int(h[int(r[i][0])-1])==int(... | [
"assignment.variable.change",
"identifier.change"
] | 422,882 | 422,883 | u445670279 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
r = [1] * len(H)
a = []
for i in range(M):
A, B = map(int, input().split())
if H[A - 1] > H[B - 1]:
r[B - 1] = 0
if H[B - 1] > H[A - 1]:
r[A - 1] = 0
print(r.count(1))
| N, M = map(int, input().split())
H = list(map(int, input().split()))
r = [1] * len(H)
a = []
for i in range(M):
A, B = map(int, input().split())
if H[A - 1] >= H[B - 1]:
r[B - 1] = 0
if H[B - 1] >= H[A - 1]:
r[A - 1] = 0
print(r.count(1))
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 422,884 | 422,885 | u186542450 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
AB = []
for _ in range(M):
AB.append(list(map(int, input().split())))
cnt = 0
new = [0 for i in range(N)]
for ab in AB:
if H[ab[0]-1] < H[ab[1]-1]:
new[ab[0]-1] += 1
if H[ab[0] - 1] > H[ab[1] - 1]:
new[ab[1]-1] += 1
print(n... | N, M = map(int, input().split())
H = list(map(int, input().split()))
AB = []
for _ in range(M):
AB.append(list(map(int, input().split())))
cnt = 0
new = [0 for i in range(N)]
for ab in AB:
if H[ab[0]-1] <= H[ab[1]-1]:
new[ab[0]-1] += 1
if H[ab[0] - 1] >= H[ab[1] - 1]:
new[ab[1]-1] += 1
print... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 422,886 | 422,887 | u022846086 | python |
p02689 | N,M=map(int,input().split())#M道の数，N展望台数
H=list(map(int,input().split()))
lists=[]
for i in range(M):
A,B=map(int,input().split())
list=[A,B]
lists.append([A,B])
list=[1]*N
for i in range(M-1):
if H[lists[i][0]-1]<H[lists[i][1]-1]:
list[lists[i][0]-1]=0
elif H[lists[i][0]-1]>H[lists[i][1]-1]:
list[list... | N,M=map(int,input().split())#M道の数，N展望台数
H=list(map(int,input().split()))
lists=[]
for i in range(M):
A,B=map(int,input().split())
list=[A,B]
lists.append([A,B])
list=[1]*N
for i in range(M):
if H[lists[i][0]-1]<H[lists[i][1]-1]:
list[lists[i][0]-1]=0
elif H[lists[i][0]-1]>H[lists[i][1]-1]:
list[lists[... | [
"expression.operation.binary.remove"
] | 422,888 | 422,889 | u685684561 | python |
p02689 | from collections import defaultdict
N, M = map(int, input().split())
H = list(map(int, input().split()))
adj = defaultdict(set)
for i in range(M):
a, b = map(int, input().split())
adj[a-1].add(H[b-1])
adj[b-1].add(H[a-1])
ans = 0
for i in range(N):
adj[H[i]].add(-1)
if H[i] > max(adj[H[i]]):
... | from collections import defaultdict
N, M = map(int, input().split())
H = list(map(int, input().split()))
adj = defaultdict(set)
for i in range(M):
a, b = map(int, input().split())
adj[a-1].add(H[b-1])
adj[b-1].add(H[a-1])
ans = 0
for i in range(N):
adj[i].add(-1)
if H[i] > max(adj[i]):
ans +... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 422,901 | 422,902 | u785213188 | python |
p02689 | n = list(map(int,input().split()))
m = list(map(int,input().split()))
a = []
kaku = []
for x in range(n[1]) :
a.append(list(map(int, input().split())))
kaku = [0]* len(m)
cou = 0
for x in range(n[1]):
if m[a[x][0] -1 ] > m[a[x][1] -1 ]:
kaku[a[x][0] -1 ] += 1
else:
kaku[a[x][0] - 1] -= 1
... | n = list(map(int,input().split()))
m = list(map(int,input().split()))
a = []
kaku = []
for x in range(n[1]) :
a.append(list(map(int, input().split())))
kaku = [0]* len(m)
cou = 0
for x in range(n[1]):
if m[a[x][0] -1 ] > m[a[x][1] -1 ]:
kaku[a[x][0] -1 ] += 1
else:
kaku[a[x][0] - 1] -= 10... | [
"literal.number.integer.change"
] | 422,909 | 422,910 | u930723367 | python |
p02689 | N,M = map(int, input().split())
H = list(map(int, input().split()))
loadJ = []
kekka = [True] * N
for i in range(M):
temp = list(map(int, input().split()))
loadJ.append(temp)
if H[temp[0] - 1] < H[temp[1] - 1]:
kekka[temp[0] - 1] = False
if H[temp[1] - 1] < H[temp[0] - 1]:
kekk... | N,M = map(int, input().split())
H = list(map(int, input().split()))
loadJ = []
kekka = [True] * N
for i in range(M):
temp = list(map(int, input().split()))
loadJ.append(temp)
if H[temp[0] - 1] <= H[temp[1] - 1]:
kekka[temp[0] - 1] = False
if H[temp[1] - 1] <= H[temp[0] - 1]:
ke... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 422,913 | 422,914 | u763291354 | python |
p02689 | n, m = map(int, input().split())
h = [int(i) for i in input().split()]
load = [list(map(int, input().split())) for _ in range(m)]
result = {i: 1 for i in range(n)}
for l in load:
a, b = l[0] - 1, l[1] - 1
if h[a] < h[b]:
result[a] = 0
elif h[a] > h[b]:
result[b] = 0
elif h[a] == h[b]:
... | n, m = map(int, input().split())
h = [int(i) for i in input().split()]
load = [list(map(int, input().split())) for _ in range(m)]
result = {i: 1 for i in range(n)}
for l in load:
a, b = l[0] - 1, l[1] - 1
if h[a] < h[b]:
result[a] = 0
elif h[a] > h[b]:
result[b] = 0
elif h[a] == h[b]:
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 422,921 | 422,922 | u729915102 | python |
p02689 | n = [int(e) for e in input().split(" ")]
d = []
c = 0
for e in input().split(" "):
d.append([(int(e)), []])
for _ in range(n[1]):
x = [int(e) - 1 for e in input().split(" ")]
d[x[0]][1].append(d[x[1]][0])
d[x[1]][1].append(x[0])
for e_d in d:
try:
m = max(e_d[1])
except:
m = -1
... | n = [int(e) for e in input().split(" ")]
d = []
c = 0
for e in input().split(" "):
d.append([(int(e)), []])
for _ in range(n[1]):
x = [int(e) - 1 for e in input().split(" ")]
d[x[0]][1].append(d[x[1]][0])
d[x[1]][1].append(d[x[0]][0])
for e_d in d:
try:
m = max(e_d[1])
except:
m ... | [] | 422,923 | 422,924 | u284744415 | python |
p02689 | import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
V = [True] * N
H = [int(v) for v in input().split()]
AB = [[int(v) - 1 for v in input().split()] for _ in range(M)]
for a, b in AB:
# if V[a] or V[b]:
if H[a] < H[b]:
V[a] = False
... | import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
V = [True] * N
H = [int(v) for v in input().split()]
AB = [[int(v) - 1 for v in input().split()] for _ in range(M)]
for a, b in AB:
# if V[a] or V[b]:
if H[a] <= H[b]:
V[a] = False
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 422,927 | 422,928 | u538817603 | python |
p02689 | N,M=map(int,input().split())
H=list(map(int,input().split()))
t=[1]*N
for i in range(M):
a,b=map(int,input().split())
if H[a-1]>H[b-1]:
t[b-1]=0
elif H[a-1]<H[b-1]:
t[a-1]=0
else:
t[a-1],a[b-1]=0,0
print(sum(t)) | N,M=map(int,input().split())
H=list(map(int,input().split()))
t=[1]*N
for i in range(M):
a,b=map(int,input().split())
if H[a-1]>H[b-1]:
t[b-1]=0
elif H[a-1]<H[b-1]:
t[a-1]=0
else:
t[a-1],t[b-1]=0,0
print(sum(t)) | [
"assignment.variable.change",
"identifier.change"
] | 422,933 | 422,934 | u387080888 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
d = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
d[a].append(b)
d[b].append(a)
cnt = 0
for i in range(n):
H = h[i]
max1 = 0
for j in d[i]:
max1 = max(max1,h[j])
if max1 > ... | n,m = map(int,input().split())
h = list(map(int,input().split()))
d = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
a,b = a-1,b-1
d[a].append(b)
d[b].append(a)
cnt = 0
for i in range(n):
H = h[i]
max1 = 0
for j in d[i]:
max1 = max(max1,h[j])
if H > max... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 422,937 | 422,938 | u252828980 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
good_H = [1] * N
for i in range(M):
A, B = map(int, input().split())
if H[A-1] < H[B-1]:
good_H[A-1] = 0
elif H[A-1] > H[B-1]:
good_H[B-1] = 0
print(good_H.count(1)) | N, M = map(int, input().split())
H = list(map(int, input().split()))
good_H = [1] * N
for i in range(M):
A, B = map(int, input().split())
if H[A-1] <= H[B-1]:
good_H[A-1] = 0
if H[A-1] >= H[B-1]:
good_H[B-1] = 0
print(good_H.count(1)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 422,941 | 422,942 | u195396655 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
a = b = [0]*m
for i in range(m):
a[i],b[i] = map(int,input().split())
sw = [1]*n
for i in range(m):
if h[a[i]-1] > h[b[i]-1]:
sw[b[i]-1] = 0
elif h[a[i]-1] < h[b[i]-1]:
sw[a[i]-1] = 0
else:
sw[a[i]-1] = 0
s... | n,m = map(int,input().split())
h = list(map(int,input().split()))
a = [0]*m
b = [0]*m
for i in range(m):
a[i],b[i] = map(int,input().split())
sw = [1]*n
for i in range(m):
if h[a[i]-1] > h[b[i]-1]:
sw[b[i]-1] = 0
elif h[a[i]-1] < h[b[i]-1]:
sw[a[i]-1] = 0
else:
sw[a[i]-1] = 0
... | [
"assignment.change"
] | 422,949 | 422,950 | u614181788 | python |
p02689 | n,m = map(int,input().split())
h = [int(x) for x in input().split()]
a = [0] * m
b = [0] * m
for i in range(m):
a[i],b[i] = map(int,input().split())
ind = []
for i in range(m):
if h[a[i]-1] < h[b[i]-1]:
ind.append(a[i])
elif h[a[i]-1] == h[b[i]-1]:
ind.append(a[i])
ind.append(b[i])
... | n,m = map(int,input().split())
h = [int(x) for x in input().split()]
a = [0] * m
b = [0] * m
for i in range(m):
a[i],b[i] = map(int,input().split())
ind = []
for i in range(m):
if h[a[i]-1] < h[b[i]-1]:
ind.append(a[i])
elif h[a[i]-1] == h[b[i]-1]:
ind.append(a[i])
ind.append(b[i])
... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 422,961 | 422,962 | u050805798 | python |
p02689 | n,m = map(int,input().split())
h = [int(x) for x in input().split()]
a = [0] * m
b = [0] * m
for i in range(m):
a[i],b[i] = map(int,input().split())
ind = []
for i in range(m):
if h[a[i]-1] < h[b[i]-1]:
ind.append(a[i])
elif h[a[i]-1] == h[b[i]-1]:
ind.append(a[i])
ind.append(b[i])
... | n,m = map(int,input().split())
h = [int(x) for x in input().split()]
a = [0] * m
b = [0] * m
for i in range(m):
a[i],b[i] = map(int,input().split())
ind = []
for i in range(m):
if h[a[i]-1] < h[b[i]-1]:
ind.append(a[i])
elif h[a[i]-1] == h[b[i]-1]:
ind.append(a[i])
ind.append(b[i])
... | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 422,963 | 422,962 | u050805798 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
C = [1]*(N)
for i in range(M):
a, b = map(int, input().split())
if H[a-1] >= H[b-1]:
H[b-1] = 0
if H[b-1] >= H[a-1]:
H[a-1] = 0
print(sum(C)) | N, M = map(int, input().split())
H = list(map(int, input().split()))
C = [1]*(N)
for i in range(M):
a, b = map(int, input().split())
if H[a-1] >= H[b-1]:
C[b-1] = 0
if H[b-1] >= H[a-1]:
C[a-1] = 0
print(sum(C)) | [
"assignment.variable.change",
"identifier.change"
] | 422,978 | 422,979 | u331997680 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
check = [True] * n #小さかったらfalseに
for i in range(m):
print(i)
a,b = (map(int,input().split()))
if h[a-1] > h[b-1]:
check[b-1] = False
elif h[a-1] < h[b-1]:
# print("i,check",i,check)
check[a-1] = False
else:
... | n,m = map(int,input().split())
h = list(map(int,input().split()))
check = [True] * n #小さかったらfalseに
for i in range(m):
#print(i)
a,b = (map(int,input().split()))
if h[a-1] > h[b-1]:
check[b-1] = False
elif h[a-1] < h[b-1]:
# print("i,check",i,check)
check[a-1] = False
else:
... | [
"call.remove"
] | 422,983 | 422,984 | u391675400 | python |
p02689 | co = list(map(int,input().split()))
N = co[0]
M = co[1]
h = list(map(int,input().split()))
tenbo = [0 for i in range(N)]
for i in range(M):
load = list(map(int,input().split()))
if h[load[0]-1] >= h[load[1]-1]:
tenbo[load[1]-1] +=1
elif h[load[0]-1] <= h[load[1]-1]:
tenbo[load[0]-1] +=1
ans... | co = list(map(int,input().split()))
N = co[0]
M = co[1]
h = list(map(int,input().split()))
tenbo = [0 for i in range(N)]
for i in range(M):
load = list(map(int,input().split()))
if h[load[0]-1] >= h[load[1]-1]:
tenbo[load[1]-1] +=1
if h[load[0]-1] <= h[load[1]-1]:
tenbo[load[0]-1] +=1
#... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 422,985 | 422,986 | u207397871 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
ma = [0]*(N+1)
cnt = 0
for _ in range(M):
a, b = map(int, input().split())
ma[a] = max(ma[a], H[b-1])
ma[b] = max(H[a-1], ma[b])
for i in range(1, N+1):
if H[i] > ma[i]:
cnt += 1
print(cnt) | N, M = map(int, input().split())
H = list(map(int, input().split()))
ma = [0]*(N+1)
cnt = 0
for _ in range(M):
a, b = map(int, input().split())
ma[a] = max(ma[a], H[b-1])
ma[b] = max(H[a-1], ma[b])
for i in range(1, N+1):
if H[i-1] > ma[i]:
cnt += 1
print(cnt) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 422,987 | 422,988 | u260036763 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split))
AB = [list(map(int, input().split)) for _ in range(M)]
neighbor_max_heights = [0] * N
for i in range(M):
a, b = AB[i]
neighbor_max_heights[b-1] = max(neighbor_max_heights[b-1], H[a-1])
neighbor_max_heights[a-1] = max(neighbor_max_heights[a... | N, M = map(int, input().split())
H = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
neighbor_max_heights = [0] * N
for i in range(M):
a, b = AB[i]
neighbor_max_heights[b-1] = max(neighbor_max_heights[b-1], H[a-1])
neighbor_max_heights[a-1] = max(neighbor_max_heigh... | [
"call.add"
] | 422,999 | 423,000 | u548545174 | python |
p02689 | n, m = map(int, input().split())
h = []
h = list(map(int, input().split()))
ans = [0]*n
for i in range(m):
a, b = map(int, input().split())
if h[a-1] > h[b-1]:
ans[b-1] = 1
if h[a-1] < h[b-1]:
ans[a-1] = 1
else:
ans[a-1] = 1
ans[b-1] = 1
print(ans.count(0)) | n, m = map(int, input().split())
h = []
h = list(map(int, input().split()))
ans = [0]*n
for i in range(m):
a, b = map(int, input().split())
if h[a-1] > h[b-1]:
ans[b-1] = 1
elif h[a-1] < h[b-1]:
ans[a-1] = 1
else:
ans[a-1] = 1
ans[b-1] = 1
print(ans.count(0)) | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add"
] | 423,003 | 423,004 | u231959533 | python |
p02689 | n, m = map(int, input().split())
h = []
h = list(map(int, input().split()))
ans = [0]*n
for i in range(m):
a, b = map(int, input().split())
if h[a-1] > h[b-1]:
ans[b-1] = 1
if h[a-1] < h[b-1]:
ans[a-1] = 1
else:
ans[a-1] = 1
ans[b-1] = 1
print(ans.count(1)) | n, m = map(int, input().split())
h = []
h = list(map(int, input().split()))
ans = [0]*n
for i in range(m):
a, b = map(int, input().split())
if h[a-1] > h[b-1]:
ans[b-1] = 1
elif h[a-1] < h[b-1]:
ans[a-1] = 1
else:
ans[a-1] = 1
ans[b-1] = 1
print(ans.count(0)) | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add",
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 423,005 | 423,004 | u231959533 | python |
p02689 | n,m=[int(_) for _ in input().split()]
H=[int(_) for _ in input().split()]
Hlist=[(set() for a in range(n))]
count=0
for a in range(m):
a,b=[int(_) for _ in input().split()]
Hlist[a-1].add(b-1)
Hlist[b-1].add(a-1)
for i,j in enumerate(Hlist):
flag=1
for a in j:
if H[a]>=H[i]:
flag... | n,m=[int(_) for _ in input().split()]
H=[int(_) for _ in input().split()]
Hlist=[set() for a in range(n)]
count=0
for a in range(m):
a,b=[int(_) for _ in input().split()]
Hlist[a-1].add(b-1)
Hlist[b-1].add(a-1)
for i,j in enumerate(Hlist):
flag=1
for a in j:
if H[a]>=H[i]:
flag=0... | [] | 423,008 | 423,009 | u535659144 | python |
p02689 | N, M = map(int,input().split())
H = list(map(int,input().split()))
ans = [1] * N
for i in range(M):
A, B = map(int, input().split())
if H[A - 1] <= H[B -1]:
ans[B - 1] = 0
elif H[A - 1] >= H[B - 1]:
ans[A - 1] = 0
print(sum(ans)) | N, M = map(int,input().split())
H = list(map(int,input().split()))
ans = [1] * N
for i in range(M):
A, B = map(int, input().split())
if H[A - 1] <= H[B -1]:
ans[A - 1] = 0
if H[A - 1] >= H[B - 1]:
ans[B - 1] = 0
print(sum(ans)) | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,013 | 423,014 | u939585142 | python |
p02689 | N, M = map(int,input().split())
H = list(map(int,input().split()))
ans = [1] * N
for i in range(M):
A, B = map(int, input().split())
if H[A - 1] <= H[B -1]:
ans[B - 1] = 0
elif H[A - 1] >= H[B - 1]:
ans[B - 1] = 0
print(sum(ans)) | N, M = map(int,input().split())
H = list(map(int,input().split()))
ans = [1] * N
for i in range(M):
A, B = map(int, input().split())
if H[A - 1] <= H[B -1]:
ans[A - 1] = 0
if H[A - 1] >= H[B - 1]:
ans[B - 1] = 0
print(sum(ans)) | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,015 | 423,014 | u939585142 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
preH =[]
for i in range(M):
preH.append(list(map(int, input().split())))
ans = [True]*N
for i in range(M):
A,B = preH[i]
if(H[A-1]>=H[B-1]):
ans[A-1] = False
if(H[B-1]>=H[A-1]):
ans[B-1] = False
print(ans.count(T... | N, M = map(int, input().split())
H = list(map(int, input().split()))
preH =[]
for i in range(M):
preH.append(list(map(int, input().split())))
ans = [True]*N
for i in range(M):
A,B = preH[i]
if(H[A-1]<=H[B-1]):
ans[A-1] = False
if(H[B-1]<=H[A-1]):
ans[B-1] = False
print(ans.count(True... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,016 | 423,017 | u208309047 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
preH = []
for i in range(M):
preH.append(list(map(int, input().split())))
ans = [True]*N
for i in range(M):
A,B = preH[i] #一行ずつ処理
if(H[A-1]>=H[B-1]):
ans[A-1] = False
if(H[B-1]>=H[A-1]):
ans[B-1] = False
print(ans.c... | N, M = map(int, input().split())
H = list(map(int, input().split()))
preH =[]
for i in range(M):
preH.append(list(map(int, input().split())))
ans = [True]*N
for i in range(M):
A,B = preH[i]
if(H[A-1]<=H[B-1]):
ans[A-1] = False
if(H[B-1]<=H[A-1]):
ans[B-1] = False
print(ans.count(True... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,018 | 423,017 | u208309047 | python |
p02689 | N,M=map(int, input().split())
yoi = []
for i in range(N):
yoi.append(True)
H=list(map(int, input().split()))
for i in ranage(M):
A,B=map(int, input().split())
if H[A-1]<=H[B-1]: yoi[A-1]=False
if H[B-1]<=H[A-1]: yoi[B-1]=False
print(len([1 for x in yoi if x==True])) | N,M=map(int, input().split())
yoi = []
for i in range(N):
yoi.append(True)
H=list(map(int, input().split()))
for i in range(M):
A,B=map(int, input().split())
if H[A-1]<=H[B-1]: yoi[A-1]=False
if H[B-1]<=H[A-1]: yoi[B-1]=False
print(len([1 for x in yoi if x==True])) | [
"identifier.change",
"call.function.change"
] | 423,019 | 423,020 | u252964975 | python |
p02689 | N,M = map(int,input().split())
H = list(map(int,input().split()))
bridge = [[] for i in range(N+1)]
for i in range(M):
A,B = map(int,input().split())
bridge[A].append(B)
bridge[B].append(A)
ans = 0
count = 0
for i in range(1,N+1):
tmp = bridge[i]
tmp = list(set(tmp))
flag = True
for j in... | N,M = map(int,input().split())
H = list(map(int,input().split()))
bridge = [[] for i in range(N+1)]
for i in range(M):
A,B = map(int,input().split())
bridge[A].append(B)
bridge[B].append(A)
ans = 0
count = 0
for i in range(1,N+1):
tmp = bridge[i]
tmp = list(set(tmp))
flag = True
for j in... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,023 | 423,024 | u698919163 | python |
p02689 | N,M = map(int, input().split())
H=list(map(int, input().split()))
h=[1 for _ in range(N)]
for i in range(M):
A=list(map(int, input().split()))
Ah = H[A[0]-1]
Bh = H[A[1]-1]
if Ah >= Bh:
h[A[1]-1]=0
else:
h[A[0]-1]=0
print(sum(h))
| N,M = map(int, input().split())
H=list(map(int, input().split()))
h=[1 for _ in range(N)]
for i in range(M):
A=list(map(int, input().split()))
Ah = H[A[0]-1]
Bh = H[A[1]-1]
if Ah >= Bh:
h[A[1]-1]=0
if Ah <= Bh:
h[A[0]-1]=0
print(sum(h))
| [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 423,029 | 423,030 | u746154235 | python |
p02689 | n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(0))
| n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(1))
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 423,039 | 423,040 | u067095357 | python |
p02689 | vn, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(0))
| n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(1))
| [
"assignment.variable.change",
"identifier.change",
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 423,041 | 423,040 | u067095357 | python |
p02689 | n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(0))
| n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(1))
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 423,042 | 423,040 | u067095357 | python |
p02689 | n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(0)) | n, m = list(map(int, input().split()))
hs = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
road = list(map(int, input().split()))
if hs[road[0]-1] <= hs[road[1]-1]:
ans[road[0]-1] = 0
if hs[road[0]-1] >= hs[road[1]-1]:
ans[road[1]-1] = 0
print(ans.count(1))
| [
"literal.number.integer.change",
"call.arguments.change",
"io.output.change"
] | 423,046 | 423,040 | u067095357 | python |
p02689 | n, m = map(int, input().rstrip().split())
h = map(int, input().rstrip().split())
l = []
high = [0] * n
count = 0
for i in range(m):
a, b = map(int, input().rstrip().split())
l.append([a, b])
for i in l:
if h[i[0]-1] < h[i[1]-1]:
high[i[0]-1] += 1
elif h[i[0]-1] == h[i[1]-1]:
high[i[0]-... | n, m = map(int, input().rstrip().split())
h = list(map(int, input().rstrip().split()))
l = []
high = [0] * n
count = 0
for i in range(m):
a, b = map(int, input().rstrip().split())
l.append([a, b])
for i in l:
if h[i[0]-1] < h[i[1]-1]:
high[i[0]-1] += 1
elif h[i[0]-1] == h[i[1]-1]:
high... | [
"call.add",
"call.arguments.change"
] | 423,053 | 423,054 | u749301160 | python |
p02689 | # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
to = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
print(a, b)
to[a].append(b)
to[b].append(a)
ans = 0
for i in range(n):
ok = True
for ... | # -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
h = list(map(int, input().split()))
to = [[] for i in range(n)]
for i in range(m):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
to[a].append(b)
to[b].append(a)
ans = 0
for i in range(n):
ok = True
for j in to[i]:
... | [
"call.remove"
] | 423,055 | 423,056 | u632094970 | python |
p02689 |
d = defaultdict(list)
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
for i in range(M):
a, b = list(map(int, input().split()))
d[a-1].append(b-1)
d[b-1].append(a-1)
ans = 0
for i in range(N):
ng = 0
if(i not in d):
ans += 1
continue
for j in d[i... | from collections import defaultdict
d = defaultdict(list)
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
for i in range(M):
a, b = list(map(int, input().split()))
d[a-1].append(b-1)
d[b-1].append(a-1)
ans = 0
for i in range(N):
ng = 0
if(i not in d):
ans += ... | [] | 423,061 | 423,062 | u985374340 | python |
p02689 | from collections import defaultdict
d = defaultdict(list)
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
for i in range(M):
a, b = list(map(int, input().split()))
d[a-1].append(b-1)
d[b-1].append(a-1)
ans = 0
for i in range(N):
ng = 0
if(i not in d):
ans += ... | from collections import defaultdict
d = defaultdict(list)
N, M = list(map(int, input().split()))
H = list(map(int, input().split()))
for i in range(M):
a, b = list(map(int, input().split()))
d[a-1].append(b-1)
d[b-1].append(a-1)
ans = 0
for i in range(N):
ng = 0
if(i not in d):
ans += ... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 423,063 | 423,062 | u985374340 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
ma = [0]*N
for i in range(M):
a, b = map(int, input().split())
ma[a-1] = max(ma[a-1], H[b-1])
ma[b-1] = max(ma[b-1], H[a-1])
ans = 0
for i in range(1, N):
if ma[i] < H[i]:
ans += 1
print(ans)
| N, M = map(int, input().split())
H = list(map(int, input().split()))
ma = [0]*N
for i in range(M):
a, b = map(int, input().split())
ma[a-1] = max(ma[a-1], H[b-1])
ma[b-1] = max(ma[b-1], H[a-1])
ans = 0
for i in range(N):
if ma[i] < H[i]:
ans += 1
print(ans) | [
"call.arguments.change"
] | 423,070 | 423,071 | u259861571 | python |
p02689 | N, M = map(int, input().split())
H = [int(x) for x in input().split()]
ifChecked = [0 for _ in range(N)]
path = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
# ここのindexには気をつける
path[A-1].append(B)
path[B-1].append(A)
count = 0
for i in range(1, N+1):
# このifCheckはLowestとし... | N, M = map(int, input().split())
H = [int(x) for x in input().split()]
ifChecked = [0 for _ in range(N)]
path = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int, input().split())
# ここのindexには気をつける
path[A-1].append(B)
path[B-1].append(A)
count = 0
for i in range(1, N+1):
# このifCheckはLowestとし... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,079 | 423,080 | u068727970 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
adj = [[] for i in range(n + 1)]
count = 0
def compare_height(adj, h, i):
height = h[i - 1]
if not adj[i]:
return False
for j in adj[i]:
if h[j - 1] > height:
return False
return True
#adj list
for i in ran... | n, m = map(int, input().split())
h = list(map(int, input().split()))
adj = [[] for i in range(n + 1)]
count = 0
def compare_height(adj, h, i):
height = h[i - 1]
if not adj[i]:
return True
for j in adj[i]:
if h[j - 1] >= height:
return False
return True
#adj list
for i in ran... | [
"misc.opposites",
"function.return_value.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,105 | 423,106 | u051915278 | python |
p02689 | import copy
n,m=map(int,input().split())
h=list(map(int,input().split()))
l=[]
for i in range(m):
a,b=map(int,input().split())
l.append([a,b])
ll=[0]*n
for j in l:
if h[j[0]-1]>h[j[1]-1]:
ll[j[1]-1]+=1
elif h[j[0]-1]==h[j[1]-1]:
ll[j[1]-1]+=1
ll[j[0]-1]+=1
else:
ll... | import copy
n,m=map(int,input().split())
h=list(map(int,input().split()))
l=[]
for i in range(m):
a,b=map(int,input().split())
l.append([a,b])
ll=[0]*n
for j in l:
if h[j[0]-1]>h[j[1]-1]:
ll[j[1]-1]+=1
elif h[j[0]-1]==h[j[1]-1]:
ll[j[1]-1]+=1
ll[j[0]-1]+=1
else:
ll... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 423,113 | 423,114 | u175746978 | python |
p02689 | ## import
## function definition
## main process
if __name__ == '__main__':
## input
N, M = map(int,input().split())
HEIGHT_LIST = list(map(int,input().split()))
ROAD_LIST = []
for j in range(M):
ROAD_LIST.append(
tuple(map(int,input().split()))
)
## bu... | ## import
## function definition
## main process
if __name__ == '__main__':
## input
N, M = map(int,input().split())
HEIGHT_LIST = list(map(int,input().split()))
ROAD_LIST = []
for j in range(M):
ROAD_LIST.append(
tuple(map(int,input().split()))
)
## bu... | [
"assignment.value.change",
"expression.operation.unary.arithmetic.remove"
] | 423,115 | 423,116 | u629614915 | python |
p02689 | N,M = list(map(int, input().split()))
hights = list(map(int, input().split()))
ans = [1]*N
for i in range(0,M):
a,b = list(map(int, input().split()))
if hights[a-1] > hights[b-1]:
ans[table[1]] = 0
elif hights[a-1] < hights[b-1]:
ans[a-1] = 0
else:
ans[a-1] = 0
ans[b-1] = 0
print(sum(ans))
... | N,M = list(map(int, input().split()))
hights = list(map(int, input().split()))
ans = [1]*N
for i in range(0,M):
a,b = list(map(int, input().split()))
if hights[a-1] > hights[b-1]:
ans[b-1] = 0
elif hights[a-1] < hights[b-1]:
ans[a-1] = 0
else:
ans[a-1] = 0
ans[b-1] = 0
print(sum(ans))
| [] | 423,119 | 423,120 | u315759831 | python |
p02689 | N, M= (int(x) for x in input().split())
height=[int(x) for x in input().split()]
nlist=[1]*N
for _ in range(M):
a, b =(int(x) for x in input().split())
a-=1
b-=1
if height[a]<height[b]:
nlist[a]=0
if height[b]<height[a]:
nlist[b]=0
print(sum(nlist)) | N, M= (int(x) for x in input().split())
height=[int(x) for x in input().split()]
nlist=[1]*N
for _ in range(M):
a, b =(int(x) for x in input().split())
a-=1
b-=1
if height[a]<=height[b]:
nlist[a]=0
if height[b]<=height[a]:
nlist[b]=0
print(sum(nlist)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,132 | 423,133 | u444481227 | python |
p02689 | i = input()
i = i.split(' ')
l = []
while len(l)<int(i[0]):
l += [0]
lim = int(i[1])
i = input()
i = i.split(' ')
for j in list(range(len(l))):
i[j]=int(i[j])
print(i)
count=0
while count<lim:
count += 1
k = input()
k = k.split(' ')
if i[int(k[0])-1]==i[int(k[1])-1]:
l[int(k[1])-1] = 1
... | i = input()
i = i.split(' ')
l = []
while len(l)<int(i[0]):
l += [0]
lim = int(i[1])
i = input()
i = i.split(' ')
for j in list(range(len(l))):
i[j]=int(i[j])
count=0
while count<lim:
count += 1
k = input()
k = k.split(' ')
if i[int(k[0])-1]==i[int(k[1])-1]:
l[int(k[1])-1] = 1
... | [
"call.remove"
] | 423,134 | 423,135 | u010379708 | python |
p02689 | n, m = map(int, input().split())
hs = list(map(int, input().split()))
ans = [1] * n
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
if hs[a] < hs[b]:
ans[a] = 0
elif hs[a] == hs[b]:
ans[a] = 0
ans[b] = 0
else:
ans[b] == 0
print(sum(ans)) | n, m = map(int, input().split())
hs = list(map(int, input().split()))
ans = [1] * n
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
if hs[a] < hs[b]:
ans[a] = 0
elif hs[a] == hs[b]:
ans[a] = 0
ans[b] = 0
else:
ans[b] = 0
print(sum(ans)) | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 423,138 | 423,139 | u701077471 | python |
p02689 | N, M = map(int, input().split())
H = [int(x) for x in input().split()]
A = [0] * M
B = [0] * M
F = [0] * N
for i in range(M):
A[i], B[i] = map(int, input().split())
F[A[i] - 1] = max(F[A[i] - 1], H[B[i] - 1])
F[B[i] - 1] = max(F[B[i] - 1], H[A[i] - 1])
ans = 0
for i in range(N):
if F[i] > H[i]:
... | N, M = map(int, input().split())
H = [int(x) for x in input().split()]
A = [0] * M
B = [0] * M
F = [0] * N
for i in range(M):
A[i], B[i] = map(int, input().split())
F[A[i] - 1] = max(F[A[i] - 1], H[B[i] - 1])
F[B[i] - 1] = max(F[B[i] - 1], H[A[i] - 1])
ans = 0
for i in range(N):
if F[i] < H[i]:
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,144 | 423,145 | u672054421 | python |
p02689 | N, M = map(int, input().split())
H = [int(x) for x in input().split()]
A = [0] * M
B = [0] * M
F = [0] * N
for i in range(M):
A[i], B[i] = map(int, input().split())
F[A[i] - 1] = max(F[A[i] - 1], H[B[i] - 1])
F[B[i] - 1] = max(F[B[i] - 1], H[A[i] - 1])
ans = 0
for i in range(N):
if F[i] >= H[i]:
... | N, M = map(int, input().split())
H = [int(x) for x in input().split()]
A = [0] * M
B = [0] * M
F = [0] * N
for i in range(M):
A[i], B[i] = map(int, input().split())
F[A[i] - 1] = max(F[A[i] - 1], H[B[i] - 1])
F[B[i] - 1] = max(F[B[i] - 1], H[A[i] - 1])
ans = 0
for i in range(N):
if F[i] < H[i]:
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,146 | 423,145 | u672054421 | python |
p02689 | N, M =map(int, input().split())
H_tree = [0] + [int(n) for n in input().split()]
GOOD_tree = [0] + [1 for n in range(N)]
for i in range(M):
A, B = map(int, input().split())
if H_tree[A]<=H_tree[B]:GOOD_Tree[A] = 0
if H_tree[A]>=H_tree[B]:GOOD_Tree[B] = 0
print(sum(GOOD_tree)) | N, M =map(int, input().split())
H_tree = [0] + [int(n) for n in input().split()]
GOOD_tree = [0] + [1 for n in range(N)]
for i in range(M):
A, B = map(int, input().split())
if H_tree[A]<=H_tree[B]:GOOD_tree[A] = 0
if H_tree[A]>=H_tree[B]:GOOD_tree[B] = 0
print(sum(GOOD_tree)) | [
"assignment.variable.change",
"identifier.change"
] | 423,147 | 423,148 | u929996201 | python |
p02689 | n,m = map(int,input().split())
h = list(map(int,input().split()))
q = [1]*1
for i in range(m):
a,b = map(int,input().split())
if h[a-1] < h[b-1]:
q[a-1] = 0
elif h[a-1] > h[b-1]:
q[b-1] = 0
else:
q[a-1] = 0
q[b-1] = 0
print(q.count(1)) | n,m = map(int,input().split())
h = list(map(int,input().split()))
q = [1]*n
for i in range(m):
a,b = map(int,input().split())
if h[a-1] < h[b-1]:
q[a-1] = 0
elif h[a-1] > h[b-1]:
q[b-1] = 0
else:
q[a-1] = 0
q[b-1] = 0
print(q.count(1)) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change"
] | 423,164 | 423,165 | u604412462 | python |
p02689 | N,M = map(int,input().split())
H = input().split()
good = [1]*N
import collections
for i in range(M):
a,b = map(int,input().split())
if int(H[a-1]) > int(H[b-1]):
good[b-1] = 0
elif int(H[a-1]) < int(H[b-1]):
good[b-1] = 0
else:
good[a-1] = 0
good[b-1] = 0
c = collections.Counter(good)
pri... | N,M = map(int,input().split())
H = input().split()
good = [1]*N
import collections
for i in range(M):
a,b = map(int,input().split())
if int(H[a-1]) > int(H[b-1]):
good[b-1] = 0
elif int(H[a-1]) < int(H[b-1]):
good[a-1] = 0
else:
good[a-1] = 0
good[b-1] = 0
c = collections.Counter(good)
pri... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 423,179 | 423,180 | u727051308 | python |
p02689 | n,m=map(int,input().split())
height = list(map(int,input().split()))
lst = [0] * n
for j in range(m):
a,b=map(int,input().split())
if height[a-1]<height[b-1]:
if height[b-1] == -1:
lst[a-1]=-1
else:
lst[a-1]=-1
lst[b-1]+=1
elif height[a-1]>height[b-1]:
if height[a-1]==-1:
lst[b... | n,m=map(int,input().split())
height = list(map(int,input().split()))
lst = [0] * n
for j in range(m):
a,b=map(int,input().split())
if height[a-1]<height[b-1]:
if lst[b-1] == -1:
lst[a-1]=-1
else:
lst[a-1]=-1
lst[b-1]+=1
elif height[a-1]>height[b-1]:
if lst[a-1]==-1:
lst[b-1]=-1... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 423,183 | 423,184 | u383450070 | python |
p02689 | n,m = map(int, input().split())
H = list(map(int, input().split()))
import collections
d = collections.defaultdict(list)
for i in range(m):
a,b = map(int, input().split())
d[a].append(b-1)
d[b].append(a-1)
ans = 0
for i in range(n):
s = list(set(d[i]))
#print('s',s)
if len(s) == 0:
ans +... | n,m = map(int, input().split())
H = list(map(int, input().split()))
import collections
d = collections.defaultdict(list)
for i in range(m):
a,b = map(int, input().split())
d[a-1].append(b-1)
d[b-1].append(a-1)
ans = 0
for i in range(n):
s = list(set(d[i]))
#print('l,s', d[i], s)
#print('s',s)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,197 | 423,198 | u488884575 | python |
p02689 | import numpy as np
N, M = map(int, input().split())
H = [int(i) for i in input().split()]
X = np.ones(N, np.bool)
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
if H[a] == H[b]:
X[a] = X[b] = False
elif H[a] < H[b]:
X[a] = False
else:
X[b] = False
prin... | import numpy as np
N, M = map(int, input().split())
H = [int(i) for i in input().split()]
X = np.ones(N, np.bool)
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
if H[a] == H[b]:
X[a] = X[b] = False
elif H[a] < H[b]:
X[a] = False
else:
X[b] = False
prin... | [
"call.remove"
] | 423,199 | 423,200 | u967106822 | python |
p02689 |
n, m = list(map(int, input().split(" ")))
h = list(map(int, input().split(" ")))
ans = [1] * n
for i in range(m):
a, b = list(map(int, input().split(" ")))
a,b = a-1,b-1
if h[a] < h[b]:
ans[a] = 0
elif h[b] < h[a]:
ans[b] = 0
else:
ans[a] = 0
ans[b] = 0
print(ans... |
n, m = list(map(int, input().split(" ")))
h = list(map(int, input().split(" ")))
ans = [1] * n
for i in range(m):
a, b = list(map(int, input().split(" ")))
a,b = a-1,b-1
if h[a] < h[b]:
ans[a] = 0
elif h[b] < h[a]:
ans[b] = 0
else:
ans[a] = 0
ans[b] = 0
print(ans... | [
"call.add"
] | 423,201 | 423,202 | u178465329 | python |
p02689 | N, M = map(int, input().split(" "))
Hs = list(map(int, input().split(" ")))
candidate = set(range(1, N+1))
for _ in range(M):
i, j = map(int, input().split(" "))
if Hs[i - 1] >= Hs[j - 1]:
# jは良い展望台ではない
candidate.discard(j)
elif Hs[j - 1] >= Hs[i - 1]:
# iは良い展望台ではない
candidate... | N, M = map(int, input().split(" "))
Hs = list(map(int, input().split(" ")))
candidate = set(range(1, N+1))
for _ in range(M):
i, j = map(int, input().split(" "))
if Hs[i - 1] >= Hs[j - 1]:
# jは良い展望台ではない
candidate.discard(j)
if Hs[j - 1] >= Hs[i - 1]:
# iは良い展望台ではない
candidate.d... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,221 | 423,222 | u465284486 | python |
p02689 | n,m=map(int, input().split())
h=list(map(int, input().split()))
arr=[0]*n
for i in range(m):
a,b=map(int, input().split())
if h[a-1]>h[b-1]:
if arr[a-1]!=-1:
arr[a-1]=1
arr[b-1]=-1
elif h[a-1]<h[b-1]:
if arr[a-1]!=-1:
arr[b-1]=1
arr[a-1]=-1
else:
... | n,m=map(int, input().split())
h=list(map(int, input().split()))
arr=[0]*n
for i in range(m):
a,b=map(int, input().split())
if h[a-1]>h[b-1]:
if arr[a-1]!=-1:
arr[a-1]=1
arr[b-1]=-1
elif h[a-1]<h[b-1]:
if arr[b-1]!=-1:
arr[b-1]=1
arr[a-1]=-1
else:
... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 423,229 | 423,230 | u669173971 | python |
p02689 | list1=list(map(int,input().strip().split()))[:2]
n,m=list1[0],list1[1]
arr=list(map(int,input().strip().split()))[:n]
dict1={}
for i in range(m):
l=list(map(int,input().strip().split()))[:2]
key,val=l[0],l[1]
if key in dict1:
dict1[key].append(val)
else:
dict1[key]=[]
dict1[key].append(val)
if val in dict1:
... | list1=list(map(int,input().strip().split()))[:2]
n,m=list1[0],list1[1]
arr=list(map(int,input().strip().split()))[:n]
dict1={}
for i in range(m):
l=list(map(int,input().strip().split()))[:2]
key,val=l[0],l[1]
if key in dict1:
dict1[key].append(val)
else:
dict1[key]=[]
dict1[key].append(val)
if val in dict1:
... | [
"call.remove"
] | 423,240 | 423,241 | u065994196 | python |
p02689 |
def main():
NM = list(map(int,input().split()))
H = list(map(int,input().split()))
# AB = [list(map(int,input().split())) for i in range(NM[1])]
Judge = [True] * NM[0]
for i in range(NM[1]):
ABi = list(map(int,input().split()))
if H[ABi[0]-1] > H[ABi[1]-1]:
if Judg... |
def main():
NM = list(map(int,input().split()))
H = list(map(int,input().split()))
# AB = [list(map(int,input().split())) for i in range(NM[1])]
Judge = [True] * NM[0]
for i in range(NM[1]):
ABi = list(map(int,input().split()))
if H[ABi[0]-1] > H[ABi[1]-1]:
if Judg... | [
"call.remove"
] | 423,247 | 423,248 | u282652245 | python |
p02689 | N,M = map(int, input().split())
H=list(map(int, input().split()))
A=[]
B=[]
for i in range(M):
A1,B1=map(int, input().split())
A.append(A1)
B.append(B1)
miti={}
for i in range(M):
if A[i] in miti:
miti[A[i]].append(H[B[i]-1])
else:
miti[A[i]]=[]
miti[A[i]].append(... | N,M = map(int, input().split())
H=list(map(int, input().split()))
A=[]
B=[]
for i in range(M):
A1,B1=map(int, input().split())
A.append(A1)
B.append(B1)
miti={}
for i in range(M):
if A[i] in miti:
miti[A[i]].append(H[B[i]-1])
else:
miti[A[i]]=[]
miti[A[i]].append(... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 423,251 | 423,252 | u959307673 | python |
p02689 | N,M = map(int, input().split())
H=list(map(int, input().split()))
A=[]
B=[]
for i in range(M):
A1,B1=map(int, input().split())
A.append(A1)
B.append(B1)
miti={}
for i in range(M):
if A[i] in miti:
miti[A[i]].append(H[B[i]-1])
else:
miti[A[i]]=[]
miti[A[i]].append(... | N,M = map(int, input().split())
H=list(map(int, input().split()))
A=[]
B=[]
for i in range(M):
A1,B1=map(int, input().split())
A.append(A1)
B.append(B1)
miti={}
for i in range(M):
if A[i] in miti:
miti[A[i]].append(H[B[i]-1])
else:
miti[A[i]]=[]
miti[A[i]].append(... | [
"identifier.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,253 | 423,252 | u959307673 | python |
p02689 | def main():
n, m = map(int, input().strip().split())
h = list(map(int, input().strip().split()))
flg = [True] * n
for i in range(m):
a, b = map(int, input().strip().split())
if(h[a-1]<h[b-1]):
flg[a-1] = False
elif(h[a-1]<h[b-1]):
flg[b-1] = False
... | def main():
n, m = map(int, input().strip().split())
h = list(map(int, input().strip().split()))
flg = [True] * n
for i in range(m):
a, b = map(int, input().strip().split())
if(h[a-1]<h[b-1]):
flg[a-1] = False
elif(h[a-1]>h[b-1]):
flg[b-1] = False
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,261 | 423,262 | u122557211 | python |
p02689 | from collections import deque
N, M = map(int, input().split())
hight = list(input().split())
hight = [int(hight[i]) for i in range(N)]
G = [deque([]) for i in range(N+1)]
road = [input().split() for i in range(M)]
for i in range(M):
G[int(road[i][0])].append(int(road[i][1]))
G[int(road[i][1]) - 1].append(... | from collections import deque
N, M = map(int, input().split())
hight = list(input().split())
hight = [int(hight[i]) for i in range(N)]
G = [deque([]) for i in range(N+1)]
road = [input().split() for i in range(M)]
for i in range(M):
G[int(road[i][0])].append(int(road[i][1]))
G[int(road[i][1])].append(int(... | [
"expression.operation.binary.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,263 | 423,264 | u637918426 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
N_addj = [[] for i in range(N)]
for i in range(M):
AB = list(map(int, input().split()))
N_addj[AB[0]-1].append(AB[1]-1)
N_addj[AB[1]-1].append(AB[0]-1)
N_memo = [0] * N
num = 0
arr = []
print(H)
for i in range(N):
flag = Tru... | N, M = map(int, input().split())
H = list(map(int, input().split()))
N_addj = [[] for i in range(N)]
for i in range(M):
AB = list(map(int, input().split()))
N_addj[AB[0]-1].append(AB[1]-1)
N_addj[AB[1]-1].append(AB[0]-1)
N_memo = [0] * N
num = 0
arr = []
for i in range(N):
flag = True
for ... | [
"call.remove"
] | 423,267 | 423,268 | u518242261 | python |
p02689 | n,m = map(int,input().split())
ans = [1]*n
h = input().split()
h_int = [int(s) for s in h]
cou = 0
for i in range(m):
x,y = map(int,input().split())
if h_int[x-1] >= h_int[y-1]:
ans[y-1] = 0
elif h_int[y-1] >= h_int[x-1]:
ans[x-1] = 0
for i in range(n):
if ans[i] == 1:
cou += 1
print(cou)
| n,m = map(int,input().split())
ans = [1]*n
h = input().split()
h_int = [int(s) for s in h]
cou = 0
for i in range(m):
x,y = map(int,input().split())
if h_int[x-1] >= h_int[y-1]:
ans[y-1] = 0
if h_int[y-1] >= h_int[x-1]:
ans[x-1] = 0
for i in range(n):
if ans[i] == 1:
cou += 1
print(cou)
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,286 | 423,287 | u969639186 | python |
p02689 | n,m = map(int,input().split())
ans = [1]*n
h = input().split()
h_int = [int(s) for s in h]
cou = 0
for i in range(m):
x,y = map(int,input().split())
if h_int[x-1] >= h_int[y-1]:
ans[y-1] = 0
elif h_int[y-1] >= h_int[x-1]:
ans[x-1] = 0
for i in range(n):
if ans[i] == 1:
cou += 1
print(cou) | n,m = map(int,input().split())
ans = [1]*n
h = input().split()
h_int = [int(s) for s in h]
cou = 0
for i in range(m):
x,y = map(int,input().split())
if h_int[x-1] >= h_int[y-1]:
ans[y-1] = 0
if h_int[y-1] >= h_int[x-1]:
ans[x-1] = 0
for i in range(n):
if ans[i] == 1:
cou += 1
print(cou)
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,288 | 423,287 | u969639186 | python |
p02689 | def solve():
N,M = map(int, input().split())
H = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
graph = [[] for _1 in range(N)]
for a,b in AB:
graph[a-1].append(b)
graph[b-1].append(a)
ans = 0
for i in range(N):
height = H[i... | def solve():
N,M = map(int, input().split())
H = list(map(int, input().split()))
AB = [list(map(int, input().split())) for _ in range(M)]
graph = [[] for _1 in range(N)]
for a,b in AB:
graph[a-1].append(b)
graph[b-1].append(a)
ans = 0
#print(graph)
for i in range(N):
... | [
"expression.operation.binary.remove"
] | 423,303 | 423,304 | u136843617 | python |
p02689 | N,M=map(int,input().split())
H=list(map(int,input().split()))
A,B=[0]*M,[0]*M
for i in range(M):
A[i],B[i]=map(int,input().split())
lst=[1]*N
for i in range(M):
if H[A[i]-1]<H[B[i]-1]:
lst[A[i]-1]=0
if H[A[i]-1]>H[B[i]-1]:
lst[B[i]-1]=0
print(sum(lst)) | N,M=map(int,input().split())
H=list(map(int,input().split()))
A,B=[0]*M,[0]*M
for i in range(M):
A[i],B[i]=map(int,input().split())
lst=[1]*N
for i in range(M):
if H[A[i]-1]<=H[B[i]-1]:
lst[A[i]-1]=0
if H[A[i]-1]>=H[B[i]-1]:
lst[B[i]-1]=0
print(sum(lst)) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,319 | 423,320 | u798675549 | python |
p02689 | n,m = map(int,input().split())
height = list(map(int,input().split()))
# print(height)
bridge = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
bridge[a-1].append(b-1)
bridge[b-1].append(a-1)
# print(bridge)
good = [None for i in range(n)]
# print(good)
flag = True
for i in range(n):
fla... | n,m = map(int,input().split())
height = list(map(int,input().split()))
# print(height)
bridge = [[] for i in range(n)]
for i in range(m):
a,b = map(int,input().split())
bridge[a-1].append(b-1)
bridge[b-1].append(a-1)
# print(bridge)
good = [None for i in range(n)]
# print(good)
flag = True
for i in range(n):
fla... | [
"call.remove"
] | 423,321 | 423,322 | u153846982 | python |
p02689 | N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [0]*M
B = [0]*M
for i in range(M):
A[i], B[i] = map(int, input().split())
A[i] -= 1
B[i] -= 1
lis = [0]*N
for i in range(M):
if H[A[i]] >= H[B[i]]:
lis[B[i]] = 1
if H[A[i]] <= H[B[i]]:
lis[A[i]] = 1
pr... | N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [0]*M
B = [0]*M
for i in range(M):
A[i], B[i] = map(int, input().split())
A[i] -= 1
B[i] -= 1
lis = [0]*N
for i in range(M):
if H[A[i]] >= H[B[i]]:
lis[B[i]] = -1
if H[A[i]] <= H[B[i]]:
lis[A[i]] = -1
... | [
"expression.operation.unary.add"
] | 423,344 | 423,345 | u809816772 | python |
p02689 | N,M = map(int,input().split())
listH = list(map(int,input().split()))
LofS = [set() for i in range(N) ]
for i in range(M):
a,b=map(int,input().split())
LofS[a-1].add(b)
LofS[b-1].add(a)
listMax = []
for i in range(N):
listMax.append( max( [ listH[j-1] for j in LofS[i] ] , default=0) )
print(listMax)
count = 0
... | N,M = map(int,input().split())
listH = list(map(int,input().split()))
LofS = [set() for i in range(N) ]
for i in range(M):
a,b=map(int,input().split())
LofS[a-1].add(b)
LofS[b-1].add(a)
listMax = []
for i in range(N):
listMax.append( max( [ listH[j-1] for j in LofS[i] ] , default=0) )
count = 0
for i in range(... | [
"call.remove"
] | 423,352 | 423,353 | u071695942 | python |
p02689 | N, M = map(int, input().split())
H = [int(h) for h in input().split()]
ans = [1] * N
# print(H)
for i in range(M):
a, b = map(int, input().split())
AH = H[a - 1]
BH = H[b - 1]
# print(AH, BH)
if AH >= BH:
ans[b - 1] = 0
elif BH >= AH:
ans[a - 1] = 0
print(ans.count(1))
| N, M = map(int, input().split())
H = [int(h) for h in input().split()]
ans = [1] * N
# print(H)
for i in range(M):
a, b = map(int, input().split())
AH = H[a - 1]
BH = H[b - 1]
# print(AH, BH)
if AH >= BH:
ans[b - 1] = 0
if BH >= AH:
ans[a - 1] = 0
print(ans.count(1))
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,354 | 423,355 | u596681540 | python |
p02689 | N, M = map(int, input().split())
H = [int(h) for h in input().split()]
ans = [1] * N
# print(H)
for i in range(M):
a, b = map(int, input().split())
AH = H[a - 1]
BH = H[b - 1]
if AH >= BH:
ans[b - 1] = 0
elif BH >= AH:
ans[a - 1] = 0
print(ans.count(1))
| N, M = map(int, input().split())
H = [int(h) for h in input().split()]
ans = [1] * N
# print(H)
for i in range(M):
a, b = map(int, input().split())
AH = H[a - 1]
BH = H[b - 1]
# print(AH, BH)
if AH >= BH:
ans[b - 1] = 0
if BH >= AH:
ans[a - 1] = 0
print(ans.count(1))
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,356 | 423,355 | u596681540 | python |
p02689 | def main():
n,m = map(int,input().split())
h = list(map(int,input().split()))
A = [0] * n
for i in range(m):
a,b = map(int,input().split())
A[a-1] = max(A[a-1],h[b-1])
A[b-1] = max(A[b-1],h[a-1])
cnt = 0
for i in range(n):
if A[i] > h[i]:
cnt += 1
... | def main():
n,m = map(int,input().split())
h = list(map(int,input().split()))
A = [0] * n
for i in range(m):
a,b = map(int,input().split())
A[a-1] = max(A[a-1],h[b-1])
A[b-1] = max(A[b-1],h[a-1])
cnt = 0
for i in range(n):
if A[i] < h[i]:
cnt += 1
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,359 | 423,360 | u548123110 | python |
p02689 | N, M = map(int, input().split())
H = [int(h) for h in input().split()]
Max = [h-1 for h in H]
for _ in range(M):
ab = [int(_ab)-1 for _ab in input().split()]
Max[ab[0]] = max(Max[ab[0]], Max[ab[1]])
Max[ab[1]] = max(Max[ab[0]], Max[ab[1]])
cnt = 0
for n in range(N):
if H[n] > Max[n]:
cnt += 1
... | N, M = map(int, input().split())
H = [int(h) for h in input().split()]
Max = [h-1 for h in H]
for _ in range(M):
ab = [int(_ab)-1 for _ab in input().split()]
Max[ab[0]] = max(Max[ab[0]], H[ab[1]])
Max[ab[1]] = max(H[ab[0]], Max[ab[1]])
cnt = 0
for n in range(N):
if H[n] > Max[n]:
cnt += 1
prin... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 423,363 | 423,364 | u722148122 | python |
p02689 | N, M =map(int, input().split())
H_tree =[0]+[int(n) for n in input().split()]
GOOD_Tree = [0]+[1 for n in range(N)]
for i in range(M):
A, B = map(int, input().split())
if H_tree[A]>=H_tree[B]:GOOD_Tree[A] = 0
if H_tree[A]<=H_tree[B]:GOOD_Tree[B] = 0
print(sum(GOOD_Tree)) | N, M =map(int, input().split())
H_tree =[0]+[int(n) for n in input().split()]
GOOD_Tree = [0]+[1 for n in range(N)]
for i in range(M):
A, B = map(int, input().split())
if H_tree[A]<=H_tree[B]:GOOD_Tree[A] = 0
if H_tree[A]>=H_tree[B]:GOOD_Tree[B] = 0
print(sum(GOOD_Tree)) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 423,368 | 423,369 | u382169668 | python |
p02689 | import numpy as np
N,M = [int(i) for i in input().split(" ")]
H = [int(i) for i in input().split(" ")]
mh = np.zeros([N])
for i in range(M):
a,b = [int(i)-1 for i in input().split(" ")]
mh[a] = max(mh[a],h[b])
mh[b] = max(mh[b],h[a])
ans = 0
for i in range(N):
if mh[i] < h[i]:
ans += 1
print(... | import numpy as np
N,M = [int(i) for i in input().split(" ")]
H = [int(i) for i in input().split(" ")]
mh = np.zeros([N])
for i in range(M):
a,b = [int(i)-1 for i in input().split(" ")]
mh[a] = max(mh[a],H[b])
mh[b] = max(mh[b],H[a])
ans = 0
for i in range(N):
if mh[i] < H[i]:
ans += 1
print(... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 423,379 | 423,380 | u264113350 | python |
p02689 | int1 = lambda x: int(x) - 1
N, M = map(int, input().split())
H = list(map(int, input().split()))
nei = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int1, input().split())
nei[A].append(B)
nei[B].append(A)
good = [True] * N
for i in range(N):
if good[i]:
for n in nei[i]:
i... | int1 = lambda x: int(x) - 1
N, M = map(int, input().split())
H = list(map(int, input().split()))
nei = [[] for _ in range(N)]
for _ in range(M):
A, B = map(int1, input().split())
nei[A].append(B)
nei[B].append(A)
good = [True] * N
for i in range(N):
if good[i]:
for n in nei[i]:
i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 423,392 | 423,393 | u886747123 | python |
p02689 | from heapq import heappush, heappop
def main():
N, M = [int(v) for v in input().split()]
H = [int(v) for v in input().split()]
link = [0] * N
for _ in range(M):
a, b = [int(v) - 1 for v in input().split()]
link[a] = max(link[a], H[b])
link[b] = max(link[b], H[a])
count ... | from heapq import heappush, heappop
def main():
N, M = [int(v) for v in input().split()]
H = [int(v) for v in input().split()]
link = [0] * N
for _ in range(M):
a, b = [int(v) - 1 for v in input().split()]
link[a] = max(link[a], H[b])
link[b] = max(link[b], H[a])
count ... | [
"call.remove"
] | 423,394 | 423,395 | u006883624 | python |
p02689 | # C
N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [0] * N
for i in range(M):
a, b = map(int, input().split())
A[a-1] = max(A[a-1], H[b-1])
A[b-1] = max(A[b-1], H[a-1])
res = sum([H[i] >= A[i] for i in range(N)])
print(res) | # C
N, M = map(int, input().split())
H = list(map(int, input().split()))
A = [0] * N
for i in range(M):
a, b = map(int, input().split())
A[a-1] = max(A[a-1], H[b-1])
A[b-1] = max(A[b-1], H[a-1])
res = sum([H[i] > A[i] for i in range(N)])
print(res) | [
"expression.operator.compare.change",
"assignment.value.change",
"call.arguments.change"
] | 423,398 | 423,399 | u609307781 | python |
p02689 |
i = list(map(int, input().split()))
j = list(map(int, input().split()))
lis=[]
ans = 0
for a in range (i[0]):
tendata=[a+1,j[a],0]
lis.append(tendata)
for b in range(i[1]):
miti = list(map(int, input().split()))
if ((lis[miti[0]-1][1]) > (lis[miti[1]-1][1])):
lis[miti[1]-1][2] = 1
... |
i = list(map(int, input().split()))
j = list(map(int, input().split()))
lis=[]
ans = 0
for a in range (i[0]):
tendata=[a+1,j[a],0]
lis.append(tendata)
for b in range(i[1]):
miti = list(map(int, input().split()))
if ((lis[miti[0]-1][1]) > (lis[miti[1]-1][1])):
lis[miti[1]-1][2] = 1
... | [
"call.remove"
] | 423,414 | 423,415 | u892615201 | python |
p02689 | n,m=map(int, input().split())
h = list(map(int, input().split()))
l = [input().split() for i in range(m)]
list = [0]*n
for j in range(m):
if h[int(l[j][0])-1] > h[int(l[j][1])-1]:
list[int(l[j][1])-1] -= 1
elif h[int(l[j][0])-1] < h[int(l[j][1])-1]:
list[int(l[j][0])-1] -= 1
else :
... | n,m=map(int, input().split())
h = list(map(int, input().split()))
l = [input().split() for i in range(m)]
list = [0]*n
for j in range(m):
if h[int(l[j][0])-1] > h[int(l[j][1])-1]:
list[int(l[j][1])-1] -= 1
elif h[int(l[j][0])-1] < h[int(l[j][1])-1]:
list[int(l[j][0])-1] -= 1
else :
... | [
"call.remove"
] | 423,416 | 423,417 | u453623947 | python |
p02689 | n,m = map(int, input().split())
h = list(map(int, input().split()))
n = [i for i in range(n)]
for i in range(m):
a,b = map(int, input().split())
if h[a-1] > h[b-1]:
n[b-1]=0
elif h[a-1]<h[b-1]:
n[a-1]=0
else:
n[a-1]=0
n[b-1]=0
print(sum(n)) | n,m = map(int, input().split())
h = list(map(int, input().split()))
n = [1 for i in range(n)]
for i in range(m):
a,b = map(int, input().split())
if h[a-1] > h[b-1]:
n[b-1]=0
elif h[a-1]<h[b-1]:
n[a-1]=0
else:
n[a-1]=0
n[b-1]=0
print(sum(n)) | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 423,424 | 423,425 | u752414478 | python |
p02689 | n,m = list(map(int,input().split() ))
h = list(map(int,input().split() ))
# 要素n が全てTrueの配列
good = [True] * n
for im in range(m):
a,b = list(map(int,input().split()))
if h[a-1] > h[b-1]:
good[b] = False
elif h[b-1] > h[a-1]:
good[a-1] = False
else:
good[a-1] = False
good... | n,m = list(map(int,input().split()))
h = list(map(int,input().split()))
# 要素n が全てTrueの配列
good = [True] * n
for im in range(m):
a,b = list(map(int,input().split()))
if h[a-1] > h[b-1]:
good[b-1] = False
elif h[b-1] > h[a-1]:
good[a-1] = False
else:
good[a-1] = False
good... | [
"assignment.change"
] | 423,428 | 423,429 | u307418002 | python |
p02689 |
N, M = map(int,input().split())
H = list(map(int, input().split()))
arr = [list(map(int, input().split())) for i in range(M)]
highest_tenbo = [0 for i in range(N)]
for a, b in arr:
highest_tenbo[a-1] = max(highest_tenbo[a-1], H[b-1])
highest_tenbo[b-1] = max(highest_tenbo[b-1], H[a-1])
ans = 0
for i, t in en... | N, M = map(int,input().split())
H = list(map(int, input().split()))
arr = [list(map(int, input().split())) for i in range(M)]
highest_tenbo = [0 for i in range(N)]
for a, b in arr:
highest_tenbo[a-1] = max(highest_tenbo[a-1], H[b-1])
highest_tenbo[b-1] = max(highest_tenbo[b-1], H[a-1])
ans = 0
for i, t in enu... | [
"control_flow.branch.if.condition.change"
] | 423,432 | 423,433 | u612261372 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
ai, bi = map(int, input().split())
if h[ai-1] >= h[bi-1]:
ans[bi-1] = 0
elif h[ai-1] <= h[bi-1]:
ans[ai-1] = 0
print(sum(ans))
| n, m = map(int, input().split())
h = list(map(int, input().split()))
ans = [1]*n
for i in range(m):
ai, bi = map(int, input().split())
if h[ai-1] >= h[bi-1]:
ans[bi-1] = 0
if h[ai-1] <= h[bi-1]:
ans[ai-1] = 0
print(sum(ans))
| [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,436 | 423,437 | u763210820 | python |
p02689 | import bisect
import collections
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
ACMOD = 1000000007
INF = 1 << 62
def lmi():
return list(map(int, input().split()))
def llmi(n):
return [lmi() for _ in range(n)]
N, M = lmi()
H = lmi()
AB = llmi(M)
flag = [1] * N
for a, b in AB:
a =... | import bisect
import collections
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
ACMOD = 1000000007
INF = 1 << 62
def lmi():
return list(map(int, input().split()))
def llmi(n):
return [lmi() for _ in range(n)]
N, M = lmi()
H = lmi()
AB = llmi(M)
flag = [1] * N
for a, b in AB:
a =... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,448 | 423,449 | u257374434 | python |
p02689 | # -*- coding: utf-8 -*-
N,M = map(int, input().split())
h_l = list(map(int, input().split()))
all_l = list(range(1,N+1))
lose_l = []
while M > 0:
a,b = map(int, input().split())
if h_l[a-1] > h_l[b-1]:
lose_l.append(b)
if h_l[a-1] < h_l[b-1]:
lose_l.append(a)
else:
lose_l.appen... | # -*- coding: utf-8 -*-
N,M = map(int, input().split())
h_l = list(map(int, input().split()))
all_l = list(range(1,N+1))
lose_l = []
while M > 0:
a,b = map(int, input().split())
if h_l[a-1] > h_l[b-1]:
lose_l.append(b)
elif h_l[a-1] < h_l[b-1]:
lose_l.append(a)
else:
lose_l.app... | [
"control_flow.branch.if.replace.remove",
"control_flow.branch.else_if.replace.add",
"identifier.change",
"call.arguments.change"
] | 423,456 | 423,457 | u084491185 | python |
p02689 | # -*- coding: utf-8 -*-
def main():
N,M = map(int, input().split())
H = list(map(int, input().split()))
ans = []
for _ in range(N):
ans.append(1)
for i in range(M):
A,B = map(int, input().split())
if H[A-1] < H[B-1]:
ans[A-1] = -1
elif H[A-1] > H[B-1]:
... | # -*- coding: utf-8 -*-
def main():
N,M = map(int, input().split())
H = list(map(int, input().split()))
ans = []
for _ in range(N):
ans.append(1)
for i in range(M):
A,B = map(int, input().split())
if H[A-1] < H[B-1]:
ans[A-1] = 0
elif H[A-1] > H[B-1]:
... | [
"assignment.value.change",
"expression.operation.unary.remove"
] | 423,458 | 423,459 | u981040490 | python |
p02689 | n, m = map(int, input().split())
h = list(map(int, input().split()))
ans = [1] * n
for i in range(m):
ai, bi = map(int, input().split())
if h[ai-1] >= h[bi-1]:
ans[bi-1] = 0
elif h[ai-1] <= h[bi-1]:
ans[ai-1] = 0
print(sum(ans)) | n, m = map(int, input().split())
h = list(map(int, input().split()))
ans = [1] * n
for i in range(m):
ai, bi = map(int, input().split())
if h[ai-1] >= h[bi-1]:
ans[bi-1] = 0
if h[ai-1] <= h[bi-1]:
ans[ai-1] = 0
print(sum(ans)) | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 423,460 | 423,461 | u010178026 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.