Submission #839737

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

longesttrip

// incorrect/solution-wa-2waysLineSearch.cpp

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

std::vector<int> longest_trip(int N, int /*D*/)
{
    std::set<int> nodes;
    nodes.clear();
    std::vector<int> ans;
    ans.clear();
    srand(time(0));
    for (int i = 1; i < N; i++)
        nodes.insert(i);
    int last = 0;
    ans.push_back(0);

    bool flipped = false;
    while (!nodes.empty())
    {
        bool found = false;
        for (int i : nodes)
        {
            if (are_connected({last}, {i}))
            {
                last = i;
                nodes.erase(i);
                ans.push_back(last);
                found = true;
                flipped = false;
                break;
            }
        }
        if (!found)
        {
            if (flipped)
                break;
            flipped = true;
            std::reverse(ans.begin(), ans.end());
            auto it = ans.end();
            it--;
            last = (*it);
        }
    }

    return ans;
}

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