Submission #1226083

#TimeUsernameProblemLanguageResultExecution timeMemory
1226083SpyrosAlivFun Tour (APIO20_fun)C++20
26 / 100
268 ms589824 KiB
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;

int n, q;

vector<int> createFunTour(int N, int Q) {
    n = N;
    q = Q;
    vector<vector<int>> dis(n, vector<int>(n, 0));
    int a = 0, b = 0;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            if (i == j) continue;
            dis[i][j] = hoursRequired(i, j);
            if (dis[i][j] >= dis[a][b]) {
                a = i;
                b = j;
            }
        }
    }
    vector<int> ans;
    vector<bool> used(n, false);
    used[a] = true;
    ans.push_back(a);
    while (ans.size() < n) {
        int curr = ans.back();
        int mx = 0;
        int sec = 0;
        for (int j = 0; j < n; j++) {
            if (used[j] || j == curr) continue;
            if (dis[curr][j] >= mx) {
                mx = dis[curr][j];
                sec = j;
            }
        }
        used[sec] = true;
        ans.push_back(sec);
    }
    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...