# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
884129 | vjudge1 | Bubble Sort 2 (JOI18_bubblesort2) | C++17 | 9031 ms | 1672 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>
using namespace std;
vector<int>aib;
void update(int pos,int val,int n)
{
int i=pos;
while(i<=n)
{
aib[i]+=val;
i+=(i&(-i));
}
}
int get(int pos,int n)
{
int i=pos,s=0;
while(i>0)
{
s=s+aib[i];
i-=(i&(-i));
}
return s;
}
vector<int> countScans(vector<int>A, vector<int>X, vector<int>V)
{
int n=A.size(),q=X.size();
vector<int>Aux(n+q);
for(int i=0;i<n;i++)
{
# | 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... |