Submission #840438

#	Time	Username	Problem	Language	Result	Execution time	Memory
840438		ogkostya	가장 긴 여행 (IOI23_longesttrip)	C++17	40 / 100	15 ms	336 KiB

longesttrip

#include "longesttrip.h"

std::vector<int> longest_trip(int N, int D)
{

    std::vector<int> an1 = {};
    std::vector<int> an2 = {};

    an1.push_back(0);

    std::vector<int> temp1 = {};
    std::vector<int> temp2 = {};
    for (int i = 1; i < N; i++)
    {
        temp1.clear();
        temp1.push_back(i);
        temp2.clear();
        temp2.push_back(an1.back());

        if (are_connected(temp1, temp2))
        {
            an1.push_back(i);
        }
        else
        {
            if (an2.size() == 0)
            {
                an2.push_back(i);
            }
            else
            {
                temp2.clear();
                temp2.push_back(an2.back());
                if (are_connected(temp1, temp2))
                {
                    an2.push_back(i);
                }
                else
                {
                    while (an2.size() > 0)
                    {
                        an1.push_back(an2.back());
                        an2.pop_back();
                    }
                    an2.push_back(i);
                }
            }
        }
    }

    if (an2.size() > 0)
    {
        temp1.clear();
        temp1.push_back(an1.back());
        temp2.clear();
        temp2.push_back(an2.back());
        if (are_connected(temp1, temp2))
        {
            while (an2.size() > 0)
            {
                an1.push_back(an2.back());
                an2.pop_back();
            }
        }
        else
        {
            temp1.clear();
            temp1.push_back(an1.front());

            if (are_connected(temp1, temp2))
            {
                int l = an1.size();
                for (int i = 0; i < l; i++)
                {
                    an2.push_back(an1[i]);
                }
                an1 = an2;
            }
            else
            {
                if (an2.size() > an1.size())
                    an1 = an2;
            }
        }
    }

    return an1;
}

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