Submission #939832

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
939832	2024-03-06 19:39:18	weajink	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	11 ms	860 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>
#include "longesttrip.h"
using namespace std;
typedef long long ll;
vector<int> sciezka[2];
void dodaj_wierzcholek(int v){
  if (!sciezka[0].size() || are_connected({v},{sciezka[0].back()})){
    sciezka[0].push_back(v);
    return;
  }
  if (!sciezka[1].size() || are_connected({v},{sciezka[1].back()})){
    sciezka[1].push_back(v);
    return;
  }
  for (int i = (int)sciezka[1].size()-1; i >= 0; i--) sciezka[0].push_back(sciezka[1][i]);
  sciezka[1] = {v};
}
void dodaj_wierzcholki(int v1, int v2){
  if (are_connected({v1},{v2})){
    dodaj_wierzcholek(v1);
    if (sciezka[0].back() == v1) sciezka[0].push_back(v2);
    else sciezka[1].push_back(v2);
    return;
  }
  if (!are_connected({v1},{sciezka[0].back()})) swap(v1,v2);
  sciezka[0].push_back(v1);
  if (are_connected({v1},{sciezka[1].back()})){
    reverse(sciezka[1].begin(),sciezka[1].end());
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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