Submission #1038935

#	Time	Username	Problem	Language	Result	Execution time	Memory
1038935		ZanP	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	9 ms	420 KiB

longesttrip

#include "longesttrip.h"
#include <iostream>
#include <vector>
using namespace std;

void sub1(vector<int> & ans, int n){
    ans.resize(n);
    for(int i = 0;i<n;i++){ans[i] = i;}
}

void sub2(vector<int> & ans, int n){
    ans.reserve(n);
    ans.push_back(0);
    if(!are_connected({n-2}, {n-1})){ans.push_back(n-1);} 
    for(int i = 0;i<n-1;i++){
        if(are_connected({i}, {i+1})){
            ans.push_back(i+1);
        }else{
            if(i == n-2){break;}
            ans.push_back(i+2);
            ans.push_back(i+1);
            if(i != n-3)ans.push_back(i+3);
            i+=2;
        }
    }
}

vector<int> longest_trip(int n, int d){
    vector<int> ans; 
    if(d == 3){
        sub1(ans, n);
        return ans;
    }
    if(d == 2){
        sub2(ans,n);
        return ans;
    }
    return {0, 4, 5 ,2};
}

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