oj.uz

Submission #752208

# Submission time Handle Problem Language Result Execution time Memory
752208 2023-06-02T13:37:59 Z aryan12 Sequence (APIO23_sequence) C++17
7 / 100
 468 ms 53248 KB 
#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;

int sequence(int n, vector<int> a) 
{
    int pos = 0;
    vector<int> b = a;
    sort(b.begin(), b.end());
    int min_median = b[n / 2];
    for(int i = 0; i < n - 1; i++)
    {
        if(a[i] <= a[i + 1])
        {
            continue;
        }
        else
        {
            pos = i;
            break;
        }
    }
    for(int i = n - 1; i > 1; i--)
    {
        if(a[i] <= a[i - 1])
        {
            continue;
        }
        else
        {
            pos = i;
            break;
        }
    }
    map<int, int> freq1, freq2;
    for(int i = 0; i <= pos; i++)
    {
        freq1[a[i]]++;
    }
    for(int i = n - 1; i > pos; i--)
    {
        freq2[a[i]]++;
    }
    int ans = 0;
    for(int i = 1; i <= n; i++)
    {
        if(i < min_median)
        {
            ans = max(ans, max(freq1[i], freq2[i]));
        }
        else
        {
            ans = max(ans, freq1[i] + freq2[i]);
        }
    }
    return ans;
}

Subtask #1
0.0 / 11.0

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

Subtask #2
0.0 / 17.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 358 ms 53036 KB Output is correct
3 Correct 334 ms 53024 KB Output is correct
4 Correct 292 ms 53128 KB Output is correct
5 Correct 338 ms 53016 KB Output is correct
6 Correct 342 ms 53144 KB Output is correct
7 Correct 286 ms 53052 KB Output is correct
8 Correct 282 ms 53248 KB Output is correct
9 Correct 294 ms 53096 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 280 ms 53076 KB Output is correct
3 Incorrect 293 ms 53152 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 468 ms 53140 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 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 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 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Incorrect 1 ms 212 KB Output isn't correct
5 Halted 0 ms 0 KB -