Submission #1011466

#	Time	Username	Problem	Language	Result	Execution time	Memory
1011466		mdn2002	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	9 ms	344 KiB

longesttrip

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


vector<int> longest_trip(int N, int D) {
    vector<int> a, b;
    a.push_back(0);

    for (int i = 1; i < N; i ++) {
        int x = a.back(), y = are_connected({x}, {i});
        if (y) {
            a.push_back(i);
            continue;
        }
        if (b.size() == 0) b.push_back(i);

        else {
            int z = b.back(), k = are_connected({z}, {i});
            if (k) b.push_back(i);
            else {
                for (int j = b.size() - 1; j >= 0; j --) a.push_back(b[j]);
                b.clear();
                b.push_back(i);
            }
        }
    }

    if (b.size() == 0) return a;
    if (are_connected(a, b) == 0){
        if (a.size() > b.size()) return a;
        return b;
    }

    int l = 0, r = a.size(), mid;
    while (l < r) {
        mid = (l + r) / 2;
        vector<int> temp;
        for (int i = 0; i <= mid; i ++) temp.push_back(a[i]);
        if (are_connected(temp, b)) r = mid;
        else l = mid + 1;
    }
    vector<int> ans;
    for (int i = l - 1; i >= 0; i --) ans.push_back(a[i]);
    for (int i = a.size() - 1; i >= l; i --) ans.push_back(a[i]);

    int x = a[l];

    l = 0, r = b.size();
    while (l < r) {
        mid = (l + r) / 2;
        vector<int> temp;
        for (int i = 0; i <= mid; i ++) temp.push_back(b[i]);
        if (are_connected({x}, temp)) r = mid;
        else l = mid + 1;
    }

    for (int i = l; i >= 0; i --) ans.push_back(b[i]);
    for (int i = a.size() - 1; i > l; i --) ans.push_back(b[i]);

    return ans;
}

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