#include "longesttrip.h" #include <bits/stdc++.h> using namespace std; std::vector<int> longest_trip(int N, int D) { vector<vector<int>> g(N); for (int i=0;i<N;i++) { for (int j=i+1;j<N;j++) { if (are_connected({i}, {j})) { g[i].push_back(j); g[j].push_back(i); } } } int tries = 100; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); vector<int> lng; for (int i=0;i<tries;i++) { vector<int> tmp; vector<bool> vis(N, false); function<void(int)> dfs=[&](int node) { vis[node] = true; tmp.push_back(node); vector<int> suf; for (int i=0;i<g[node].size();i++)suf.push_back(i); shuffle(suf.begin(), suf.end(), rng); for (int x:suf) { if (!vis[x]) { dfs(x); break; } } }; dfs(uniform_int_distribution<int>(0, N-1)(rng)); if (lng.size() < tmp.size()) { lng = tmp; } } return lng; }

longesttrip.cpp: In lambda function:
longesttrip.cpp:28:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |             for (int i=0;i<g[node].size();i++)suf.push_back(i);
      |                          ~^~~~~~~~~~~~~~~