# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
42333 | milmillin | Deda (COCI17_deda) | C++14 | 169 ms | 3920 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 <cstdio>
#include <vector>
#include <cstring>
using namespace std;
int seg[600100];
void update(int idx,int l,int r,int k,int val) {
if (k<l||k>=r) return;
if (l+1==r) {
seg[idx]=val;
return;
}
int m = (l+r)>>1;
update(idx*2,l,m,k,val);
update(idx*2+1,m,r,k,val);
seg[idx]=min(seg[idx*2],seg[idx*2+1]);
//printf("++ %d %d %d\n",l,r,seg[idx]);
}
int get(int idx,int l,int r,int ll,int rr,int k) {
//printf("gg %d %d %d %d %d %d\n",l,r,ll,rr,k,seg[idx]);
if (ll>=r||rr<=l) return 2e9;
if (l+1==r) return (seg[idx]<=k)?l:2e9;
if (ll<=l&&rr>=r&&seg[idx]>k) return 2e9;
int m = (l+r)>>1;
if (ll>=m) {
return get(idx*2+1,m,r,ll,rr,k);
} else if (rr<=m) {
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |