Submission #745029

#	Time	Username	Problem	Language	Result	Execution time	Memory
745029		arush_agu	Fun Tour (APIO20_fun)	C++17	26 / 100	90 ms	19064 KiB

fun

#include "fun.h"

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

vi createFunTour(int n, int q) {
  vector<set<int>> adj(n);
  for (int i=0; i<n; i++) for (int j=i + 1; j<n; j++) if (hoursRequired(i, j) == 1) {
    adj[i].insert(j);
    adj[j].insert(i);
  }

  auto furthest = [&](int x) {
    vi dist(n, INF); dist[x] = 0;
    queue<int> q; q.push(x);
    while (!q.empty()) {
      int curr = q.front(); q.pop();
      for (int v : adj[curr]) if (dist[v] >= INF) {
        dist[v] = dist[curr] + 1;
        q.push(v);
      }
    }

    int idx = x;
    for (int i=0; i<n; i++) if (dist[i] < INF) {
      if (dist[idx] < dist[i]) idx = i;
    }
    return idx;
  };

  int u = furthest(0);
  u = furthest(u);

  int tmp = n;
  vi ans;
  while (tmp) {
    tmp--;
    ans.push_back(u);

    if (tmp == 0) break;
    assert(adj[u].size() <= 1);
    adj[*adj[u].begin()].erase(u);
    u = furthest(u);
  }

  return ans;
}

• Subtask 1: 10 / 10
• Subtask 2: 16 / 16
• Subtask 3: 0 / 21
• Subtask 4: 0 / 19
• Subtask 5: 0 / 34