oj.uz

Submission #737743

# Submission time Handle Problem Language Result Execution time Memory
737743 2023-05-07T16:46:45 Z Ariadna Izbori (COCI22_izbori) C++14
0 / 110
 3000 ms 724 KB 
#include <bits/stdc++.h>
#define ll long long int

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector < int > a(n), aux;
    unordered_set < int > s;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        s.insert(a[i]);
    }
    int t = s.size();
    ll ans = n, ant;
    for (int i = 0; i < n; ++i) {
        aux = vector < int >(t, 0); 
        aux[a[i]] = 1;
        ant = a[i];
        for (int j = i + 1; j < n; ++j) {
            ++aux[a[j]];
            if (aux[a[j]] > aux[ant]) ans = a[j];
            if (aux[ant] > (j - i + 1) / 2) ++ans;
        }
    }
    cout << ans << '\n';
    
    
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

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

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -