Submission #1280917

#	Time	Username	Problem	Language	Result	Execution time	Memory
1280917		avighna	Longest Trip (IOI23_longesttrip)	C++20	5 / 100	349 ms	764 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> _ans;
  for (int u = 0; u < n; ++u) {
    std::deque<int> ans;
    ans.push_back(u);
    std::vector<bool> vis(n);
    vis[u] = true;
    bool changed = true;
    while (changed) {
      changed = false;
      for (int &i : adj[ans.front()]) {
        if (vis[i]) {
          continue;
        }
        vis[i] = true;
        ans.push_front(i);
        changed = true;
      }
      for (int &i : adj[ans.back()]) {
        if (vis[i]) {
          continue;
        }
        vis[i] = true;
        ans.push_back(i);
        changed = true;
      }
    }
    if (ans.size() > _ans.size()) {
      _ans=ans;
    }
  }

  return std::vector<int>(_ans.begin(), _ans.end());
}

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