| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1063861 | Mr_Husanboy | Rail (IOI14_rail) | C++17 | 0 ms | 0 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 maxn = 5e5;
int memo[maxn][maxn];
int get(int i, int j){
if(memo[i][j] != -1){
return memo[i][j];
}
return getDistance(i, j);
}
void findLocation(int n, int first, int location[], int stype[])
{
location[0] = first;
stype[0] = 1;
if(n == 1){
return;
}
for(int i = 0; i < n; i ++){
for(int j = 0; j < n; j ++){
memo[i][j] = -1;
}
}
for(int j = 1; j < n; j ++){
if(get(0, j) == get(j, 0)){
location[j] = first + get(0, j);
stype[j] = 2;
continue;
}
}
}