Submission #900524

#	Time	Username	Problem	Language	Result	Execution time	Memory
900524		abcvuitunggio	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	8 ms	608 KiB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> longest_trip(int N, int D){
    if (D>1){
        deque <int> q={0};
        if (!are_connected({0},{1}))
            q.push_back(2);
        q.push_back(1);
        for (int i=q.size();i<N;i++)
            if (are_connected({i},{q.front()}))
                q.push_front(i);
            else
                q.push_back(i);
        vector <int> res;
        for (int i:q)
            res.push_back(i);
        return res;
    }
    vector <int> a,b;
    a.push_back(0);
    b.push_back(1);
    for (int i=2;i<N;i++){
        if (are_connected({a.back()},{i})){
            a.push_back(i);
            continue;
        }
        if (are_connected({b.back()},{i})){
            b.push_back(i);
            continue;
        }
        reverse(b.begin(),b.end());
        for (int i:b)
            a.push_back(i);
        b={i};
    }
    if (a.size()<b.size())
        swap(a,b);
    if (a.size()==2){
        for (int i=0;i<b.size();i++)
            if (are_connected({a[0]},{b[i]})){
                reverse(a.begin(),a.end());
                a.push_back(b[i]);
                if (i)
                    a.push_back(b[0]);
                return a;
            }
            else if (are_connected({a[1]},{b[i]})){
                a.push_back(b[i]);
                if (i)
                    a.push_back(b[0]);
                return a;
            }
        return a;
    }
    if (are_connected({a[0]},{b[0]}))
        reverse(a.begin(),a.end());
    for (int i:b)
        a.push_back(i);
    return a;
}

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:40:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |         for (int i=0;i<b.size();i++)
      |                      ~^~~~~~~~~

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