# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84018 | sams | Deda (COCI17_deda) | C++14 | 214 ms | 18372 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, INF=0x3f3f3f3f;
int n, q;
int seg[4*MAXN];
// Segment Tree
void upd(int i, int x, int u=1, int l=1, int r=n){
if(l==r){
seg[u]=x;
return;
}
int mid=(l+r)/2;
if(i<=mid) upd(i, x, 2*u, l, mid);
else upd(i, x, 2*u+1, mid+1, r);
seg[u]=min(seg[2*u], seg[2*u+1]);
}
int search_seg(int b, int x, int u=1, int l=1, int r=n){
if(seg[u]>x) return INF;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |