Submission #1232804

#TimeUsernameProblemLanguageResultExecution timeMemory
1232804m5588ohammedLongest Trip (IOI23_longesttrip)C++20
15 / 100
3 ms428 KiB
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> longest_trip(int N, int D)
{
    set <int> num;
    deque <int> curr;
    vector <int> ans;
    for(int i=0;i<N;i++) num.insert(i);
    num.erase(0);
    curr.push_back(0);
    if(are_connected({0},{1})==1){
        num.erase(1);
        curr.push_back(1);
    }
    else{
        num.erase(2);
        curr.push_back(2);    
    }
    for(int i:num){
        if(are_connected({curr.back()},{i})==1) curr.push_back(i);
        else curr.push_front(i);   
    }
    for(int i:curr) ans.push_back(i);
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...