| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 250681 | kingfran1907 | Baloni (COCI15_baloni) | C++14 | 1076 ms | 92428 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;
const int maxn = 1e6+10;
int n;
set< int > s[maxn];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
s[x].insert(i);
}
int sol = 0;
for (int i = maxn - 10; i >= 0; i--) {
while (!s[i].empty()) {
int las = -1;
int x = i;
while (true) {
auto iter = s[x].lower_bound(las);
if (iter == s[x].end()) break;
las = *iter + 1;
s[x].erase(iter);
x--;
}
sol++;
}
}
printf("%d\n", sol);
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
