# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029639 | sleepntsheep | Roller Coaster Railroad (IOI16_railroad) | C11 | 124 ms | 11572 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 "railroad_c.h"
#include<stdio.h>
#include <stdlib.h>
int C(const void*i, const void*j){return*(const int*)i-*(const int*)j;}
int lb(int*a,int n,int x){
int l=-1,u=n,m;
while(u-l>1)(a[m=l+(u-l)/2]<x)?(l=m):(u=m);
return u;
}
long long plan_roller_coaster(int n, int *s, int *t) {
static int lef[1000000],rgt[1000000], lc[1000000];
/*compress*/
for(int i=0;i<n;++i) lef[2*i]=s[i],lef[2*i+1]=t[i];
qsort(lef,2*n,sizeof*lef,C);
for(int i=0;i<n;++i) s[i]=lb(lef,2*n,s[i]),t[i]=lb(lef,2*n,t[i]),++s[i],++t[i];
/*yes*/
int lo=0,ro=0;
for (int i = 0; i < n; ++i)
if (s[i]<=t[i])
lef[lo] = i, lc[lo++] = s[i];
for (int i = 0; i < n; ++i) {
if (s[i]>t[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... |