oj.uz

Submission #310819

# Submission time Handle Problem Language Result Execution time Memory
310819 2020-10-08T05:12:50 Z VROOM_VARUN Bosses (BOI16_bosses) C++14
100 / 100
 792 ms 760 KB 
/*
ID: varunra2
LANG: C++
TASK: bosses
*/

#include<bits/stdc++.h>
using namespace std;

#ifdef DEBUG
#include "lib/debug.h"
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#define debug_arr(...) \
  cerr << "[" << #__VA_ARGS__ << "]:", debug_arr(__VA_ARGS__)
#pragma GCC diagnostic ignored "-Wsign-compare"
//#pragma GCC diagnostic ignored "-Wunused-parameter"
//#pragma GCC diagnostic ignored "-Wunused-variable"
#else
#define debug(...) 42
#endif

#define EPS 1e-9
#define IN(A, B, C) assert(B <= A && A <= C)
#define INF (int)1e9
#define MEM(a, b) memset(a, (b), sizeof(a))
#define MOD 1000000007
#define MP make_pair
#define PB push_back
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.end(), cont.begin()
#define x first
#define y second

const double PI = acos(-1.0);
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef map<int, int> MPII;
typedef multiset<int> MSETI;
typedef set<int> SETI;
typedef set<string> SETS;
typedef vector<int> VI;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<string> VS;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef pair<int, int> pii;
typedef vector<int> vi;
#pragma GCC diagnostic ignored "-Wsign-compare"
// util functions


int n;
VVI adj;

void init() {
  adj.resize(n);
}

int calc(int root) {
  VI dist(n, -1);
  dist[root] = 1;
  
  queue<int> q;
  q.push(root);

  while(!q.empty()) {
    int u = q.front();
    q.pop();
    for(auto& x: adj[u]) {
      if(dist[x] != -1) continue;
      dist[x] = dist[u] + 1;
      q.push(x);
    }
  }

  int mn = *min_element(all(dist));
  if(mn == -1) return INF;

  return accumulate(all(dist), 0);

}

int main() {
// #ifndef ONLINE_JUDGE
  // freopen("bosses.in", "r", stdin);
  // freopen("bosses.out", "w", stdout);
// #endif
  cin.sync_with_stdio(0); cin.tie(0);

  cin >> n;

  init();

  for(int i = 0; i < n; i++) {
    int cnt;
    cin >> cnt;
    while(cnt--) {
      int u;
      cin >> u;
      u--;
      adj[u].PB(i);
    }
  }

  int ret = INF;

  for(int i = 0; i < n; i++) {
    ret = min(ret, calc(i));
  }

  cout << ret << '\n';

  return 0;
}

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 4 ms 512 KB Output is correct
14 Correct 168 ms 640 KB Output is correct
15 Correct 44 ms 640 KB Output is correct
16 Correct 619 ms 760 KB Output is correct
17 Correct 791 ms 760 KB Output is correct
18 Correct 792 ms 740 KB Output is correct