# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82271 | luciocf | Deda (COCI17_deda) | C++14 | 604 ms | 3952 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;
const int maxn = 2e5+10;
const int inf = 1e9+10;
int num[maxn], tree[4*maxn];
bool done;
void build(int node, int l, int r)
{
if (l == r)
{
tree[node] = inf;
return;
}
int mid = (l+r)>>1;
build(2*node, l, mid); build(2*node+1, mid+1, r);
tree[node] = inf;
}
void upd(int node, int l, int r, int pos, int v)
{
if (l == r)
{
tree[node] = v;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |