제출 #1272189

#제출 시각아이디문제언어결과실행 시간메모리
1272189StefanSebez즐거운 행로 (APIO20_fun)C++20
26 / 100
23 ms17220 KiB
#include "fun.h" #include <bits/stdc++.h> using namespace std; #define fi first #define se second #define pb push_back #define ll long long #define ld long double int dist[1000][1000]; vector<int> createFunTour(int n, int q) { for(int i=0;i<n;i++){ for(int j=i+1;j<n;j++){ dist[i][j]=dist[j][i]=hoursRequired(i,j); } } int u=0; for(int i=0;i<n;i++) if(dist[u][0]<dist[i][0]) u=i; bool was[n+10]={false}; vector<int>res={u};was[u]=true; for(int j=1;j<n;j++){ int maks=0,v; for(int i=0;i<n;i++){ if(was[i]) continue; if(maks<=dist[u][i]) maks=dist[u][i],v=i; } res.pb(v); was[v]=true; u=v; } return res; /*int H = hoursRequired(0, N - 1); int A = attractionsBehind(0, N - 1); return std::vector<int>(N);*/ }
#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...