Submission #849307

#	Time	Username	Problem	Language	Result	Execution time	Memory
849307		Muaath_5	가장 긴 여행 (IOI23_longesttrip)	C++17	0 / 100	2 ms	344 KiB

longesttrip

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double

using namespace std;

const ll N = 1005, INF = 7e15;

bool are_connected(vector<int> A, vector<int> B);

vector<int> longest_trip(int N, int D)
{
	if (D == 1) {
		vector<int> ans(N-1);
		iota(ans.begin(), ans.end(), 0);
		return ans;
	}
	else if (D == 2) {

	}
	else {
		// you have two paths and the other points
		// if p1
	}
	return {};
}

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