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 <iostream>
using namespace std;
int l[10000],ty[10000];
int gD(int x, int y)
{
return getDistance(x,y);
}
void findLocation(int N, int first, int location[], int stype[])
{
for(int i=1;i<N;i++)l[i]=gD(0,i);
for(int i=1;i<N;i++)location[i]=first+l[i];
for(int i=1;i<N;i++)stype[i]=2;
location[0]=first;
stype[0]=1;
// cout<<gD(0,2)<<endl;
// for(int i=0;i<N;i++)cout<<location[i]<<"\t";cout<<endl;
// for(int i=0;i<N;i++)cout<<stype[i]<<"\t";cout<<endl;
}
# | 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... |