Submission #1233516

#	Time	Username	Problem	Language	Result	Execution time	Memory
1233516		thelegendary08	즐거운 행로 (APIO20_fun)	C++17	26 / 100	285 ms	589824 KiB

fun

#include "fun.h"
#include<bits/stdc++.h>
#define int long long
#define mp make_pair
#define pb push_back
#define f0r(i,n) for(signed i = 0; i<n; i++)
#define FOR(i, k, n) for(signed i = k; i<n; i++)
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define pii pair<int,int>
#define vb vector<bool>
#define mii map<int,int>
#define vvi vector<vector<int>>
#define vout(v) for(auto u : v)cout<<u<<' '; cout<<endl;
#define dout(a) cout<<a<<' '<<#a<<endl;
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<endl;
using namespace std;

std::vector<signed> createFunTour(signed N, signed Q) {
	vvi dist(N, vi(N));
	pii diam; int mx = 0;
	f0r(i, N){
		f0r(j, N){
			if(i != j){
				int a = hoursRequired(i, j);
				dist[i][j] = a; dist[j][i] = a;
				if(a > mx){
					mx = a;
					diam = mp(i,j);
				}
			}
		}
	}
	
	vb vis(N);
	vis[diam.first] = 1;
	vis[diam.second] = 1;
	vector<signed>ans; ans.pb(diam.first); ans.pb(diam.second);
	int cnt = 2; int cur = diam.second; 
	while(cnt < N){
		int mxd = 0; int mx = -1;
		f0r(i, N){
			if(!vis[i]){
				if(dist[cur][i] > mx){
					mx = dist[cur][i]; mxd = i;
				}
			}
		}
		cur = mxd; ans.pb(cur); vis[cur] = 1; cnt++;
	}
	return ans;
	
	
	/*
  signed H = hoursRequired(0, N - 1);
  signed A = attractionsBehind(0, N - 1);
  return std::vector<signed>(N);
  */
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 34