Submission #1194512

#TimeUsernameProblemLanguageResultExecution timeMemory
1194512hackstarFun Tour (APIO20_fun)C++20
0 / 100
2096 ms328 KiB
#include "fun.h" #include<bits/stdc++.h> using namespace std; vector<int>createFunTour(int n,int q){ vector<vector<int>>dist(n,vector<int>(n)); for(int i=0;i<n;i++){ for(int j=i+1;j<n;j++){ int cur=hoursRequired(i,j); dist[i][j]=cur; dist[j][i]=cur; } } vector<int>o(n); iota(o.begin(),o.end(),0); auto check=[&]()->bool{ for (int i=1;i<n-1;i++){ int prev_dist=dist[o[i-1]][o[i]]; int curr_dist=dist[o[i]][o[i+1]]; if(curr_dist>prev_dist){ return 0; } } return 1; }; do{ if(check()){ break; } }while(next_permutation(o.begin(),o.end())); return o; }
#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...