Submission #3045168
Source Code Expand
#include <cstdio> #include <iostream> #include <string> #include <algorithm> #include <cstring> #include <queue> #include <utility> #include <vector> #include <map> #include <set> #include <cmath> #include <deque> using namespace std; typedef long long LL; typedef pair<int, int> pii; int main() { int A, B, C, X, Y; while (~scanf("%d %d %d %d %d", &A, &B, &C, &X, &Y)) { int ans = 0; if (2 * C <= A + B) { int tmp = min(X, Y); ans += tmp * 2 * C; X -= tmp; Y -= tmp; } if (2 * C <= A) ans += X * 2 * C; else ans += X * A; if (2 * C <= B) ans += Y * 2 * C; else ans += Y * B; printf("%d\n", ans); } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Half and Half |
User | BOT |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 796 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | a01, a02, a03 |
All | a01, a02, a03, b04, b05, b06, b07, b08, b09, b10, b11, b12, b13, b14, b15 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
a01 | AC | 1 ms | 256 KB |
a02 | AC | 1 ms | 256 KB |
a03 | AC | 1 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 1 ms | 256 KB |
b06 | AC | 1 ms | 256 KB |
b07 | AC | 1 ms | 256 KB |
b08 | AC | 1 ms | 256 KB |
b09 | AC | 1 ms | 256 KB |
b10 | AC | 1 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 1 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |
b14 | AC | 1 ms | 256 KB |
b15 | AC | 1 ms | 256 KB |