# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1166809 | tamyte | Potatoes and fertilizers (LMIO19_bulves) | C++20 | 1 ms | 328 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);
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
}
stack<pair<int, int>> right, left;
for (int i = n - 1; i >= 0; --i) {
if (a[i] > 0) right.push({a[i], i});
}
ll res = 0;
for (int i = 0; i < n; ++i) {
while (right.size() && right.top().second < i) {
left.push(right.top());
right.pop();
}
while (b[i] > 0) {
int mn = INT_MAX;
if (right.size()) {
mn = min(mn, abs(i - right.top().second));
}
if (left.size()) {
# | 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... |