# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
376988 | 8e7 | Cake 3 (JOI19_cake3) | C++14 | 1558 ms | 7528 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.
//Challenge: Accepted
#include <iostream>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <set>
#define ll long long
#define maxn 200005
#define pii pair<int, int>
#define ff first
#define ss second
#define io ios_base::sync_with_stdio(0);cin.tie(0);
using namespace std;
const int maxb = 1<<18;
int n, m;
vector<int> v;
inline int id(int x) {
return lower_bound(v.begin(), v.end(), x) - v.begin() + 1;
}
int bit[maxb + 1];
inline void modify(int ind, int val) {
for (;ind <= maxb;ind += ind & (-ind)) bit[ind] += val;
}
inline int kthsmall(int k) { //1 indexed
int ret = 0;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |