| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1347301 | goodpjw2008 | Fun Tour (APIO20_fun) | C++20 | 13 ms | 1464 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 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... | ||||
