Submission #1178085

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178085		Kaztaev_Alisher	Longest Trip (IOI23_longesttrip)	C++20	15 / 100	1086 ms	4480 KiB

longesttrip

#include <bits/stdc++.h>

#define ios ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
#define all(a) a.begin() , a.end()
#define F first
#define S second

using namespace std;
using ll = long long;

const ll N = 2e5+5 , inf = 2e9 + 7;
const ll INF = 1e18 ,   mod = 1e9+7;

bool are_connected(vector<int> A, vector<int> B);
vector<int> vec;
vector<int> solve(int n, int d){
	vec.clear();
	map<pair<int,int>,int>mp;
	for(int i = 0; i < n; i++) vec.push_back(i);
	for(int i = 0; i < n; i++){
		for(int j = i+1; j < n; j++){
			if(are_connected({i},{j})){
				mp[{i,j}] = mp[{j,i}] = 1;			
			}
		}
	}
	while(1){
		int ok = 1;
		for(int i = 0; i+1 < vec.size(); i++){
			if(!mp[{vec[i],vec[i+1]}]){
				ok = 0;
			}
		}
		if(ok) break;
		random_shuffle(all(vec));
	}
	return vec;
}
vector<int> longest_trip(int N, int D){
    return solve(N,D);
}

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