Submission #1077249

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1077249	2024-08-27T04:04:44 Z	emptypringlescan	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	11 ms	712 KB

longesttrip

#include <bits/stdc++.h>
using namespace std;
#include "longesttrip.h"
vector<int> longest_trip(int n, int d){
	assert(d>0);
	vector<vector<int> > chains;
	for(int i=0; i<n; i++) chains.push_back({i});
	mt19937 rng(999);
	shuffle(chains.begin(),chains.end(),rng);
	while((int)chains.size()>2){
		vector<int> take[3];
		for(int i=0; i<3; i++){
			swap(take[i],chains[(int)chains.size()-i-1]);
		}
		chains.pop_back();
		if(are_connected({take[0][0]},{take[2][0]})) swap(take[1],take[2]);
		else if(are_connected({take[1][0]},{take[2][0]})) swap(take[0],take[2]);
		reverse(take[0].begin(),take[0].end());
		for(int i:take[1]) take[0].push_back(i);
		take[1].clear();
		swap(chains[(int)chains.size()-1],take[0]);
		swap(chains[(int)chains.size()-2],take[2]);
	}
	assert((int)chains.size()==2);
	if(are_connected(chains[0],chains[1])){
		int lo=0,hi=chains[1].size()-1,mid;
		vector<int> hehe;
		while(lo<hi){
			hehe.clear();
			mid=(lo+hi)/2;
			for(int i=lo; i<=mid; i++) hehe.push_back(chains[1][i]);
			if(are_connected(chains[0],hehe)) hi=mid;
			else lo=mid+1;
		}
		int m2=chains[1][lo];
		lo=0,hi=chains[0].size()-1;
		while(lo<hi){
			hehe.clear();
			mid=(lo+hi)/2;
			for(int i=lo; i<=mid; i++) hehe.push_back(chains[0][i]);
			if(are_connected({m2},hehe)) hi=mid;
			else lo=mid+1;
		}
		int m1=chains[0][lo];
		if(m2!=chains[1][0]&&m2!=chains[1].back()){
			if(are_connected({m1},{chains[1].back()})){
				reverse(chains[1].begin(),chains[1].end());
			}
			else if(are_connected({chains[1][0]},{chains[1].back()})){
				hehe.clear();
				while(!chains[1].empty()){
					if(chains[1].back()==m2) break;
					hehe.push_back(chains[1].back());
					chains[1].pop_back();
				}
				reverse(chains[1].begin(),chains[1].end());
				for(int i:hehe) chains[1].push_back(i);
			}
		}
		else if(m2==chains[1].back()) reverse(chains[1].begin(),chains[1].end());
		if(m1==chains[0].back()){
			for(int i:chains[1]) chains[0].push_back(i);
			return chains[0];
		}
		else if(m1==chains[0][0]){
			reverse(chains[0].begin(),chains[0].end());
			for(int i:chains[1]) chains[0].push_back(i);
			return chains[0];
		}
		else{
			if(are_connected({chains[0][0]},{chains[1].back()})){
				for(int i:chains[0]) chains[1].push_back(i);
				return chains[1];
			}
			else if(are_connected({chains[0].back()},{chains[1].back()})){
				reverse(chains[1].begin(),chains[1].end());
				for(int i:chains[1]) chains[0].push_back(i);
				return chains[0];
			}
			else{
				hehe.clear();
				while(!chains[0].empty()){
					if(chains[0].back()==m2) break;
					hehe.push_back(chains[0].back());
					chains[0].pop_back();
				}
				vector<int> ans;
				while(!hehe.empty()){
					ans.push_back(hehe.back());
					hehe.pop_back();
				}
				for(int i:chains[0]) ans.push_back(i);
				for(int i:chains[1]) ans.push_back(i);
				return ans;
			}
		}
	}
	else{
		if(chains[0].size()>chains[1].size()) return chains[0];
		else return chains[1];
	}
}

Subtask #0

0.0 / 0.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	2 ms	344 KB	Output is correct

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	11 ms	344 KB	Output is correct
2	Correct	11 ms	344 KB	Output is correct
3	Correct	9 ms	344 KB	Output is correct
4	Correct	6 ms	600 KB	Output is correct
5	Correct	8 ms	344 KB	Output is correct

Subtask #2

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	9 ms	344 KB	Output is correct
2	Correct	9 ms	344 KB	Output is correct
3	Correct	7 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	6 ms	460 KB	Output is correct
6	Correct	8 ms	344 KB	Output is correct
7	Correct	8 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	5 ms	344 KB	Output is correct
10	Correct	5 ms	344 KB	Output is correct
11	Correct	5 ms	344 KB	Output is correct
12	Correct	8 ms	600 KB	Output is correct
13	Correct	8 ms	712 KB	Output is correct

Subtask #3

0.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	6 ms	344 KB	Output is correct
2	Correct	7 ms	344 KB	Output is correct
3	Correct	6 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	7 ms	344 KB	Output is correct
6	Correct	7 ms	344 KB	Output is correct
7	Correct	10 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	6 ms	600 KB	Output is correct
10	Correct	9 ms	600 KB	Output is correct
11	Correct	7 ms	344 KB	Output is correct
12	Correct	8 ms	452 KB	Output is correct
13	Correct	5 ms	344 KB	Output is correct
14	Correct	7 ms	344 KB	Output is correct
15	Correct	11 ms	344 KB	Output is correct
16	Incorrect	1 ms	344 KB	Incorrect
17	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	7 ms	344 KB	Output is correct
2	Correct	8 ms	344 KB	Output is correct
3	Correct	7 ms	344 KB	Output is correct
4	Correct	6 ms	344 KB	Output is correct
5	Correct	5 ms	344 KB	Output is correct
6	Correct	8 ms	344 KB	Output is correct
7	Correct	9 ms	344 KB	Output is correct
8	Correct	6 ms	344 KB	Output is correct
9	Correct	6 ms	344 KB	Output is correct
10	Correct	5 ms	424 KB	Output is correct
11	Correct	6 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	7 ms	468 KB	Output is correct
14	Correct	9 ms	344 KB	Output is correct
15	Correct	8 ms	344 KB	Output is correct
16	Incorrect	1 ms	344 KB	Incorrect
17	Halted	0 ms	0 KB	-