oj.uz

답안 #870777

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
870777 2023-11-09T03:57:17 Z salmon 서열 (APIO23_sequence) C++17
69 / 100
 2000 ms 48720 KB 
#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];
}

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

            vector<long long int> v;

            v.push_back(0);

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

            for(int j = 1; j <= ((int)in[i].size()) - m + 1; j++){
                pair<int,int> ii = query(1,-1,N - 1,-1,sat[j] - 1);

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

                v.push_back(ii1.first - ii.second);
            }

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

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

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

                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) * v[j] > 0)  continue;
                else{
                    flag = true;
                    break;
                }
            }

            if(flag) break;
        }

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



    return s;

}

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:102:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  102 |             for(int j = 0; j < in[i].size(); j++){
      |                            ~~^~~~~~~~~~~~~~
sequence.cpp:115:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             for(int j = 0; j < in[i].size() ; j++){
      |                            ~~^~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16984 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 4 ms 16984 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16984 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 4 ms 16984 KB Output is correct
13 Correct 6 ms 16988 KB Output is correct
14 Correct 7 ms 16988 KB Output is correct
15 Correct 5 ms 16988 KB Output is correct
16 Correct 6 ms 16988 KB Output is correct
17 Correct 6 ms 17076 KB Output is correct
18 Correct 6 ms 17288 KB Output is correct
19 Correct 6 ms 16988 KB Output is correct
20 Correct 6 ms 16988 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 7 ms 16988 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 1710 ms 44968 KB Output is correct
3 Correct 1737 ms 46488 KB Output is correct
4 Correct 1373 ms 37216 KB Output is correct
5 Correct 1606 ms 45452 KB Output is correct
6 Correct 1527 ms 45648 KB Output is correct
7 Correct 1095 ms 37152 KB Output is correct
8 Correct 1473 ms 37340 KB Output is correct
9 Correct 1311 ms 37736 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 1362 ms 38364 KB Output is correct
3 Correct 1403 ms 36660 KB Output is correct
4 Correct 1480 ms 37348 KB Output is correct
5 Correct 1648 ms 39132 KB Output is correct
6 Correct 1446 ms 40172 KB Output is correct

Subtask #5
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2025 ms 48720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16984 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 4 ms 16984 KB Output is correct
13 Correct 6 ms 16988 KB Output is correct
14 Correct 7 ms 16988 KB Output is correct
15 Correct 5 ms 16988 KB Output is correct
16 Correct 6 ms 16988 KB Output is correct
17 Correct 6 ms 17076 KB Output is correct
18 Correct 6 ms 17288 KB Output is correct
19 Correct 6 ms 16988 KB Output is correct
20 Correct 6 ms 16988 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 7 ms 16988 KB Output is correct
23 Correct 294 ms 21644 KB Output is correct
24 Correct 266 ms 21596 KB Output is correct
25 Correct 265 ms 21840 KB Output is correct
26 Correct 205 ms 20572 KB Output is correct
27 Correct 228 ms 20572 KB Output is correct
28 Correct 224 ms 20828 KB Output is correct
29 Correct 173 ms 20348 KB Output is correct
30 Correct 185 ms 20316 KB Output is correct
31 Correct 233 ms 21328 KB Output is correct
32 Correct 197 ms 22616 KB Output is correct
33 Correct 212 ms 21716 KB Output is correct
34 Correct 250 ms 21676 KB Output is correct
35 Correct 227 ms 21592 KB Output is correct
36 Correct 263 ms 21804 KB Output is correct
37 Correct 282 ms 21852 KB Output is correct
38 Correct 290 ms 21820 KB Output is correct

Subtask #7
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 16984 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 3 ms 16988 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16984 KB Output is correct
7 Correct 4 ms 16988 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 4 ms 16988 KB Output is correct
11 Correct 3 ms 16988 KB Output is correct
12 Correct 4 ms 16984 KB Output is correct
13 Correct 6 ms 16988 KB Output is correct
14 Correct 7 ms 16988 KB Output is correct
15 Correct 5 ms 16988 KB Output is correct
16 Correct 6 ms 16988 KB Output is correct
17 Correct 6 ms 17076 KB Output is correct
18 Correct 6 ms 17288 KB Output is correct
19 Correct 6 ms 16988 KB Output is correct
20 Correct 6 ms 16988 KB Output is correct
21 Correct 8 ms 16988 KB Output is correct
22 Correct 7 ms 16988 KB Output is correct
23 Correct 1710 ms 44968 KB Output is correct
24 Correct 1737 ms 46488 KB Output is correct
25 Correct 1373 ms 37216 KB Output is correct
26 Correct 1606 ms 45452 KB Output is correct
27 Correct 1527 ms 45648 KB Output is correct
28 Correct 1095 ms 37152 KB Output is correct
29 Correct 1473 ms 37340 KB Output is correct
30 Correct 1311 ms 37736 KB Output is correct
31 Correct 1362 ms 38364 KB Output is correct
32 Correct 1403 ms 36660 KB Output is correct
33 Correct 1480 ms 37348 KB Output is correct
34 Correct 1648 ms 39132 KB Output is correct
35 Correct 1446 ms 40172 KB Output is correct
36 Execution timed out 2025 ms 48720 KB Time limit exceeded
37 Halted 0 ms 0 KB -