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 <bits/stdc++.h>
#include "rail.h"
using namespace std;
const int MAX_N = 5e3 + 10;
int dist[MAX_N][MAX_N];
void findLocation(int N, int first, int location[], int stype[]) {
for(int i = 1; i < N; i++) {
dist[0][i] = getDistance(0, i);
}
location[0] = first;
stype[0] = 1;
for(int i = 1; i < N; i++) {
location[i] = first + dist[0][i];
stype[i] = 2;
}
}
# | 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... |