oj.uz

Submission #863393

# Submission time Handle Problem Language Result Execution time Memory
863393 2023-10-20T06:55:37 Z Arthas Bosses (BOI16_bosses) C++17
100 / 100
 433 ms 824 KB 
/// I'm only brave when I have to be
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define ppb pop_back
#define fast_io ios::sync_with_stdio(false);cin.tie(NULL);
#define file_io freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
#define FOR(i,k,n) for(int i = k; i < n; ++ i)
#define debf cout<<"(0-0)\n";
#define all(x) x.begin(), x.end()
#define dec(x) cout << fixed << setprecision(x);
#define pf push_front
#define ppf pop_front
#define dash " ------- "
#define what(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
//#define int short int
//#define int long long
#define sz(s) (int) (s.size())
#define fl cout.flush()
 
using namespace std;
 
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <int, pii> pip;
typedef pair <pii, int> ppi;
typedef pair <ll, ll> pll;
typedef unsigned long long ull;
typedef long double ld;
 
template <class T> using max_heap = priority_queue <T, vector <T>, less <T> >;
template <class T> using min_heap = priority_queue <T, vector <T>, greater <T> >;
 
constexpr int MOD = 1e9 + 7, N = 5008, M = 3e5 + 8, SQ = 500, INF = 1e9 + 8, LGN = 11, mod = 998244353;
 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
 
int n, h[N], hs[N], ans = INF;
vector <int> v[N];
 
void bfs (int u){
  queue <int> q;
  fill (h, h + n + 3, INF);
  fill (hs, hs + n + 3, 0);
  h[u] = 0;
  q.push(u);
  while (q.size()){
    int x = q.front();
    q.pop();
    for (int i : v[x]){
      if (h[i] > h[x] + 1){
        h[i] = h[x] + 1;
        q.push(i);
      }
    }
  }
  for (int i = 0; i < n; ++ i){
    if (h[i] == INF){
      return;
    }
    ++ hs[h[i]];
  }
  int ret = 0, ps = 0;
  for (int i = n; i >= 0; -- i){
    ps += hs[i];
    ret += ps;
  }
  ans = min (ans, ret);
  return;
}
 
int32_t main(){
  fast_io;
  cin >> n;
  FOR (i, 0, n){
    int m;
    cin >> m;
    FOR (j, 0, m){
      int aa;
      cin >> aa;
      v[--aa].pb(i);
    }
  }
  FOR (i, 0, n){
    bfs (i);
  }
  cout << ans;
  return 0;
}
 
// Yesterday is history
// Tomorrow is a mystery
// but today is a gift
// That is why it is called the present

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 588 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 588 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 588 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 588 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 588 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 2 ms 688 KB Output is correct
14 Correct 77 ms 712 KB Output is correct
15 Correct 15 ms 600 KB Output is correct
16 Correct 415 ms 804 KB Output is correct
17 Correct 433 ms 824 KB Output is correct
18 Correct 432 ms 600 KB Output is correct