# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
136605 | mosesmayer | Rail (IOI14_rail) | C++17 | 84 ms | 632 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 <cstdio>
//getDistance(i,j) --> distance from i to j
int d[3][5005];
int type[5005];
int pos[5005];
void findLocation(int n, int first, int location[], int stype[]){
int mnid = 0;
d[0][0] = 0x3f3f3f3f;
for (int i = 1; i < n; i++){
d[0][i] = getDistance(0, i);
if (d[0][i] < d[0][mnid]) mnid = i;
}
type[mnid] = 2;
int mnid2 = 0;
for (int i = 0; i < n; i++){
if (i == mnid) continue;
d[1][i] = getDistance(mnid, i);
if (d[1][i] < d[1][mnid2]) mnid2 = i;
}
for (int i = 0; i < n; i++){
if (i == mnid2) continue;
d[2][i] = getDistance(mnid2, i);
}
pos[mnid] = d[0][mnid] + first;
pos[mnid2] = pos[mnid] - d[1][mnid2];
type[mnid] = 2;
type[mnid2] = 1;
// printf("%d %d t%d\n", mnid, pos[mnid], type[mnid]);
# | 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... |