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"
void findLocation(int n, int first, int location[], int stype[]){
location[0] = first, stype[0] = 1;
for(int i=1;i<=n-1;i++){
int dis1 = getDistance(0,i), dis2 = getDistance(i,0);
location[i] = (dis1 == dis2) ? first + dis1 - 1 : first + dis2 - 1;
stype[i] = (dis1 == dis2) ? 2 : 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... |