Submission #793777

#	Time	Username	Problem	Language	Result	Execution time	Memory
793777		arush_agu	Bosses (BOI16_bosses)	C++17	0 / 100	1 ms	212 KiB

bosses

#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 <random>
#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;

struct DSU {
  int n;
  vi par, sz;

  DSU(int n) : n(n) {
    par = vi(n, -1);
    sz = vi(n, 1);
  }

  int find(int x) {
    if (par[x] == -1)
      return x;
    return par[x] = find(par[x]);
  }

  void merge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v)
      return;

    if (sz[u] < sz[v])
      swap(u, v);
    sz[u] += sz[v];
    par[v] = u;
  }
};

void solve() {
  int n;
  cin >> n;

  vi indeg(n);

  vvi poss_boss(n), poss_sub(n);
  vii pars;
  for (int i = 0; i < n; i++) {
    int k;
    cin >> k;
    for (int j = 0; j < k; j++) {
      int x;
      cin >> x;
      poss_boss[i].push_back(x - 1);
      poss_sub[x - 1].push_back(i);
      indeg[x - 1]++;
      pars.push_back({i, x - 1});
    }
  }

  vector<vb> erased(n, vb(n));

  DSU dsu(n);

  vvi childs(n);
  vi par(n, -1);
  auto it = max_element(all(indeg));
  while (*it > 0) {
    int idx = it - indeg.begin();
    for (int i : poss_sub[idx])
      if (par[i] == -1 && dsu.find(idx) != dsu.find(i)) {
        par[i] = idx;
        childs[idx].push_back(i);
        dsu.merge(idx, i);
      }

    indeg[idx] = 0;

    for (auto [u, p] : pars)
      if (!erased[u][p] && par[u] != -1) {
        indeg[p]--;
        erased[u][p] = 1;
      }
    it = max_element(all(indeg));
  }

  vl sub_sz(n);
  function<ll(int)> f = [&](int u) {
    ll sz = 1;
    for (int &v : childs[u])
      sz += f(v);

    return sub_sz[u] = sz;
  };

  assert(count(all(par), -1) == 1);
  f(find(all(par), -1) - par.begin());

  cout << accumulate(all(sub_sz), 0LL) << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message (stderr)

bosses.cpp: In function 'int main()':
bosses.cpp:185:11: warning: unused variable 'start' [-Wunused-variable]
  185 |   clock_t start = clock();
      |           ^~~~~

• Subtask 1: 0 / 22
• Subtask 2: 0 / 45
• Subtask 3: 0 / 33