Submission #348459

#	Time	Username	Problem	Language	Result	Execution time	Memory
348459		tengiz05	Rail (IOI14_rail)	C++17	8 / 100	454 ms	98668 KiB

rail

#include "rail.h"
#ifndef EVAL
#include "grader.cpp"
#endif
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5005;
int dist[MAXN][MAXN], n;
void findLocation(int N, int first, int location[], int stype[]){
	n = N;
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			dist[i][j] = getDistance(i,j);
		}
	}
	stype[0]=1;
	location[0]=first;
	for(int i=1;i<n;i++){
		location[i] = first + dist[0][i];
		stype[i] = 2;
	}return;
}

• Subtask 1: 8 / 8
• Subtask 2: 0 / 22
• Subtask 3: 0 / 26
• Subtask 4: 0 / 44