oj.uz

Submission #977490

# Submission time Handle Problem Language Result Execution time Memory
977490 2024-05-08T04:56:36 Z JungPS Bosses (BOI16_bosses) C++14
100 / 100
 424 ms 736 KB 
#include <iostream>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;

int vis[5007];
long long cost = 0;

vector<int> vec[5007];

int n,cnt=0;

void bfs(int src)
{
    queue< pair<int , int> >q ;
    q.push({src , 1}) ;
    vis[src] = 1 ;
    while(!q.empty())
    {
        pair<int , int>p = q.front() ;
        q.pop() ;
        cnt++ ;
        int node = p.first ;
        cost += (p.second * 1ll) ;
        for(auto child : vec[node])
        {
            if(vis[child] == 1)
                continue ;
            vis[child] = 1 ;
            q.push({child , p.second+1}) ;
        }
    }
    return ;
}

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    cin >> n;
    for(int i = 1 ; i <= n ; ++i)
    {
        int m;
        cin >> m;
        while(m--)
        {
            int x;
            cin >> x;
            vec[x].push_back(i) ;
        }
    }
    long long ans = 1e18 ;
    for(int i = 1 ; i <= n ; ++i)
    {
        memset(vis , 0 , sizeof(vis)) ;
        cnt = 0 , cost = 0;
        bfs(i) ;
        if(cnt != n)
            continue;
        ans = min(ans , cost) ;
    }
    return printf("%lld" , ans) , 0 ;
}

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 0 ms 348 KB Output is correct
5 Correct 0 ms 360 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 1 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 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 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 344 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 1 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 0 ms 348 KB Output is correct
5 Correct 0 ms 360 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 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 344 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 604 KB Output is correct
14 Correct 103 ms 604 KB Output is correct
15 Correct 5 ms 604 KB Output is correct
16 Correct 424 ms 708 KB Output is correct
17 Correct 384 ms 736 KB Output is correct
18 Correct 387 ms 732 KB Output is correct