# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
158656 | PeppaPig | Street Lamps (APIO19_street_lamps) | C++14 | 1645 ms | 76484 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>
#define iii tuple<int, int, int>
using namespace std;
const int N = 3e5+5;
void update(vector<int> &t, int x, int k) {
for(int i = x; i < t.size(); i += i & -i)
t[i] += k;
}
int query(vector<int> &t, int x) {
int ret = 0;
for(int i = x; i; i -= i & -i)
ret += t[i];
return ret;
}
int n, q, state[N];
char str[N];
set<iii> S;
vector<iii> ask;
vector<int> coord[N], t[N];
void update_2d(int x, int l, int r, int k) {
for(int i = x; i <= n; i += i & -i) {
auto it = lower_bound(coord[i].begin(), coord[i].end(), l + 1);
if(it == coord[i].begin()) update(t[i], 1, k);
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... |