Submission #941840

#	Time	Username	Problem	Language	Result	Execution time	Memory
941840		benjaminkleyn	가장 긴 여행 (IOI23_longesttrip)	C++17	40 / 100	12 ms	852 KiB

longesttrip

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

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

    if (D == 2)
    {
        vector<int> res;
        int cur;
        if (are_connected({0}, {1}))
            res = {0, 1}, cur = 2;
        else
            res = {0, 2, 1}, cur = 3;

        for (int i = cur; i < N; i++)
        {
            if (!are_connected({res.back()}, {i}))
                reverse(res.begin(), res.end());
            res.push_back(i);
        }

        return res;
    }

    vector<int> A = {0}, B = {1};
    for (int i = 2; i < N; i++)
    {
        if (are_connected({i}, {A.back(), B.back()}))
        {
            if (are_connected({i}, {A.back()}))
                A.push_back(i);
            else
                B.push_back(i);
        }
        else
        {
            reverse(B.begin(), B.end());
            for (int x : B)
                A.push_back(x);
            B = {i};
        }
    }
    if (A.size() > B.size())
        return A;
    return B;
}

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