oj.uz

Submission #1082167

# Submission time Handle Problem Language Result Execution time Memory
1082167 2024-08-30T19:31:53 Z serifefedartar Izbori (COCI22_izbori) C++17
0 / 110
 12 ms 9680 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0)
typedef long long ll;
#define f first
#define s second
#define LOGN 21
const ll MOD = 1e9 + 7;
const ll MAXN = 2e5 + 100;

#define int long long

vector<int> A, cc, occ[MAXN];

signed main() {
    fast;
    int n;
    cin >> n;

    A = vector<int>(n+1);
    for (int i = 1; i <= n; i++) {
        cin >> A[i];
        cc.push_back(A[i]);
    }
    sort(cc.begin(), cc.end());
    cc.erase(unique(cc.begin(), cc.end()), cc.end());
    int N = cc.size();

    for (int i = 1; i <= n; i++) {
        A[i] = upper_bound(cc.begin(), cc.end(), A[i]) - cc.begin();
        occ[A[i]].push_back(i);
    }

    int cnt = 0;
    for (int i = 1; i <= N; i++) {
        if (occ[i].size() <= 2000) {
            for (int a = 0; a < occ[i].size(); a++) {
                for (int b = a; b < occ[i].size(); b++) {
                    int positive = b - a + 1;
                    int now = - (occ[i][b] - occ[i][a] + 1) + 2 * positive - 1;
                    int left = (a == 0 ? occ[i][a] - 1 : occ[i][a] - occ[i][a-1] - 1);
                    int right = (b + 1 == occ[i].size() ? n - occ[i][b] : occ[i][b+1] - occ[i][b] - 1);

                    left = min(left, now);
                    right = min(right, now);

                    if (left > right)
                        swap(left, right);

                    if (left + right <= now) {
                        cnt += (left + 1) * (right + 1);
                    } else {
                        cnt += (right + 1) * (right + 2) / 2 + (now - right) * (right + 1);
                        cnt -= (now - left) * (now - left + 1) / 2;
                    }

                }
            }

        } else {

        }
    }
    cout << cnt << "\n";
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:38:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |             for (int a = 0; a < occ[i].size(); a++) {
      |                             ~~^~~~~~~~~~~~~~~
Main.cpp:39:35: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |                 for (int b = a; b < occ[i].size(); b++) {
      |                                 ~~^~~~~~~~~~~~~~~
Main.cpp:43:40: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   43 |                     int right = (b + 1 == occ[i].size() ? n - occ[i][b] : occ[i][b+1] - occ[i][b] - 1);
      |                                  ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 10.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 70.0

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