Submission #1285194

#	Time	Username	Problem	Language	Result	Execution time	Memory
1285194		MMihalev	Longest Trip (IOI23_longesttrip)	C++20	15 / 100	5 ms	408 KiB

longesttrip

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include "longesttrip.h"
using namespace std;
deque<int>ans;
int n;

bool edge(int u,int v)
{
    return are_connected({u},{v});
}
std::vector<int> longest_trip(int N, int D)
{
    n=N;
    ans.clear();
    ///reset eveerything

    if(edge(0,1))
    {
        if(edge(1,2))
        {
            ans.push_back(0);ans.push_back(1);ans.push_back(2);
        }
        else
        {
            ans.push_back(1);ans.push_back(0);ans.push_back(2);
        }
    }
    else
    {
        ans.push_back(0);ans.push_back(2);ans.push_back(1);
    }

    for(int i=3;i<n;i++)
    {
        if(edge(ans.back(),i))ans.push_back(i);
        else ans.push_front(i);
    }

    vector<int>an;
    an.resize(n);
    for(int i=0;i<n;i++)an[i]=ans[i];
    return an;
}

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