This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#include "longesttrip.h"
vector<int> longest_trip(int n, int k)
{
vector<int>ans;
if(k == 3) for(int i = 0; i < n; i++) ans.push_back(i);
else if(k == 2){
int v = 0; ans.push_back(0);
vector<bool>vis(n,0); vis[0] = 1;
for(int i = 1; i < n; i++){
for(int j = 0; j < n; j++){
if(vis[j]) continue;
vector<int>tmp;tmp.push_back(v);
vector<int>tmp2;tmp2.push_back(j);
bool ok = are_connected(tmp,tmp2);
if(ok){v = j;ans.push_back(j);vis[j]=1;}
}
}
}
return {ans};
}
// int main(){
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |