# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
750616 | Abrar_Al_Samit | Rail (IOI14_rail) | C++17 | 77 ms | 34272 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 <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;
int ndt;
int dis = 1e9;
for(int i=1; i<N; ++i) {
if(get(0, i)<dis) {
dis = get(0, i);
ndt = i;
}
}
location[ndt] = first + dis, stype[ndt] = 2;
for(int i=1; i<N; ++i) {
if(i==ndt) continue;
int d1 = get(0, i);
int d2 = get(ndt, i);
if(d1<d2) {
location[i] = first + d1;
stype[i] = 2;
} else {
location[i] = location[ndt] - d2;
stype[i] = 1;
}
}
}
Compilation message (stderr)
# | 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... |