제출 #548150

#제출 시각아이디문제언어결과실행 시간메모리
548150Pherokung철로 (IOI14_rail)C++14
0 / 100
73 ms476 KiB
#include "rail.h" void findLocation(int n, int first, int location[], int stype[]){ location[0] = first, stype[0] = 1; for(int i=1;i<=n-1;i++){ int dis1 = getDistance(0,i), dis2 = getDistance(i,0); location[i] = (dis1 == dis2) ? first + dis1 - 1 : first + dis2 - 1; stype[i] = (dis1 == dis2) ? 2 : 1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...