# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
124579 | TadijaSebez | Street Lamps (APIO19_street_lamps) | C++11 | 4354 ms | 199424 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=300050;
const int M=18*18*N;
int state[N];
struct Seg
{
int l,r,tme;
Seg(){}
Seg(int a, int b, int c):l(a),r(b),tme(c){}
bool operator < (Seg b) const { return l<b.l;}
};
set<Seg> all;
Seg Get(int x)
{
auto it=all.lower_bound(Seg(x+1,0,0));
it--;
return *it;
}
int root[N],ls[M],rs[M],tsz,sum[M];
void Set(int &c, int ss, int se, int qs, int qe, int x)
{
if(qs>qe || qs>se || ss>qe) return;
if(!c) c=++tsz;
if(qs<=ss && qe>=se){ sum[c]+=x;return;}
int mid=ss+se>>1;
Set(ls[c],ss,mid,qs,qe,x);
Set(rs[c],mid+1,se,qs,qe,x);
}
int Get(int c, int ss, int se, int qi)
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |