# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
866185 | TAhmed33 | Izbori (COCI22_izbori) | C++98 | 103 ms | 7372 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e5 + 25;
int arr[MAXN], n;
vector <int> occ[MAXN];
vector <int> d;
struct bit {
int tree[2 * MAXN + 25] = {};
void add (int pos, int val) {
for (; pos < 2 * MAXN + 25; pos += pos & (-pos)) tree[pos] += val;
}
ll get (int pos) {
ll sum = 0; for (; pos; pos -= pos & (-pos)) sum += tree[pos];
return sum;
}
};
ll solve1 (int x) {
int a[n + 1] = {}; bit cur;
for (int i = 1; i <= n; i++) {
a[i] = -1;
}
for (auto i : occ[x]) a[i] = 1;
cur.add(MAXN, 1);
ll ret = 0;
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
ret += cur.get(a[i] - 1 + MAXN);
cur.add(a[i] + MAXN, 1);
}
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... |