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 "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int N, int D){
vector<int> r(N);
int j=0;
r[0]=0;
for(int i=1;i<N;i++){
vector<int>e1,e2;
e1.push_back(r[j]);
e2.push_back(i);
if(are_connected(e1,e2))j++,r[j]=i;
else if(i==N-1){
for(int k=N-1;0<k;k--)r[k]=r[k-1];
r[0]=i;
}
else j++,r[j]=i+1,j++,r[j]=i,i++;
}
return r;
}
# | 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... |