oj.uz

Submission #929206

# Submission time Handle Problem Language Result Execution time Memory
929206 2024-02-17T23:05:46 Z Karoot Baloni (COCI15_baloni) C++17
100 / 100
 1728 ms 131072 KB 
#include <iostream>
#include <cmath>
#include <unordered_map>
#include <map>
#include <set>
#include <queue>
#include <vector>
#include <string>
#include <iomanip>
#include <algorithm>

#define all(x)  (x).begin(), (x).end()
#define rall(x)  (x).rbegin(), (x).rend()

using namespace std;

typedef long long ll;

ll linf = 1e15+1;

inline void scoobydoobydoo(){
    ios::sync_with_stdio(false);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
}

set<int> bals[1000007];

int main(){
    scoobydoobydoo();
    int n; cin >> n;

    set<pair<int, int>> v;
    vector<int> val;

    for (int i = 0; i < n; i++){
        int h; cin >> h;
        v.insert({i, h});
        if (n <= 5000)val.push_back(h);
        bals[h].insert(i);
    }


    if (n <= 5000){
        int sum = 0;
        for (int i = 0; i < n; i++){
            if (val[i] == -1)continue;
            sum++;
            int h = val[i]-1;
            for (int j = i+1; j < n; j++){
                if (h == 0)break;                
                if (val[j] == h){
                    val[j] = -1;
                    h--;
                }
            }
        }
        cout << sum << endl;
        return 0;
    }

    int sum = 0;

    while (!v.empty()){
        sum++;
        int h = (*v.begin()).second;
        int i = (*v.begin()).first;
        v.erase(v.begin());
        if (v.empty())break;
        if (bals[h-1].empty())break;
        auto it = bals[h-1].upper_bound(i);

        while (h >= 1 && it != bals[h-1].end()){
            auto itr = v.find({*it, h-1});
            v.erase(itr);
            bals[h-1].erase(it);
            i = *it;
            h--;
            if (bals[h-1].empty())break;
            it = bals[h-1].upper_bound(i);
        }
    }

    cout << sum << endl;




    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 47452 KB Output is correct
2 Correct 13 ms 47704 KB Output is correct
3 Correct 14 ms 47708 KB Output is correct
4 Correct 16 ms 47676 KB Output is correct
5 Correct 1545 ms 121728 KB Output is correct
6 Correct 1728 ms 131072 KB Output is correct
7 Correct 1249 ms 116100 KB Output is correct
8 Correct 1315 ms 115476 KB Output is correct
9 Correct 1573 ms 119052 KB Output is correct
10 Correct 1488 ms 121704 KB Output is correct