Submission #980137

#	Time	Username	Problem	Language	Result	Execution time	Memory
980137		vjudge1	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	8 ms	600 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define pf push_front
#define fi first
#define se second

using namespace std;

vector<int> longest_trip(int N, int D){
	deque<vector<int>> ans;
	rep(i,0,N){
		ans.pb({i});
	}
	while(ans.size()>1){
		if(are_connected({ans[0].back()},{ans[1].back()})){
			repa(e,ans[1]) ans[0].pb(e);
			ans.erase(ans.begin()+1);
		}else{
			repa(e,ans[2]) ans[0].pb(e);
			ans.erase(ans.begin()+2);
		}
	}
	if(ans[0].size()>ans[1].size()) return ans[0];
	else return ans[1];
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 60