# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1013712 | vjudge1 | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 5317 ms | 64092 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;
using ll = long long;
using vll = vector <ll>;
using vi = vector <int>;
// using ii = pair <ll, ll>;
// using vii = vector <ii>;
const ll MAXN = 5E5+16, INF = ll(1E18)+16;
priority_queue <ll> pq[2*MAXN];
struct SegTree {
function <ll(ll, ll)> op;
ll idem;
vll tree;
ll n;
SegTree (ll n, function <ll(ll, ll)> op, ll idem): op(op), idem(idem), tree(2*n, idem), n(n) {}
void update (ll id, ll val) {
tree[id] = val;
}
void update (ll ql, ll qr, ll val) {
for (ll i = ql; i <= qr; i++) tree[i] = op(tree[i], val);
}
ll query (ll ql, ll qr) {
ll ans = idem;
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... |