제출 #1080868

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1080868		DarkMatter	철로 (IOI14_rail)	C++14	0 / 100	47 ms	600 KiB

rail

#include "rail.h"
#include<bits/stdc++.h>
using namespace std;
void findLocation(int N, int first, int location[], int stype[])
{
	for (int i = 0; i < N; i++)
		location[i] = -1;
	location[0] = first, stype[0] = 1;
	int cur = 0, mx = 0, mn = 1e9 + 7;
	cout << endl;
	while (true) {
		int curMn = 1e9 + 7, nxt = -1;
		for (int i = 0; i < N; i++) {
			int dis1 = getDistance(cur, i), dis2 = getDistance(0, i);
			if (cur == 0)
				cout << i + 1 << " " << dis1 << " " << dis2 << endl;
			if ((dis1 < dis2 || !cur) && dis1 < curMn && location[i] == -1)
				curMn = dis1, nxt = i;
		}
		if (nxt == -1)
			break;
		//cout << cur + 1 << " " << nxt + 1 << endl;
		cur = nxt;
		int curDis = getDistance(0, cur);
		mx = max(mx, curDis), mn = min(mn, curDis);
		location[cur] = curDis + first, stype[cur] = 2;
	}
	//cout << endl;
	//for (int i = 0; i < N; i++)
	//	cout << i << " " << location[i] << endl;
	for (int i = 0; i < N; i++) {
		if (location[i] != -1)
			continue;
		//cout << i << endl;
		int dis = getDistance(0, i);
		dis -= mn;
		dis++;
		location[i] = first - dis, stype[0] = 1;
	}
}

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