Submission #1226058

#TimeUsernameProblemLanguageResultExecution timeMemory
1226058sokratisi즐거운 행로 (APIO20_fun)C++20
0 / 100
0 ms324 KiB
#include "fun.h" #include <vector> #include <set> #include <math.h> #include <algorithm> using namespace std; vector<int> adj[20]; int dist[20][20]; vector<int> createFunTour(int n, int q) { for (int i = 0; i < n; i++) { for (int j = i + 1; j < n; j++) { if (hoursRequired(i, j) == 1) { adj[i].push_back(j); adj[j].push_back(i); } } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { dist[i][j] = hoursRequired(i, j); } } vector<int> a; for (int i = 0; i < n; i++) a.push_back(i); vector<int> ans; do { bool okay = true; for (int i = 0; i < n-2; i++) { if (dist[a[i]][a[i+1]] < dist[a[i+1]][a[i+2]]) okay = false; if (okay) ans = a; } } while(next_permutation(a.begin(), a.end())); //int H = hoursRequired(0, N - 1); //int A = attractionsBehind(0, N - 1); //return std::vector<int>(N); 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...