# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
222949 | ngot23 | Deda (COCI17_deda) | C++11 | 119 ms | 5240 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 N=200005;
int t[N*4], n, Q;
void update(int l, int r, int id, int u, int val) {
if(u<l || u>r) return;
if(l==r) {t[id]=val;return;}
int mid=(r+l)>>1;
update(l, mid, id*2, u, val);
update(mid+1, r, id*2+1, u, val);
t[id]=min(t[id*2], t[id*2+1]);
}
int get(int l, int r, int id, int u, int val) {
if(r<u) return -1;
if(t[id] > val) return -1;
if(l==r) {
if(t[id]<=val) return l;
return -1;
}
int mid = (r+l)>>1;
if(u<=mid) {
int x=get(l, mid, id*2, u, val);
if(x!=-1) return x;
int y=get(mid+1, r, id*2+1, u, val);
if(y!=-1) return y;
} else {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |