# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
12217 | paulsohn | 격자 보존하기 (GA9_preserve) | C11 | 40 ms | 2452 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<stdlib.h>
int n, k, d;
int p[100010], Gap[100010], lb, rb, sum, sum2, score;
void mergesort(int* po, int n){
int *pt, *pt2, *tmp;
int rm, rm2, h=0, i;
if(n<2) return;
pt=po;
pt2=po+n/2;
rm=n/2;
rm2=n-n/2;
mergesort(pt, rm);
mergesort(pt2, rm2);
tmp=(int*) malloc(sizeof(int)*n);
while(rm && rm2){
if(*pt>*pt2){
tmp[h++]=*(pt++);
rm--;
}
else{
tmp[h++]=*(pt2++);
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |