Submission #1357863

#TimeUsernameProblemLanguageResultExecution timeMemory
1357863maya_sLongest Trip (IOI23_longesttrip)C++20
15 / 100
3 ms412 KiB
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
typedef int ll;

vector<int> longest_trip(int n, int d)
{
    vector<ll> ans;
    queue<ll> q;
    for(ll i = 1; i < n; i++) q.push(i);
    ll node = 0;
    deque<ll> dq; dq.push_back(0);
    while(q.size()){
        ll x = q.front(); q.pop();
        if(are_connected({node}, {x})) {
            dq.push_back(x); node = x;
        }
        else if(q.size()){
            ll y = q.front(); q.pop();
            dq.push_back(y); dq.push_back(x); node = x;
        }
        else dq.push_front(x);
    }
    while(dq.size()) ans.push_back(dq.front()), dq.pop_front();
    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...