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 <bits/stdc++.h>
#include "rail.h"
using namespace std;
void findLocation(int N, int first, int location[], int stype[]){
stype[0]=1;
location[0]=first;
for (int i=1;i<N;i++){
int X=getDistance(0,i);
int Y=getDistance(i,0);
// printf("%d: %d,%d\n",i,X,Y);
if (X==Y){
location[i]=first+X;
stype[i]=2;
}else{
location[i]=first-Y;
stype[i]=1;
}
}
}
# | 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... |