# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
260717 | ChrisT | Exercise Deadlines (CCO20_day1problem2) | C++17 | 253 ms | 18292 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;
using ll = long long;
using pii = pair<int,int>;
using pli = pair<ll,int>;
using pll = pair<ll,ll>;
using ld = long double;
#define all(x) (x).begin(),(x).end()
const int MN = 2e5 + 5, MOD = 1e9 + 7, BASE = 131;
int bit[MN],n; set<int> in;
void inc (int i) {
for (;i<MN;i+=i&-i)
++bit[i];
}
void dec (int i) {
for (;i<MN;i+=i&-i)
--bit[i];
}
int query (int i) {
int ret = 0;
for (;i;i^=i&-i)
ret += bit[i];
return ret;
}
int bsearch (int ind) {
int l = 1, r = n, mid, ans = -1;
while (l <= r) {
mid = (l+r)/2;
if (query(mid) <= ind) l = (ans = mid) + 1;
else r = mid - 1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |