제출 #725088

#제출 시각아이디문제언어결과실행 시간메모리
725088danikoynov즐거운 행로 (APIO20_fun)C++14
0 / 100
1 ms212 KiB
#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] == 0) v ++; for (int j = 1; 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; }
#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...