제출 #1253215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253215		TIN	World Map (IOI25_worldmap)	C++20	15 / 100	14 ms	2120 KiB

worldmap

#include "worldmap.h"
#include <functional>

std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
	std::vector<std::vector<int>> ans(2 * N, std::vector<int>(2 * N, 1));
	for (auto& x : A) --x; for (auto& x : B) --x;
	if (M == N - 1) {
		bool sub1 = true;
		for (int i = 0; i + 1 < N; i++) if (A[i] != i || B[i] != i + 1) sub1 = false;
		if (sub1) {
			for (int i = 0; i < 2 * N; i++) for (int j = 0; j < 2 * N; j++) ans[i][j] = N;
			for (int i = 1; i < N; i++) for (int j = 0; j < 2 * N; j++) ans[i - 1][j] = i;
		} else {
			for (int i = 0; i < 2 * N; i++) for (int j = 0; j < 2 * N; j++) ans[i][j] = 1;
			std::vector<std::vector<int>> adj(N, std::vector<int>());
			for (int i = 0; i < M; i++) adj[A[i]].push_back(B[i]), adj[B[i]].push_back(A[i]);
			std::vector<int> euler_tour;
			std::function<void(int, int)> DFS;
			DFS = [&](int u, int par) {
				euler_tour.push_back(u + 1);
				for (int v : adj[u]) {
					if (v ^ par) {
						DFS(v, u);
						euler_tour.push_back(u + 1);
					}
				}
			};
			DFS(0, 0);
			for (int i = 0; i < (int) euler_tour.size(); i++) for (int j = 0; j < 2 * N; j++) ans[i][j] = euler_tour[i];
		}
		return ans;
	}
	if (M == N * (N - 1) / 2) {
		for (int i = 0; i + 1 < 2 * N; i += 2) {
			int v = i / 2 + 1;
			for (int j = 0; j < 2 * N; j++) {
				ans[i][j] = v;
				ans[i + 1][j] = j + 1;
			}
		}
		return ans;
	}
	return ans;
}

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