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"
// bool are_connected(vector<int>a,vector<int>b){
// return 0;
// }
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);
set<int>st;
for(int i = 1; i < n; i++) st.insert(i);
for(int i = 1; i < n; i++){
vector<int>one;one.push_back(v);
for(int u : st){
vector<int>two; two.push_back(u);
bool ok = are_connected(one,two);
if(ok){
v = u;
break;
}
}
ans.push_back(v);
st.erase(v);
}
}
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... |