제출 #168334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
168334		johutha	철로 (IOI14_rail)	C++14	30 / 100	3031 ms	99556 KiB

rail

#include "rail.h"
#include <queue>
#include <vector>
#include <iostream>
#include <set>

using namespace std;

void findLocation(int N, int first, int location[], int stype[])
{
	location[0] = first;
	stype[0] = 1;

	priority_queue<pair<int,pair<int,int>>> pq;
	vector<int> mindist(N, -1);
	mindist[0] = 0;
	set<int> notused;

	for (int i = 1; i < N; i++)
	{
		location[i] = -1;
		stype[i] = -1;
		int qdist = -getDistance(0, i);
		pq.emplace(qdist, make_pair(0, i));
		notused.insert(i);
	}

	while (!pq.empty())
	{
		auto curr = pq.top();
		pq.pop();

		int dist = -curr.first;
		int oldnr = curr.second.first;
		int newnr = curr.second.second;

		if (location[newnr] != -1) continue;

		int pos = location[oldnr] + dist*(stype[oldnr] == 1 ? 1 : -1);

		location[newnr] = pos;
		stype[newnr] = (stype[oldnr] == 1 ? 2 : 1);
		notused.erase(newnr);

		for (int i : notused)
		{
			int qdist = getDistance(newnr, i);
			if (mindist[i] != -1 && mindist[i] <= qdist) continue;
			mindist[i] = qdist;
			pq.emplace(-qdist, make_pair(newnr, i));
		}
	}
}

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