# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498600 | beepbeepsheep | Sterilizing Spray (JOI15_sterilizing) | C++17 | 601 ms | 21316 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;
#define ll long long
#define endl '\n'
typedef pair<ll,ll> ii;
const ll inf=1e15;
const ll maxn=5e5+5;
const ll mod=1e9+7;
struct node{
ll s,e,m,val;
node *l,*r;
node(ll _s,ll _e):s(_s),e(_e),m((_s+_e)>>1),val(0){
if (s!=e) l=new node(s,m),r=new node(m+1,e);
}
void upd(ll p, ll v){
if (s==e){val=v; return;}
if (p>m) r->upd(p,v);
if (p<=m) l->upd(p,v);
val=l->val+r->val;
}
ll query(ll x, ll y){
if (x<=s && e<=y) return val;
if (x>m) return r->query(x,y);
if (y<=m) return l->query(x,y);
return l->query(x,y)+r->query(x,y);
}
}*root;
# | 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... |