# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
15779 | gs13068 | Rail (IOI14_rail) | C++98 | 232 ms | 844 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 "rail.h"
#include<algorithm>
std::pair<int,int> a[5555];
int c[5555];
int d[5555];
void findLocation(int n,int fir,int loc[],int stp[])
{
int i,j,k,l,sec,le,ri,t;
loc[0]=fir;
stp[0]=1;
fir=0;
for(i=1;i<n;i++)
{
c[i]=getDistance(fir,i);
a[i].first=c[i];
a[i].second=i;
}
sec=std::min_element(a+1,a+n)->second;
loc[sec]=loc[fir]+c[sec];
stp[sec]=2;
for(i=1;i<n;i++)
{
d[i]=getDistance(sec,i);
a[i].first=std::min(c[i],d[i]);
}
std::sort(a+1,a+n);
le=fir;
ri=sec;
# | 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... |