Submission #1280928

#	Time	Username	Problem	Language	Result	Execution time	Memory
1280928		avighna	Longest Trip (IOI23_longesttrip)	C++20	5 / 100	1071 ms	736 KiB

longesttrip

#include <bits/stdc++.h>

bool are_connected(std::vector<int> A, std::vector<int> B);

std::vector<int> longest_trip(int n, int d) {
  std::vector<std::vector<int>> adj(n);
  auto add_edge = [&](int u, int v) {
    adj[u].push_back(v);
    adj[v].push_back(u);
  };
  for (int i = 0; i < n; ++i) {
    for (int j = i + 1; j < n; ++j) {
      if (are_connected({i}, {j})) {
        add_edge(i, j);
      }
    }
  }

  std::deque<int> dq;
  dq.push_back(0);
  std::vector<bool> vis(n);
  vis[0] = true;
  while (dq.size() != n) {
    for (int &i : adj[dq.front()]) {
      if (vis[i]) {
        continue;
      }
      vis[i] = true;
      dq.push_front(i);
    }
    for (int &i : adj[dq.back()]) {
      if (vis[i]) {
        continue;
      }
      vis[i] = true;
      dq.push_back(i);
    }
  }

  assert(dq.size() == n);

  std::vector<int> ans;
  for (int &i : dq) {
    ans.push_back(i);
  }

  return ans;
}

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