# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1113497 | jkb_gryz | Bubble Sort 2 (JOI18_bubblesort2) | C++14 | 85 ms | 102728 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;
#define ll long long
const int base = 1<<20;
const ll INF = 1e18+7;
const ll MAXN = 1e6+7;
ll tree[base<<1];
set<int> pozycje[MAXN];
ll lazy[base<<1];
int n;
void build(ll v, ll l, ll r){
if(l == r){
if(l > n){
tree[v] = -INF;
return;
}
auto tmp = pozycje[l].end();
--tmp;
tree[v] = *tmp;
}
else{
ll mid = (l + r)/2;
build(2*v, l, mid);
build(2*v+1, mid+1, r);
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... |