Submission #725089

#	Time	Username	Problem	Language	Result	Execution time	Memory
725089		danikoynov	Fun Tour (APIO20_fun)	C++14	26 / 100	29 ms	1372 KiB

fun

#include "fun.h"

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

const int maxn = 510;
int dis[maxn][maxn], used[maxn];
vector<int> createFunTour(int N, int Q)
{
    for (int i = 0; i < N; i ++)
        for (int j = 0; j < N; j ++)
    {
        dis[i][j] = hoursRequired(i, j);
    }

    int cur = 0;
    for (int i = 1; i < N; i ++)
        if (dis[0][i] > dis[0][cur])
        cur = i;

    vector < int > ans;
    ans.push_back(cur);
    used[cur] = 1;
    for (int i = 1; i < N; i ++)
    {
        int v = 1;
        while(used[v] == 1)
            v ++;

        for (int j = 0; j < N; j ++)
        {
            if (used[j])
                continue;
            if (dis[cur][j] > dis[cur][v])
                v = j;
        }

        ans.push_back(v);
        used[v] = 1;
        cur = v;
    }

    return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 34