Submission #853201

#TimeUsernameProblemLanguageResultExecution timeMemory
853201LudisseyLongest Trip (IOI23_longesttrip)C++17
5 / 100
769 ms596 KiB
#include <bits/stdc++.h> #include "longesttrip.h" using namespace std; std::vector<int> longest_trip(int n, int d) { vector<pair<int,int>> disc; for (int i = 0; i < n-1; i++) { for (int j = i+1; j < n; j++) { if(!are_connected({i}, {j})){ disc.push_back({i,j}); break; } } } vector<bool> rem(n); vector<int> path(disc.size()*2); int mid=disc.size(); for (int i = 0; i < (int)disc.size(); i++) { path[i]=disc[i].first; path[i+mid]=disc[i].second; rem[disc[i].first]=true; rem[disc[i].second]=true; } for (int i = 0; i < n; i++) { if(!rem[i]) path.push_back(i); } return path; }
#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...