제출 #1254526

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1254526		Jer	World Map (IOI25_worldmap)	C++20	0 / 100	1 ms	328 KiB

worldmap

#include "worldmap.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 45;
pair<int, int> con[MAXN];

vector<vector<int>> create_map(int n, int m, vector<int> a, vector<int> b) {
	for (int i = 0; i < n; i++) con[i] = {-1, -1};
	for (int i = 0; i < m; i++)
	{
		if (con[a[i]].second == -1 and con[a[i]].first != -1) con[a[i]].second = b[i];
		if (con[a[i]].first == -1) con[a[i]].first = b[i];

		if (con[b[i]].second == -1 and con[b[i]].first != -1) con[b[i]].second = a[i];
		if (con[b[i]].first == -1) con[b[i]].first = a[i];
	}

	int prev = -1;
	int cur;
	for (int i = 0; i < n; i++) if (con[i].second == -1) cur = i;

	vector<vector<int>> res;
	res.resize(n);
	for (int i = 0; i < n; i++)
	{
		res[i].resize(n);
		for (int j = 0; j < n; j++) 
			res[i][j] = cur;
		if (con[cur].first != prev) prev = cur, cur = con[cur].first;
		else prev = cur, cur = con[cur].second;
	}

	return res;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 7
• Subtask 4: 0 / 8
• Subtask 5: 0 / 14
• Subtask 6: 0 / 56