제출 #113944

#제출 시각아이디문제언어결과실행 시간메모리
113944E869120철로 (IOI14_rail)C++14
8 / 100
74 ms624 KiB
#include "rail.h"
#include <bits/stdc++.h>
using namespace std;

int N, A[100009], T[100009];

void findLocation(int n, int first, int location[], int stype[]) {
	N = n; A[0] = first; T[0] = 1;
	
	for (int i = 1; i < N; i++) {
		int G = getDistance(0, i);
		A[i] = G + A[0];
		T[i] = 2;
	}
	for (int i = 0; i < N; i++) { location[i] = A[i]; stype[i] = T[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...