# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
142543 | imeimi2000 | Street Lamps (APIO19_street_lamps) | C++17 | 4153 ms | 122732 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 <algorithm>
#include <vector>
#include <set>
using namespace std;
typedef long long llong;
typedef pair<int, int> pii;
void initv(vector<int> &v) {
sort(v.begin(), v.end());
v.erase(unique(v.begin(), v.end()), v.end());
}
struct fen1D {
vector<llong> fen;
vector<int> cp;
void add(int x) {
cp.push_back(x);
}
void init() {
initv(cp);
fen.resize(cp.size(), 0);
}
int find(int x) const {
return lower_bound(cp.begin(), cp.end(), x) - cp.begin() + 1;
}
void update(int i, llong x) {
i = find(i);
while (i <= cp.size()) {
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... |