# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
733515 | Username4132 | Street Lamps (APIO19_street_lamps) | C++14 | 2467 ms | 205504 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<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<cassert>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define forn(i, n) for(int i=0; i<(int)n; ++i)
#define PB push_back
#define F first
#define S second
const int MAXN=300010;
int n, m;
string str;
ll sum(vector<ll>& bit, int r){
ll ret=0;
for(; r>=0; r=(r&(r+1))-1) ret+=bit[r];
return ret;
}
void add(vector<ll>& bit, int r, int delta){
for(; r<(int)bit.size(); r=r|(r+1)) bit[r]+=delta;
}
void add(vector<ll>& bit, int l, int r, int delta){
# | 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... |