# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164818 | King87arshia | Izbori (COCI22_izbori) | C++17 | 82 ms | 10056 KiB |
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#pragma GCC optimize ("Ofast,unroll-loops")
#pragma GCC target ("avx2")
const int N = 2e5 + 5, T = 0;
vector<int> big;
int ans = 0, n, a[N];
map<int, int> mp;
map<int, bool> mark;
int main() {
scanf("%lld", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
mp[a[i]]++;
}
for (auto &[x, y] : mp) {
if (y >= T) big.push_back(x);
else mark[x] = true;
}
for (long long x : big) {
ordered_set s;
long long fake[n + 5];
int sum = 0;
for (int i = 0; i < n; i++)
fake[i] = (a[i] == x ? 1 : -1);
s.insert({0, -1});
for (int i = 0; i < n; i++) {
sum += fake[i];
ans += s.order_of_key({sum, INT_MIN});
s.insert({sum, i});
}
}
for (int i = 0; i < n; i++) {
pair<int, int> mx = {0, 0};
mp.clear();
for (int sz = 1; sz <= 2 * T; sz++) {
if (i + sz - 1 >= n)
break;
mp[a[i + sz - 1]]++;
long long x = mp[a[i + sz - 1]];
if (mx.first < x)
mx = {x, a[i + sz - 1]};
if (mx.first > sz / 2 && mark[mx.second] == true)
ans++;
}
}
printf("%lld\n", ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |