Submission #1170723

#	Time	Username	Problem	Language	Result	Execution time	Memory
1170723		anmattroi	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	3 ms	416 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

vector<int> longest_trip(int N, int D) {
    if (D == 3) {
        vector<int> ans(N);
        iota(ans.begin(), ans.end(), 0);
        return ans;
    }
    if (D == 2) {
        deque<int> ans;

        vector<int> cl(N, 0);

        if (are_connected({0}, {1})) {
            cl[0] = cl[1] = 1;
            ans.push_front(0); ans.push_back(1);
        } else {
            cl[0] = cl[2] = 1;
            ans.push_front(0); ans.push_back(2);
        }

        while (ans.size() < N) {
            for (int i = 0; i < N; i++)
            if (!cl[i]) {
                if (are_connected({ans.front()}, {i})) ans.push_front(i);
                else ans.push_back(i);
                cl[i] = 1;
                break;
            }
        }

        return vector<int>(ans.begin(), ans.end());
    }
}

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