# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059934 | noyancanturk | Longest Trip (IOI23_longesttrip) | C++17 | 427 ms | 600 KiB |
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;
#define pb push_back
int n,d;
vector<int> longest_trip(int N, int D)
{
n=N,d=D;
if(2<=D){
deque<int>trip;
trip.pb(0);
for(int i=1;i<n;i++){
bool ok=are_connected({trip.back()},{i});
if(ok)trip.pb(i);
else if(trip.size()==1){
trip.pb(i+1);
trip.pb(i);
i++;
}else{
trip.push_front(i);
}
}
return vector<int>(trip.begin(),trip.end());
}
bool vis[n]{};
vis[0]=1;
vector<int>trip;
trip.pb(0);
while(trip.size()<(N+1)/2){
//cerr<<trip.size()<<"\n";
vector<int>myguys;
for(int j=0;j<n;j++){
if(j==trip.back())continue;
bool ok=are_connected({trip.back()},{j});
//cerr<<"trying "<<trip.back()<<" "<<j<<"\n";
if(!ok)myguys.pb(j);
if(myguys.size()==(N+1)/2){
return myguys;
}
if(ok&&!vis[j]){
trip.push_back(j);
vis[j]=1;
break;
}
}
cerr<<myguys.size()<<" my guys\n";
}
return trip;
}
Compilation message (stderr)
# | 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... |