Submission #1187763

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187763		MatteoArcari	Longest Trip (IOI23_longesttrip)	C++20	0 / 100	3 ms	408 KiB

longesttrip

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

bool are_connected(vector<int> A, vector<int> B);

vector<int> connect(vector<int> a, vector<int> b) {
    reverse(a.begin(), a.end());
    for (auto x: b) a.push_back(x);
    return a;
}

vector<int> longest_trip(int n, int d) {
    vector<int> pathA = {0}, pathB = {1};

    for (int i = 2; i < n; i++) {
        if (are_connected({pathA[0]}, {i})) {
            pathA.push_back(i);
        } else if (are_connected({pathB[0]}, {i})) {
            pathB.push_back(i);
        } else {
            pathA = connect(pathA, pathB);
            pathB = {i};
        }
    }


    if (pathA.size() > pathB.size()) return pathA;
    return pathB;
}

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