Submission #4021205
Source Code Expand
#include <iostream> #include <vector> #include <map> #include <unordered_map> #include <queue> #include <set> #include <algorithm> #include <string> #include <math.h> #include <limits.h> #include <stack> #include <complex> using namespace std; typedef long long ll; typedef pair<ll, ll> P; int main(){ int a, b, c; cin >> a >> b >> c; int x, y; cin >> x >> y; int plan_a = x * a + y * b; int plan_b = min(x, y) * 2 * c + max((x - y)*a, (y - x)*b); int plan_c = max(x, y) * 2 * c; cout << min(plan_a, min(plan_b, plan_c)) << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Half and Half |
User | bomac1 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 619 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 |