Submission #1233678

#TimeUsernameProblemLanguageResultExecution timeMemory
1233678nikulidLongest Trip (IOI23_longesttrip)C++20
5 / 100
3 ms404 KiB
#include "longesttrip.h"
#include <stack>

using namespace std;

#define pb push_back

vector<int> longest_trip(int n, int d){
	vector<int> ans;
	if(d==3){
		for(int i=0; i<n; i++){
			ans.pb(i);
		}
	} else if(d==2){
		// surely there still exists a round trip...
		// why is this screaming linked list :(
		stack<int> cur;
		for(int i=0; i<n-1; i++){
			cur.push(i);
			if(!are_connected({i}, {i+1})){
				while(!cur.empty()){
					ans.pb(cur.top());
					cur.pop();
				}
			}
		} cur.push(n-1);
		while(!cur.empty()){
			ans.pb(cur.top());
			cur.pop();
		}
	}
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...