Submission #1081073

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081073		Kipras	Longest Trip (IOI23_longesttrip)	C++17	5 / 100	2 ms	344 KiB

longesttrip

#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

bool are_connected(vector<int> a, vector<int> b);

vector<int> longest_trip(int N, int D)
{
    if(D==3) {
        vector<int> a;
        for(int i = 0; i < N; i++)a.push_back(i);
        return a;
    }else if(D==2) {
        deque<int> q;
        if(!are_connected({0}, {1})) {
            q.push_back(0);
            q.push_back(2);
            q.push_back(1);
        }
        else if(!are_connected({0}, {2})) {
            q.push_back(0);
            q.push_back(1);
            q.push_back(2);
        }
        else if(!are_connected({1}, {2})) {
            q.push_back(1);
            q.push_back(0);
            q.push_back(2);
        }

        for(int i = 3; i < N; i++) {
            if(are_connected({q.front()}, {i}))
                q.push_front(i);
            else
                q.push_back(i);
        }

        vector<int> a;
        for(int i = 0; i < N; i++) {
            a.push_back(q.front());
            q.pop_front();
        }
        return a;

    }
}

Compilation message (stderr)

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

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