Submission #1008701

#	Time	Username	Problem	Language	Result	Execution time	Memory
1008701		Abito	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	3099 ms	564 KiB

longesttrip

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

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:12:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   12 |     while (v.size()<n){
      |            ~~~~~~~~^~

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