oj.uz

Submission #764957

# Submission time Handle Problem Language Result Execution time Memory
764957 2023-06-24T06:58:06 Z The_Samurai Izbori (COCI22_izbori) C++17
25 / 110
 3000 ms 1364 KB 
#include "bits/stdc++.h"

using namespace std;
using ll = long long;

ll sum(ll l, ll r) {
    // l^2 + ... + r^2
    l--;
    return r * (r + 1) * (2 * r + 1) / 6 - l * (l + 1) * (2 * l + 1) / 6;
}

int brute(int n, vector<int> &a) {
    int ans = 0;
    for (int i = 0; i < n; i++) {
        vector<int> cnt(n);
        int mx = 0;
        for (int j = i; j < n; j++) {
            cnt[a[j]]++;
            mx = max(mx, cnt[a[j]]);
            if (2 * mx > (j - i + 1)) {
                ans++;
            }
        }
    }
    return ans;
}

void solve() {
    int n;
    cin >> n;
    map<int, int> mp;
    vector<int> cnt, a(n);
    {
        for (int &x: a) {
            cin >> x;
            mp[x];
        }
        int z = 0;
        for (auto &it: mp) {
            it.second = z++;
        }
        cnt.assign(mp.size(), 0);
        for (int &x: a) {
            x = mp[x];
            cnt[x]++;
        }
    }
    cout << brute(n, a);
    return;
    vector<vector<int>> pos(mp.size());
    for (int i = 0; i < n; i++) {
        pos[a[i]].emplace_back(i);
    }
    int N = 100;
    ll ans = 0;
    for (int i = 0; i < mp.size(); i++) {
        if (cnt[i] <= N) {
            cout << i << endl;
            for (int l = 0; l < cnt[i]; l++) {
                for (int r = l; r < cnt[i]; r++) {
                    int left = 0, right = n - 1, plus = r - l + 1;
                    int have = plus - ((pos[i][r] - pos[i][l] + 1) - plus);
                    if (have <= 0) {
                        continue;
                    }
                    if (l > 0) {
                        left = pos[i][l - 1] + 1;
                    }
                    if (r + 1 < cnt[i]) {
                        right = pos[i][r + 1] - 1;
                    }
                    right = min(right, pos[i][r] + (have - 1));
                    left = max(left, pos[i][l] - (have - 1));
                    int right2 = left + (2 * plus - 1) - 1;
                    cout << l << ' ' << r << ' ' << left << ' ' << right << ' ' << right2 << endl;
                    // right - 1
                    // right-1 - 2
                    // ...
                    // right2 - da stop
                    // qogani bir hil
                }
            }
        }
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cout.tie(nullptr);
    cin.tie(nullptr);

    int queries = 1;
#ifdef test_cases
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    cin >> queries;
#else
    //    cin >> queries;
#endif

    for (int test_case = 1; test_case <= queries; test_case++) {
#ifdef test_cases
        cout << "Test case: " << test_case << '\n';
#endif
        solve();
        cout << '\n';
    }
}

Compilation message

Main.cpp: In function 'void solve()':
Main.cpp:56:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::map<int, int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (int i = 0; i < mp.size(); i++) {
      |                     ~~^~~~~~~~~~~
Main.cpp:55:8: warning: unused variable 'ans' [-Wunused-variable]
   55 |     ll ans = 0;
      |        ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 4 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 212 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 6 ms 340 KB Output is correct

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3063 ms 1364 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 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 4 ms 212 KB Output is correct
10 Correct 4 ms 212 KB Output is correct
11 Correct 5 ms 340 KB Output is correct
12 Correct 4 ms 212 KB Output is correct
13 Correct 4 ms 212 KB Output is correct
14 Correct 5 ms 340 KB Output is correct
15 Correct 4 ms 212 KB Output is correct
16 Correct 5 ms 340 KB Output is correct
17 Correct 6 ms 340 KB Output is correct
18 Execution timed out 3063 ms 1364 KB Time limit exceeded
19 Halted 0 ms 0 KB -