problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03371 | s391529604 | Wrong Answer | a,b,c,x,y = map(int,input().split())
ans = 0
if c*2 <= a+b:
while 0<min(x,y):
x -= 1
y -= 1
ans += c*2
if 0 < a and a*c*2 < a*x:
ans += (c*x*2)
elif 0 < b and b*c*2 < b*y:
ans += (c*y*2)
else:
ans += (a*x)+(b*y)
else:
ans = (a*x)+(b*y)
print(ans) |
p03371 | s326051938 | Wrong Answer | A, B, C, X, Y = map(int,input().split())
ans = float('inf')
for i in range(max(X,Y)):
num = i*C + min(0, X-i)*A + min(0, Y-i)*B
ans = min(ans, num)
print(ans)
|
p03371 | s732927970 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
ans = float("inf")
for i in range(max(X, Y)):
x = max(X - i, 0)
y = max(Y - i, 0)
cost = 2*C * i + A * x + B * y
ans = min(ans, cost)
print(ans) |
p03371 | s307610937 | Wrong Answer | def solve(a,b,c,x,y):
l = []
for i in range(5*(10**4)+1):
s = a*max(x-i,0)+b*max(y-i,0)+c*i*2
l.append(s)
return min(l)
A,B,C,X,Y = map(int,input().split())
print(solve(A,B,C,X,Y)) |
p03371 | s610144277 | Wrong Answer |
a,b,c,x,y = map(int,input().split())
#print(a,b,c,x,y)
if x > y:
d = x
else:
d = y
#print(d)
for i in range(x + 1):
for j in range(y + 1):
for k in range(2 * d + 1):
if (i + k / 2 >= x and j + k / 2 >= y):
price = a * i + b * j + c * k
maxprice = a * x + b * y
if price <= maxprice:
maxprice = price
#print(p_lists)
print(price)
|
p03371 | s359891106 | Wrong Answer | A, B, C, X, Y = list(map(int, input().split()))
a_total = A * X
b_total = B * Y
total = a_total + b_total
c_mul = (X + Y) // 2
c_total = C * (2 * c_mul)
if X > Y:
c_total += A * (X - c_mul)
if Y > X:
c_total += B * (Y - c_mul)
if total > c_total:
print(c_total)
else:
print(total) |
p03371 | s034566259 | Wrong Answer | def i():
return int(input())
def i2():
return map(int,input().split())
def s():
return str(input())
def l():
return list(input())
def intl():
return list(int(k) for k in input().split())
a,b,c,x,y = i2()
if a+b > 2*c:
z = min(x,y)//2
print( a*(x-2*z)+b*(y-2*z)+c*4*z)
else:
print( a*x+b*y ) |
p03371 | s743034380 | Wrong Answer | a , b , c , x , y = map(int,input().split())
k = max(x,y)
minman = a * b * c
k = k // 2
for i in range(k,-1,-1):
now_x = x
now_y = y
ans = c * (i * 4)
now_x = now_x - (i * 2)
now_y = now_y - (i * 2)
if now_x < 0:
now_x = 0
if now_y < 0:
now_y = 0
ans +=( now_x * a ) + ( now_y * b)
if minman > ans:
minman = ans
print(minman) |
p03371 | s587495922 | Wrong Answer | def solve(a,b,c,x,y):
k_max = min(x,y)
l = []
for i in range(k_max):
s = a*max((x-i),0)+b*max((y-i),0)+c*i*2
l.append(s)
return min(l)
A,B,C,X,Y = map(int,input().split())
print(solve(A,B,C,X,Y)) |
p03371 | s631507413 | Wrong Answer | a,b,c,x,y=map(int,input().split())
c=c*2
print(min(c*max(x,y),y*c+(x-y)*a,x*c+(y-x)*b,a*x+b*y)) |
p03371 | s019236332 | Wrong Answer | a, b, c, x, y = map(int, input().split())
if (a+b) <= c*2:
print(a*x+b*y)
else:
if x >= y:
tmp1 = y*2*c + (x-y)*a
tmp2 = c*x*2
print(min(tmp1, tmp2))
else:
tmp1 = x * 2 * c + (y-x) * a
tmp2 = c * y * 2
print(min(tmp1, tmp2))
|
p03371 | s291431528 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ab = min(x, y)//2 * 2
ans1 = ab*2*c + max(0, x-ab)*a + max(0, y-ab)*b
ans2 = x*a + y*b
ab = max(x, y)//2 * 2
ans3 = ab*2*c + max(0, x-ab)*a + max(0, y-ab)*b
ab = -(-max(x, y)/2) * 2
ans4 = ab*2*c + max(0, x-ab)*a + max(0, y-ab)*b
ab = -(-min(x, y)/2) * 2
ans5 = ab*2*c + max(0, x-ab)*a + max(0, y-ab)*b
print(min(ans1, ans2, ans3, ans4, ans5))
|
p03371 | s146217601 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ans = 0
if a > c * 2 and b > c * 2:
ans = max(x, y) * 2 * c
elif a + b > c * 2:
mini= min(x, y)
x -= mini
y -= mini
ans = mini * 2 * c + x * a + y * b
else:
ans += a * x + b * y
print(ans)
|
p03371 | s747240758 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
value = float('inf')
D = max(A,B)
for i in range(D+1):
E = max((X-i)*A, 0)
F = max((Y-i)*B, 0)
valueX = 2*i*C+E+F
if valueX < value:
value = valueX
print(str(value)) |
p03371 | s065590406 | Wrong Answer | def main():
A, B, C, X, Y = map(int, input().split())
if A + B <= 2*C:
print(A*X + B*Y)
elif 2*C < A and 2*C < B:
print(C*max(X, Y)*2)
elif 2*C < A or 2*C < B:
print(C*max(X, Y)*2)
else:
if X < Y:temp = B
else: temp = A
print(C*min(X, Y)*2 + temp*(abs(X-Y)))
if __name__ == "__main__":
main()
|
p03371 | s094968987 | Wrong Answer | A,B,C,X,Y = map(int, input().split())
n = min(X,Y)
sum = 0
sum = min(n*2*C, A*n+B*n)
if X>Y:
n = X-n
sum = sum + n*A
else:
n = Y - n
sum = sum + n*B
print(sum) |
p03371 | s077538590 | Wrong Answer | def main():
a, b, c, x, y = map(int, input().split())
d = [a, b]
i, j = max(x, y), min(x, y)
n = i // 2 * 2
f = i == x
if 2 * c * n > (a + b) * n:
ans = a * x + b * y
else:
ans = c * 2 * n + (i % 2 == 1) * min(2 * c, d[not f])
print(ans)
if __name__ == '__main__':
main()
|
p03371 | s347580674 | Wrong Answer | import itertools
a,b,c,x,y = map(int, input().split(" "))
ans = 10 ** 10
if min(a, b) > 2 * c:
print(c * max(x, y) * 2)
else:
for i in range(min(x, y) + 1):
temp = a * (x - i) + b * (y - i) + c * (i * 2)
if ans > temp:
ans = temp
print(ans) |
p03371 | s691025358 | Wrong Answer | a,b,c,x,y = map(int,input().split())
ans=a*x+b*y
if x>y:
e = c*2*y
f = a*(x-y)
ans=min(ans,e+y)
g= 2*c*x
ans=min(ans,g)
else:
e = c*2*x
f = b*(y-x)
ans = min(ans,e+f)
g = 2*c*y
ans = min(ans,g)
print(ans)
|
p03371 | s393608086 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ans = 10000000
for i in range(max(x, y) + 1):
p = c * i * 2 + max(0, x - i) * a + max(0, y - i) * b
ans = min(ans, p)
print(ans) |
p03371 | s190075424 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ab = min(x, y)//2 * 2
ans1 = ab*2*c + max(0, x-ab)*a + max(0, y-ab)*b
ans2 = x*a + y*b
ab = max(x, y)//2 * 2
ans3 = ab*2*c + max(0, x-ab)*a + max(0, y-ab)*b
ab = max(x, y)//2 * 2
ans4 = ab*2*c + max(0, x-ab)*a + max(0, y-ab)*b
print(min(ans1, ans2, ans3, ans4))
|
p03371 | s957688638 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
plan1 = (A*X) + (B*Y)
plan2 = (C*2) * max(X,Y)
plan3 = (C*2) * X + B*(Y-X)
plan4 = (C*2) * Y + A*(Y-X)
if X <= Y:
print(min(plan1,plan2,plan3))
else:
print(min(plan1,plan2,plan4)) |
p03371 | s348596205 | Wrong Answer | a, b, c, x, y = map(int, input().split())
price = 0
if a + b <= 2 * c:
price = a * x + b * y
elif a >= 2 * c and b >= 2 * c:
price = 2 * c * max(x, y)
elif a >= 2 * c:
price = 2 * c * x + b * max(y - x, 0)
elif b >= 2 * c:
price = 2 * c * y + b * max(x - y, 0)
else:
price = 2 * c * min(x, y)
if x > y:
price += a * (x - y)
else:
price += b * (y - x)
print(price) |
p03371 | s826585222 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
TotalPrice = 5000 * 10**5
for i in range(max(X, Y) + 1):
priceA = A * max(X - i, 0)
priceB = B * max(Y - i, 0)
TotalPrice = min(TotalPrice, 2 * C * i + priceA + priceB)
print(TotalPrice)
|
p03371 | s086830024 | Wrong Answer | a,b,ab,x,y=map(int,input().split())
ans=0
abcnt=min(x,y)
if (a+b)//2>ab*2:
ans+=max(x,y)*2*ab
elif (a+b)//2>=ab:
ans+=abcnt*2*ab
if x>y:
ans+=(x-abcnt)*a
else:
ans+=(y-abcnt)*b
else:
ans+=x*a+y*b
print(ans)
|
p03371 | s117165735 | Wrong Answer | A,B,C,X,Y = map(int, input().split())
n = min(X,Y)
sum = 0
sum = min(n*2*C, A*n+B*n)
if X>Y:
n = X-n
sum = sum + n*A
else:
n = Y - n
sum = sum + n*B
s = (X+Y)*2*C
if sum>s:
print(s)
else:
print(sum) |
p03371 | s610150441 | Wrong Answer | #<全探索>
#<ABC95C>
A,B,C,X,Y = map(int,input().split())
ans1 = A*X + B* Y
ans2=0
if X > Y:
ans2= C * 2 * Y + A * (X-Y)
else:
ans2= C * 2 * X + A * (Y-X)
ans3 = 0
if X > Y:
ans3 = C * 2 * X
else:
ans3 = C * 2 * Y
print(min(ans1,ans2,ans3))
|
p03371 | s850388465 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
X_piza = X
Y_piza = Y
minimum = 10**20
for i in range(0,10**5+2,2):
if minimum>C*2*i+max(0,X-i)*A+max(0,Y-i)*B:
minimum = C*2*i+max(0,X-i)*A+max(0,Y-i)*B
print(minimum) |
p03371 | s488969390 | Wrong Answer | a,b,c,x,y = map(int,input().split())
c *= 2
ans = 10 ** 5
for i in range(max(x,y)):
p = 0
p += c * i
p += a * (max(0,x - i))
p += b * (max(0,y - i))
ans = min(ans,p)
print(ans) |
p03371 | s032503043 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
ans = 0
for i in range(max(X, Y)):
if i <= min(X, Y) - 1:
ans += min(A + B, 2 * C)
else:
ans += min(A, B, 2 * C)
print(ans) |
p03371 | s717875660 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
print(min(max(A,B)*min(X,Y)+min(A,B)*max(X,Y), ((max(X,Y)-min(X,Y))*A)+2*C*min(X,Y) if A < B else (max(X,Y)-min(X,Y))*B+2*C*min(X,Y), 2*C*max(X,Y))) |
p03371 | s029701744 | Wrong Answer | a, b, c, x, y = map(int, input().split())
if c <= (a/2) and c <= (b/2):
print(c*max(x, y)*2)
elif c <= (a + b) / 2:
if x <= y:
print(c*x*2+b*(y-x))
else:
print(c*y*2+a*(x-y))
else:
print(a*x+b*y) |
p03371 | s604832557 | Wrong Answer | #<全探索>
#<ABC95C>
A,B,C,X,Y = map(int,input().split())
ans1 = A*X + B* Y
ans2=0
if X > Y:
ans2= C * 2 * Y + A * (X-Y)
else:
ans2= C * 2 * X + A * (Y-X)
ans3 = 0
if X > Y:
ans3 = C * 2 * X
else:
ans3 = C * 2 * Y
ans4=A * X + C * 2 *Y
ans5 = 2 * C * X + B * Y
print(min(ans1,ans2,ans3,ans4,ans5))
|
p03371 | s658456929 | Wrong Answer | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
a,b,c,x,y = nm()
min_cost = 10**7
for i in range(10**6):
cost=2*c*i
cost+=max(0,x-i)*a
cost+=max(0,y-i)*b
min_cost = min(min_cost,cost)
print(min_cost)
|
p03371 | s933314761 | Wrong Answer | a,b,c,x,y=map(int,input().split())
ans=10**18
for i in range(0,min(x,y)+1):
tmp=(x-i)*a+(y-i)*b+2*i*c
ans=min(ans,tmp)
print(min(ans,tmp)) |
p03371 | s480499725 | Wrong Answer | a,b,c,x,y=map(int,input().split())
if a>2*c and b>2*c:
print(max(x,y)*2*c)
elif a<2*c and b>2*c:
print(y*2*c + max(0,x-y)*a)
elif a>c and b<c:
print(x*2*c + max(0,y-x)*b)
elif a+b>2*c:
if x>y:
print(y*2*c+(x-y)*a)
else:
print(x*2*c+(y-x)*b)
else:
print(a*x+b*y)
|
p03371 | s129382957 | Wrong Answer | [a,b,c,x,y] = [int(i) for i in input().split()]
ans = a * x + b * y
cnt = 1
while x != 0 or y != 0:
x = max(x - 2, 0)
y = max(y - 2, 0)
ans = min(ans,a*x+b*y+c*4*cnt)
cnt += 1
print(ans) |
p03371 | s990595553 | Wrong Answer | a,b,c,x,y = map(int,input().split())
if a+b<=2*c: print(x*a+y*b)
else:
cnt=0
if a*x+b*y<2*c*max(x,y):
cnt=2*c*min(x,y)
if x<=y: cnt+=b*(y-x)
elif x>y: cnt+=a*(x-y)
else:
cnt=2*c*max(x,y)
print(cnt) |
p03371 | s461140508 | Wrong Answer | a,b,c,x,y = map(int,input().split())
ans = 0
if a + b >= c * 2:
ans = c * 2 * min(x,y)
if min(a,b) >= c * 2:
ans += (max(x,y) - min(x,y)) * (c * 2)
else:
if x >= y:
ans += min((max(x,y) - min(x,y)) * a,(max(x,y) - min(x,y)) * a)
else:
ans = a * x + b * y
print(ans) |
p03371 | s028593481 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
ans = 0
if 4 * C < (A + B):
ans = C * max(X,Y) * 2
elif 2 * C < A + B:
if X > Y:
ans = Y * 2 * C + (X - Y) * A
else:
ans = X * 2 * C + (Y - X) * B
else:
ans = A * X + B * Y
print(ans)
|
p03371 | s697168974 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
m = min(X,Y)
m2 = max(X,Y)
if (A+B)/2 > C and m > 1:#できるだけCを買う方がお得
ans = C*2*m
if X>Y:
ans += A*(X-Y)
else:
ans += B*(Y-X)
if ans > C*2*m2:
print(C*2*m2)
else:
print(ans)
else:
print(A*X+B*Y)
|
p03371 | s092581248 | Wrong Answer | A,B,C,X,Y = list(map(int,input().split()))
if A+B <= 2*C:
print(A*X+B*Y)
exit()
if X == Y:
print(2*C*X)
elif X > Y:
tmp = 2*C*Y
m = min(2*C*(X-Y),A*(X-Y))
print(tmp+m)
else:
tmp = 2*C*X
m = min(2*C*(Y-X),A*(Y-X))
print(tmp+m) |
p03371 | s198438974 | Wrong Answer | a, b, c, x, y = map(int, input().split())
dc = c * 2
if dc < a + b:
if dc < a or dc < b:
ans = dc * max(x, y)
else:
ans = dc * min(x, y)
if x > y:
ans += a * (x - y)
elif x < y:
ans += b * (y - x)
else:
ans = a * x + b * y
print(ans)
|
p03371 | s978340662 | Wrong Answer | # https://atcoder.jp/contests/abc095/tasks/arc096
# 値段,枚数
A, B, C, X, Y = map(int, input().split())
# C * 2 は A + Bとなる
ans = max(X, Y) * 2 * C
ans = min(ans, A * X + B * Y)
if X > Y:
ans = min(ans, (X - Y) * A + 2 * C * Y)
elif Y > X:
ans = min(ans, (Y - X) * A + 2 * C * X)
print(ans) |
p03371 | s256780634 | Wrong Answer | A,B,C,X,Y=map(int,input().split())
ans1 = int(A*X + B*Y)
ans2 = int(C*X + (Y-X)*B)
ans3 = int(C*Y + (X-Y)*A)
print(min(ans1,ans2,ans3)) |
p03371 | s268863434 | Wrong Answer | S = input().split(" ")
A = int(S[0])
B = int(S[1])
C = int(S[2])
X = int(S[3])
Y = int(S[4])
def calculate(a,b,c,x,y):
s1 = a * x + b * y
base = min([x,y])
if base % 2 == 1:
base = base - 1
values = [s1]
for i in range(base):
index = (i + 1)
tmp = s1 - (A + B) * index + 2 * C * index
values.append(tmp)
print(min(values))
calculate(A,B,C,X,Y) |
p03371 | s183975799 | Wrong Answer | A, B, C, X, Y = map(int,input().split())
if A+B <= C*2:
print(A*X + B*Y)
else:
if X>=Y:
print(Y*C*2 + (X-Y)*A)
else:
print(X*C*2 + (Y-X)*B)
|
p03371 | s268849396 | Wrong Answer | a, b, c, x, y = map(int, input().split())
if c < (a + b) / 2:
if (c < a and c < b) or (c * 2 <= a or c * 2 <= b):
ans = c * 2 * max(x, y)
else:
ans = c * 2 * min(x, y)
if x > y:
ans += a * abs(y - x)
elif x < y:
ans += b * abs(y - x)
else:
ans = a * x + b * y
print(ans)
|
p03371 | s408916557 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
#全部Cで買うとき
a = 2*C*min(X,Y) + 2*C*(max(X,Y)-min(X,Y))
print(a)
#片方を全部Cで買うとき
if X > Y:
b = 2*C*Y + (X-Y)*A
elif Y > X:
b = 2*C*X + (Y-X)*B
else:
b = a
print(b)
#全部AとBで買うとき
c = A*X + B*Y
print(c)
print(min(a,b,c)) |
p03371 | s621743268 | Wrong Answer | a,b,c,x,y=map(int,input().split())
ans=0
if a+b>=c*2:
print(a*x+b*y)
exit()
elif x>=y:
ans+=c*y
x-=y
if a>=c*2:
ans+=c*2*x
else:
ans+=a*x
elif y>x:
ans+=c*y
y-=x
if b>=c*2:
ans+=c*2*y
else:
ans+=b*x
print(ans)
|
p03371 | s999274749 | Wrong Answer | # https://atcoder.jp/contests/abc095/tasks/arc096
# 値段,枚数
A, B, C, X, Y = map(int, input().split())
ans = float("inf")
for i in range(10 ** 5):
ans = min(ans, max(X - i, 0) * A + max(Y - i, 0) * B + 2 * i * C)
print(ans)
|
p03371 | s984919169 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
if A + B > 2 * C:
if A >= 2 * C and B >= 2 * C:
print(max(X, Y) * 2 * C)
elif X > Y:
print(2 * C * Y + A * (X - Y))
else:
print(2 * C * X + B * (Y - X))
else:
print(X * A + Y * B) |
p03371 | s424512301 | Wrong Answer | A,B,C,X,Y=map(int, input().split())
ans = 500000000
ans = min(ans, A*X+B*Y)
ans = min(ans, C*min(X,Y))
ans = min(ans, (A+B)*min(X,Y)+C*(abs(X-Y)))
print(ans)
|
p03371 | s800991130 | Wrong Answer | piza = list(map(int,input().split()))
half = False
sum = 0
if(piza[0] >= piza[2] and piza[1] >= piza[2]):
sum += piza[2] * max(piza[3],piza[4]) * 2
print(sum)
exit()
elif(piza[0]+piza[1]>piza[2]*2):
half = True
if(half == True):
sum += min(piza[3],piza[4])*piza[2]*2
if(piza[3] > piza[4]):
sum += (piza[3]-piza[4])*piza[0]
else:
sum += (piza[4]-piza[3])*piza[1]
else:
sum += piza[0] * piza[3] + piza[1] * piza[4]
print(sum) |
p03371 | s684078012 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ret = 0
if 2 * c <= a + b:
m = min(x, y)
ret += m * c
x -= m
y -= m
ret += min(2 * c, a) * x
ret += min(2 * c, b) * y
print(ret)
|
p03371 | s549966412 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
print(min(max(A,B)*min(X,Y)+min(A,B)*max(X,Y), ((max(X,Y)-min(X,Y))*A)+2*C*min(X,Y) if A <= B else ((max(X,Y)-min(X,Y))*B)+2*C*min(X,Y), 2*C*max(X,Y))) |
p03371 | s194594087 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
ans = float('INF')
for k in range(2*max(X, Y)+1, 2):
i = max(0, X - k/2)
j = max(0, Y - k/2)
ans = min(ans, A*i + B*j + C*k)
print(ans) |
p03371 | s452387556 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
min = A * X + B * Y
for x in range(X+1):
for y in range(Y+1):
if x <= y:
z = 2 * (X - x)
else:
z = 2 * (Y - y)
Sum = A * x + B * y + C * z
if Sum < min:
min = Sum
print(Sum) |
p03371 | s716069664 | Wrong Answer | a,b,c,x,y=map(int,input().split())
if 2*c > a+b:
if 2*c < min(a,b):
print(c*max(x,y))
else:
if x>=y:
print(2*c*y+a*x)
else:
print(2*c*x+b*y)
else:
print(a*x+b*y) |
p03371 | s860412690 | Wrong Answer | a , b , c , x , y = map(int,input().split())
n = max(x,y)
kar = a*x + b*y
for i in range(1,n+1):
if kar > a*(max(0,x-i)) + b*(max(0,y-i)) +c*i:
kar = a*(max(0,x-i)) + b*(max(0,y-i)) +2*c*i
print(kar) |
p03371 | s940393435 | Wrong Answer | sum = 0
A,B,C,X,Y = map(int,input().split())
AB = C*2
ans = float("inf")
for i in range(10**5+1):
sum = AB*i + A*min(0,X-i) + B*min(0,Y-i)
if sum < ans:
ans = sum
print(ans)
|
p03371 | s455260675 | Wrong Answer | A,B,C,X,Y=list(map(int,input().split()))
money=0
if min(A,B,2*C)==2*C:
money+=2*C*max(X,Y)
elif A+B>=2*C:
money+=2*C*min(X,Y)
if min(X,Y)==X:
Y-=X
money+=Y*B
else:
X-=Y
money+=X*A
else:
money+=A*X
money+=B*Y
print(money) |
p03371 | s669974841 | Wrong Answer | a,b,c,x,y=map(int,input().split())
if x>=y:
if c*2<=min(a,b):
print(c*2*x)
elif c*2<=a+b:
print(c*2*y+a*(x-y))
else:
print(a*x+b*y)
else:
if c*2<=min(a,b):
print(c*2*y)
elif c*2<=a+b:
print(c*2*x+b*(y-x))
else:
print(a*x+b*y) |
p03371 | s999056049 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
print(min(C*2*min(X, Y) + abs(X-Y)*min(A, B), C*2*max(X, Y), A*X+B*Y))
|
p03371 | s508799935 | Wrong Answer | def solve(a,b,c,x,y):
k_max = min(x,y)
l = []
for i in range(k_max+1):
s = a*max((x-i),0)+b*max((y-i),0)+c*i*2
l.append(s)
return min(l)
A,B,C,X,Y = map(int,input().split())
print(solve(A,B,C,X,Y))
|
p03371 | s511886095 | Wrong Answer | a, b, c, x, y = map(int, input().split())
ha = c/2
cost = 10000000000000000
for i in range(x):
for j in range(y):
res = a*i + 2*ha*(x-i) + b*j + 2*ha*(y-j)
if x - i != y - j:
res += abs((x-i)-(y-j))*2*ha
if res < cost:
cost = res
print(int(cost))
|
p03371 | s275943422 | Wrong Answer | a,b,c,x,y = map(int,input().split())
ans = 0
if x>=y:
if 2*c <= a:
print(2*c*x)
else:
if 2*c <= a+b:
print(2*c*y + a*(x-y))
else:
print(a*x + b*y)
else:
if 2*c <= b:
print(2*c*y)
else:
if 2*c <= a+b:
print(2*c*x + a*(y-x))
else:
print(a*x + b*y) |
p03371 | s177793249 | Wrong Answer | A,B,C,X,Y = [int(x) for x in input().split()]
ans = A*X+B*Y
for i in [0, 1, max(1,A-1), max(1,X)]:
for j in [0, 1, max(1,B-1), max(1,Y)]:
ab = max(X-i, Y-j)
ans = min(ans, A*i + B*j + C*(2*ab))
print(ans) |
p03371 | s621563752 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
ans = 1e1000
for i in range(0, 2*min(X, Y)+1, 2):
ans = min(ans, A*max(0, X-i/2)+B*max(0, Y-i/2)+C*i)
print(ans) |
p03371 | s276092672 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
min_ = min(X,Y)
max_ = max(X,Y)
sum = 0
res = A*X + B*Y
for i in range(0,min_):
sum += C * 2
if(C<=0.5 * A and C <= 0.5 * B):
sum += 2*C*(max_-min_)
elif(max_==X):
sum += (max_-min_)*A
else:
sum += (max_-min_)*B
print(min(res,sum)) |
p03371 | s104614528 | Wrong Answer | import math
A,B,C,x,y=map(int,input().split())
price=5000*(10**5)
for a in range(x+1):
c=(x-a)*2
b=math.ceil(y-c/2)
if c<0 or b<0:
continue
if A*a+B*b+C*c<price:
price=A*a+B*b+C*c
print(price) |
p03371 | s615260184 | Wrong Answer | #n = int(input())
a,b,c,x,y = map(int,input().split())
#a_L = list(map(int,input().split()))
price = 500*10**5*2+1
for i in range(100001):
price = min(price,i*2*c + max(0,x-i)*a + max(0,y-i)*b)
print(price)
|
p03371 | s065508163 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
if (A + B) <= 2 * C:
print( A*X + B+Y)
else:
if X >= Y:
if A < 2 * C:
print(A*(X-Y)+2*C*Y)
else:
print(2*C*X)
else:
if B < 2 * C:
print(B*(Y-X)+2*C*X)
else:
print(2*C*Y) |
p03371 | s423824672 | Wrong Answer | A,B,C,X,Y = map(int,input().split())
#全部Cで買うとき
a = 2*C*min(X,Y) + 2*C*(max(X,Y)-min(X,Y))
#片方を全部Cで買うとき
if X > Y:
b = 2*C*Y + (X-Y)*A
elif Y > X:
b = 2*C*X + (Y-X)*A
else:
b = a
#全部AとBで買うとき
c = A*X + B*Y
print(min(a,b,c)) |
p03371 | s999354670 | Wrong Answer | a,b,c,x,y=map(int,input().split())
ans=float("inf")
for i in range(max(x,y)-1):
t=a*(x-min(x,i))+b*(y-min(y,i))+2*c*i
ans=min(ans,t)
print(ans) |
p03371 | s511821995 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
ans = float('INF')
for k in range(2*max(X, Y)+1, 2):
i = max(0, X - int(k/2))
j = max(0, Y - int(k/2))
ans = min(ans, A*i + B*j + C*k)
print(ans) |
p03371 | s788318426 | Wrong Answer | A,B,C,X,Y = map(int, input().split())
sum_1 = A*X + B*Y
sum_2 = 0
if X > Y:
sum_2 = A*(X-Y) + C*2*Y
else:
sum_2 = B*(Y-X) + C*2*X
if sum_2 < sum_1:
print(sum_2)
else:
print(sum_1) |
p03371 | s562273038 | Wrong Answer | import itertools
import math
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
INF = 1 << 60
sys.setrecursionlimit(10 ** 6)
#ここから書き始める
a, b, c, x, y = map(int, input().split())
ans = min((a + b) * min(x, y), c * min(x, y) * 2)
if x > y:
ans += min(a * (x - y), c * (x - y) * 2)
else:
ans += min(a * (y - x), c * (y - x) * 2)
print(ans) |
p03371 | s130854381 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
ans = 10**7
for i in range(max(X, Y) * 2 + 1):
c = i
a = X - i // 2
if a < 0:
a = 0
b = Y - i // 2
if b < 0:
b = 0
v = a * A + b * B + c * C
if v < ans:
ans = v
print(ans)
|
p03371 | s157002775 | Wrong Answer | a,b,c,x,y= map(int, input().split())
if x==y:
ans=min(c*2*x,a*x+b*x)
else:
if x>y:
ans=min(x*c*2,a*x+b*y,y*c*2+(x-y)*a)
else:
ans=min(y*c*2,a*x+b*y,x*c*2+(y-x)*a)
print(ans) |
p03371 | s628577596 | Wrong Answer | A,B,C,X,Y = map(int, input().split())
ans = 0
if A >= C:
ans += C*X
Y -= X
if Y > 0:
if B >= C:
ans += C*Y
else:
ans += B*Y
else:
if B >= C:
ans += C*Y
X -= Y
else:
ans += B*Y
X -= Y
if X > 0:
ans += A*X
print(ans)
|
p03371 | s615135154 | Wrong Answer | #from math import gcd
from math import factorial as f
from math import ceil,floor,sqrt
import bisect
import re
import heapq
from copy import deepcopy
import itertools
from sys import exit
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
yes = "Yes"
no = "No"
def main():
a,b,c,x,y = mi()
ans = 1<<60
for i in range(max(x,y)):
ans = min(max(x-i,0)*a+max(y-i,0)*b+2*i*c,ans)
print(ans)
main()
|
p03371 | s736358415 | Wrong Answer | piza = list(map(int,input().split()))
x = piza[0] * piza[3] + piza[1] * piza[4]
y = piza[2] * 2 * max(piza[3],piza[4])
if piza[3] >= piza[4]:
z = piza[2] * (2 * piza[4]) + piza[0]*(piza[3]-piza[4])
else:
z = piza[2] * (2 * piza[3]) + piza[0]*(piza[4]-piza[3])
print(min(x,y,z)) |
p03371 | s904025181 | Wrong Answer | x=input().split()
x=[int(x[i]) for i in range(len(x))]
if x[0]+x[1]<=2*x[2]:
print(x[0]*x[3]+x[1]*x[4])
else:
if x[3]>x[4]:
ans=x[4]*2*x[2]+(x[3]-x[4])*x[0]
ans=min(ans,x[3]*2*x[2])
else:
ans=x[3]*2*x[2]+(x[4]-x[3])*x[0]
ans=min(ans,x[4]*2*x[2])
print(ans) |
p03371 | s061809504 | Wrong Answer | a, b, c, x, y = [int(i) for i in input().split()]
if a > 2*c and b > 2*c:
ans = 2 * c * max(x,y)
elif a+b > 2*c:
if x >= y:
ans = c * 2 * y
ans += a * (x - y)
else:
ans = c * 2 * x
ans += b * (y - x)
else:
ans = a * x + b * y
print(ans)
|
p03371 | s655657372 | Wrong Answer | a, b, c, x, y = map(int, input().split())
if a+b <= 2*c:
print(a*x + b*y)
else:
if x > y:
if a < c:
print(2*y*c + (x-y)*a)
else:
print(2*x*c)
else:
if a < c:
print(2*x*c + (y-x)*b)
else:
print(2*y*c) |
p03371 | s879628955 | Wrong Answer | # https://atcoder.jp/contests/abc095/tasks/arc096
# 値段,枚数
A, B, C, X, Y = map(int, input().split())
# C * 2 は A + Bとなる
ans = max(X, Y) * 2 * C
ans = min(ans, A * X + B * Y)
if A + B > 2 * C:
if X > Y:
ans = min(ans, (X - Y) * A + 2 * C * Y)
else:
ans = min(ans, (Y - X) * A + 2 * C * X)
print(ans) |
p03371 | s381490454 | Wrong Answer | a,b,c,x,y=map(int,input().split())
if 2*c>=a and 2*c>=b:
print(x*a+y*b)
elif 2*c>=a and 2*c<b:
if x<=y:
print(y*c*2)
else:
print(y*c*2+(x-y)*a)
elif 2*c>=b and 2*c<a:
if y<=x:
print(x*c*2)
else:
print(x*c*2+(y-x)*b)
else:
print(max(x,y)*2*c)
|
p03371 | s917611821 | Wrong Answer | a, b, c, x, y = A = list(map(int, input().split()))
l = a * x + b * y
m = c * max(x, y) * 2
if x >= y :
n = c * y * 2 + a * (x - y)
else:
n = c * x * 2 + a * (y - x)
ans = min(l, min(m, n))
print(ans)
|
p03371 | s690552745 | Wrong Answer | a,b,c,x,y = map(int,input().split())
ans = 10**12
for i in range(0,int(10e5),2):
ans=min(ans,(i*(2*c))+(max(0,x-i)*a)+(max(0,y-i)*b))
print(ans) |
p03371 | s121926257 | Wrong Answer | a,b,c,x,y=map(int,input().split())
ans=float('inf')
for i in range(10**5):
tmp=i*c*2+a*max(x-i,0)+b*max(y-i,0)
ans=min(ans,tmp)
print(ans) |
p03371 | s645677180 | Wrong Answer | A,B,C,X,Y=map(int,input().split())
if Y>=X:
X,Y=Y,X
A,B=B,A
if A+B<=C*2:
print(A*X+B*Y)
else:
print(Y*2*C+(X-Y)*min(A,B,2*C)) |
p03371 | s049974794 | Wrong Answer | a,b,c,x,y=map(int,input().split())
ans=100000
for i in range(100001):
tmp=i*2*c+max(0,x-i)*a+max(0,y-i)*b
ans=min(ans,tmp)
print(ans) |
p03371 | s645405722 | Wrong Answer | a,b,c,x,y=map(int,input().split())
ans=a*x+b*y
if x>y:
p=2*y*c+(x-y)*min(a,2*c)
ans=min(ans,p)
if x<y:
p=2*x*c+(y-x)*min(b,2*c)
ans=min(ans,p)
print(ans)
|
p03371 | s595531042 | Wrong Answer | import itertools
a,b,c,x,y = map(int, input().split(" "))
ans = 10 ** 11
if min(a, b) >= 2 * c:
print(c * max(x, y) * 2)
else:
for i in range(min(x, y) + 1):
temp = a * (x - i) + b * (y - i) + c * (i * 2)
if ans > temp:
ans = temp
print(ans) |
p03371 | s373197434 | Wrong Answer | a,b,c,x,y=map(int,input().split())
ans=[a*x+b*y,max(x,y)*c*2,min(x,y)*2*c+min(a,b,2*c)*abs(y-x)]
print(min(ans)) |
p03371 | s228523895 | Wrong Answer | A,B,C,X,Y = map(int, input().split())
sum_1 = A*X + B*Y
sum_2 = 0
if X >= Y:
sum_2 = A*(X-Y) + C*2*Y
else:
sum_2 = B*(Y-X) + C*2*X
if sum_2 < sum_1:
print(sum_2)
else:
print(sum_1)
|
p03371 | s431342141 | Wrong Answer | a,b,c,x,y=map(int,input().split())
c=c*2
if c<=max(a,b):
print(c*max(x,y))
elif (a+b)>=c:
if x>=y:
print(y*c+(x-y)*a)
else:
print(x*c+(y-x)*b)
else:
print(a*x+b*y) |
p03371 | s521598067 | Wrong Answer | a,b,c,x,y = list(map(int, input().split()))
if a + b < 2*c :
print(x*a + y*b)
else :
if a > 2*c or b > 2*c:
print(max(x,y)*2*c)
else :
if x >= y :
print(y*2*c + (x-y)*a)
else :
print(x*2*c + (y-x)*b)
|
p03371 | s922722738 | Wrong Answer | A, B, C, X, Y = map(int, input().split())
xn, yn = 0, 0
price = 0
if (A+B) >= 2*C and A >= 1 and B >= 1:
ammount = min(X, Y)
price += C * ammount * 2
xn += ammount
yn += ammount
if A >= 2*C and X > xn:
ammount = X - xn
price += C * X * 2
xn += X
yn += X
if B >= 2*C and Y > yn:
ammount = Y - yn
price += C * ammount * 2
xn += ammount
yn += ammount
price += A * (X - xn)
price += B * (Y - yn)
print(price)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.