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[]) {
std::vector<std::vector<int>> dists(N, std::vector<int>(N));
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
dists[i][j] = getDistance(i, j);
}
}
stype[0] = 1;
location[0] = first;
for (int i = 1; i < N; ++i) {
stype[i] = 2;
location[i] = first + dists[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... |