oj.uz

Submission #981926

# Submission time Handle Problem Language Result Execution time Memory
981926 2024-05-13T16:33:17 Z vjudge1 Sequence (APIO23_sequence) C++17
7 / 100
 78 ms 13396 KB 
#include "sequence.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;
using ii = pair <ll, ll>;
using vii = vector <ii>;

int sequence (int n, vi ve) {
    for (int &i : ve) i--;
    vi v2 = ve;
    sort(v2.begin(), v2.end());
    ll med = v2[(n-1)/2];
    ll ans = 0;
    vll freq(n, 0);
    for (int i : ve) freq[i]++;
    for (ll i = med; i < n; i++) {
        ans = max(ans, freq[i]);
    }
    freq.assign(n, 0);
    ll i = 0;
    for (; i < n; i++) {
        if (!i || ve[i-1] <= ve[i]) {
            ans = max(ans, ++freq[ve[i]]);
        } else break;
    }
    freq.assign(n, 0);
    for (; i < n; i++) {
        if (!i || ve[i-1] >= ve[i]) {
            ans = max(ans, ++freq[ve[i]]);
        } else break;
    }
    return int(ans);
}

Subtask #1
0.0 / 11.0

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

Subtask #2
0.0 / 17.0

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

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 67 ms 10060 KB Output is correct
3 Correct 69 ms 10076 KB Output is correct
4 Correct 40 ms 11088 KB Output is correct
5 Correct 70 ms 13396 KB Output is correct
6 Correct 75 ms 13396 KB Output is correct
7 Correct 43 ms 11348 KB Output is correct
8 Correct 42 ms 11612 KB Output is correct
9 Correct 41 ms 11080 KB Output is correct

Subtask #4
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 10140 KB Output is correct
2 Correct 74 ms 9972 KB Output is correct
3 Incorrect 71 ms 10060 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0.0 / 22.0

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

Subtask #7
0.0 / 18.0

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