oj.uz

Submission #751826

# Submission time Handle Problem Language Result Execution time Memory
751826 2023-06-01T14:37:57 Z 1075508020060209tc Sequence (APIO23_sequence) C++17
11 / 100
 2000 ms 8408 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int lowbit(int x){return x&-x;}

struct BIT{
vector<int>bit;
};


int n;
int ar[500005];
int freq[500005];

int slv(){
   int ans=0;
    for(int l=1;l<=n;l++){
        for(int r=l+1;r<=n;r++){
            vector<int>vc;
            for(int i=1;i<=n;i++){
                freq[i]=0;
            }
            for(int i=l;i<=r;i++){
                vc.push_back(ar[i]);
                freq[ar[i]]++;
            }
            sort(vc.begin(),vc.end());
            int k=r-l+1;
            ans=max(ans,max(freq[vc[(k-1)/2]],freq[vc[k/2]]));
        }
    }
    return ans;
}


int sequence(int N, std::vector<int> A) {
    n=N;
    for(int i=0;i<n;i++){
        ar[i+1]=A[i];
    }
return slv();

  return 0;
}


/*
signed main()
{




    return 0;
}

*/

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 320 KB Output is correct
5 Correct 4 ms 212 KB Output is correct
6 Correct 4 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 5 ms 212 KB Output is correct
12 Correct 6 ms 212 KB Output is correct

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 320 KB Output is correct
5 Correct 4 ms 212 KB Output is correct
6 Correct 4 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 5 ms 212 KB Output is correct
12 Correct 6 ms 212 KB Output is correct
13 Execution timed out 2073 ms 360 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #3
0.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 2050 ms 8364 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Execution timed out 2048 ms 8408 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

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

Subtask #6
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 320 KB Output is correct
5 Correct 4 ms 212 KB Output is correct
6 Correct 4 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 5 ms 212 KB Output is correct
12 Correct 6 ms 212 KB Output is correct
13 Execution timed out 2073 ms 360 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 320 KB Output is correct
5 Correct 4 ms 212 KB Output is correct
6 Correct 4 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 3 ms 316 KB Output is correct
9 Correct 5 ms 212 KB Output is correct
10 Correct 5 ms 212 KB Output is correct
11 Correct 5 ms 212 KB Output is correct
12 Correct 6 ms 212 KB Output is correct
13 Execution timed out 2073 ms 360 KB Time limit exceeded
14 Halted 0 ms 0 KB -