oj.uz

답안 #533211

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
533211 2022-03-05T06:36:53 Z kebine Bosses (BOI16_bosses) C++17
67 / 100
 1500 ms 220216 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll n;
vector<ll> adj[5005];
ll dist[5005][5005];
bool vis[5005][5005];

ll bfs(ll x) {
  queue <ll> q;
  q.push(x);
  ll sum = 1;
  dist[x][x] = 1;
  ll mx = 0;
  vis[x][x] = true;
  while(!q.empty()) {
    ll cur = q.front();
    q.pop();
    for(ll i = 0; i < adj[cur].size(); i++) {
      ll next = adj[cur][i];
      if (!vis[next][x]) {
        vis[next][x] = true;
        dist[next][x] = dist[cur][x] + 1;
        sum += dist[next][x];
        mx = max(mx, dist[next][x]);
        q.push(next);
      }
    }
  }
  return sum;
  
}

int main() {
  cin >> n;
  for(ll i = 1; i <= n; i++) {
    ll k;
    cin >> k;
    for(ll j = 0; j < k; j++) {
      ll next;
      cin >> next;
      adj[next].push_back(i);
      //cout << next << " " << i << endl;
    }
  }
  
  ll mn = LLONG_MAX;
  for(ll i = 1; i <= n; i++) {
    int ans = bfs(i);
    bool flag = true;
    for(ll j = 1; j <= n; j++) {
      if (!vis[j][i]) {
        flag = false;
        break;
      }
    }
    if (flag && ans < mn) {
      mn = ans;
    }
  }
  cout << mn << endl;
  
}

Compilation message

bosses.cpp: In function 'long long int bfs(long long int)':
bosses.cpp:19:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for(ll i = 0; i < adj[cur].size(); i++) {
      |                   ~~^~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 1 ms 460 KB Output is correct

Subtask #2
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 1184 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 460 KB Output is correct
3 Correct 1 ms 460 KB Output is correct
4 Correct 1 ms 460 KB Output is correct
5 Correct 1 ms 424 KB Output is correct
6 Correct 1 ms 460 KB Output is correct
7 Correct 1 ms 1184 KB Output is correct
8 Correct 1 ms 844 KB Output is correct
9 Correct 1 ms 588 KB Output is correct
10 Correct 1 ms 1228 KB Output is correct
11 Correct 2 ms 1280 KB Output is correct
12 Correct 9 ms 2560 KB Output is correct
13 Correct 7 ms 1972 KB Output is correct
14 Correct 379 ms 220216 KB Output is correct
15 Correct 80 ms 147056 KB Output is correct
16 Correct 1362 ms 219888 KB Output is correct
17 Execution timed out 1552 ms 218236 KB Time limit exceeded
18 Halted 0 ms 0 KB -