oj.uz

답안 #251673

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
251673 2020-07-22T07:09:24 Z VEGAnn Baloni (COCI15_baloni) C++14
0 / 100
 730 ms 95824 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<i2> st;
set<int> ps[N];
set<int>::iterator iter;
int n, a[N], ans, nt[N], pos[N];

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

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

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];

    for (int i = n; i > 0; i--){
        nt[i] = pos[a[i] - 1];
        pos[a[i]] = i;
        st.insert({a[i], -i});
    }

    while (sz(st) > 0){
        ans++;

        i2 cr = (*(--st.end()));

        st.erase(cr);

        int pst = -cr[1], vl = cr[0];

        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--;
            st.erase({a[pst], -pst});
        }
    }

    cout << ans;

    return 0;
}

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 29 ms 47352 KB Output isn't correct
2 Incorrect 25 ms 47488 KB Output isn't correct
3 Incorrect 31 ms 47608 KB Output isn't correct
4 Incorrect 26 ms 47616 KB Output isn't correct
5 Incorrect 677 ms 90616 KB Output isn't correct
6 Incorrect 730 ms 95824 KB Output isn't correct
7 Incorrect 576 ms 87416 KB Output isn't correct
8 Incorrect 582 ms 87068 KB Output isn't correct
9 Incorrect 624 ms 89080 KB Output isn't correct
10 Incorrect 633 ms 90744 KB Output isn't correct