Submission #1238466

#	Time	Username	Problem	Language	Result	Execution time	Memory
1238466		CyberCow	가장 긴 여행 (IOI23_longesttrip)	C++20	0 / 100	170 ms	408 KiB

longesttrip

#include "longesttrip.h"
#include <vector>
#include <deque>
#include <algorithm>
using namespace std;

const int n = 250;
int st[n][n];

bool xD(const vector<int> &a, const vector<int> &b)
{
	return a.size() > b.size();
}

vector<int> longest_trip(int N, int D)
{
	vector<int> ans;
	for (int i = 0; i < N; i++)
	{
		for (int j = i + 1; j < N; j++)
		{
			if (are_connected({ i }, { j }))
			{
				st[i][j] = 1;
				st[j][i] = 1;
			}
		}
	}
	vector<int> a = { 0 }, b = {1};
	for (int i = 2; i < N; i++)
	{
		if (st[a.back()][i])
		{
			a.push_back(i);
		}
		else if (st[b.back()][i])
		{
			b.push_back(i);
		}
		else
		{
			for (int j = b.size() - 1; j >= 0; j--)
			{
				a.push_back(b[j]);
			}
			b.clear();
			b.push_back(i);
		}
	}
	vector<vector<int>> qaq;
	if (a.size() < b.size())swap(a, b);
	qaq.push_back(a);
	qaq.push_back(b);
	int arec = 1;
	while (arec)
	{
		arec = 0;
		for (int i = 1; i < qaq.size(); i++)
		{
			for (int x = 0; x < qaq[0].size(); x++)
			{
				int kanckacnem = 0;
				for (int y = 0; i < qaq.size() && y < qaq[i].size(); y++)
				{
					int a1 = x + 1, a2 = qaq[0].size() - x;
					int b1 = y + 1, b2 = qaq[i].size() - y;
					int maxerk = max(max(a1 + b1, a1 + b2), max(a2 + b1, a2 + b2));
					kanckacnem = max(kanckacnem, maxerk);
				}
				if (kanckacnem > qaq[0].size())
				{
					for (int y = 0; i < qaq.size() && y < qaq[i].size(); y++)
					{
						if (st[qaq[0][x]][qaq[i][y]] != 1)continue;
						int a1 = x + 1, a2 = qaq[0].size() - x;
						int b1 = y + 1, b2 = qaq[i].size() - y;
						int maxerk = max(max(a1 + b1, a1 + b2), max(a2 + b1, a2 + b2));
						if (maxerk == kanckacnem)
						{
							vector<int>mnacord1, mnacord2;
							//arec = 1;
							if (a1 + b1 == maxerk)
							{
								while (qaq[0].size() > a1)
								{
									//mnacord1.push_back(qaq[0].back());
									qaq[0].pop_back();
								}
								while (qaq[i].size() > b1)
								{
									//mnacord2.push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								while (!qaq[i].empty())
								{
									qaq[0].push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								qaq.push_back(mnacord1);
								qaq.push_back(mnacord2);
							}
							else if (a1 + b2 == maxerk)
							{
								while (qaq[0].size() > a1)
								{
									//mnacord1.push_back(qaq[0].back());
									qaq[0].pop_back();
								}
								reverse(qaq[i].begin(), qaq[i].end());
								while (qaq[i].size() > b2)
								{
									//mnacord2.push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								while (!qaq[i].empty())
								{
									qaq[0].push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								qaq.push_back(mnacord1);
								qaq.push_back(mnacord2);
							}
							else if (a2 + b1 == maxerk)
							{
								reverse(qaq[0].begin(), qaq[0].end());
								while (qaq[0].size() > a2)
								{
									//mnacord1.push_back(qaq[0].back());
									qaq[0].pop_back();
								}
								while (qaq[i].size() > b1)
								{
									//mnacord2.push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								while (!qaq[i].empty())
								{
									qaq[0].push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								qaq.push_back(mnacord1);
								qaq.push_back(mnacord2);
							}
							else
							{
								reverse(qaq[0].begin(), qaq[0].end());
								while (qaq[0].size() > a2)
								{
									//mnacord1.push_back(qaq[0].back());
									qaq[0].pop_back();
								}
								reverse(qaq[i].begin(), qaq[i].end());
								while (qaq[i].size() > b2)
								{
									//mnacord2.push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								while (!qaq[i].empty())
								{
									qaq[0].push_back(qaq[i].back());
									qaq[i].pop_back();
								}
								qaq.push_back(mnacord1);
								qaq.push_back(mnacord2);
							}
							sort(qaq.begin(), qaq.end(), xD);
							while (qaq.back().empty())
							{
								qaq.pop_back();
							}
						}
					}
				}
			}
		}
		sort(qaq.begin(), qaq.end(), xD);
		while (qaq.back().empty())
		{
			qaq.pop_back();
		}
	}
	return qaq[0];
}

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