oj.uz

Submission #977946

# Submission time Handle Problem Language Result Execution time Memory
977946 2024-05-08T14:25:24 Z Nexus Sequence (APIO23_sequence) C++17
7 / 100
 130 ms 31660 KB 
#include <bits/stdc++.h>
#define ll long long
#define mid (r+l)/2

using namespace std;

const ll N=5e5+9,M=2e18+9,mod=1e9+7;

ll n,x,y,z;
vector<ll>v[N];

int sequence(int N, vector<int> A) {
    x=1;
    for(ll i=0;i<N;++i)
    {
        if(i && A[i]==A[i-1])++y;
        else x=max(x,y),y=1;
        v[A[i]].push_back(i);
    }
    x=max(x,y);
    for(ll i=1;i<=N;++i)
    {
        if(v[i].size()<2)continue;
        y=v[i][v[i].size()-1]-v[i][0]+1;
        z=y-v[i].size();
        if(z<=N/2)x=max(x,(ll)v[i].size());
    }
    return x;
}

/*
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);

    cin>>n;
    vector<int>g(n);
    for(auto &i:g)cin>>i;
    cout<<sequence(n,g);
}
*/

Subtask #1
0.0 / 11.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 61 ms 26452 KB Output is correct
3 Correct 61 ms 29776 KB Output is correct
4 Correct 37 ms 20948 KB Output is correct
5 Correct 60 ms 29012 KB Output is correct
6 Correct 62 ms 29080 KB Output is correct
7 Correct 37 ms 21932 KB Output is correct
8 Correct 36 ms 22356 KB Output is correct
9 Correct 36 ms 22420 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 12124 KB Output is correct
2 Correct 41 ms 24316 KB Output is correct
3 Incorrect 38 ms 20148 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

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