# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
943217 | MisterReaper | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 754 ms | 92372 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 i64 = long long;
int lsb(int x) {
return x & -x;
}
void solve() {
int n, q;
std::cin >> n >> q;
std::vector<int> a(n + 1);
a[0] = 1E9 + 5;
for(int i = 1; i <= n; i++) {
std::cin >> a[i];
}
std::vector<std::array<int, 3>> qs[n + 1];
for(int i = 0; i < q; i++) {
int l, r, k;
std::cin >> l >> r >> k;
qs[r].push_back({l, k, i});
}
std::vector<int> mx(n + 1);
auto Update = [&](int p, int b) -> void {
for(int i = p; i > 0; i -= lsb(i)) {
mx[i] = std::max(mx[i], b);
}
};
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |