Submission #1144748

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144748		AlgorithmWarrior	가장 긴 여행 (IOI23_longesttrip)	C++20	15 / 100	3 ms	404 KiB

longesttrip

#include "longesttrip.h"
#include <cassert>
#include <cstdio>
#include <string>
#include <vector>
#include <deque>

using namespace std;

std::vector<int> longest_trip(int N, int D){
    if(D==3){
        int i;
        vector<int>path;
        for(i=0;i<N;++i)
            path.push_back(i);
        return path;
    }
    else if(D==2){
        int i;
        deque<int>path;
        int vec0;
        if(are_connected({0},{1}))
            vec0=1;
        else
            vec0=2;
        path.push_back(0);
        path.push_back(vec0);
        for(i=1;i<N;++i)
            if(i!=vec0){
                if(are_connected({path.front()},{i}))
                    path.push_front(i);
                else
                    path.push_back(i);
            }
        vector<int>ans;
        for(auto el : path)
            ans.push_back(el);
        return ans;
    }
}

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:40:1: warning: control reaches end of non-void function [-Wreturn-type]
   40 | }
      | ^

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