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"
#define N 5000
#define INF 0x3f3f3f3f
void findLocation(int n, int x0, int xx[], int tt[]) {
static int dd[N];
int i, id, d_;
d_ = INF, id = -1;
for (i = 1; i < n; i++) {
dd[i] = getDistance(0, i);
if (d_ > dd[i])
d_ = dd[i], id = i;
}
tt[0] = 1, xx[0] = x0;
for (i = 1; i < n; i++)
if (i != id && d_ + getDistance(id, i) == dd[i])
tt[i] = 1, xx[i] = x0 + d_ - (dd[i] - d_);
else
tt[i] = 2, xx[i] = x0 + dd[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... |