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 |
|---|---|---|---|---|---|---|---|
p02788
|
import math
n, d, a = map(int,input().split())
e = [[] for i in range(n)]
for i in range(n):
x, h = map(int,input().split())
e[i] = [x,h]
num = 0
e.sort()
sd = [0 for i in range(n)]
l = [i for i in range(n)]
for i in range(n):
for j in range(l[i-1],i):
if e[i][0]-e[j][0] <= 2*d:
l[i] = j
break
for i in range(n):
res = x[i][1] - sd[i-1] + sd[l[i]-1]
if res < 0:
sd[i] = sd[i-1]
else:
k = math.ceil(res/a)
sd[i] = sd[i-1]+k*a
num += k
print(num)
|
import math
n, d, a = map(int,input().split())
e = [[] for i in range(n)]
for i in range(n):
x, h = map(int,input().split())
e[i] = [x,h]
num = 0
e.sort()
sd = [0 for i in range(n)]
l = [i for i in range(n)]
for i in range(n):
for j in range(l[i-1],i):
if e[i][0]-e[j][0] <= 2*d:
l[i] = j
break
for i in range(n):
res = e[i][1] - sd[i-1] + sd[l[i]-1]
if res < 0:
sd[i] = sd[i-1]
else:
k = math.ceil(res/a)
sd[i] = sd[i-1]+k*a
num += k
print(num)
|
[
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 592,432
| 592,433
|
u169350228
|
python
|
p02788
|
f=lambda:map(int,input().split())
n,d,a=f()
lt=sorted([tuple(f()) for _ in range(n)])
from collections import *
q=deque()
c=s=0
for x,h in lt:
while q and q[0][0]<x:
s+=q.popleft()[1]
h-=s
t=-h//a
c-=t
s-=t*a
q.append((x+d*2,t*a))
print(c)
|
f=lambda:map(int,input().split())
n,d,a=f()
lt=sorted([tuple(f()) for _ in range(n)])
from collections import *
q=deque()
c=s=0
for x,h in lt:
while q and q[0][0]<x:
s+=q.popleft()[1]
h-=s
if h<1: continue
t=-h//a
c-=t
s-=t*a
q.append((x+d*2,t*a))
print(c)
|
[
"control_flow.branch.if.add"
] | 592,436
| 592,437
|
u133936772
|
python
|
p02788
|
import sys
input = sys.stdin.readline
import bisect
import collections
from collections import deque
n,d,a= map(int, input().split())
x= [list(map(int, input().split())) for i in range(n)]
x.sort()
y=[]
for i in range(n):
y.append(x[i][0])
x[i][1]=-(-x[i][1]//a)
# どのモンスターまで倒したか管理しながら進める。
# 累積ダメージを管理
qq=deque([])
ans=0
atk=0
for i in range(n):
w=x[i][1]
# 累積ダメージの有効期限を超過
if len(qq)!=0 and i>qq[0][0]:
atk-=qq[0][1]
qq.popleft()
if w-atk>0:
ans+=w-atk
q=bisect.bisect_right(y,x[i][0]+2*d)-1
# 有効期限 ダメージ
qq.append([q,w-atk])
atk += w - atk
print(ans)
|
import sys
input = sys.stdin.readline
import bisect
import collections
from collections import deque
n,d,a= map(int, input().split())
x= [list(map(int, input().split())) for i in range(n)]
x.sort()
y=[]
for i in range(n):
y.append(x[i][0])
x[i][1]=-(-x[i][1]//a)
# どのモンスターまで倒したか管理しながら進める。
# 累積ダメージを管理
qq=deque([])
ans=0
atk=0
for i in range(n):
w=x[i][1]
# iがダメージの有効期限を超過している場合
while len(qq)>0 and i > qq[0][0]:
atk-=qq[0][1]
qq.popleft()
if w-atk>0:
ans+=w-atk
q=bisect.bisect_right(y,x[i][0]+2*d)-1
# 有効期限 ダメージ
qq.append([q,w-atk])
atk += w - atk
print(ans)
|
[
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 592,460
| 592,461
|
u970899068
|
python
|
p02788
|
from collections import deque
N, D, A = map(int, input().split())
mons = []
for _ in range(N):
X, H = map(int, input().split())
mons.append((X, (H + A - 1) // A))
mons.sort()
ans = 0
q = deque([])
tot = 0
for x, h in mons:
while q:
x0, h0 = next(iter(q))
if x - 2 * D <= x0:
break
tot -= h0
q.popleft()
ans += max(0, h - tot)
tot += h
q.append((x, h))
print(ans)
|
from collections import deque
N, D, A = map(int, input().split())
mons = []
for _ in range(N):
X, H = map(int, input().split())
mons.append((X, (H + A - 1) // A))
mons.sort()
ans = 0
q = deque([])
tot = 0
for x, h in mons:
while q:
x0, h0 = next(iter(q))
if x - 2 * D <= x0:
break
tot -= h0
q.popleft()
h = max(0, h - tot)
ans += h
tot += h
q.append((x, h))
print(ans)
|
[] | 592,484
| 592,485
|
u794145298
|
python
|
p02788
|
# https://atcoder.jp/contests/abc153/tasks/abc153_f
# 座標圧縮、貪欲法、imos法
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
# まず、何回攻撃すればいいのかを計算する。これがとにかく必要だ(なくてもいいけど)。
#
# 素直な戦略として、左から倒せるギリギリの爆弾を投下して倒すのが最適
# だけどナイーブに実装すると、O(N^2)。だから体力を管理するのが重要。
# どこにどれだけダメージが蓄積したのかはimos法(デルタ関数をおいてから累積和)で管理できる。
from bisect import bisect_left
N, D, A = read_ints()
XH = read_tuple(N)
XH.sort() # 座標でソート
n_atk = [] # 何回攻撃するのが必要か
X = [] # 座標アクセス用配列
for x, h in XH:
n_atk.append((h - 1) // A + 1)
X.append(x)
damege = [0] * (N + 10) # ダメージ管理用、配列外アクセスがめんどくさいので長めに取る
ans = 0
# j = 0 # 次のxが、今のx+2d以下でもっとも大きなidx
for i, (x, n) in enumerate(zip(X, n_atk)):
damege[i] += damege[i - 1] # 積分して、現時点の蓄積回数を表示
atk = max(0, n - damege[i]) # iには何回攻撃したか
ans += atk
# 攻撃下回数を記録
damege[i] += atk
# 効果が切れる点を予約 # 尺取ならO(1)で次に行けるけど二分探索でも間に合うか
damege[bisect_left(X, x + 2 * D + 1, lo=x)] -= atk # 効果切れを予約
print(ans)
|
# https://atcoder.jp/contests/abc153/tasks/abc153_f
# 座標圧縮、貪欲法、imos法
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_tuple(H):
'''
H is number of rows
'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
# まず、何回攻撃すればいいのかを計算する。これがとにかく必要だ(なくてもいいけど)。
#
# 素直な戦略として、左から倒せるギリギリの爆弾を投下して倒すのが最適
# だけどナイーブに実装すると、O(N^2)。だから体力を管理するのが重要。
# どこにどれだけダメージが蓄積したのかはimos法(デルタ関数をおいてから累積和)で管理できる。
from bisect import bisect_left
N, D, A = read_ints()
XH = read_tuple(N)
XH.sort() # 座標でソート
n_atk = [] # 何回攻撃するのが必要か
X = [] # 座標アクセス用配列
for x, h in XH:
n_atk.append((h - 1) // A + 1)
X.append(x)
damege = [0] * (N + 10) # ダメージ管理用、配列外アクセスがめんどくさいので長めに取る
ans = 0
# j = 0 # 次のxが、今のx+2d以下でもっとも大きなidx
for i, (x, n) in enumerate(zip(X, n_atk)):
damege[i] += damege[i - 1] # 積分して、現時点の蓄積回数を表示
atk = max(0, n - damege[i]) # iには何回攻撃したか
ans += atk
# 攻撃下回数を記録
damege[i] += atk
# 効果が切れる点を予約 # 尺取ならO(1)で次に行けるけど二分探索でも間に合うか
damege[bisect_left(X, x + 2 * D + 1, lo=i)] -= atk # 効果切れを予約
print(ans)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"call.arguments.keyword_argument.change"
] | 592,549
| 592,550
|
u179169725
|
python
|
p02788
|
from collections import deque
import math
n, d, a = map(int, input().split())
data = []
for i in range(n):
data.append(list(map(int, input().split())))
data.sort()
dam = 0
ans = 0
q = deque()
for i in range(n):
x,h = data[i]
while q:
k = q.popleft()
if k[1] >= x:
q.appendleft(k)
break
else:
dam -= k[0]
print(q)
h -= dam
h = max(h, 0)
count = math.ceil(h / a)
dam += count * a
q.append([count * a, x + 2*d])
ans += count
print(ans)
|
from collections import deque
import math
n, d, a = map(int, input().split())
data = []
for i in range(n):
data.append(list(map(int, input().split())))
data.sort()
dam = 0
ans = 0
q = deque()
for i in range(n):
x,h = data[i]
while q:
k = q.popleft()
if k[1] >= x:
q.appendleft(k)
break
else:
dam -= k[0]
h -= dam
h = max(h, 0)
count = math.ceil(h / a)
dam += count * a
q.append([count * a, x + 2*d])
ans += count
print(ans)
|
[
"call.remove"
] | 592,600
| 592,601
|
u691896522
|
python
|
p02788
|
from collections import deque
import math
n, d, a = map(int, input().split())
data = []
for i in range(n):
data.append(list(map(int, input().split())))
data.sort()
dam = 0
ans = 0
q = deque()
for i in range(n):
x,h = data[i]
while q:
k = q.popleft()
if k[1] >= x:
q.appendleft(k)
break
else:
dam -= k[0]
print(q)
h -= dam
h = max(h, 0)
count = math.ceil(h / a)
dam += count * a
q.append([count * a, x + 2*d])
ans += count
print(ans)
|
from collections import deque
import math
n, d, a = map(int, input().split())
data = []
for i in range(n):
data.append(list(map(int, input().split())))
data.sort()
dam = 0
ans = 0
q = deque()
for i in range(n):
x,h = data[i]
while q:
k = q.popleft()
if k[1] >= x:
q.appendleft(k)
break
else:
dam -= k[0]
h -= dam
h = max(h, 0)
count = math.ceil(h / a)
dam += count * a
q.append([count * a, x + 2*d])
ans += count
print(ans)
|
[
"call.remove"
] | 592,600
| 592,606
|
u691896522
|
python
|
p02788
|
n, d, a = map(int, input().split())
D = True
pos = []
pos1 = []
for i in range(n):
x, h = map(int, input().split())
pos.append((x, h))
pos.sort(key=lambda x: x[0])
bombs = 0
damage = 0
y, z = 0, 0
while y < n:
x0 = pos[y][0]
try:
x1 = pos1[z][0]
except IndexError:
x1 = 1e16
if x0 <= x1:
health = pos[y][1]
health -= damage
number = (health-1) // a + 1
bombs += number
damage += number*a
pos1.append((x0+2*d, number*a))
y+=1
else:
damage -= pos1[z][1]
z += 1
print(bombs)
|
n, d, a = map(int, input().split())
D = True
pos = []
pos1 = []
for i in range(n):
x, h = map(int, input().split())
pos.append((x, h))
pos.sort(key=lambda x: x[0])
bombs = 0
damage = 0
y, z = 0, 0
while y < n:
x0 = pos[y][0]
try:
x1 = pos1[z][0]
except IndexError:
x1 = 1e16
if x0 <= x1:
health = pos[y][1]
health -= damage
number = max(0, (health-1) // a + 1)
bombs += number
damage += number*a
pos1.append((x0+2*d, number*a))
y+=1
else:
damage -= pos1[z][1]
z += 1
print(bombs)
|
[
"call.add",
"call.arguments.change"
] | 592,686
| 592,687
|
u218071226
|
python
|
p02788
|
from collections import deque
N,D,A = map(int, input().split())
ps = []
def ceil(a,b):
return -(-a//b)
for i in range(N):
x,h = map(int, input().split())
ps.append([x,h])
ps.sort()
damage = 0
cnt = 0
q = deque([])
for x,h in ps:
while len(q) > 0 and q[0][0] < x:
# 範囲外のものはダメージを与えられない
_, d = q.popleft()
damage -= d
# 残りダメージ
h_rest = h - damage
if h_rest <= 0: continue
num = ceil(h_rest, A)
damage += num * A
cnt += num
r = x + 2*D
q.append((r,damage))
print(int(cnt))
|
from collections import deque
N,D,A = map(int, input().split())
ps = []
def ceil(a,b):
return -(-a//b)
for i in range(N):
x,h = map(int, input().split())
ps.append([x,h])
ps.sort()
damage = 0
cnt = 0
q = deque([])
for x,h in ps:
while len(q) > 0 and q[0][0] < x:
# 範囲外のものはダメージを与えられない
_, d = q.popleft()
damage -= d
# 残りダメージ
h_rest = h - damage
if h_rest <= 0: continue
num = ceil(h_rest, A)
damage += num * A
cnt += num
r = x + 2*D
q.append((r,num*A))
print(int(cnt))
|
[
"call.arguments.change"
] | 592,714
| 592,715
|
u545368057
|
python
|
p02788
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def main():
n,d,a = LI()
xh = sorted([LI() for _ in range(n)])
r = 0
k = 0
t = []
ti = 0
for x,h in xh:
while len(t) > ti and t[ti][0] < x:
k -= t[ti][1]
ti += 1
h -= k
if h <= 0:
continue
u = (h+a-1) // a
r += u
k += u * d
t.append((x+d*2, u*d))
return r
print(main())
|
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)
def main():
n,d,a = LI()
xh = sorted([LI() for _ in range(n)])
r = 0
k = 0
t = []
ti = 0
for x,h in xh:
while len(t) > ti and t[ti][0] < x:
k -= t[ti][1]
ti += 1
h -= k
if h <= 0:
continue
u = (h+a-1) // a
r += u
k += u * a
t.append((x+d*2, u*a))
return r
print(main())
|
[
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 592,718
| 592,719
|
u637175065
|
python
|
p02788
|
def wczytaj_liste():
ciag = input()
rozdzielona_lista = ciag.split()
odp = []
for wyraz in rozdzielona_lista:
liczba = int(wyraz)
odp.append(liczba)
return odp
def F_symulacja():
N, D, A = wczytaj_liste()
monstery = []
for i in range(N):
x, h = wczytaj_liste()
monstery.append((x, h))
monstery.sort()
wynik = 0
while len(monstery) > 0:
x, h = monstery[0]
if h <= 0:
monstery.pop(0)
continue
bomba_x = x + D
wynik += 1
for i in range(len(monstery)):
x_i, h_i = monstery[i]
if bomba_x - D <= x_i <= bomba_x + D:
monstery[i] = (x_i, h_i - A)
print(wynik)
def zabij(H, A):
if H % A == 0:
return H // A
else:
return H // A + 1
def F():
N, D, A = wczytaj_liste()
monstery = []
for i in range(N):
x, h = wczytaj_liste()
monstery.append((x, h))
monstery.sort()
wynik = 0
gdzie_sie_koncza_bomby = []
skonczone = 0
ile_tu_spadlo = 0
for x, h in monstery:
while len(gdzie_sie_koncza_bomby) > skonczone:
bomby_do, ile_bomb = gdzie_sie_koncza_bomby[skonczone]
if bomby_do < x:
ile_tu_spadlo -= ile_bomb
skonczone += 1
else:
break
if h - ile_tu_spadlo * A > 0:
zrzucam_tutaj = zabij(h - ile_tu_spadlo, A)
wynik += zrzucam_tutaj
ile_tu_spadlo += zrzucam_tutaj
gdzie_sie_koncza_bomby.append((x + 2 * D, zrzucam_tutaj))
print(wynik)
F()
|
def wczytaj_liste():
ciag = input()
rozdzielona_lista = ciag.split()
odp = []
for wyraz in rozdzielona_lista:
liczba = int(wyraz)
odp.append(liczba)
return odp
def F_symulacja():
N, D, A = wczytaj_liste()
monstery = []
for i in range(N):
x, h = wczytaj_liste()
monstery.append((x, h))
monstery.sort()
wynik = 0
while len(monstery) > 0:
x, h = monstery[0]
if h <= 0:
monstery.pop(0)
continue
bomba_x = x + D
wynik += 1
for i in range(len(monstery)):
x_i, h_i = monstery[i]
if bomba_x - D <= x_i <= bomba_x + D:
monstery[i] = (x_i, h_i - A)
print(wynik)
def zabij(H, A):
if H % A == 0:
return H // A
else:
return H // A + 1
def F():
N, D, A = wczytaj_liste()
monstery = []
for i in range(N):
x, h = wczytaj_liste()
monstery.append((x, h))
monstery.sort()
wynik = 0
gdzie_sie_koncza_bomby = []
skonczone = 0
ile_tu_spadlo = 0
for x, h in monstery:
while len(gdzie_sie_koncza_bomby) > skonczone:
bomby_do, ile_bomb = gdzie_sie_koncza_bomby[skonczone]
if bomby_do < x:
ile_tu_spadlo -= ile_bomb
skonczone += 1
else:
break
if h - ile_tu_spadlo * A > 0:
zrzucam_tutaj = zabij(h - ile_tu_spadlo * A, A)
wynik += zrzucam_tutaj
ile_tu_spadlo += zrzucam_tutaj
gdzie_sie_koncza_bomby.append((x + 2 * D, zrzucam_tutaj))
print(wynik)
F()
|
[
"assignment.change"
] | 592,727
| 592,728
|
u443725372
|
python
|
p02788
|
# --*-coding:utf-8-*--
import math
N,D,A = map(int, input().split())
XH = sorted(tuple(map(int, input().split())) for _ in range(N))
Q = []
qIdx = 0
s = 0
t = 0
for (x, h) in XH:
while qIdx < len(Q) and Q[qIdx][0] < x:
s -= Q[qIdx][1]
qIdx += 1
if s < h:
q = int(math.ceil((h-s)/A))
Q.append((x+2*D, q))
s += q
t += q
print(t)
|
# --*-coding:utf-8-*--
import math
N,D,A = map(int, input().split())
XH = sorted(tuple(map(int, input().split())) for _ in range(N))
Q = []
qIdx = 0
s = 0
t = 0
for (x, h) in XH:
while qIdx < len(Q) and Q[qIdx][0] < x:
s -= Q[qIdx][1]
qIdx += 1
if s < h:
q = int(math.ceil((h-s)/A))
Q.append((x+2*D, q*A))
s += q*A
t += q
print(t)
|
[
"expression.operation.binary.add"
] | 592,747
| 592,748
|
u729417323
|
python
|
p02788
|
# --*-coding:utf-8-*--
import math
N,D,A = map(int, input().split())
XH = sorted(tuple(map(int, input().split())) for _ in range(N))
Q = []
qIdx = 0
s = 0
t = 0
for (x, h) in XH:
while qIdx < len(Q) and Q[qIdx][0] < x:
s -= Q[qIdx][1]
qIdx += 1
if s < h:
q = int(math.ceil((h-s)/A))
Q.append((x+2*D, q))
s += q
t += q
print(t)
|
# --*-coding:utf-8-*--
import math
N,D,A = map(int, input().split())
XH = sorted(tuple(map(int, input().split())) for _ in range(N))
Q = []
qIdx = 0
s = 0
t = 0
for (x, h) in XH:
while qIdx < len(Q) and Q[qIdx][0] < x:
s -= Q[qIdx][1]
qIdx += 1
if s < h:
q = int(math.ceil((h-s)/A))
Q.append((x+2*D, q*A))
s += q*A
t += q
print(t)
|
[
"expression.operation.binary.add"
] | 592,747
| 592,749
|
u729417323
|
python
|
p02788
|
from collections import deque
# input
N, D, A = map(int, input().split())
XH = [tuple(map(int, input().split())) for _ in range(N)]
# process
XH.sort()
print(XH)
ans = 0
dq = deque()
dam = 0
for x, h in XH:
while dq:
x2, h2 = dq[0]
if x > x2:
dam -= h2
dq.popleft()
else:
break
h -= dam
if h <= 0:
continue
c = -(-h//A)
ans += c
d = A*c
dam += d
dq.append((x+D*2, d))
# output
print(ans)
|
from collections import deque
# input
N, D, A = map(int, input().split())
XH = [tuple(map(int, input().split())) for _ in range(N)]
# process
XH.sort()
#print(XH)
ans = 0
dq = deque()
dam = 0
for x, h in XH:
while dq:
x2, h2 = dq[0]
if x > x2:
dam -= h2
dq.popleft()
else:
break
h -= dam
if h <= 0:
# print("x,h,dam: {},{},{}".format(x,h,dam))
continue
c = -(-h//A)
ans += c
d = A*c
dam += d
dq.append((x+D*2, d))
# print("x,h,dam,ans,dq: {},{},{},{},{}".format(x,h,dam,ans,dq))
# output
print(ans)
|
[
"call.remove"
] | 592,795
| 592,796
|
u563676207
|
python
|
p02788
|
from operator import itemgetter
import bisect
import math
N,d,a = map(int, input().split())
xh = sorted([list(map(int, input().split())) for i in range(N)], key=itemgetter(0))
x = []
for X,h in xh:
x.append(X)
ans = 0
attack_start = [i for i in range(N)]
now = 0
cumsum = [0] * (N+1)
for L,(X,H) in enumerate(xh):
R = bisect.bisect_right(x,X+2*d)
for i in range(now,R):
attack_start[i] = L
now = R
damage = (cumsum[L] - cumsum[attack_start[L]]) * a
attack_time = math.ceil((H - damage) / a)
ans += attack_time
cumsum[L+1] = ans
print(ans)
|
from operator import itemgetter
import bisect
import math
N,d,a = map(int, input().split())
xh = sorted([list(map(int, input().split())) for i in range(N)], key=itemgetter(0))
x = []
for X,h in xh:
x.append(X)
ans = 0
attack_start = [i for i in range(N)]
now = 0
cumsum = [0] * (N+1)
for L,(X,H) in enumerate(xh):
R = bisect.bisect_right(x,X+2*d)
for i in range(now,R):
attack_start[i] = L
now = R
damage = (cumsum[L] - cumsum[attack_start[L]]) * a
attack_time = max(0,math.ceil((H - damage) / a))
ans += attack_time
cumsum[L+1] = ans
print(ans)
|
[
"call.add",
"call.arguments.change"
] | 592,816
| 592,817
|
u102960641
|
python
|
p02788
|
import math
from collections import deque
n,d,a = map(int,input().split())
lst1 = [list(map(int,input().split())) for i in range(n)]
lst1.sort()
#解法1 - 貪欲法
"""
キューを使った貪欲法で間に合わせる。
que = [[ダメージ量,そのダメージがどこまで使えるか],...]
とすることにより、高速にダメージ管理をすることができる。
"""
que = deque()
ans = 0
dmg = 0
for i in range(n):
while que:
lim = que.popleft()
if lst1[i][0] > lim[1]:
dmg -= lim[0]
else:
break
if lst1[i][1] > dmg:
need = math.ceil((lst1[i][1]-dmg)/a)
ans += need
dmg += need*a
que.append([need*a,lst1[i][0]+2*d])
print(ans)
|
import math
from collections import deque
n,d,a = map(int,input().split())
lst1 = [list(map(int,input().split())) for i in range(n)]
lst1.sort()
#解法1 - 貪欲法
"""
キューを使った貪欲法で間に合わせる。
que = [[ダメージ量,そのダメージがどこまで使えるか],...]
とすることにより、高速にダメージ管理をすることができる。
"""
que = deque()
ans = 0
dmg = 0
for i in range(n):
while que:
lim = que.popleft()
if lst1[i][0] > lim[1]:
dmg -= lim[0]
else:
que.appendleft(lim)
break
if lst1[i][1] > dmg:
need = math.ceil((lst1[i][1]-dmg)/a)
ans += need
dmg += need*a
que.append([need*a,lst1[i][0]+2*d])
print(ans)
|
[
"call.add"
] | 592,825
| 592,826
|
u372144784
|
python
|
p02788
|
import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
from collections import deque
def main():
N,D,A = map(int,input().split())
X = [tuple(map(int,input().split())) for _ in range(N)]
X.sort(key=itemgetter(0))
aldam = 0
count = 0
q = deque([])
for now,dam in X:
while q:
if now <= q[0][0]:
break
aldam -= q[0][1]
q.popleft()
dam -= aldam
if dam < 0:
continue
c = -(-dam//A)
count += c
aldam += c*A
q.append([now+2*D,aldam])
print(count)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.buffer.readline
from operator import itemgetter
from collections import deque
def main():
N,D,A = map(int,input().split())
X = [tuple(map(int,input().split())) for _ in range(N)]
X.sort(key=itemgetter(0))
aldam = 0
count = 0
q = deque([])
for now,dam in X:
while q:
if now <= q[0][0]:
break
aldam -= q[0][1]
q.popleft()
dam -= aldam
if dam < 0:
continue
c = -(-dam//A)
count += c
aldam += c*A
q.append((now+2*D,c*A))
print(count)
if __name__ == "__main__":
main()
|
[
"call.arguments.change"
] | 592,831
| 592,832
|
u648212584
|
python
|
p02788
|
n,d,a = map(int,input().split())
lst = [[int(i) for i in input().split()] for _ in range(n)]
lst.sort(key=lambda x:x[0])
x = [0]*n
h = [0]*n
for i in range(n): x[i],h[i] = lst[i]
length = [0]*n
for i in range(n):
left = i+1
right = n-1
while left <= right:
mid = (left+right)//2
if x[mid] - x[i] <= 2*d:
left = mid+1
else:
right = mid-1
length[i] = left-1
d = [0]*n
dmg = 0
idx = 0
ans = 0
for i in range(n):
if i > length[idx]:
idx += 1
h[i] = max(h[i]-dmg+d[idx-1],0)
cnt = (h[i]+a-1)//a
ans += cnt
dmg += cnt*a
d[i] = dmg
print(ans)
|
n,d,a = map(int,input().split())
lst = [[int(i) for i in input().split()] for _ in range(n)]
lst.sort(key=lambda x:x[0])
x = [0]*n
h = [0]*n
for i in range(n): x[i],h[i] = lst[i]
length = [0]*n
for i in range(n):
left = i+1
right = n-1
while left <= right:
mid = (left+right)//2
if x[mid] - x[i] <= 2*d:
left = mid+1
else:
right = mid-1
length[i] = left-1
d = [0]*n
dmg = 0
idx = 0
ans = 0
for i in range(n):
while i > length[idx]:
idx += 1
h[i] = max(h[i]-dmg+d[idx-1],0)
cnt = (h[i]+a-1)//a
ans += cnt
dmg += cnt*a
d[i] = dmg
print(ans)
|
[
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 592,843
| 592,844
|
u677121387
|
python
|
p02788
|
n,d,a = map(int,input().split())
lst = [[int(i) for i in input().split()] for _ in range(n)]
lst.sort(key=lambda x:x[0])
x = [0]*n
h = [0]*n
for i in range(n): x[i],h[i] = lst[i]
length = [0]*n
for i in range(n):
left = i+1
right = n-1
while left <= right:
mid = (left+right)//2
if x[mid] - x[i] <= 2*d:
left = mid+1
else:
right = mid-1
length[i] = left-1
d = [0]*n
dmg = 0
idx = 0
ans = 0
for i in range(n):
if i > length[idx]:
idx += 1
h[i] = max(h[i]-dmg+d[idx-1],0)
cnt = (h[i]+a-1)//a
ans += cnt
dmg += cnt*a
d[i] = dmg
print(ans)
|
n,d,a = map(int,input().split())
lst = [[int(i) for i in input().split()] for _ in range(n)]
lst.sort(key=lambda x:x[0])
x = [0]*n
h = [0]*n
for i in range(n): x[i],h[i] = lst[i]
length = [0]*n
for i in range(n):
left = i+1
right = n-1
while left <= right:
mid = (left+right)//2
if x[mid] - x[i] <= 2*d:
left = mid+1
else:
right = mid-1
length[i] = left-1
d = [0]*n
dmg = 0
idx = 0
ans = 0
for i in range(n):
while i > length[idx]:
idx += 1
h[i] = max(h[i]-dmg+d[idx-1],0)
cnt = (h[i]+a-1)//a
ans += cnt
dmg += cnt*a
d[i] = dmg
print(ans)
|
[
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 592,845
| 592,844
|
u677121387
|
python
|
p02787
|
def solve(H, N, AB):
INF = 10e10
dp = [[INF] * (H+1) for i in range(N+1)]
dp[0][0] = 0
A, B = AB[0]
#print(" ", *range(H+1), sep="\t")
for j in range(H+1):
dp[0][j] = min(dp[0][j], dp[0][j-A]+B)
#print(0, *dp[0], sep="\t")
for i in range(1,N):
A, B = AB[i]
for h in range(H+1):
dp[i][h] = min(dp[i-1][h], dp[i][max(0, h-A)]+B)
#print(i, *dp[i], sep="\t")
return(dp[N-1][H])
def main():
H, N = map(int, input().split())
AB = []
for i in range(N):
A, B = map(int, input().split())
AB.append((A, B))
print(solve(H, N, AB))
main()
|
def solve(H, N, AB):
INF = 10e10
dp = [[INF] * (H+1) for i in range(N+1)]
dp[0][0] = 0
A, B = AB[0]
for j in range(H+1):
dp[0][j] = min(dp[0][j], dp[0][max(0, j-A)]+B)
for i in range(1,N):
A, B = AB[i]
for h in range(H+1):
dp[i][h] = min(dp[i-1][h], dp[i][max(0, h-A)]+B)
#print(i, *dp[i], sep="\t")
return(dp[N-1][H])
def main():
H, N = map(int, input().split())
AB = []
for i in range(N):
A, B = map(int, input().split())
AB.append((A, B))
print(solve(H, N, AB))
main()
|
[
"call.add",
"call.arguments.change"
] | 592,859
| 592,860
|
u736729525
|
python
|
p02787
|
H, N = map(int, input().split())
inf =10*10
dp = [inf for _ in range(H+1)]
# min_cost = np.inf
dp[0]=0
for n in range(N):
a,b = map(int, input().split())
for h in range(H):
nj = min(h+a,H)
dp[nj] = min([dp[nj],dp[h]+b])
print(int(dp[H]))
|
H, N = map(int, input().split())
inf =1000100001001000
dp = [inf for _ in range(H+1)]
# min_cost = np.inf
dp[0]=0
for n in range(N):
a,b = map(int, input().split())
for h in range(H):
nj = min(h+a,H)
dp[nj] = min([dp[nj],dp[h]+b])
print(int(dp[H]))
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 592,878
| 592,879
|
u219015402
|
python
|
p02787
|
H, N = map(int, input().split())
dp = [np.inf for _ in range(H+1)]
# min_cost = np.inf
dp[0]=0
for n in range(N):
a,b = map(int, input().split())
for h in range(H):
nj = min(h+a,H)
dp[nj] = min([dp[nj],dp[h]+b])
# if h+a<H:
# dp[h+a] = np.min([dp[h+a], dp[h]+b])
# elif dp[h]+b<min_cost:
# min_cost = dp[h]+b
print(int(dp[H]))
|
H, N = map(int, input().split())
inf =1000100001001000
dp = [inf for _ in range(H+1)]
# min_cost = np.inf
dp[0]=0
for n in range(N):
a,b = map(int, input().split())
for h in range(H):
nj = min(h+a,H)
dp[nj] = min([dp[nj],dp[h]+b])
print(int(dp[H]))
|
[
"assignment.add"
] | 592,880
| 592,879
|
u219015402
|
python
|
p02787
|
INF=10**10
def main():
H,N=map(int,input().split())
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
dp=[INF]*(H+1)
dp[0]=0
for a,b in AB:
for k in range(H+1):
tmp=k-a
if tmp<0:
tmp=0
need_magic=dp[tmp]+b
if need_magic<dp[k]:
dp[k]=need_magic
print(dp[H+1])
main()
|
INF=10**10
def main():
H,N=map(int,input().split())
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
dp=[INF]*(H+1)
dp[0]=0
for a,b in AB:
for k in range(H+1):
tmp=k-a
if tmp<0:
tmp=0
need_magic=dp[tmp]+b
if need_magic<dp[k]:
dp[k]=need_magic
print(dp[H])
main()
|
[
"expression.operation.binary.remove"
] | 592,894
| 592,895
|
u825378567
|
python
|
p02787
|
import sys
def input():
return sys.stdin.readline()[:-1]
H,N = map(int,input().split(' '))
A = [None]*N
B = [None]*N
for i in range(N):
a,b = list(map(int, input().split()))
A[i] = a
B[i] = b
INF = float('inf')
dp = [INF]*(H+1)
dp[H] = 0
for i in raneg(N):
a = A[i]
b = B[i]
for j in range(H,0,-1):
aft = j - a
if aft<=0:
dp[0] = min(dp[0],dp[j]+b)
else:
dp[aft] = min(dp[aft],dp[j]+b)
print(dp[0])
|
import sys
def input():
return sys.stdin.readline()[:-1]
H,N = map(int,input().split(' '))
A = [None]*N
B = [None]*N
for i in range(N):
a,b = list(map(int, input().split()))
A[i] = a
B[i] = b
INF = float('inf')
dp = [INF]*(H+1)
dp[H] = 0
for i in range(N):
a = A[i]
b = B[i]
for j in range(H,0,-1):
aft = j - a
if aft<=0:
dp[0] = min(dp[0],dp[j]+b)
else:
dp[aft] = min(dp[aft],dp[j]+b)
print(dp[0])
|
[
"identifier.change",
"call.function.change"
] | 592,920
| 592,921
|
u598720217
|
python
|
p02787
|
H, N = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N)]
dp = [10**9]*(H+1)
dp[0] = 0
for i in range(1, N+1):
for j in range(H+1):
a, b = ab[i-1]
if j < a:
dp[j] = min([dp[0]+b, dp[j]])
else:
dp[j] = min([dp[j-a]+b, dp[j]])
print(dp[N][H])
|
H, N = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(N)]
dp = [10**9]*(H+1)
dp[0] = 0
for i in range(1, N+1):
for j in range(H+1):
a, b = ab[i-1]
if j < a:
dp[j] = min([dp[0]+b, dp[j]])
else:
dp[j] = min([dp[j-a]+b, dp[j]])
print(dp[H])
|
[] | 592,932
| 592,933
|
u342869120
|
python
|
p02787
|
import sys
use_clipboard=True
bbn=1000000007
#+++++
def main():
h, n = map(int, input().split())
ii=[]
for i in range(n):
a,b=map(int, input().split())
ii.append([a/b, a, b])
ii.sort()
_,ma,mb = ii[0]
tn = (h + ma-1)//ma
tc = tn * mb
vv=[bbn]*(h+1)
vv[0]=0
for i in range(h+1):
for c,a,b in ii:
nn = min(i + a, h)
vv[nn]= min(vv[i] + b, vv[nn])
print(vv[-1])
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
class input_clipboard:
def __init__(self,s):
self.input_l=s.splitlines()
self.ii=0
def input(self):
ret = self.input_l[self.ii]
self.ii+=1
return ret
if __name__ == "__main__":
if sys.platform =='ios':
if use_clipboard:
import clipboard
input_text=clipboard.get()
ic=input_clipboard(input_text)
input = lambda : ic.input()
else:
sys.stdin=open('inputFile.txt')
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret)
|
import sys
use_clipboard=True
bbn=1000000007
#+++++
def main():
h, n = map(int, input().split())
ii=[]
for i in range(n):
a,b=map(int, input().split())
ii.append([a/b, a, b])
#ii.sort()
_,ma,mb = ii[0]
tn = (h + ma-1)//ma
tc = tn * mb
vv=[bbn]*(h+1)
vv[0]=0
for i in range(h+1):
for c,a,b in ii:
nn = min(i + a, h)
vv[nn]= min(vv[i] + b, vv[nn])
print(vv[-1])
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
class input_clipboard:
def __init__(self,s):
self.input_l=s.splitlines()
self.ii=0
def input(self):
ret = self.input_l[self.ii]
self.ii+=1
return ret
if __name__ == "__main__":
if sys.platform =='ios':
if use_clipboard:
import clipboard
input_text=clipboard.get()
ic=input_clipboard(input_text)
input = lambda : ic.input()
else:
sys.stdin=open('inputFile.txt')
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret)
|
[
"call.remove"
] | 592,963
| 592,964
|
u505830998
|
python
|
p02789
|
n,m = input().split()
if n == m :
print('AC')
else :
print('No')
|
n,m = input().split()
if n == m :
print('Yes')
else :
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 592,967
| 592,968
|
u109272021
|
python
|
p02789
|
a, b = map(int, input().split())
ans = "No"
if a == b:
ans = "yes"
print(ans)
|
a, b = map(int, input().split())
ans = "No"
if a == b:
ans = "Yes"
print(ans)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 592,971
| 592,972
|
u329319441
|
python
|
p02789
|
import sys
input = sys.stdin.readline
N,M = [int(i) for i in input().split()]
if N == M :
print("AC")
else :
print("WA")
|
import sys
input = sys.stdin.readline
N,M = [int(i) for i in input().split()]
if N == M :
print("Yes")
else :
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 592,984
| 592,985
|
u490553751
|
python
|
p02789
|
n, m = map(int(), input().split())
if n == m:
print('Yes')
else:
print('No')
|
n, m = map(int, input().split())
if n == m:
print('Yes')
else:
print('No')
|
[
"call.arguments.change"
] | 592,995
| 592,996
|
u539659844
|
python
|
p02789
|
# !/usr/nbin/python3
"""
https://atcoder.jp/contests/abc152/tasks/abc152_a
AC or WA.
"""
def solve(n, m):
if n == m: print("YES")
else: print("NO")
if __name__ == "__main__":
n, m = list(map(int, input().split()))
solve(n, m)
|
# !/usr/nbin/python3
"""
https://atcoder.jp/contests/abc152/tasks/abc152_a
AC or WA.
"""
def solve(n, m):
if n == m: print("Yes")
else: print("No")
if __name__ == "__main__":
n, m = list(map(int, input().split()))
solve(n, m)
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,014
| 593,015
|
u862417957
|
python
|
p02789
|
from sys import stdin
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n, m = MAP()
print('Yes') if n == m else print('No')
|
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n, m = MAP()
print('Yes') if n == m else print('No')
|
[] | 593,016
| 593,017
|
u612975321
|
python
|
p02788
|
from bisect import bisect_left as bl
n,d,a=map(int,input().split())
s=sorted([list(map(int,input().split()))for i in range(n)])
c=0
p=[0]
q=[0]
for i in range(n):
a=bl(q,s[i][0])
s[i][1]-=p[-1]-p[a-1]
if s[i][1]>0:
t=((s[i][1]-1)//a+1)
c+=t
p.append(p[-1]+t)
q.append(s[i][0]+2*d)
print(c)
|
from bisect import bisect_left as bl
n,d,a=map(int,input().split())
s=sorted([list(map(int,input().split()))for i in range(n)])
c=0
p=[0]
q=[0]
for i in range(n):
g=bl(q,s[i][0])
s[i][1]-=a*(p[-1]-p[g-1])
if s[i][1]>0:
t=((s[i][1]-1)//a+1)
c+=t
p.append(p[-1]+t)
q.append(s[i][0]+2*d)
print(c)
|
[
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 593,062
| 593,063
|
u619819312
|
python
|
p02788
|
from math import ceil
from bisect import bisect
from operator import itemgetter
class BIT:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
i += 1
while i <= self.size:
self.tree[i] += x
i += i & -i
N,D,A = map(int,input().split())
XH = [list(map(int,input().split())) for _ in range(N)]
XH.sort(key=itemgetter(0))
X = [XH[i][0] for i in range(N)]
H = [XH[i][1] for i in range(N)]
bit = BIT(N)
ans = 0
for i in range(N):
bit.add(i+1,H[i])
bit.add(i+2,-H[i])
h = bit.sum(i+1)
if h>0:
ans += ceil(h/A)
x = -ceil(h/A)*A
j = bisect(X,X[i]+2*D)
bit.add(i+1,x)
bit.add(j+1,-x)
print(ans)
|
from math import ceil
from bisect import bisect
from operator import itemgetter
class BIT:
def __init__(self, n):
self.size = n
self.tree = [0] * (n + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return s
def add(self, i, x):
while i <= self.size:
self.tree[i] += x
i += i & -i
N,D,A = map(int,input().split())
XH = [list(map(int,input().split())) for _ in range(N)]
XH.sort(key=itemgetter(0))
X = [XH[i][0] for i in range(N)]
H = [XH[i][1] for i in range(N)]
bit = BIT(N)
ans = 0
for i in range(N):
bit.add(i+1,H[i])
bit.add(i+2,-H[i])
h = bit.sum(i+1)
if h>0:
ans += ceil(h/A)
x = -ceil(h/A)*A
j = bisect(X,X[i]+2*D)
bit.add(i+1,x)
bit.add(j+1,-x)
print(ans)
|
[] | 593,075
| 593,076
|
u170201762
|
python
|
p02788
|
N, D, A = map(int, input().split())
XH = [[0, 0] for _ in range(N)]
for i in range(N):
XH[i][0], XH[i][1] = map(int, input().split())
XH.sort()
# XH
ans = 0
P = 0
hist = []
j = 0
for i in range(N):
X, H = XH[i]
while True:
if j >= len(hist):
break
if hist[j][0] >= X:
break
if hist[j][0] < X:
P -= hist[0][1]
j += 1
if H - P > 0:
if (H - P) % A == 0:
bomb = (H - P) // A
else:
bomb = (H - P) // A + 1
ans += bomb
P += bomb * A
hist.append((X + 2 * D, bomb * A))
print(ans)
|
N, D, A = map(int, input().split())
XH = [[0, 0] for _ in range(N)]
for i in range(N):
XH[i][0], XH[i][1] = map(int, input().split())
XH.sort()
# XH
ans = 0
P = 0
hist = []
j = 0
for i in range(N):
X, H = XH[i]
while True:
if j >= len(hist):
break
if hist[j][0] >= X:
break
if hist[j][0] < X:
P -= hist[j][1]
j += 1
if H - P > 0:
if (H - P) % A == 0:
bomb = (H - P) // A
else:
bomb = (H - P) // A + 1
ans += bomb
P += bomb * A
hist.append((X + 2 * D, bomb * A))
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change"
] | 593,099
| 593,100
|
u887142477
|
python
|
p02788
|
N, D, A = map(int, input().split())
XH = [[0, 0] for _ in range(N)]
for i in range(N):
XH[i][0], XH[i][1] = map(int, input().split())
XH.sort()
# XH
ans = 0
P = 0
hist = []
j = 0
for i in range(N):
X, H = XH[i]
while True:
if j >= len(hist):
break
if hist[j][0] >= 0:
break
if hist[j][0] < X:
P -= hist[0][1]
j += 1
if H - P > 0:
if (H - P) % A == 0:
bomb = (H - P) // A
else:
bomb = (H - P) // A + 1
ans += bomb
P += bomb * A
hist.append((X + 2 * D, bomb * A))
print(ans)
|
N, D, A = map(int, input().split())
XH = [[0, 0] for _ in range(N)]
for i in range(N):
XH[i][0], XH[i][1] = map(int, input().split())
XH.sort()
# XH
ans = 0
P = 0
hist = []
j = 0
for i in range(N):
X, H = XH[i]
while True:
if j >= len(hist):
break
if hist[j][0] >= X:
break
if hist[j][0] < X:
P -= hist[j][1]
j += 1
if H - P > 0:
if (H - P) % A == 0:
bomb = (H - P) // A
else:
bomb = (H - P) // A + 1
ans += bomb
P += bomb * A
hist.append((X + 2 * D, bomb * A))
print(ans)
|
[
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 593,102
| 593,100
|
u887142477
|
python
|
p02788
|
n, d, a = map(int, input().split())
loans = []
bar = 0
ans = 0
xh = sorted([tuple(map(int, input().split())) for _ in range(n)])
for x, h in xh:
while len(loans) > 0:
xx, dd = loans[0]
if xx < x:
loans.pop(0)
bar -= dd
else:
break
h -= bar
c = h // a if h % a == 0 else ((h // a) + 1)
ans += c
dd = c * a
bar += dd
loans.append((x + 2 * d, dd))
print(ans)
|
n, d, a = map(int, input().split())
loans = []
bar = 0
ans = 0
xh = sorted([tuple(map(int, input().split())) for _ in range(n)])
for x, h in xh:
while len(loans) > 0:
xx, dd = loans[0]
if xx < x:
loans.pop(0)
bar -= dd
else:
break
h -= bar
if h > 0:
c = h // a if h % a == 0 else ((h // a) + 1)
ans += c
dd = c * a
bar += dd
loans.append((x + 2 * d, dd))
print(ans)
|
[
"control_flow.branch.if.add"
] | 593,130
| 593,131
|
u556672233
|
python
|
p02789
|
n = input()
m = input()
if n == m:
print("Yes")
else:
print("No")
|
n , m = input().split()
if n == m:
print("Yes")
else:
print("No")
|
[
"assignment.variable.change",
"call.remove",
"call.add"
] | 593,298
| 593,299
|
u427649652
|
python
|
p02789
|
N,M = map(int,input().split())
if N == M:
print('Yes')
else:
pritn('No')
|
N,M = map(int,input().split())
if N == M:
print('Yes')
else:
print('No')
|
[
"identifier.change",
"call.function.change"
] | 593,304
| 593,305
|
u967484343
|
python
|
p02789
|
N,M = map(int,input())
print("Yes") if N==M else print("No")
|
N,M = map(int,input().split())
print("Yes") if N==M else print("No")
|
[
"call.add"
] | 593,306
| 593,307
|
u068862866
|
python
|
p02789
|
n,m = map(int,input().spit())
if n == m:
print("Yes")
else:
print("No")
|
n,m = map(int,input().split())
if n == m:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 593,308
| 593,309
|
u283751459
|
python
|
p02789
|
a,b=input().split();print('YNeos'[a>b::2])
|
a,b=input().split()
print('YNeos'[a!=b::2])
|
[
"expression.operator.compare.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 593,330
| 593,331
|
u729133443
|
python
|
p02789
|
lst = input().split(' ')
m = lst[0]
n = lst[1]
if n==m:
print('AC')
else:
print('WA')
|
lst = input().split(' ')
m = lst[0]
n = lst[1]
if n==m:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,335
| 593,336
|
u830237447
|
python
|
p02789
|
N, M = map(int, input.split())
print('Yes') if N == M else print('No')
|
N, M = map(int, input().split())
print('Yes') if N == M else print('No')
|
[
"call.add"
] | 593,339
| 593,340
|
u202112682
|
python
|
p02789
|
if len(set((list(input().split()))))==1:
print("Yes")
else:("No")
|
if len(set((list(input().split()))))==1:
print("Yes")
else:
print("No")
|
[
"io.output.change",
"call.add"
] | 593,341
| 593,342
|
u311961196
|
python
|
p02789
|
a, b = map(int, input(), split())
if a == b:
print("Yes")
else:
print("No")
|
a, b = map(int, input().split())
if a == b:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"call.arguments.change"
] | 593,345
| 593,346
|
u694233896
|
python
|
p02788
|
import sys
sys.setrecursionlimit(500000)
def input():
return sys.stdin.readline()[:-1]
class DualSegmentTree:
def __init__(self, n) :
self.n = n
self.N0 = 1 << n.bit_length()
self.data = [0] * (self.N0*2)
def update(self, l, r, val) :
l += self.N0
r += self.N0
while l < r:
if l & 1:
self.data[l] = self.data[l] + val
l += 1
if r & 1:
self.data[r-1] = self.data[r-1] + val
r -= 1
l //= 2
r //= 2
def query(self, i):
i += len(self.data) // 2
ret = self.data[i]
while i > 0:
i //= 2
ret = ret + self.data[i]
return ret
def main():
N,D,A = list(map(int,input().split()))
enemy = []
for i in range(N):
x,h = list(map(int,input().split()))
if h%A==0:
enemy.append([x,h//A])
else:
enemy.append([x,h//A+1])
enemy.sort(key=lambda x:x[0])
def bisect(index):
x = enemy[index][0]
if enemy[N-1][0] <= x + 2*D:
return N-1
l = index
r = N-1
while r-l>1:
if enemy[(r+l)//2][0] <= x + 2*D:
l = (r+l)//2
else:
r = (r+l)//2
return l
ST = DualSegmentTree(N)
for i in range(N):
ST.update(i,i+1,enemy[i][1])
count = 0
for i in range(N):
v = ST.query(i)
count += v
j = bisect(i)
ST.update(i,j+1,-v)
print(count)
if __name__ == '__main__':
main()
|
import sys
sys.setrecursionlimit(500000)
def input():
return sys.stdin.readline()[:-1]
class DualSegmentTree:
def __init__(self, n) :
self.n = n
self.N0 = 1 << n.bit_length()
self.data = [0] * (self.N0*2)
def update(self, l, r, val) :
l += self.N0
r += self.N0
while l < r:
if l & 1:
self.data[l] = self.data[l] + val
l += 1
if r & 1:
self.data[r-1] = self.data[r-1] + val
r -= 1
l //= 2
r //= 2
def query(self, i):
i += len(self.data) // 2
ret = self.data[i]
while i > 0:
i //= 2
ret = ret + self.data[i]
return ret
def main():
N,D,A = list(map(int,input().split()))
enemy = []
for i in range(N):
x,h = list(map(int,input().split()))
if h%A==0:
enemy.append([x,h//A])
else:
enemy.append([x,h//A+1])
enemy.sort(key=lambda x:x[0])
def bisect(index):
x = enemy[index][0]
if enemy[N-1][0] <= x + 2*D:
return N-1
l = index
r = N-1
while r-l>1:
if enemy[(r+l)//2][0] <= x + 2*D:
l = (r+l)//2
else:
r = (r+l)//2
return l
ST = DualSegmentTree(N)
for i in range(N):
ST.update(i,i+1,enemy[i][1])
count = 0
for i in range(N):
v = ST.query(i)
if v>0:
count += v
j = bisect(i)
ST.update(i,j+1,-v)
print(count)
if __name__ == '__main__':
main()
|
[
"control_flow.branch.if.add"
] | 593,033
| 593,035
|
u785989355
|
python
|
p02788
|
n,d,a=map(int,input().split())
xh=[list(map(int,input().split())) for _ in range(n)]
xh.sort()
import collections
pq=collections.deque()
ans = 0
totalDamage = 0
for i in range(n):
x,h = xh[i]
if len(pq) and pq[0][0] < x:
totalDamage -= pq[0][1]
pq.popleft()
h -=totalDamage
if h <= 0:
continue
num = (h + a -1) //a
ans += num
dam = num*a
totalDamage += dam
pq.append((x+2*d,dam))
print(ans)
|
n,d,a=map(int,input().split())
xh=[list(map(int,input().split())) for _ in range(n)]
xh.sort()
import collections
pq=collections.deque()
ans = 0
totalDamage = 0
for i in range(n):
x,h = xh[i]
while len(pq) > 0 and pq[0][0] < x:
totalDamage -= pq[0][1]
pq.popleft()
h -=totalDamage
if h <= 0:
continue
num = (h + a -1) //a
ans += num
dam = num*a
totalDamage += dam
pq.append((x+2*d,dam))
print(ans)
|
[
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove",
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 593,123
| 593,124
|
u566529875
|
python
|
p02788
|
import sys
n, D, a = map(int, input().split())
tg = []
for _ in range(n):
x, h = map(int, sys.stdin.readline().split())
c = h // a
if h % a > 0:
c+=1
tg.append([x, c])
class BIT:
def __init__(self, n):
self.n = n
self.N = 1 << n.bit_length()
self.data = [0] * (self.N +1)
def add(self, i, x):
while i <= self.N:
self.data[i] += x
i += i & -i
def sum(self, i):
total = 0
while i > 0:
total += self.data[i]
i -= i&-i
return total
def search(self, w):
if w <= 0:
return 0
x = 0
k = self.N >> 1
while k > 0:
if x+k <= self.N and self.data[x+k] < w:
w -= self.data[x+k]
x += k
k = k >> 1
return x+1
def len(self):
return self.data[self.N]
tg = sorted(tg, key=lambda x:x[0])
bit = BIT(n+2)
result = 0
ind = 0
for i in range(n):
c = tg[i][1] - bit.sum(i+1)
d = tg[i][0]
if c <= 0:
continue
result += c
wd = d + 2*D
if ind < c:
ind = c
for j in range(ind, n):
if tg[j][0] <= wd:
ind = j
else:
break
bit.add(i+1, c)
bit.add(ind+2, -c)
print(result)
|
import sys
n, D, a = map(int, input().split())
tg = []
for _ in range(n):
x, h = map(int, sys.stdin.readline().split())
c = h // a
if h % a > 0:
c+=1
tg.append([x, c])
class BIT:
def __init__(self, n):
self.n = n
self.N = 1 << n.bit_length()
self.data = [0] * (self.N +1)
def add(self, i, x):
while i <= self.N:
self.data[i] += x
i += i & -i
def sum(self, i):
total = 0
while i > 0:
total += self.data[i]
i -= i&-i
return total
def search(self, w):
if w <= 0:
return 0
x = 0
k = self.N >> 1
while k > 0:
if x+k <= self.N and self.data[x+k] < w:
w -= self.data[x+k]
x += k
k = k >> 1
return x+1
def len(self):
return self.data[self.N]
tg = sorted(tg, key=lambda x:x[0])
bit = BIT(n+2)
result = 0
ind = 0
for i in range(n):
c = tg[i][1] - bit.sum(i+1)
d = tg[i][0]
if c <= 0:
continue
result += c
wd = d + 2*D
if ind < i:
ind = i
for j in range(ind, n):
if tg[j][0] <= wd:
ind = j
else:
break
bit.add(i+1, c)
bit.add(ind+2, -c)
print(result)
|
[
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 593,175
| 593,176
|
u594518120
|
python
|
p02788
|
#!/usr/bin/env python3
import sys, math, bisect
sys.setrecursionlimit(300000)
def solve(N: int, D: int, A: int, X: "List[int]", H: "List[int]"):
p = []
for i in range(N):
p.append([X[i], H[i]])
p.sort()
ret = 0
idx = []
val = []
cur = 0
nex = 0
cum = 0
minus = 0
l = 0
for i in range(N):
v = cum
while l < i and idx[l] < i:
minus = val[l]
l += 1
v -= minus
p[i][1] = max(0, p[i][1] - v * A)
tmp = math.ceil(p[i][1] // A)
ret += tmp
x = p[i][0] + D
while nex < N and p[nex][0] <= x + D:
#$print('hogehoge')
#$print(nex, p[nex][0], x + D)
nex += 1
cum += tmp
idx.append(nex - 1)
val.append(cum)
#print(i)
#print(idx)
#print(val)
#print('tmp ', tmp)
#print(ret)
#print(cum)
#print()
print(ret)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
D = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
X = [int()] * (N) # type: "List[int]"
H = [int()] * (N) # type: "List[int]"
for i in range(N):
X[i] = int(next(tokens))
H[i] = int(next(tokens))
solve(N, D, A, X, H)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys, math, bisect
sys.setrecursionlimit(300000)
def solve(N: int, D: int, A: int, X: "List[int]", H: "List[int]"):
p = []
for i in range(N):
p.append([X[i], H[i]])
p.sort()
ret = 0
idx = []
val = []
cur = 0
nex = 0
cum = 0
minus = 0
l = 0
for i in range(N):
v = cum
while l < i and idx[l] < i:
minus = val[l]
l += 1
v -= minus
p[i][1] = max(0, p[i][1] - v * A)
tmp = math.ceil(p[i][1] / A)
ret += tmp
x = p[i][0] + D
while nex < N and p[nex][0] <= x + D:
#$print('hogehoge')
#$print(nex, p[nex][0], x + D)
nex += 1
cum += tmp
idx.append(nex - 1)
val.append(cum)
#print(i)
#print(idx)
#print(val)
#print('tmp ', tmp)
#print(ret)
#print(cum)
#print()
print(ret)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
D = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
X = [int()] * (N) # type: "List[int]"
H = [int()] * (N) # type: "List[int]"
for i in range(N):
X[i] = int(next(tokens))
H[i] = int(next(tokens))
solve(N, D, A, X, H)
if __name__ == '__main__':
main()
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 593,263
| 593,264
|
u200785298
|
python
|
p02788
|
#!/usr/bin/env python3
import sys, math, bisect
sys.setrecursionlimit(300000)
def solve(N: int, D: int, A: int, X: "List[int]", H: "List[int]"):
p = []
for i in range(N):
p.append([X[i], H[i]])
p.sort()
ret = 0
idx = []
val = []
nex = 0
minus = 0
l = 0
for i in range(N):
#print(i)
#print(p[i])
v = ret
while l < i and idx[l] < i:
minus = val[l]
l += 1
v -= minus
p[i][1] = max(0, p[i][1] - v * A)
tmp = math.ceil(p[i][1] // A)
ret += tmp
x = p[i][0] + D
while nex < N and p[nex][0] <= x + D:
nex += 1
nex -= 1
idx.append(nex)
val.append(ret)
#print(idx)
#print(val)
#print('tmp ', tmp)
#print(ret)
#print()
print(ret)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
D = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
X = [int()] * (N) # type: "List[int]"
H = [int()] * (N) # type: "List[int]"
for i in range(N):
X[i] = int(next(tokens))
H[i] = int(next(tokens))
solve(N, D, A, X, H)
if __name__ == '__main__':
main()
|
#!/usr/bin/env python3
import sys, math, bisect
sys.setrecursionlimit(300000)
def solve(N: int, D: int, A: int, X: "List[int]", H: "List[int]"):
p = []
for i in range(N):
p.append([X[i], H[i]])
p.sort()
ret = 0
idx = []
val = []
nex = 0
minus = 0
l = 0
for i in range(N):
#print(i)
#print(p[i])
v = ret
while l < i and idx[l] < i:
minus = val[l]
l += 1
v -= minus
p[i][1] = max(0, p[i][1] - v * A)
tmp = math.ceil(p[i][1] / A)
ret += tmp
x = p[i][0] + D
while nex < N and p[nex][0] <= x + D:
nex += 1
nex -= 1
idx.append(nex)
val.append(ret)
#print(idx)
#print(val)
#print('tmp ', tmp)
#print(ret)
#print()
print(ret)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
D = int(next(tokens)) # type: int
A = int(next(tokens)) # type: int
X = [int()] * (N) # type: "List[int]"
H = [int()] * (N) # type: "List[int]"
for i in range(N):
X[i] = int(next(tokens))
H[i] = int(next(tokens))
solve(N, D, A, X, H)
if __name__ == '__main__':
main()
|
[
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 593,266
| 593,267
|
u200785298
|
python
|
p02789
|
a,b = map(int,input().split())
print(a,b)
if a == b:
print("Yes")
else:
print("No")
|
a,b = map(int,input().split())
if a == b:
print("Yes")
else:
print("No")
|
[
"call.remove"
] | 593,356
| 593,357
|
u127499732
|
python
|
p02789
|
a,b = map(int,input().split())
if a - b == 0:
print("yes")
else:
print("No")
|
a,b = map(int,input().split())
if a == b:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,358
| 593,357
|
u127499732
|
python
|
p02789
|
a,b = map(int,input().split())
if a == b:
print("yes")
else:
print("No")
|
a,b = map(int,input().split())
if a == b:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,359
| 593,357
|
u127499732
|
python
|
p02789
|
N, M = map(input().split())
print("Yes" if N == M else "No")
|
N, M = map(int, input().split())
print("Yes" if N == M else "No")
|
[
"call.arguments.add"
] | 593,375
| 593,376
|
u600261652
|
python
|
p02789
|
b, c = map(int , input().split())
print("Yes") if b == c else print("NO")
|
b, c = map(int, input().split())
print("Yes") if b == c else print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,401
| 593,402
|
u511449169
|
python
|
p02789
|
N,M=[int(i) for i in input().split()]
print("AC" if N==M else "WA")
|
N,M=[int(i) for i in input().split()]
print("Yes" if N==M else "No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,405
| 593,406
|
u789436713
|
python
|
p02789
|
N, M = map(input().split())
if M == N:
print("Yes")
else:
print("No")
|
N, M = map(int, input().split())
if M == N:
print("Yes")
else:
print("No")
|
[
"call.arguments.add"
] | 593,409
| 593,410
|
u884323674
|
python
|
p02789
|
n, m = map(int,input(),split())
if n == m:
print("Yes")
else:
print("No")
|
n, m = map(int,input().split())
if n == m:
print("Yes")
else:
print("No")
|
[
"assignment.value.change",
"call.arguments.change"
] | 593,411
| 593,412
|
u169350228
|
python
|
p02789
|
n,m = map(int, input().split())
if n == m:
print('AC')
else:
print('WA')
|
n,m = map(int, input().split())
if n == m:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,424
| 593,425
|
u447456419
|
python
|
p02789
|
a,b = input().split()
if b >= a:
print('Yes')
else:
print('No')
|
a,b = input().split()
if b == a:
print('Yes')
else:
print('No')
|
[
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 593,429
| 593,430
|
u591823813
|
python
|
p02789
|
N,M = map(int,input(),split())
print("Yes" if N == M else "No")
|
N,M = map(int,input().split())
print("Yes" if N == M else "No")
|
[
"assignment.value.change",
"call.arguments.change"
] | 593,444
| 593,445
|
u626228246
|
python
|
p02789
|
print("Yes" if len(set(input.split()))==1 else "No")
|
print("Yes" if len(set(input().split()))==1 else "No")
|
[
"call.add"
] | 593,457
| 593,458
|
u089032001
|
python
|
p02789
|
n.m=map(int,input().split())
if n==m:
print('Yes')
else:
print('No')
|
n,m=map(int,input().split())
if n==m:
print('Yes')
else:
print('No')
|
[
"misc.typo",
"assignment.variable.change"
] | 593,459
| 593,460
|
u768256617
|
python
|
p02789
|
a,b=map(int,input().split())
print("Yes" if a==b else "Np")
|
a,b=map(int,input().split())
print("Yes" if a==b else "No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,475
| 593,476
|
u332793228
|
python
|
p02789
|
a,b = input().split(' ')
if a == b:
print('Yes')
else:
print('NO')
|
a,b = input().split(' ')
if a == b:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,477
| 593,478
|
u126063509
|
python
|
p02789
|
N,M = map(input().split())
if N == M:
print("Yes")
else:
print("No")
|
N,M = map(int,input().split())
if N == M:
print("Yes")
else:
print("No")
|
[
"call.arguments.add"
] | 593,483
| 593,482
|
u131464432
|
python
|
p02789
|
N, M = map(int, input().split())
print('yes' if N==M else 'no')
|
N, M = map(int, input().split())
print('Yes' if N==M else 'No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,491
| 593,492
|
u350667455
|
python
|
p02789
|
n,m = map(int, input().split())
if (n==m):
print("AC")
else:
print("WA")
|
n,m = map(int, input().split())
if (n==m):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,497
| 593,498
|
u262597910
|
python
|
p02789
|
n,m=map(int,input().split())
print(Yes) if n==m else print(No)
|
n,m=map(int,input().split())
print("Yes") if n==m else print("No")
|
[
"call.arguments.change"
] | 593,501
| 593,502
|
u039189422
|
python
|
p02789
|
n. k = map(int, input().split())
if(n == k):
print('Yes')
else:
print('No')
|
n, k = map(int, input().split())
if(n == k):
print('Yes')
else:
print('No')
|
[
"misc.typo",
"assignment.variable.change"
] | 593,503
| 593,504
|
u250554058
|
python
|
p02789
|
a,b=(input().split())
print("YES" if(a==b) else "NO")
|
a,b=(input().split())
print("Yes" if(a==b) else "No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,505
| 593,506
|
u810066979
|
python
|
p02789
|
n, m = list(map(int, input().split()))
print('Yes') if n == M else print('No')
|
n, m = list(map(int, input().split()))
print('Yes') if n == m else print('No')
|
[
"identifier.change"
] | 593,533
| 593,534
|
u341543478
|
python
|
p02789
|
N, M = map(int, input())
if N == M:
print("Yes")
else:
print("No")
|
N, M = map(int, input().split())
if N == M:
print("Yes")
else:
print("No")
|
[
"call.add"
] | 593,555
| 593,556
|
u238084414
|
python
|
p02789
|
N,M=map(int, input().split())
if N==m:
print('Yes')
else:
print('No')
|
N,M=map(int, input().split())
if N==M:
print('Yes')
else:
print('No')
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 593,563
| 593,564
|
u252964975
|
python
|
p02789
|
N, M=map(int, input().split())
if N!=M:
print("Yes")
else:
print("No")
|
N, M=map(int, input().split())
if N==M:
print("Yes")
else:
print("No")
|
[
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 593,584
| 593,585
|
u337626942
|
python
|
p02789
|
N,M=map(int,input().split())
if(N==M):
print("Yes")
else:
("No")
|
N,M=map(int,input().split())
if(N==M):
print("Yes")
else:
print ("No")
|
[
"io.output.change",
"call.add"
] | 593,586
| 593,587
|
u129312662
|
python
|
p02789
|
n,m=input().split();print("YNeos"[n>m::2])
|
n,m=input().split();print("YNeos"[n!=m::2])
|
[
"expression.operator.compare.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"io.output.change"
] | 593,597
| 593,596
|
u540631540
|
python
|
p02789
|
a, b = map(int, input().split())
if a == b:
Print('Yes')
else:
Print('No')
|
a, b = map(int, input().split())
if a == b:
print('Yes')
else:
print('No')
|
[
"identifier.change",
"call.function.change",
"io.output.change"
] | 593,601
| 593,602
|
u024340351
|
python
|
p02789
|
N, M = map(int, input())
if N == M:
print('Yes')
else:
print('No')
|
N, M = map(int, input().split())
if N == M:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 593,603
| 593,604
|
u729836751
|
python
|
p02789
|
n, m = map(int, input().split())
if n / m == 1:
print("Yes")
else:
print("No")
|
n, m = map(int, input().split())
if n == m:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 593,605
| 593,606
|
u744857643
|
python
|
p02789
|
n,m=map(int,input().split())
print("Yes" if n==m else "NO")
|
n,m=map(int,input().split())
print("Yes" if n==m else "No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,609
| 593,610
|
u369133448
|
python
|
p02789
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
from io import StringIO
import unittest
def resolve():
n, m = map(int, input().split())
if n == m:
print("Yes")
else:
print("No")
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 3"""
output = """Yes"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """3 2"""
output = """No"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """1 1"""
output = """Yes"""
self.assertIO(input, output)
if __name__ == "__main__":
unittest.main()
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
from io import StringIO
import unittest
def resolve():
n, m = map(int, input().split())
if n == m:
print("Yes")
else:
print("No")
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """3 3"""
output = """Yes"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """3 2"""
output = """No"""
self.assertIO(input, output)
def test_入力例_3(self):
input = """1 1"""
output = """Yes"""
self.assertIO(input, output)
if __name__ == "__main__":
# unittest.main()
resolve()
|
[] | 593,632
| 593,633
|
u458388104
|
python
|
p02789
|
N,M = map(int,input().split())
if N == M :
print ('yes')
else :
print ('no')
|
N,M = map(int,input().split())
if N == M :
print ('Yes')
else :
print ('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,634
| 593,635
|
u354623416
|
python
|
p02789
|
n, m = map(int, input().split())
if n == m:
print("AC")
else:
print("WA")
|
n, m = map(int, input().split())
if n == m:
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,638
| 593,639
|
u652081898
|
python
|
p02789
|
# coding: utf-8
# Your code here!
n,m = map(int, input.split())
if n == m:
print('Yes')
else:
print('No')
|
# coding: utf-8
# Your code here!
n, m = map(int, input().split())
if n == m:
print("Yes")
else:
print('No')
|
[
"call.add",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,653
| 593,654
|
u488127128
|
python
|
p02789
|
# coding: utf-8
# Your code here!
n,m = map(int, input.split())
if n == m:
print('Yes')
else:
print('No')
|
# coding: utf-8
# Your code here!
n,m = map(int, input().split())
if n == m:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 593,653
| 593,655
|
u488127128
|
python
|
p02789
|
N, M = map(int, input().split())
if N == M:
print("YES")
else :
print("NO")
|
N, M = map(int, input().split())
if N == M:
print("Yes")
else :
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,658
| 593,659
|
u288613683
|
python
|
p02789
|
N, M = map(int, input())
if N == M:
print('Yes')
else:
print('No')
|
N, M = map(int, input().split())
if N == M:
print('Yes')
else:
print('No')
|
[
"call.add"
] | 593,666
| 593,667
|
u433147299
|
python
|
p02789
|
N, M = input().split()
if N==M :
print('YES')
else:
print('NO')
|
N , M = input().split()
if N == M:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,674
| 593,675
|
u634046173
|
python
|
p02789
|
N, M = input().split()
if N==M :
print('YES')
else:
print('NO')
|
N , M = input().split()
if N == M:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,676
| 593,675
|
u634046173
|
python
|
p02789
|
N, M = input().split()
if N==M :
print('YES')
else:
print('NO')
|
N, M = input().split()
if N==M:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,674
| 593,677
|
u634046173
|
python
|
p02789
|
N, M = input().split()
if N==M :
print('YES')
else:
print('NO')
|
N, M = input().split()
if N==M:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,676
| 593,677
|
u634046173
|
python
|
p02789
|
def main():
n,m = map(int, input().split())
if n == m:
print('yes')
else:
print('No')
if __name__ == '__main__':
main()
|
def main():
n,m = map(int, input().split())
if n == m:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 593,678
| 593,679
|
u624617831
|
python
|
p02789
|
ac="AC"
wa="WA"
n,m=map(int,input().split())
if n==m:print(ac)
else:print(wa)
|
ac="Yes"
wa="No"
n,m=map(int,input().split())
if n==m:print(ac)
else:print(wa)
|
[
"literal.string.change",
"assignment.value.change"
] | 593,690
| 593,691
|
u227082700
|
python
|
p02789
|
N ,M= map(int,input())
#S = int(input())
if N== M:
print("Yes")
else:
print("No")
|
N ,M= map(int,input().split())
#S = int(input())
if N== M:
print("Yes")
else:
print("No")
|
[
"call.add"
] | 593,696
| 593,697
|
u948521599
|
python
|
p02789
|
N,M = map(int,input().split())
ans = "WA"
if N == M:
ans = "AC"
print(ans)
|
N,M = map(int,input().split())
ans = "No"
if N == M:
ans = "Yes"
print(ans)
|
[
"literal.string.change",
"assignment.value.change"
] | 593,700
| 593,701
|
u274599728
|
python
|
p02789
|
n, m = map(int, input(),split())
print('Yes' if n==m else 'No')
|
n, m = map(int, input().split())
print('Yes' if n==m else 'No')
|
[
"assignment.value.change",
"call.arguments.change"
] | 593,702
| 593,703
|
u771167374
|
python
|
p02789
|
a,b = input().split()
if a == b:
print('Tes')
else:
print('No')
|
a,b = input().split()
if a == b:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 593,719
| 593,718
|
u126887629
|
python
|
p02789
|
input = list(map(int, input().split()))
N = input[0]
M = input[1]
if iN == M:
print("Yes")
else:
print("No")
|
input = list(map(int, input().split()))
N = input[0]
M = input[1]
if N == M:
print("Yes")
else:
print("No")
|
[
"identifier.change",
"control_flow.branch.if.condition.change"
] | 593,720
| 593,721
|
u034777138
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.