# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14196 | dohyun0324 | 버블 정렬 (OJUZ10_bubblesort) | C++98 | 110 ms | 35856 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<stdio.h>
#include<algorithm>
#include<stdlib.h>
using namespace std;
int t,n,k,b[100010],tree[200010],nxt[21][200010],num[21][200010];
struct data{
int x,p;
bool operator<(const data&r)const{
return x>r.x;
}
}a[100010];
void update(int x){
while(x<=t){
tree[x]++;
x+=x&(-x);
}
}
int query(int x){
int cnt=0;
while(x){
cnt+=tree[x];
x-=x&(-x);
}
return cnt;
}
int func(){
int i;
for(i=1;i<=18;i++){
if(rand()%2==0) break;
}
# | 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... |