Submission #1178082

#	Time	Username	Problem	Language	Result	Execution time	Memory
1178082		Kaztaev_Alisher	Longest Trip (IOI23_longesttrip)	C++20	5 / 100	328 ms	5300 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);
int was[N];
vector<int> vec , g[N];
void dfs(int v){
	was[v] = 1;
	vec.push_back(v-1);
	for(int to : g[v]){
		if(was[to] == 0) dfs(to);
	}
}
vector<int> solve(int n, int d){
	for(int i = 1; i <= n; i++) was[i] = 0 , g[i].clear();
	vec.clear();
	for(int i = 1; i <= n; i++){
		for(int j = i+1; j <= n; j++){
			if(are_connected({i-1},{j-1})){
				g[i].push_back(j);			
				g[j].push_back(i);			
			}
		}
	}
	for(int i = 1; i <= n; i++){
		sort(all(g[i]));
	}
	dfs(1);
	return vec;
}
vector<int> longest_trip(int N, int D){
    return solve(N,D);
}
  

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