Submission #875990

#TimeUsernameProblemLanguageResultExecution timeMemory
875990Darren0724Rail (IOI14_rail)C++17
0 / 100
45 ms856 KiB
#include "rail.h" //#include "grader.cpp" #include <bits/stdc++.h> using namespace std; const int INF = 1e9; void findLocation(int n, int first, int ans[], int type[]) { ans[0] = first; vector<int> a(n), b(n); type[0] = 1; ans[0] = first; pair<int, int> p = {INF, -1}; for (int i = 1; i < n; i++) { a[i] = getDistance(0, i); p = min(p, {a[i], i}); } int t = p.first; for (int i = 0; i < n; i++) { b[i] = getDistance(t, i); } int second = first + a[t]; for (int i = 0; i < n; i++) { if (a[i] < b[i]) { type[i] = 1; ans[i] = first + a[i]; } else { type[i] = 2; ans[i] = second - b[i]; } } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...