oj.uz

Submission #980492

# Submission time Handle Problem Language Result Execution time Memory
980492 2024-05-12T07:59:56 Z thelegendary08 Sequence (APIO23_sequence) C++17
11 / 100
 2000 ms 7884 KB 
#include "sequence.h"
#include<bits/stdc++.h>
#define pb push_back
#define ll long long int
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long int>
#define vvll vector<vector<long long int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long int, long long int>>
#define pqpll priority_queue<pair<long long int, long long int>>
#define vc vector<char>
#define vvc vector<vector<char>>
#define vb vector<bool>
#define mii map<int,int>
#define mll map<long long int, long long int>
#define mivi map<int,vector<int>>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
using namespace std;
vi med(vi v){
    sort(v.begin(), v.end());
    if(v.size()%2 == 1)return {v[v.size()/2]};
    else return {v[v.size()/2 - 1], v[v.size()/2]};
}
int sequence(int n, std::vector<int> v) {
    int ans = 0;
    f0r(i,n){
        FOR(j, i, n){
            vi tmp;
            FOR(k, i, j+1){
                tmp.pb(v[k]);
            }
            vi md = med(tmp);
            //for(auto u : md)cout<<u<<' ';
            //cout<<'\n';
            if(md.size() == 1) ans = max(ans,(int)count(tmp.begin(), tmp.end(), md[0]));
            else ans = max(ans, max((int)count(tmp.begin(), tmp.end(), md[0]), (int)count(tmp.begin(), tmp.end(), md[1])));
        }
    }
    return ans;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 448 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 4 ms 432 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct

Subtask #2
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 448 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 4 ms 432 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Execution timed out 2091 ms 500 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 344 KB Output is correct
2 Execution timed out 2012 ms 7884 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Execution timed out 2045 ms 5672 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 2017 ms 7760 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 448 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 4 ms 432 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Execution timed out 2091 ms 500 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 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 4 ms 448 KB Output is correct
5 Correct 4 ms 348 KB Output is correct
6 Correct 4 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 4 ms 432 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 4 ms 348 KB Output is correct
13 Execution timed out 2091 ms 500 KB Time limit exceeded
14 Halted 0 ms 0 KB -