Submission #1150401

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1150401	2025-02-14 16:40:07	marvinthang	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	5 ms	420 KiB

longesttrip

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> longest_trip(int N, int D) {
    auto connected = [&] (int u, int v) { return are_connected({u}, {v}); };
    vector <int> path;
    if (D == 3) {
        path.resize(N);
        iota(path.begin(), path.end(), 0);
    } else if (D == 2) {
        if (!connected(0, 1)) path = {0, 2, 1};
        else if (!connected(0, 2)) path = {0, 1, 2};
        else path = {1, 0, 2};
        for (int i = 3; i < N; ++i) {
            if (!connected(i, path.back())) path.insert(path.begin(), i);
            else path.push_back(i);
        }
    } else {
        vector <int> left{0}, right{1};
        bool last = false;
        for (int i = 2; i < N; ++i) {
            if (connected(left.back(), i)) {
                left.push_back(i);
                last = false;
            } else if (last || connected(right.back(), i)) {
                right.push_back(i);
                last = true;
            } else {
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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