# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
99763 | luciocf | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 5854 ms | 215844 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>
#include "bubblesort2.h"
using namespace std;
const int maxn = 1e6+10;
int n;
int num[maxn], qtd[maxn], soma[maxn];
int tree[4*maxn], lazy[4*maxn];
set<int> Pos[maxn];
void build(int node, int l, int r)
{
if (l == r)
{
tree[node] = -soma[l]-(*Pos[l].begin());
return;
}
int mid = (l+r)>>1;
build(2*node, l, mid); build(2*node+1, mid+1, r);
tree[node] = max(tree[2*node], tree[2*node+1]);
}
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... |