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>
#include "longesttrip.h"
using namespace std;
typedef long long ll;
vector<int> sciezka[2];
void dodaj_wierzcholek(int v){
if (!sciezka[0].size() || are_connected({v},{sciezka[0].back()})){
sciezka[0].push_back(v);
return;
}
if (!sciezka[1].size() || are_connected({v},{sciezka[1].back()})){
sciezka[1].push_back(v);
return;
}
for (int i = (int)sciezka[1].size()-1; i >= 0; i--) sciezka[0].push_back(sciezka[1][i]);
sciezka[1] = {v};
}
vector<int> longest_trip(int N, int D){
sciezka[0].clear();
sciezka[1].clear();
for (int i = 0; i < N; i++) dodaj_wierzcholek(i);
if (sciezka[0].size() < sciezka[1].size()) swap(sciezka[0],sciezka[1]);
return sciezka[0];
}
# | 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... |