Submission #1069767

#TimeUsernameProblemLanguageResultExecution timeMemory
1069767UmairAhmadMirzaLongest Trip (IOI23_longesttrip)C++17
0 / 100
857 ms596 KiB
#include <bits/stdc++.h> using namespace std; bool are_connected(vector<int> A, vector<int> B); int const MAXN=260; bool con[MAXN][MAXN]; vector<int> path,longest; bool vis[MAXN]; int nn; void dfs(int node){ path.push_back(node); if(path.size()>longest.size()) longest=path; vis[node]=1; for(int i=0;i<nn;i++) if(vis[i]==0 && con[node][i]) dfs(i); path.pop_back(); } vector<int> longest_trip(int n, int D){ longest.clear(); nn=n; vector<int> a,b; for(int i=0;i<n;i++){ a.push_back(i); for(int j=i+1;j<n;j++){ b.push_back(j); con[i][j]=are_connected(a,b); con[j][i]=are_connected(a,b); b.pop_back(); } a.pop_back(); } if(D>1){ path.clear(); for (int i = 0; i < n; ++i) path.push_back(i); bool bl=0; for(int i=0;i<n-1;i++) if(con[path[i]][path[i+1]]==0){ if(i==n-2) rotate(path.rbegin(), path.rbegin() + 1, path.rend()); else swap(path[i+1],path[i+2]); } return path; } for (int i = 0; i < n; ++i) { path.clear(); for(int j=0;j<n;j++) vis[j]=0; dfs(i); } return longest; }

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:39:8: warning: unused variable 'bl' [-Wunused-variable]
   39 |   bool bl=0;
      |        ^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...