Submission #928420

#TimeUsernameProblemLanguageResultExecution timeMemory
928420n1kLongest Trip (IOI23_longesttrip)C++17
15 / 100
9 ms608 KiB
#include "longesttrip.h" #include <bits/stdc++.h> using namespace std; /* OBSERVE: path meargen hinten und vorne dazu * - * * * - * */ std::vector<int> longest_trip(int N, int D){ // vorraussetzung path[0].end nicht mit path[1].end verbunden vector<int> path[2]; path[0].push_back(0); for(int i=1; i<N; i++){ if(are_connected({*path[0].rbegin()}, {i})){ path[0].push_back(i); if(path[1].size() and are_connected({path[0][path[0].size()-1]}, {path[1][path[1].size()-1]})){ reverse(path[1].begin(), path[1].end()); path[0].insert(path[0].end(), path[1].begin(), path[1].end()); path[1].clear(); } }else{ path[1].push_back(i); } } if(path[1].empty() or not are_connected(path[0], path[1])){ if(path[0].size() > path[1].size()) return path[0]; return path[1]; } if(are_connected({path[0][0]}, {path[1][0]})){ reverse(path[0].begin(), path[0].end()); path[0].insert(path[0].end(), path[1].begin(), path[1].end()); return path[0]; } if(are_connected({path[0][0]}, {path[1][path[1].size()-1]})){ path[1].insert(path[1].end(), path[0].begin(), path[0].end()); return path[1]; } if(are_connected({path[0][path[0].size()-1]}, {path[1][0]})){ path[0].insert(path[0].end(), path[1].begin(), path[1].end()); return path[0]; } // jetzt wissen wir das path[0].begin - path[0].end // jetzt wissen wir das path[1].begin - path[1].end // und die pfade sind nicht disjoint }

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:66:1: warning: control reaches end of non-void function [-Wreturn-type]
   66 | }
      | ^
#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...