Submission #1075196

#	Time	Username	Problem	Language	Result	Execution time	Memory
1075196		Maite_Morale	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	8 ms	452 KiB

longesttrip

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define vi vector<int>
#define vll vector<ll>
#define pll pair<ll,ll>
#define vpll vector<pll>
#define MAX 500005
#define F first
#define S second 

std::vector<int> longest_trip(int N, int D);

bool are_connected(std::vector<int> A, std::vector<int> B);

ll pass[MAX];
std::vector<int> longest_trip(int N, int D)
{
    if(D==3){
        std::vector<int> r={};
        for(int i=0;i<N;i++)r.push_back(i);
        return r;
    }
    vi r={0};
    if(are_connected({0},{1})==0)r.push_back(2);
    r.push_back(1);vi fron={};
    for(int i=r.size();i<N;i++){
        if(are_connected({r.back()},{i})==0)fron.push_back(i);
        else                                    r.push_back(i);
    }
    reverse(fron.begin(),fron.end());
    for(auto u : r)fron.push_back(u);
    return fron;
}

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 0 / 25
• Subtask 4: 0 / 60