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;
typedef vector<ll> vii;
typedef pair<ll,ll> pii;
#define pb push_back
#define F first
#define S second
#define all(v) v.begin(),v.end()
const int M=1010;
const ll inf=1e18;
std::vector<int> longest_trip(int N, int D)
{
vector<int>v1,v2;
for(int i=0;i<N;i++){
if(v1.empty()){
v1.pb(i);
continue;
}
if(are_connected({i},{v1.back()})){
v1.pb(i);
continue;
}
if(v2.empty()){
v2.pb(i);
continue;
}
if(are_connected({i},{v2.back()})){
v2.pb(i);
continue;
}
reverse(all(v2));
for(auto it:v2)
v1.pb(it);
v2.clear();
v2.pb(i);
}
if(v1.size()>v2.size())
swap(v1,v2);
return v2;
}
# | 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... |