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>
using namespace std;
const int maxn=1e3+5;
#define REP(i,n) for(int i=0;i<n;i++)
int dist[maxn][maxn];
bool vis[maxn];
vector<int> createFunTour(int n, int q) {
int st=0,mx=0;
REP(i,n){
REP(j,i){
dist[i][j]=hoursRequired(i,j);
if(dist[i][j]>mx){
mx=dist[i][j];
st=i;
}
}
}
REP(i,n){
REP(j,n){
if(!dist[i][j]) dist[i][j]=dist[j][i];
}
}
vector<int> ans;
REP(asd,n){
ans.push_back(st);
vis[st]=1;
int mx=0,p=0;
REP(j,n){
if(!vis[j]){
if(dist[st][j]>mx){
mx=dist[st][j];
p=j;
}
}
}
st=p;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |