제출 #585570

#제출 시각아이디문제언어결과실행 시간메모리
585570SeDunion철로 (IOI14_rail)C++17
8 / 100
68 ms500 KiB
#include "rail.h" #include<iostream> using namespace std; int n; void findLocation(int N, int first, int location[], int stype[]) { n = N; location[0] = first; stype[0] = 1; for (int i = 1 ; i < n ; ++ i) { stype[i] = 2; } for (int i = 1 ; i < n ; ++ i) { location[i] = getDistance(0, i) + first; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...