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;
void findLocation(int N, int first, int location[], int stype[]) {
int mn = INT_MAX, id = 0;
for (int i = 1; i < N; ++i) {
int x = getDistance(0, i);
if (x < mn) {
id = i;
mn = x;
}
}
stype[0] = 1;
location[0] = first;
stype[id] = 2;
location[id] = first + mn;
for (int i = 1; i < N; ++i) {
if (i == id) {
continue;
}
int x = getDistance(0, i);
int y = getDistance(id, i);
if (x == mn + y) {
stype[i] = 1;
location[i] = location[id] - y;
} else {
stype[i] = 2;
location[i] = location[0] + x;
}
}
}
# | 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... |