Submission #977917

# Submission time Handle Problem Language Result Execution time Memory
977917 2024-05-08T13:52:38 Z Nexus Sequence (APIO23_sequence) C++17
0 / 100
93 ms 31604 KB
#include "sequence.h"
#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 x,y,z;
vector<ll>v[N];
 
int sequence(int N, vector<int> A) {
    x=1;
    for(ll i=0;i<N;++i)
    v[A[i]].push_back(i);
    for(ll i=1;i<=N;++i)
    {
        if(v[i].size()<2)continue;
        y=v[i][v[i].size()-1]-v[i][0];
        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>v(n);
    for(auto &i:v)cin>>i;
    cout<<sequence(n,v);
}
*/
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 12120 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 12120 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 12120 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 4 ms 12124 KB Output is correct
2 Correct 49 ms 24036 KB Output is correct
3 Incorrect 44 ms 20148 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 93 ms 31604 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 12120 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 12120 KB Output isn't correct
2 Halted 0 ms 0 KB -