# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
308268 | WLZ | Street Lamps (APIO19_street_lamps) | C++14 | 1681 ms | 68920 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;
struct comp {
inline bool operator()(const pair<int, int> &a, const pair<int, int> &b) {
return a.second < b.second;
}
};
struct event {
int x, y_1, y_2, val, idx;
};
template<typename T>
class fenwick_tree {
private:
int n;
vector<T> fenw;
stack<int> st;
public:
fenwick_tree(int _n) : n(_n) {
fenw.resize(n);
}
size_t size() {
return n;
}
void update(int x, T val) {
while (x < n) {
# | 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... |