# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
283995 | Pyqe | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9051 ms | 1284 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;
long long n,as[500069],fw[500069],fi,inf=1e18;
void ud(long long x,long long w)
{
for(fi=x;fi<=n;fi+=fi&-fi)
{
fw[fi]+=w;
}
}
long long qr(long long lh,long long rh)
{
long long z=0;
for(fi=rh;fi;fi-=fi&-fi)
{
z+=fw[fi];
}
for(fi=lh-1;fi;fi-=fi&-fi)
{
z-=fw[fi];
}
return z;
}
# | 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... |