제출 #839720

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
839720		model_code	가장 긴 여행 (IOI23_longesttrip)	C++17	30 / 100	17 ms	268 KiB

longesttrip

// correct/solution-st3-2N.cpp

#include "longesttrip.h"
#include <algorithm>
#include <random>
#include <deque>

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());

    std::deque<int> line1;
    line1.clear();
    std::deque<int> line2;
    line2.clear();

    line1.push_back(ids[0]);

    for (int i = 1; i < N; i++)
    {
        if (are_connected({line1.back()}, {ids[i]}))
        {
            line1.push_back(ids[i]);
        }
        else if (!line2.empty() && are_connected({line2.back()}, {ids[i]}))
        {
            line2.push_back(ids[i]);
        }
        else
        {
            while (!line2.empty())
            {
                line1.push_back(line2.back());
                line2.pop_back();
            }
            line2.push_back(ids[i]);
        }
    }

    if (line1.size() < line2.size())
        swap(line1, line2);

    std::vector<int> ans;
    ans.clear();
    for (int i : line1)
        ans.push_back(i);
    return ans;
}

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