제출 #793842

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
793842		arush_agu	Bosses (BOI16_bosses)	C++17	67 / 100	1588 ms	912 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 = 4e18;
const ld EPS = 1e-9;

const int MAXN = 5e3 + 10;

int n;
vi poss_child[MAXN];
ll res = INF;
int par[MAXN];
ll sz[MAXN];

void solve() {
  cin >> n;
  for (int i = 0; i < n; i++) {
    int k;
    cin >> k;
    for (int j = 0; j < k; j++) {
      int x;
      cin >> x;
      if (x - 1 != i)
        poss_child[x - 1].push_back(i);
    }
  }

  for (int rt = 0; rt < n; rt++) {
    vi childs[n];
    memset(par, -1, sizeof(par));

    queue<int> q;
    q.push(rt);
    while (!q.empty()) {
      int u = q.front();
      q.pop();

      for (int &v : poss_child[u])
        if (par[v] == -1 && v != rt) {
          par[v] = u;
          childs[u].push_back(v);
          q.push(v);
        }
    }

    memset(sz, 0, sizeof(sz));

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

    bool flag = 0;
    int cnt_m1 = 0;
    for (int i = 0; i < n; i++) {
      if (par[i] == -1 && ++cnt_m1 > 1) {
        flag = 1;
        break;
      }
    }

    if (flag)
      continue;

    f(rt);

    res = min(res, accumulate(sz, sz + n, 0LL));
  }

  cout << res << "\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;
}

컴파일 시 표준 에러 (stderr) 메시지

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

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