제출 #958154

#제출 시각아이디문제언어결과실행 시간메모리
95815412345678철로 (IOI14_rail)C++17
30 / 100
46 ms604 KiB
#include "rail.h" #include <bits/stdc++.h> using namespace std; void findLocation(int N, int first, int location[], int stype[]) { location[0]=first; stype[0]=1; pair<int, int> mn={INT_MAX, 0}; for (int i=1; i<N; i++) location[i]=first+getDistance(0, i), stype[i]=2, mn=min(mn, {getDistance(0, i), i}); for (int i=1; i<N; i++) { if (i==mn.second) continue; if (getDistance(mn.second, i)<getDistance(0, i)) stype[i]=1, location[i]=location[mn.second]-getDistance(mn.second, 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...