| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1023473 | NintsiChkhaidze | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 6 ms | 4808 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"
#define left h*2,l,(l + r)/2
#define right h*2+1,(l + r)/2 + 1,r
#define pii pair <int,int>
#define s second
#define f first
#define pb push_back
using namespace std;
const int N = 1e6 + 5;
int l1[N],lz[4*N],AA[N],VV[N];
pii t[4*N];
map <int,int> mp;
void build(int h,int l,int r){
if (l == r){
t[h] = {0,l};
return;
}
build(left);
build(right);
t[h] = max(t[h*2],t[h*2 + 1]);
}
void push(int h){
if (lz[h]==0) return ;
lz[h*2] += lz[h];
lz[h*2 + 1] += lz[h];
t[h*2].f += lz[h];
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... | ||||
