# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166829 | tamyte | Potatoes and fertilizers (LMIO19_bulves) | C++20 | 58 ms | 6472 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n), b(n);
stack<pair<int, int>> left, right;
ll res = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
int need = min(a[i], b[i]);
a[i] -= need;
b[i] -= need;
}
for (int i = n - 1; i >= 0; --i) {
if (a[i] > 0) {
right.push({a[i], i});
}
}
for (int i = 0; i < n; ++i) {
while (right.size() && right.top().second <= i) {
left.push({right.top()});
right.pop();
}
while (b[i] > 0) {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |