제출 #840251

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
840251	2023-08-31 08:43:46	TranGiaHuy1508	가장 긴 여행 (IOI23_longesttrip)	C++17	100 / 100	19 ms	308 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 <bits/stdc++.h>
using namespace std;
#include "longesttrip.h"
vector<int> subrange(vector<int> &V, int l, int r){
  vector<int> res(V.begin() + l, V.begin() + r + 1);
  return res;
}
vector<int> longest_trip(int N, int D){
  // Assuming D = 1
  vector<int> v1 = {0}, v2 = {1};
  bool stupid = false;
  for (int i = 2; i < N; i++){
    if (are_connected({v1.back()}, {i})){
      v1.push_back(i);
      stupid = false;
    }
    else if (stupid || are_connected({v2.back()}, {i})){
      v2.push_back(i);
      stupid = true;
    }
    else{
      reverse(v2.begin(), v2.end());
      v1.insert(v1.end(), v2.begin(), v2.end());
      v2.clear(); v2.push_back(i);
      stupid = false;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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