# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
758543 | Hanksburger | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 2308 ms | 40596 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;
int seg[4000005], lazy[4000005];
vector<pair<int, int> > vec;
vector<int> ans;
void push(int i, int l, int r)
{
if (l==r)
{
seg[i]+=lazy[i];
lazy[i]=0;
return;
}
seg[i]+=lazy[i];
lazy[i*2]+=lazy[i];
lazy[i*2+1]+=lazy[i];
lazy[i]=0;
}
void upd(int i, int l, int r, int ql, int qr, int val)
{
if (ql<=l && r<=qr)
{
lazy[i]+=val;
push(i, l, r);
return;
}
int mid=(l+r)/2;
push(i*2, l, mid);
push(i*2+1, mid+1, r);
# | 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... |