# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
76469 | win11905 | Fortune Telling 2 (JOI14_fortune_telling2) | C++11 | 3034 ms | 94424 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;
#define all(x) x.begin(), x.end()
#define long long long
#define pii pair<int, int>
#define x first
#define y second
const int N = 2e5+5;
int n, k;
long ans;
vector<int> t[N<<1];
vector<pii> que;
int f(int m, int v) {
int sum = 0;
auto get = [&](int z) {
int x = lower_bound(all(t[z]), v) - t[z].begin() - 1;
sum += t[z].size() - x - 1;
};
for(int l = m + k, r = k + k; l < r; l >>= 1, r >>= 1) {
if(l & 1) get(l++);
if(r & 1) get(--r);
}
return sum;
}
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... |