Submission #1249597

#	Time	Username	Problem	Language	Result	Execution time	Memory
1249597		MuhammadSaram	World Map (IOI25_worldmap)	C++20	72 / 100	73 ms	9544 KiB

worldmap

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

using namespace std;

const int M = 41;

int n;
vector<int> nei[M];
bool vis[M];
vector<vector<int>> ans;

void dfs(int u)
{
	vis[u]=1;
	for (int i:nei[u])
		if (!vis[i])
			ans.push_back(vector<int>(4*n,u)), dfs(i);
	ans.push_back(vector<int>(4*n,u));
	ans.push_back({});
	for (int i:nei[u])
		ans.back().push_back(i), ans.back().push_back(u);
	while (ans.back().size()<4*n) ans.back().push_back(u);
	ans.push_back(vector<int>(4*n,u));
}

vector<vector<int>> create_map(int N, int m, vector<int> a, vector<int> b)
{
	n=N;
	ans.clear();
	for (int i=1;i<=n;i++) nei[i].clear(), vis[i]=0;
	for (int i=0;i<m;i++)
		nei[a[i]].push_back(b[i]), nei[b[i]].push_back(a[i]);
	dfs(1);
	while (ans.size()<4*n)
	  ans.push_back(vector<int>(4*n,1));

	return ans;
}

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