oj.uz

Submission #870239

# Submission time Handle Problem Language Result Execution time Memory
870239 2023-11-07T09:55:38 Z salmon Sequence (APIO23_sequence) C++17
0 / 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<pair<int,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 ans = 0;

    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("%d %d ",m,i);
            sat.push_back(make_pair(-1,-1));

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

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

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

                ii.second = ii.second + m;

                pair<int,int> ii1 = query(1, -1, N - 1, sat[j + m - 1].first, sat[j + m].first - 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;
                }
            }
        }

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



    return s;

}

Compilation message

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

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 4 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 Incorrect 3 ms 16988 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 4 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 Incorrect 3 ms 16988 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 1699 ms 43176 KB Output is correct
3 Correct 1704 ms 43168 KB Output is correct
4 Correct 1543 ms 36192 KB Output is correct
5 Correct 1724 ms 42228 KB Output is correct
6 Correct 1685 ms 42224 KB Output is correct
7 Correct 1627 ms 35860 KB Output is correct
8 Incorrect 1923 ms 36008 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 16988 KB Output is correct
2 Correct 1705 ms 42040 KB Output is correct
3 Correct 1685 ms 37184 KB Output is correct
4 Correct 1719 ms 37184 KB Output is correct
5 Execution timed out 2045 ms 43336 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2080 ms 48720 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 4 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 Incorrect 3 ms 16988 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 4 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 Incorrect 3 ms 16988 KB Output isn't correct
6 Halted 0 ms 0 KB -