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>
using namespace std;
int N, A[100009], T[100009];
void findLocation(int n, int first, int location[], int stype[]) {
N = n; A[0] = first; T[0] = 1;
int minx = 100000000, minid = -1;
for (int i = 1; i < N; i++) {
int E = getDistance(0, i);
if (minx > E) { minx = E; minid = i; }
}
A[minid] = A[0] + minx; T[minid] = 2;
for (int i = 0; i < N; i++) {
if (i == 0 || i == minid) continue;
int F = getDistance(0, i);
int G = getDistance(minid, i);
if (F < G) { A[i] = (A[0] + F); T[i] = 2; }
else { A[i] = (A[minid] - G); T[i] = 1; }
}
for (int i = 0; i < N; i++) { location[i] = A[i]; stype[i] = T[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... |