# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
395320 | 2021-04-28T07:59:28 Z | iulia13 | Coins (BOI06_coins) | C++14 | 303 ms | 10044 KB |
#include <iostream> using namespace std; #define ll long long struct ura{ int x, y; }; ura v[500005]; ura ans; int main() { ll n, k, s = 0, cnt = 0, nr = 0; cin >> n >> k; for(int i = 1; i <= n; i++) { ll c, tip; cin >> c >> tip; if (c > s && tip == 0) ///rest { if (ans.x < nr || (ans.x == nr && ans.y > s)) { ans.x = nr; ans.y = s; } while (cnt && v[cnt].y) ///useless { s -= v[cnt].x; cnt--; } s += c; nr++; } else if (c <= s) { /*a1 + ... + ai >= aj a1+.......+ai-1>= aj nu*/ s -= v[cnt].x; if (v[cnt].y == 0) nr--; cnt--; s += c; if (tip == 0) nr++; } if (s > k) break; cnt++; v[cnt] = {c, tip}; } if (s <= k) { if (ans.x < nr || (ans.x == nr && ans.y > s)) { ans.x = nr; ans.y = s; } } cout << ans.x << '\n' << k - ans.y; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 204 KB | Output is correct |
2 | Incorrect | 1 ms | 204 KB | Output isn't correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 1 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Incorrect | 1 ms | 204 KB | Output isn't correct |
7 | Correct | 303 ms | 6032 KB | Output is correct |
8 | Incorrect | 298 ms | 10044 KB | Output isn't correct |
9 | Incorrect | 296 ms | 6160 KB | Output isn't correct |
10 | Incorrect | 286 ms | 5828 KB | Output isn't correct |