Submission #839808

#	Time	Username	Problem	Language	Result	Execution time	Memory
839808		AdamGS	Longest Trip (IOI23_longesttrip)	C++17	0 / 100	1 ms	388 KiB

longesttrip

#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>longest_trip(int n, int d) {
  vector<int>A, B;
  A.pb(0);
  for(int i=1; i<n; ++i) {
    vector<int>X, Y;
    X.pb(A.back());
    Y.pb(i);
    if(are_connected(X, Y)) A.pb(i);
    else B.pb(i);
    X.clear();
    Y.clear();
    X.pb(A.back());
    Y.pb(B.back());
    if(are_connected(X, Y)) while(B.size()>0) {
      A.pb(B.back());
      B.pop_back();
    }
  }
  if(B.size()>A.size()) swap(A, B);
  return A;
}

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