# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1055084 | aymanrs | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 17 ms | 17756 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>
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
using namespace std;
const int N = 1e6;
int ind[N];
int st[4*N+10], lz[4*N+10] = {0};
int cons(int i, int l, int r){
if(l==r) return st[i] = ind[l];
int m = l+r>>1;
return st[i] = max(cons(i<<1, l, m),cons(i<<1|1, m+1, r));
}
void upd(int i, int l, int r, int a, int v){
if(lz[i]){
st[i]+=lz[i];
if(l!=r){
lz[i<<1]+=lz[i];
lz[i<<1|1] += lz[i];
}
lz[i]=0;
}
if(r<a)return;
if(a<=l){
st[i]+=v;
if(l!=r){
lz[i<<1]+=v;
lz[i<<1|1]+=v;
}
return;
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... |