Submission #1063862

#TimeUsernameProblemLanguageResultExecution timeMemory
1063862Mr_HusanboyRail (IOI14_rail)C++17
8 / 100
67 ms98428 KiB
#include "rail.h" #include <bits/stdc++.h> using namespace std; const int maxn = 5e3; 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; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...