Submission #939830

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
939830	2024-03-06 19:35:41	jamjanek	Longest Trip (IOI23_longesttrip)	C++17	100 / 100	14 ms	1052 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;
bool czy[300];
vector<int>polacz(vector<int>a, vector<int>b){
  while(b.size()){
    a.push_back(b.back());
    b.pop_back();
  }
  return a;
}
vector<int>prefix(vector<int>A, int ile){
    while((int)A.size()>ile)A.pop_back();
    return A;
}
vector<int> longest_trip(int n, int d)
{
  int i;
  vector<int>tab[2];tab[0].push_back(0);tab[1].push_back(1);
  for(i=1;i<n/2;i++){
    int a = i*2, b = i*2+1;
    if(are_connected({a}, {b})){
      if(are_connected({a}, {tab[0].back()})){
        tab[0].push_back(a);
        tab[0].push_back(b);
      }
      else if(are_connected({a}, {tab[1].back()})){
        tab[1].push_back(a);
        tab[1].push_back(b);        
      }
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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