Submission #3025144
Source Code Expand
#ifndef BZ #pragma GCC optimize "-O3" #endif #include <bits/stdc++.h> #define FASTIO #define ALL(v) (v).begin(), (v).end() #define rep(i, l, r) for (int i = (l); i < (r); ++i) #ifdef FASTIO #define scanf abacaba #define printf abacaba #endif typedef long long ll; typedef long double ld; typedef unsigned long long ull; using namespace std; /* ll pw(ll a, ll b) { ll ans = 1; while (b) { while (!(b & 1)) b >>= 1, a = (a * a) % MOD; ans = (ans * a) % MOD, --b; } return ans; } */ int x, y; ll a, b, c; int main() { #ifdef FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); #endif cin >> a >> b >> c >> x >> y; ll ans = a * x + b * y; for (int i = 0; i <= 2 * max(x, y); ++i) { int nx = max(0, x - i / 2); int ny = max(0, y - i / 2); ans = min(ans, a * nx + b * ny + c * i); } cout << ans << "\n"; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Half and Half |
User | LHiC |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 902 Byte |
Status | AC |
Exec Time | 2 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 | 2 ms | 256 KB |
b04 | AC | 1 ms | 256 KB |
b05 | AC | 2 ms | 256 KB |
b06 | AC | 2 ms | 256 KB |
b07 | AC | 2 ms | 256 KB |
b08 | AC | 2 ms | 256 KB |
b09 | AC | 2 ms | 256 KB |
b10 | AC | 2 ms | 256 KB |
b11 | AC | 1 ms | 256 KB |
b12 | AC | 2 ms | 256 KB |
b13 | AC | 1 ms | 256 KB |
b14 | AC | 2 ms | 256 KB |
b15 | AC | 2 ms | 256 KB |