제출 #948369

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
948369	2024-03-18 04:55:49	Trisanu_Das	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	10 ms	852 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) {
    vector<int> s1({0}),s2({1});
    auto mrg = [&]() {
        while (!s2.empty()) {
            s1.push_back(s2.back());
            s2.pop_back();
        }
    };
    bool sep = false;
    for (int i = 2; i < N; ++i) {
        if (are_connected({s1.back()}, {i})) {
            s1.push_back(i);
            sep = false;
        } else if (sep || are_connected({s2.back()}, {i})) {
            s2.push_back(i);
            sep = true;
        } else {
            mrg();
            s2.push_back(i);
        }
    }
    if (!are_connected(s1, s2)) return s1.size() >= s2.size() ? s1 : s2;
    auto rot = [&](vector<int>& a, const vector<int>& b) {
        if (are_connected(b,{a.front()})) {
            reverse(a.begin(),a.end());
            return;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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