Submission #1071916

#	Time	Username	Problem	Language	Result	Execution time	Memory
1071916		Muhammad_Aneeq	가장 긴 여행 (IOI23_longesttrip)	C++17	5 / 100	6 ms	344 KiB

longesttrip

#include <vector>
using namespace std;
bool are_connected(vector<int> A, vector<int> B);
vector<int> sol1(int N)
{
	int a=0,b=1;
	vector<int>ans,ans1;
	ans.push_back(a);
	while (b<N&&are_connected({a},{b}))
	{
		ans.push_back(b);
		b++;
	}
	if (b<N)
		ans1.push_back(b);
	for (int i=b+1;i<N;i++)
	{
		if (are_connected({a},{i}))
			ans.push_back(i);
		else
			ans1.push_back(i);
	}
	return (ans.size()>ans1.size()?ans:ans1);
}
vector<int> sol2(int N)
{
	return {};
}
vector<int> sol3(int N)
{
	vector<int>ans;
	for (int i=0;i<N;i++)
		ans.push_back(i);
	return ans;
}
vector<int> longest_trip(int N, int D)
{
	if (D==1)
		return sol1(N);
	if (D==2)
		return sol2(N);
	return sol3(N);
}

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