# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
406133 | amunduzbaev | 즐거운 행로 (APIO20_fun) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fun.h"
#include "bits/stdc++.h"
#include "grader.cpp"
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define sz(x) (int)x.size()
#define int long long
template<class T> bool umax(T& a, const T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> bool umin(T& a, const T b) { if(a > b) { a = b; return 1; } return 0; }
const int NN = 505;
vector<int> pref[NN], edges[NN];
int dis[NN][NN], used[NN];
vector<int32_t> createFunTour(int32_t n, int32_t q) {
int l = -1, mx = 0;
for(int i=0;i<n;i++)
for(int j=0;j<n;j++) {
dis[i][j] = hoursRequired(i, j);
if(umax(mx, dis[i][j])) l = i;
}
vector<int32_t> rr;
rr.pb(l);
used[l] = 1;
while(sz(rr) < n){
int mx = 0, r = -1;
for(int i=0;i<n;i++){
if(used[i]) continue;
if(umax(mx, dis[l][i])) r = i;
}
used[r] = 1, rr.pb(r);
l = r;
} return rr;
}