제출 #163518

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
163518		faremy	Teleporters (IOI08_teleporters)	C++14	100 / 100	475 ms	29688 KiB

teleporters

#include <iostream>
#include <algorithm>
#include <vector>


const int MAXN = 2e6 + 2;

int warp[MAXN], next[MAXN];
bool seen[MAXN];

std::vector<int> cycleSizes;


int floodfill(int pos)
{
	if (seen[pos])
		return 0;
	seen[pos] = true;
	return (floodfill(warp[next[pos]]) + 1);
}

int main()
{
	std::ios::sync_with_stdio(false);
	std::cout.tie(nullptr);
	std::cin.tie(nullptr);

	std::fill_n(warp, MAXN, -1);
	warp[0] = 0;
	warp[MAXN - 1] = MAXN - 1;

	int teleporters, canAdd;
	std::cin >> teleporters >> canAdd;

	for (int iTel = 0; iTel < teleporters; iTel++)
	{
		int west, east;
		std::cin >> west >> east;
		warp[west] = east;
		warp[east] = west;
	}

	int lastSeen = MAXN - 1;
	next[MAXN - 1] = MAXN - 1;

	for (int iPos = MAXN - 2; iPos > -1; iPos--)
		if (warp[iPos] != -1)
		{
			next[iPos] = lastSeen;
			lastSeen = iPos;
		}

	int score = floodfill(0) - 2;
	for (int iPos = 1; iPos < MAXN - 1; iPos++)
		if (!seen[iPos] && warp[iPos] != -1)
			cycleSizes.emplace_back(floodfill(iPos));

	std::sort(cycleSizes.rbegin(), cycleSizes.rend());
	for (int iCyc = 0; iCyc < (int)cycleSizes.size() && canAdd > 0; iCyc++)
	{
		score += cycleSizes[iCyc] + 2;
		canAdd--;
	}

	std::cout << score + canAdd * 2 - canAdd % 2 << '\n';

	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5