oj.uz

Submission #882822

# Submission time Handle Problem Language Result Execution time Memory
882822 2023-12-03T19:34:01 Z Youssif_Elkadi Izbori (COCI22_izbori) C++17
25 / 110
 3000 ms 8796 KB 
#include <bits/stdc++.h>
using namespace std;
const long long N = 2e3 + 5, inf = 1e17 + 5, mod = 1e9 + 7;
map<int, int> mp;
int freq[N][N];
int main()
{
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
    ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL);
    int n, sz = 0;
    cin >> n;
    vector<int> arr(n);
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
        mp[arr[i]] = 1;
    }
    for (auto &v : mp)
        v.second = ++sz;
    for (int i = 0; i < n; i++)
        arr[i] = mp[arr[i]];
    long long ans = 0;
    for (int i = 0; i < n; i++)
    {
        int cnt = 0;
        for (int j = i; j < n; j++)
        {
            freq[arr[j]][i]++;
            if (freq[arr[j]][i] > cnt)
                cnt = freq[arr[j]][i];
            if (cnt > (j - i + 1) / 2)
                ans++;
        }
    }
    cout << ans;
}
/*
10
*/

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 8796 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 6 ms 552 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 5 ms 480 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 5 ms 552 KB Output is correct
17 Correct 6 ms 492 KB Output is correct

Subtask #3
0 / 15.0

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

Subtask #4
0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 464 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 3 ms 8796 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 5 ms 348 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 348 KB Output is correct
12 Correct 6 ms 552 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 5 ms 480 KB Output is correct
15 Correct 6 ms 348 KB Output is correct
16 Correct 5 ms 552 KB Output is correct
17 Correct 6 ms 492 KB Output is correct
18 Execution timed out 3023 ms 1512 KB Time limit exceeded
19 Halted 0 ms 0 KB -