Submission #839726

#	Time	Username	Problem	Language	Result	Execution time	Memory
839726		model_code	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	15 ms	320 KiB

longesttrip

// correct/sol_birka0_D1_opt2.cpp

#include "longesttrip.h"

#include <random>
#include <algorithm>

using namespace std;

vector<int> longest_trip(int N, int /*D*/)
{
    srand(time(0));
    std::vector<int> ids(N);
    for (int i = 0; i < N; i++)
        ids[i] = i;
    random_shuffle(ids.begin(), ids.end());

    vector<int> t1 = {ids[0]}, t2;
    bool goodtip = false;
    for (int j = 1; j < N; ++j)
    {
        int i = ids[j];
        if (are_connected({t1.back()}, {i}))
        {
            t1.push_back(i);
            goodtip = false;
        }
        else
        {
            if (t2.empty())
            {
                t2 = t1;
                t1 = {i};
                goodtip = true;
            }
            else if (goodtip)
            {
                t2.push_back(i);
            }
            else
            {
                if (are_connected({i}, {t2.back()}))
                {
                    t2.push_back(i);
                    goodtip = true;
                }
                else
                {
                    int x = i;
                    vector<int> nw;
                    while (j + 1 < N && nw.size() < 2)
                    {
                        i = ids[++j];
                        if (are_connected({x}, {i}))
                        {
                            nw.push_back(i);
                        }
                        else
                        {
                            t1.push_back(i);
                        }
                    }
                    t1.insert(t1.end(), t2.rbegin(), t2.rend());
                    if (nw.size() == 2)
                        nw = {nw[0], x, nw[1]};
                    else
                        nw.push_back(x);
                    t2 = nw;
                    goodtip = false;
                }
            }
        }
    }

    if (t2.size() > t1.size())
        swap(t1, t2);
    if (t2.empty() || !are_connected(t1, t2))
    {
        return t1;
    }
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    reverse(t2.begin(), t2.end());
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    reverse(t1.begin(), t1.end());
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    reverse(t2.begin(), t2.end());
    if (are_connected({t1.back()}, {t2[0]}))
    {
        t1.insert(t1.end(), t2.begin(), t2.end());
        return t1;
    }
    int lo = 0, hi = t2.size();
    while (lo + 1 < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected(t1, vector<int>(t2.begin() + mid, t2.begin() + hi)))
        {
            lo = mid;
        }
        else
        {
            hi = mid;
        }
    }
    int x = lo;
    lo = 0, hi = t1.size();
    while (lo + 1 < hi)
    {
        int mid = (lo + hi) / 2;
        if (are_connected({t2[x]}, vector<int>(t1.begin() + mid, t1.begin() + hi)))
        {
            lo = mid;
        }
        else
        {
            hi = mid;
        }
    }
    int y = lo;
    vector<int> t(t1.begin() + y + 1, t1.end());
    t.insert(t.end(), t1.begin(), t1.begin() + y + 1);
    t.insert(t.end(), t2.begin() + x, t2.end());
    t.insert(t.end(), t2.begin(), t2.begin() + x);

    return t;
}

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