Submission #1009080

#	Time	Username	Problem	Language	Result	Execution time	Memory
1009080		Abito	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	1034 ms	596 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
#define pb push_back
#define elif else if
using namespace std;
std::vector<int> longest_trip(int n, int D)
{
    vector<int> ans;
    vector<bool> vis(n);
    bool adj[n][n];
    for (int i=0;i<n;i++){
        for (int j=i+1;j<n;j++){
            vector<int> x,y;
            x.pb(i);y.pb(j);
            adj[i][j]=adj[j][i]=are_connected(x,y);
        }
    }
    for (int i=0;i<n;i++){
        vector<int> v;
        for (int j=0;j<n;j++) vis[j]=0;
        v.pb(i);vis[i]=1;
        while (true){
            int L=-1,R=-1;
            for (int j=0;j<n;j++){
                if (vis[j]) continue;
                if (adj[v.back()][j]) R=j;
                if (adj[v[0]][j]) L=j;
            }
            if (R>-1) v.pb(R),vis[R]=1;
            elif(L>-1){
                reverse(v.begin(),v.end());
                v.pb(L);
                vis[L]=1;
            }
            else break;
        }
        if (v.size()>ans.size()) ans=v;
    }
    return ans;
}

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