# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979123 | penguin133 | Baloni (COCI15_baloni) | C++17 | 730 ms | 107604 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;
#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, H[1000005], used[1000005];
set <int> s[1000005];
void solve(){
cin >> n;
for(int i = 1; i <= n; i++){
cin >> H[i];
s[H[i]].insert(i);
}
int ptr = 1, cnt = 0;
while(ptr <= n){
cnt++;
int cur = ptr, val = H[cur];
used[cur] = 1;
while(cur <= n){
if(val == 1)break;
auto it = s[val - 1].lower_bound(cur);
if(it == s[val - 1].end())break;
val--;
int tmp = *it;
s[val].erase(it);
used[tmp] = 1;
cur = tmp;
}
while(used[ptr])ptr++;
}
cout << cnt;
}
main(){
ios::sync_with_stdio(0);cin.tie(0);
int tc = 1;
//cin >> tc;
for(int tc1=1;tc1<=tc;tc1++){
// cout << "Case #" << tc1 << ": ";
solve();
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |