Submission #965085

#TimeUsernameProblemLanguageResultExecution timeMemory
965085PanndaFun Tour (APIO20_fun)C++17
26 / 100
125 ms23900 KiB
#include "fun.h"

#include <bits/stdc++.h>
using namespace std;

vector<int> createFunTour(int n, int _400000) {
    auto findFurthest = [&](int u, set<int> dom) {
        int v = u;
        int dv = 0;
        for (int x : dom) {
            int dx = hoursRequired(u, x);
            if (dx > dv) {
                v = x;
                dv = dx;
            }
        }
        return v;
    };
    set<int> rem;
    for (int u = 0; u < n; u++) rem.insert(u);
    int u = findFurthest(0, rem);
    vector<int> res;
    for (int i = 0; i < n; i++) {
        res.push_back(u);
        rem.erase(u);
        u = findFurthest(u, rem);
    }
    return res;
}
#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...