# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
19114 | mindol | 버블 정렬 (OJUZ10_bubblesort) | C++14 | 216 ms | 6100 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<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
struct segtree
{
int tree[1<<18],base=1<<17;
void add(int place)
{
for(place+=base-1;place>=1;place>>=1)
tree[place]++;
}
int rangeSum(int s,int e)
{
int sum=0;
for(s+=base-1,e+=base-1;s<=e;s>>=1,e>>=1)
{
if(s&1) sum+=tree[s++];
if(!(e&1)) sum+=tree[e--];
}
return sum;
}
} p,q;
vector<int> cpr;
vector<pair<int,int>> v;
int a[100001];
int fin[100001];
# | 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... |