Submission #1191758

#TimeUsernameProblemLanguageResultExecution timeMemory
1191758lovrotFun Tour (APIO20_fun)C++20
26 / 100
9 ms1460 KiB
#include "fun.h"
#include <vector>
#include <algorithm>
#include <cstdio>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef pair<int, int> pii;

const int N = 510;

int dist[N][N], bio[N];

vector<int> createFunTour(int n, int q) {
//	int H = hoursRequired(0, N - 1);
//	int A = attractionsBehind(0, N - 1);
//	return std::vector<int>(N);
	
	for(int i = 0; i < n; ++i) { 
		for(int j = i + 1; j < n; ++j) { 
			dist[i][j] = dist[j][i] = hoursRequired(i, j);
		}
	}

	int a = 0;
	for(int i = 1; i < n; ++i) { 
		if(dist[0][a] < dist[0][i]) { a = i; }
	}

	vector<int> p;
	p.PB(a);
	bio[a] = 1;

	for(int i = 0; i < n - 1; ++i) { 
		int b = a;
		for(int j = 0; j < n; ++j) { 
			if(!bio[j] && dist[a][b] < dist[a][j]) { b = j; }
		}

		p.PB(b);
		bio[b] = 1;
		a = b;
	}
	return p;
}
#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...