# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
698362 | lukadupli | Abracadabra (CEOI22_abracadabra) | C++14 | 956 ms | 34260 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>
#define f first
#define s second
using namespace std;
typedef pair<int, int> pii;
const int MAXN = 1 << 18, MAXQ = 1e6 + 5;
struct TourSum
{
int nodes[2 * MAXN];
void update(int ind, int val, int node = 1, int l = 0, int r = MAXN){
if(r - l == 1){
nodes[node] = val;
return;
}
int m = (l + r) / 2;
if(ind < m) update(ind, val, 2 * node, l, m);
else update(ind, val, 2 * node + 1, m, r);
nodes[node] = nodes[2 * node] + nodes[2 * node + 1];
}
int binsearch(int val, int node = 1, int l = 0, int r = MAXN){
if(r - l == 1) return l;
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... |