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 <bits/stdc++.h>
void findLocation(int N, int first, int location[], int stype[]){
stype[0] = 1;
location[0] = first;
int stat = 0;
int maxi = INT_MAX;
for(int i = 1; i < N; i++){
if(maxi > getDistance(0,i)){
maxi = getDistance(0,i);
stat = i;
}
}
stype[stat] = 2;
location[stat] = first+maxi;
for(int i = 1; i < N; i++){
if(i == stat) continue;
if(getDistance(0,i) == getDistance(maxi, i)){
stype[i] = 1;
location[i] = maxi-getDistance(maxi, i);
}else{
stype[i] = 1;
location[i] = first+getDistance(0,i);
}
}
}
# | 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... |