oj.uz

Submission #969791

# Submission time Handle Problem Language Result Execution time Memory
969791 2024-04-25T15:32:48 Z vjudge1 Bosses (BOI16_bosses) C++14
100 / 100
 499 ms 848 KB 
#include <bits/stdc++.h>

using namespace std;
int n,a,b,mn=INT_MAX;
vector<int> v[5005];
bool visited[5005];
queue<pair<int,int>> q;
int main()
{
    cin.tie(0)->sync_with_stdio(0);
    cin >> n;
    for(int i=1;i<=n;i++){
        cin >> a;
        for(int j=0;j<a;j++) cin >> b,v[b].push_back(i);
    }
    for(int i=1;i<=n;i++){
        q.push({1,i});
        int sum=0,cnt=0;
        memset(visited,0,sizeof(visited));
        while(!q.empty()){
            int now=q.front().second,cost=q.front().first; q.pop();
            if(visited[now]) continue; visited[now]=1;
            sum+=cost; cnt++;
            for(auto e:v[now]) if(!visited[e]) q.push({cost+1,e});
        }
        if(cnt==n) mn=min(mn,sum);
    }
    cout << mn;
    return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:22:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   22 |             if(visited[now]) continue; visited[now]=1;
      |             ^~
bosses.cpp:22:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   22 |             if(visited[now]) continue; visited[now]=1;
      |                                        ^~~~~~~

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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 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 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 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 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 344 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 14 ms 604 KB Output is correct
13 Correct 10 ms 588 KB Output is correct
14 Correct 96 ms 604 KB Output is correct
15 Correct 2 ms 600 KB Output is correct
16 Correct 443 ms 764 KB Output is correct
17 Correct 499 ms 848 KB Output is correct
18 Correct 466 ms 600 KB Output is correct