Submission #1081807

#	Time	Username	Problem	Language	Result	Execution time	Memory
1081807		ArthuroWich	Longest Trip (IOI23_longesttrip)	C++17	70 / 100	22 ms	852 KiB

longesttrip

#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int n, int d) {
    vector<int> a, b, ans;
    a = {0};
    b = {1};
    for (int i = 2; i < n; i++) {
        if (are_connected({a.back(), b.back()}, {i})) {
            if (are_connected({a.back()}, {i})) {
                a.push_back(i);
            } else {
                b.push_back(i);
            }
        } else {
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            b = {i};
        }
    }
    if (are_connected(a, b)) {
        if (are_connected({a.front()}, {b.front()})) {
            reverse(a.begin(), a.end());
            for (int j = 0; j < b.size(); j++) {
                a.push_back(b[j]);
            }
            reverse(a.begin(), a.end());
            b.clear();
        } else if (are_connected({a.back()}, {b.front()})) {
            for (int j = 0; j < b.size(); j++) {
                a.push_back(b[j]);
            }
            b.clear();
        } else if (are_connected({a.front()}, {b.back()})) {
            reverse(a.begin(), a.end());
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            reverse(a.begin(), a.end());
            b.clear();
        } else if (are_connected({a.back()}, {b.back()})) {
            for (int j = b.size()-1; j >= 0; j--) {
                a.push_back(b[j]);
            }
            b.clear();
        } else {
            // both become cycles that are connected via some edge?
            int e1, e2;
            for (int i : a) {
                if (are_connected({i}, b)) {
                    e1 = i;
                    break;
                }
            }
            for (int i : b) {
                if (are_connected({e1}, {i})) {
                    e2 = i;
                }
            }
            vector<int> ans;
            for (int i = find(a.begin(), a.end(), e1) - a.begin()+1; i < a.size(); i++) {
                ans.push_back(a[i]);
            }
            for (int i = 0; i <= find(a.begin(), a.end(), e1) - a.begin(); i++) {
                ans.push_back(a[i]);
            }
            for (int i = find(b.begin(), b.end(), e2) - b.begin(); i < b.size(); i++) {
                ans.push_back(b[i]);
            }
            for (int i = 0; i < find(b.begin(), b.end(), e2) - b.begin(); i++) {
                ans.push_back(b[i]);
            }
            a = ans;
            b.clear();
        }
    }
    if (a.size() >= b.size()) {
        ans = a;
    } else {
        ans = b;
    }
    return ans;
}

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:25:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~
longesttrip.cpp:31:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |             for (int j = 0; j < b.size(); j++) {
      |                             ~~^~~~~~~~~~
longesttrip.cpp:62:72: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |             for (int i = find(a.begin(), a.end(), e1) - a.begin()+1; i < a.size(); i++) {
      |                                                                      ~~^~~~~~~~~~
longesttrip.cpp:68:70: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for (int i = find(b.begin(), b.end(), e2) - b.begin(); i < b.size(); i++) {
      |                                                                    ~~^~~~~~~~~~

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