oj.uz

Submission #1087632

# Submission time Handle Problem Language Result Execution time Memory
1087632 2024-09-13T03:24:27 Z steveonalex Baloni (COCI15_baloni) C++17
100 / 100
 699 ms 96032 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

int main(void){
    ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
    clock_t start = clock();

    int n;cin >> n;
    vector<int> a(n+1);
    for(int i = 1; i<=n; ++i) cin >> a[i];

    const int N = 1e6 + 1;
    vector<set<int>> S(N);
    for(int i = 1; i<=n; ++i) S[a[i]].insert(i);

    int ans = 0;
    int cnt = 0;
    int j = N - 1;
    while(cnt < n){
        ans++;
        while(!S[j].size()) j--;
        pair<int,int> u = {j, *S[j].begin()};
        while(true){
            S[u.first].erase(u.second);
            cnt++;
            auto it = S[u.first - 1].upper_bound(u.second);
            if (it == S[u.first - 1].end()) break;
            u = {u.first - 1, *it};
        }
    }
    cout << ans << "\n";
 
    cerr << "Time elapsed: " << clock() - start << " ms\n";
    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47372 KB Output is correct
2 Correct 24 ms 47492 KB Output is correct
3 Correct 27 ms 47484 KB Output is correct
4 Correct 25 ms 47480 KB Output is correct
5 Correct 551 ms 91220 KB Output is correct
6 Correct 699 ms 96032 KB Output is correct
7 Correct 526 ms 87332 KB Output is correct
8 Correct 533 ms 86896 KB Output is correct
9 Correct 541 ms 89268 KB Output is correct
10 Correct 587 ms 90700 KB Output is correct