# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
875989 | Darren0724 | Rail (IOI14_rail) | C++17 | 0 ms | 0 KiB |
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 "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
void findLocation(int n, int first, int ans[], int type[]) {
ans[0] = first;
vector<int> a(n), b(n);
type[0] = 1;
ans[0] = first;
pair<int, int> p = {INF, -1};
for (int i = 1; i < n; i++) {
a[i] = getDistance(0, i);
p = min(p, {a[i], i});
}
int t = p.first;
for (int i = 0; i < n; i++) {
b[i] = getDistance(t, i);
}
int second = first + a[t];
for (int i = 0; i < n; i++) {
if (a[i] < b[i]) {
type[i] = 1;
ans[i] = first + a[i];
} else {
type[i] = 2;
ans[i] = second - b[i];
}
}
}