Submission #1347301

#TimeUsernameProblemLanguageResultExecution timeMemory
1347301goodpjw2008즐거운 행로 (APIO20_fun)C++20
26 / 100
13 ms1464 KiB
#include "fun.h"
#include <bits/stdc++.h>
using namespace std;
int dist[505][505];
bool chk[505];
vector<int>createFunTour(int N, int Q) {
  int mx=0,start=0;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < N; j++) {
            dist[i][j] = hoursRequired(i,j);
            if(dist[i][j]>mx){
                mx=dist[i][j];
                start=i;
            }
        }
    }
    vector<int>ans;
    ans.push_back(start);
    chk[start]=1;
    for(int i = 1; i < N; i++){
      mx=0;
        for(int j = 0; j < N; j++){
            if(chk[j]) continue;
            if(dist[ans.back()][j]>mx){
                mx=dist[ans.back()][j];
                start=j;
            }
        }
        ans.push_back(start);
        chk[start]=1;
    }
    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...