Submission #935110

#TimeUsernameProblemLanguageResultExecution timeMemory
935110MinaRagy06Fun Tour (APIO20_fun)C++17
26 / 100
309 ms524288 KiB
#include <bits/stdc++.h>
#ifdef MINA
#include "grader.cpp"
#endif
#include "fun.h"
using namespace std;
#define ll long long

vector<int> createFunTour(int n, int q) {
	int dist[n][n]{};
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			dist[i][j] = hoursRequired(i, j);
		}
	}
	int u = 0;
	array<int, 2> mx = {-1, -1};
	for (int i = 0; i < n; i++) {
		mx = max(mx, {dist[u][i], i});
	}
	u = mx[1];
	vector<int> ans, v;
	for (int i = 0; i < n; i++) {
		if (i == u) continue;
		v.push_back(i);
	}
	ans.push_back(u);
	while (v.size()) {
		mx = {-1, -1};
		for (auto i : v) {
			mx = max(mx, {dist[u][i], i});
		}
		u = mx[1];
		ans.push_back(u);
		vector<int> newv;
		for (auto i : v) {
			if (i == u) continue;
			newv.push_back(i);
		}
		v = newv;
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...