Submission #1052833

#TimeUsernameProblemLanguageResultExecution timeMemory
1052833caterpillowBosses (BOI16_bosses)C++17
100 / 100
1334 ms1112 KiB
#include <bits/stdc++.h> using namespace std; using db = long double; using ll = long long; using pl = pair<ll, ll>; using pi = pair<int, int>; #define vt vector #define f first #define s second #define pb push_back #define all(x) x.begin(), x.end() #define size(x) ((int) (x).size()) #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--) #define F0R(i, b) FOR (i, 0, b) #define endl '\n' const ll INF = 1e18; const int inf = 1e9; template<typename... Args> // tuples ostream& operator<<(ostream& os, tuple<Args...> t) { apply([&](Args... args) { string dlm = "{"; ((os << dlm << args, dlm = ", "), ...); }, t); return os << "}"; } template<typename T, typename V> // pairs ostream& operator<<(ostream& os, pair<T, V> p) { return os << "{" << p.f << ", " << p.s << "}"; } template<class T, class = decltype(begin(declval<T>()))> // iterables typename enable_if<!is_same<T, string>::value, ostream&>::type operator<<(ostream& os, const T& v) { string dlm = "{"; for (auto& i : v) os << dlm << i, dlm = ", "; return os << "}"; } template <typename T, typename... V> void printer(string pfx, const char *names, T&& head, V&& ...tail) { int i = 0; while (names[i] && names[i] != ',') i++; constexpr bool is_str = is_same_v<decay_t<T>, const char*>; if (is_str) cerr << " " << head; else cerr << pfx, cerr.write(names, i) << " = " << head; if constexpr (sizeof...(tail)) printer(is_str ? "" : ",", names + i + 1, tail...); else cerr << endl; } #ifdef LOCAL #define dbg(...) printer(to_string(__LINE__) + ": ", #__VA_ARGS__, __VA_ARGS__) #else #define dbg(x...) #define cerr if (0) std::cerr #endif int n; vt<vt<int>> adj; main() { cin.tie(0)->sync_with_stdio(0); cin >> n; adj.resize(n); F0R (u, n) { int m; cin >> m; F0R (i, m) { int v; cin >> v; v--; adj[v].pb(u); } } ll best = INF; F0R (i, n) { list<pi> q {{i, 1}}; vt<ll> dist(n, inf); for (auto [u, d] : q) { if (dist[u] <= d) continue; dist[u] = d; for (int v : adj[u]) q.pb({v, d + 1}); } best = min(best, accumulate(all(dist), 0ll)); } cout << best << endl; }

Compilation message (stderr)

bosses.cpp:59:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   59 | main() {
      | ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...