Submission #1016417

#	Time	Username	Problem	Language	Result	Execution time	Memory
1016417		pavement	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	9 ms	552 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

vector<int> longest_trip(int N, int D) {
	vector<int> ret;
	if (D == 3) {
		ret.resize(N);
		iota(ret.begin(), ret.end(), 0);
		return ret;
	} else if (D == 2) {
		deque<int> dq;
		int st = -1;
		dq.pb(0);
		if (are_connected({0}, {1})) {
			dq.pb(1);
			st = 2;
		} else {
			dq.pb(2);
			dq.pb(1);
			st = 3;
		}
		for (int i = st; i < N; i++) {
			if (are_connected({i}, {dq.back()})) {
				dq.pb(i);
			} else {
				dq.push_front(i);
			}
		}
		ret = vector<int>(dq.begin(), dq.end());
		return ret;
	} else {
		
	}
}

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:37:1: warning: control reaches end of non-void function [-Wreturn-type]
   37 | }
      | ^

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