# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
58397 | paulica | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 7559 ms | 211456 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 "bubblesort2.h"
#include <bits/stdc++.h>
using namespace std;
const int Off = 1 << 20;
struct SegTree {
int a[2 * Off], lazy[2 * Off];
set<int> inds[Off];
SegTree() {
for (int i = 1; i < 2 * Off; i++) a[i] = -1e9;
for (int i = 0; i < Off; i++) inds[i].insert(-1e9);
}
void propagate(int i) {
a[i] += lazy[i];
if (i < Off) {
lazy[2 * i] += lazy[i];
lazy[2 * i + 1] += lazy[i];
}
lazy[i] = 0;
}
void update_path(int j, int i = 1, int lo = 0, int hi = Off) {
propagate(i);
# | 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... |