Submission #1253043

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253043		walrusramen21	World Map (IOI25_worldmap)	C++20	5 / 100	9 ms	1348 KiB

worldmap

#include "worldmap.h"
#include <cassert>
#include <queue>
#include <iostream>

void dfs(int node, std::vector<std::vector<int>>& adj, std::vector<bool>& vis, std::vector<int>& order) {
	vis[node] = true;
	order.push_back(node);
	for (int nei : adj[node]) {
		if (!vis[nei]) {
			dfs(nei, adj, vis, order);
		}
	}
	order.push_back(node);
}


std::vector<std::vector<int>> create_map(int N, int M, std::vector<int> A, std::vector<int> B) {
	assert(M == N-1);
	std::vector<std::vector<int>> adj(N+1, std::vector<int>());
	for (int i = 0; i < M; i++) {
		adj[A[i]].push_back(B[i]);
		adj[B[i]].push_back(A[i]);
	}
	// remember the graph must be connected, so this should literally just be a tree?
	std::vector<bool> vis(N+1, false);
	std::vector<int> order;
	dfs(1, adj, vis, order);
	// for (int x : order) {
	// 	std::cout << x << '\n';
	// }

	int sz = order.size();
	std::vector<std::vector<int>> ans(sz, std::vector<int>(sz));
	for (int i = 0; i < sz; i++) {
		for (int j = 0; j < sz; j++) {
			ans[i][j] = order[i];
		}
	}
	return ans;
}

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