oj.uz

Submission #772033

# Submission time Handle Problem Language Result Execution time Memory
772033 2023-07-03T14:28:37 Z Tenis0206 Sequence (APIO23_sequence) C++17
0 / 100
 70 ms 13932 KB 
#include <bits/stdc++.h>

using namespace std;

const int nmax = 5e5;

int n;
int v[nmax + 5];

int lst[nmax + 5], ldr[nmax + 5], rst[nmax + 5], rdr[nmax + 5];

bool subtask3()
{
    return true;
}

int solve3()
{
    int poz = 0;
    for(int i=1; i<=n; i++)
    {
        if(v[i] > v[i + 1])
        {
            poz = i;
            break;
        }
    }
    for(int i=1; i<=poz; i++)
    {
        if(!lst[v[i]])
        {
            lst[v[i]] = i;
        }
        ldr[v[i]] = i;
    }
    for(int i=poz+1; i<=n; i++)
    {
        if(!rst[v[i]])
        {
            rst[v[i]] = i;
        }
        rdr[v[i]] = i;
    }
    int rez = 0;
    for(int i=1;i<=n;i++)
    {
        if(!lst[i] || !rst[i])
        {
            rez = max(rez, ldr[i] - lst[i] + 1);
            rez = max(rez, rdr[i] - rst[i] + 1);
            continue;
        }
        int lmax = min(n,(rdr[i] - lst[i] + 1) * 2);
        if(rst[i] - ldr[i] - 1 <= (lmax - 1) / 2)
        {
            rez = max(rez, ldr[i] - lst[i] + 1 + rdr[i] - rst[i] + 1);
        }
    }
    return rez;
}

int sequence(int N, vector<int> A)
{
    n = N;
    for(int i=1;i<=n;i++)
    {
        lst[i] = ldr[i] = rst[i] = rdr[i] = 0;
        v[i] = A[i - 1];
    }
    if(subtask3())
    {
        return solve3();
    }
}

#ifdef home

int main()
{
    freopen("nr.in","r",stdin);
    freopen("nr.out","w",stdout);
    int nn;
    cin>>nn;
    vector<int> vv(nn);
    for(int i=1; i<=nn; i++)
    {
        cin>>vv[i - 1];
    }
    cout<<sequence(nn,vv)<<'\n';
    return 0;
}

#endif // home

Compilation message

sequence.cpp: In function 'int sequence(int, std::vector<int>)':
sequence.cpp:74:1: warning: control reaches end of non-void function [-Wreturn-type]
   74 | }
      | ^

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 56 ms 13932 KB Output is correct
3 Correct 70 ms 13912 KB Output is correct
4 Correct 40 ms 13900 KB Output is correct
5 Correct 68 ms 13908 KB Output is correct
6 Correct 54 ms 13924 KB Output is correct
7 Incorrect 41 ms 13908 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 13912 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Incorrect 0 ms 340 KB Output isn't correct
3 Halted 0 ms 0 KB -