# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
359293 | jesus_coconut | Separator (CEOI19_separator) | C++17 | 279 ms | 21220 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int const MOD = 1e9;
void solve() {
int n, s = 0;
cin >> n;
int mx = -1;
priority_queue<int> pq;
pq.push(-1);
for (int i = 0; i < n; ++i) {
int b;
cin >> b;
int a = (b + s) % MOD;
while (pq.top() >= a) {
--s;
pq.pop();
}
if (a > mx) {
mx = a;
++s;
pq.push(a);
}
cout << s << '\n';
}
}
# | 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... |