# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
7754 | dohyun0324 | Rail (IOI14_rail) | C++98 | 168 ms | 948 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>
using namespace std;
int w,arr1[5010],arr2[5010];
struct data
{
int num,dis;
bool operator<(const data&r)const
{
return dis<r.dis;
}
}left[5010];
struct data2
{
int num,dis;
bool operator<(const data2&r)const
{
return dis<r.dis;
}
}right[5010];
void findLocation(int N, int first, int location[], int stype[])
{
int i,j,k,dis=2147483647,p,s,dis2,pos;
for(i=1;i<=N-1;i++)
{
k=getDistance(0,i);
arr1[i]=k;
if(dis>k) dis=k, p=i;
}
stype[0]=1, location[0]=first;
Compilation message (stderr)
# | 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... |