Submission #1293936

#	Time	Username	Problem	Language	Result	Execution time	Memory
1293936		sandrokhorgu	World Map (IOI25_worldmap)	C++20	0 / 100	1188 ms	2108268 KiB

worldmap

#include<bits/stdc++.h>
using namespace std;
vector <int> gr[45], ans;
void go (int u, int v){
	for (int i=0; i<gr[v].size(); i++){
		if (gr[v][i]!=u){
			ans.push_back(v);
			go (v, gr[v][i]);
		}
	}
	ans.push_back(v);
}
vector <vector <int> > create_map(int n, int m, vector <int> x, vector <int> y){
	if (n==1){
		vector <vector <int> > mp(1, vector <int>(1, 1));
		return mp;
	}
	if (n==m+1){
		ans.clear();
		for (int i=0; i<n; i++){
			gr[i].clear();
		}
		for (int i=0; i<m; i++){
			gr[x[i]].push_back(y[i]);
			gr[y[i]].push_back(x[i]);
		}
		go(-1, 1);
		int k=ans.size();
		vector <vector <int> > mp(k, vector <int>(k, 1));
		for (int i=0; i<k; i++){
			for (int j=0; j<k; j++){
				mp[i][j]=ans[j];
			}
		}
		return mp;
	}
}

Compilation message (stderr)

worldmap.cpp: In function 'std::vector<std::vector<int> > create_map(int, int, std::vector<int>, std::vector<int>)':
worldmap.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^

• 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