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;
typedef long long ll;
std::vector<int> longest_trip(int N, int D)
{
vector<int> a, b;
a.push_back(0);
b.push_back(1);
for(int i=2; i<N; i++) {
if(are_connected({i},{a.back()})) {
a.push_back(i);
}
else if(are_connected({i},{b.back()})) {
b.push_back(i);
}
else {
for(ll j=b.size()-1; j>=0; j--) {
a.push_back(b[i]);
}
b.clear();
}
}
if(a.size()>b.size()) return a;
else return b;
}
# | 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... |