Submission #69469

#	Time	Username	Problem	Language	Result	Execution time	Memory
69469		E869120	Rail (IOI14_rail)	C++14	30 / 100	167 ms	99100 KiB

rail

#include "rail.h"
#include <iostream>
using namespace std;

int p[100009], l[100009], dist[5009][5009];

int getDist(int a, int b) {
	if (a > b) swap(a, b);
	if (dist[a][b] != -1) return dist[a][b];
	int ZZ = getDistance(a, b);
	dist[a][b] = ZZ;
	return ZZ;
}

void findLocation(int N, int first, int location[], int stype[])
{
	for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) dist[i][j] = -1; }

	int minx = (1 << 30), minid = 0;
	for (int i = 1; i < N; i++) {
		int p = getDist(0, i);
		if (p < minx) { minx = p; minid = i; }
	}
	p[minid] = 2; p[0] = 1; l[minid] = minx;
	for (int i = 1; i < N; i++) {
		if (i == minid) continue;
		int z1 = getDist(0, i);
		int z2 = getDist(minid, i);

		if (z1 > z2) { p[i] = 1; l[i] = -1 * (z1 - minx * 2); }
		else { p[i] = 2; l[i] = z1; }
	}
	for (int i = 0; i < N; i++) { location[i] = l[i] + first; stype[i] = p[i]; }
}

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