# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
997947 | pcc | Street Lamps (APIO19_street_lamps) | C++17 | 2098 ms | 65688 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 pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
#define tlll tuple<ll,ll,ll>
const int mxn = 3e5+10;
int N;
int q;
vector<pair<int,pii>> req;
int ans[mxn];
string state;
struct Q{
int tp,s,e,val;
Q(int tt,int ss,int ee,int vv):tp(tt),s(ss),e(ee),val(vv){}
bool operator<(Q &b)const{
return s==b.s?tp<b.tp:s<b.s;
}
};
struct BIT{
BIT(){}
int bit[mxn];
void modify(int p,int v){
# | 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... |