# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1150671 | eri16 | Separator (CEOI19_separator) | C++20 | 121 ms | 11432 KiB |
#include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
long long a, b, max1 = 0;
cin >> a;
vector<int> v;
cin >> b;
max1 = b;
v.push_back(b);
cout << 1 << '\n';
for (int i = 1; i < a; i++) {
cin >> b;
b = (b + v.size()) % MOD;
// Using binary search instead of linear scan
auto it = lower_bound(v.begin(), v.end(), b);
v.erase(it, v.end());
if (b > max1) {
# | 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... |