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;
const int nax = 5000;
int mem[nax][nax];
int get(int a, int b) {
if(a==b) return 0;
if(mem[a][b]) return mem[a][b];
return mem[a][b] = mem[b][a] = getDistance(a, b);
}
void findLocation(int N, int first, int location[], int stype[]) {
location[0] = first, stype[0] = 1;
for(int i=1; i<N; ++i) {
int d = get(0, i);
location[i] = first + d;
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... |