제출 #870398

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
870398		salmon	서열 (APIO23_sequence)	C++17	0 / 100	2031 ms	48724 KiB

sequence

#include "sequence.h"

#include <bits/stdc++.h>
using namespace std;
int N;
int miin[500100 * 4];
int maax[500100 * 4];
int lazy[500100 * 4];
vector<int> in[500100];
vector<int> sat;

void build(int i, int s, int e){
    miin[i] = - e - 1;
    maax[i] = - s - 1;
    lazy[i] = 0;

    if(s != e){
        int m = (s + e + 2)/2 - 1;

        build(i * 2, s, m);
        build(i * 2 + 1, m + 1, e);
    }
}

void update(int i, int s, int e, int S){
    if(S <= s){
        miin[i] += 2;
        maax[i] += 2;
        lazy[i] += 2;
        return;
    }

    int m = (s + e + 2)/2 - 1;

    update(i * 2 + 1, m + 1, e, S);
    if(S <= m){
        update(i * 2, s, m, S);
    }

    miin[i] = min(miin[i * 2], miin[i * 2 + 1]) + lazy[i];
    maax[i] = max(maax[i * 2], maax[i * 2 + 1]) + lazy[i];
}

void nupdate(int i, int s, int e, int S){
    if(S <= s){
        miin[i] -= 2;
        maax[i] -= 2;
        lazy[i] -= 2;
        return;
    }

    int m = (s + e + 2)/2 - 1;

    update(i * 2 + 1, m + 1, e, S);
    if(S <= m){
        update(i * 2, s, m, S);
    }

    miin[i] = min(miin[i * 2], miin[i * 2 + 1]) + lazy[i];
    maax[i] = max(maax[i * 2], maax[i * 2 + 1]) + lazy[i];
}


pair<int,int> query(int i, int s, int e, int S, int E){
    if(S <= s && e <= E){
        return make_pair(miin[i],maax[i]);
    }

    int m = (s + e + 2)/2 - 1;

    pair<int,int> ii,ii1;

    if(S <= m && m < E){
        ii = query(i * 2, s, m, S, E);
        ii1 = query(i * 2 + 1, m + 1, e, S, E);

        ii.first = min(ii.first, ii1.first) + lazy[i];
        ii.second = max(ii.second, ii1.second) + lazy[i];
    }
    else if(S <= m){
        ii = query(i * 2, s, m, S, E);

        ii.first = ii.first + lazy[i];
        ii.second = ii.second + lazy[i];
    }
    else{
        ii = query(i * 2 + 1, m + 1, e, S, E);

        ii.first = ii.first + lazy[i];
        ii.second = ii.second + lazy[i];
    }

    return ii;
}

int sequence(int N, std::vector<int> lst) {
    for(int i = 0; i < N; i++){
        in[lst[i]].push_back(i);
    }

    int s,e,m;

    s = 1;
    e = N;

    while(s != e){
        m = (s + e + 1)/2;

        build(1,-1,N-1);

        bool flag = false;

        for(int i = 1; i <= N; i++){
            sat.clear();
//printf("mah %d %d \n",m,i);
            sat.push_back(-1);

            for(int j = 0; j < min((int)in[i].size(),m - 1) ; j++){
                sat.push_back(in[i][j]);

                update(1,-1,N-1,in[i][j]);
            }
            sat.push_back(N);

            for(int j = 1; j <= ((int)in[i].size()) - m + 1; j++){
                update(1,-1,N-1,in[i][j + m - 2]);

                pair<int,int> ii = query(1,-1,N - 1,-1,sat[j] - 1);

                ii.second = ii.second + m * 2;

                pair<int,int> ii1 = query(1, -1, N - 1, sat[j + m - 1], N - 1);

                //printf("\n%d %d\n",ii.first,ii.second);
                //printf("%d %d\n",ii1.first,ii1.second);

                if( (ii1.second < ii.first) || (ii.second < ii1.first))  continue;
                else{
                    flag = true;
                    break;
                }

                nupdate(1,-1,N-1,in[i][j - 1]);
            }

            for(int j = 1; j <= ((int)in[i].size()) - m + 1; j++){
                update(1,-1,N-1,in[i][j - 1]);
            }

            if(flag) break;
        }

        if(flag){
            s = m;
        }
        else{
            e = m - 1;
        }
    }



    return s;

}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 17
• Subtask 3: 0 / 7
• Subtask 4: 0 / 12
• Subtask 5: 0 / 13
• Subtask 6: 0 / 22
• Subtask 7: 0 / 18