oj.uz

Submission #857775

# Submission time Handle Problem Language Result Execution time Memory
857775 2023-10-06T22:16:19 Z qrno Bosses (BOI16_bosses) C++17
100 / 100
 388 ms 684 KB 
#include <cstdio>
#include <vector>
#include <array>
#include <queue>
#include <bitset>
using namespace std;

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

const int INF = 1e9;
const int MAXN = 5e3;

int best = INF;

int N;
array<vector<short>, MAXN> G;
array<short, MAXN> val;

signed main() {
  scanf("%d", &N);
  for (int i = 0; i < N; i++) {
    int K; scanf("%d", &K);
    while (K--) {
      int u; scanf("%d", &u); u--;
      G[u].push_back(i);
    }
  }

  for (int i = 0; i < N; i++) {
    bitset<MAXN> vis;
    queue<int> Q;
    Q.push(i);
    val[i] = 1;
    vis[i] = true;

    int done = 0, sum = 0;
    while (!Q.empty()) {
      auto v = Q.front(); Q.pop();
      sum += val[v];
      done++;
      for (auto u : G[v]) {
        if (!vis[u]) {
          Q.push(u);
          val[u] = val[v]+1;
          vis[u] = true;
        }
      }
    }
    if (done < N) continue;

    best = min(best, sum);
  }

  printf("%d", best);
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:21:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |   scanf("%d", &N);
      |   ~~~~~^~~~~~~~~~
bosses.cpp:23:17: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     int K; scanf("%d", &K);
      |            ~~~~~^~~~~~~~~~
bosses.cpp:25:19: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |       int u; scanf("%d", &u); u--;
      |              ~~~~~^~~~~~~~~~

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 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 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 3 ms 600 KB Output is correct
14 Correct 74 ms 600 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 375 ms 604 KB Output is correct
17 Correct 381 ms 684 KB Output is correct
18 Correct 388 ms 684 KB Output is correct