oj.uz

Submission #251683

# Submission time Handle Problem Language Result Execution time Memory
251683 2020-07-22T07:19:17 Z VEGAnn Baloni (COCI15_baloni) C++14
100 / 100
 1085 ms 96760 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define i2 array<int,2>
using namespace std;
typedef long long ll;
const int N = 1000100;
const int C = 22;
const int md = 10007;
set<int> ps[N];
set<int>::iterator iter;
int n, a[N], ans, nm[N];
bool mrk[N];

int mult(int x, int y) { return (x * y) % md; }

void SUM(int &x, int y){
    x += y;
    if (x >= md)
        x -= md;
}

bool cmp(int _x, int _y){
    if (a[_x] == a[_y])
        return _x < _y;
    else return a[_x] > a[_y];
}

int main() {
#ifdef _LOCAL
    freopen("in.txt","r",stdin); // freopen("output.txt","w",stdout);
#else
//    freopen("mining.in","r",stdin); freopen("mining.out","w",stdout);
    ios_base::sync_with_stdio(0); cin.tie(0);
#endif

    cin >> n;

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

    sort(nm + 1, nm + n + 1, cmp);

    for (int i = n; i > 0; i--)
        ps[a[i]].insert(i);

    int ptr = 1;

    while (1){
        while (ptr <= n && mrk[nm[ptr]])
            ptr++;

        if (ptr > n) break;

        ans++;

        int pst = nm[ptr], vl = a[nm[ptr]];

        mrk[pst] = 1;

        while (pst != 0){
            if (sz(ps[vl - 1]) == 0) break;

            iter = ps[vl - 1].upper_bound(pst);

            if (iter == ps[vl - 1].end()) break;

            ps[vl - 1].erase(iter);

            pst = *iter;
            vl--;
            mrk[pst] = 1;
        }
    }

    cout << ans;

    return 0;
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47360 KB Output is correct
2 Correct 25 ms 47488 KB Output is correct
3 Correct 26 ms 47480 KB Output is correct
4 Correct 27 ms 47616 KB Output is correct
5 Correct 874 ms 91668 KB Output is correct
6 Correct 1085 ms 96760 KB Output is correct
7 Correct 961 ms 88220 KB Output is correct
8 Correct 972 ms 87716 KB Output is correct
9 Correct 891 ms 89976 KB Output is correct
10 Correct 963 ms 91640 KB Output is correct