oj.uz

Submission #900119

# Submission time Handle Problem Language Result Execution time Memory
900119 2024-01-07T16:47:12 Z Petrix Bosses (BOI16_bosses) C++17
100 / 100
 566 ms 768 KB 
#include <iostream>
#include <vector>
#include <queue>
using namespace std;

int n;
vector<vector<int>> v;
vector<int> viz;

void curat(){
    int i;
    for(i=0;i<=n;i++) viz[i]=0;
}

bool vf(){
    int i;
    for(i=1;i<=n;i++){
        if(!viz[i]) return 0;
    }
    return 1;
}

int main()
{
    int i,j,k,min1,sum,nod,depth,a;
    cin>>n;
    viz.resize(n+1);v.resize(n+1);
    for(i=1;i<=n;i++){
        cin>>k;
        for(j=0;j<k;j++){
            cin>>a;
            v[a].push_back(i);
        }
    }
    min1=1e9;
    for(j=1;j<=n;j++){
        sum=1;
        queue<pair<int,int>> s;
        s.push({j,1});
        curat();viz[j]=1;
        while(!s.empty()){
            nod=s.front().first;
            depth=s.front().second+1;
            s.pop();
            for(i=0;i<v[nod].size();i++){
                if(!viz[v[nod][i]]){
                    viz[v[nod][i]]=1;
                    sum+=depth;
                    s.push({v[nod][i],depth});
                }
            }
        }
        if(vf())
            min1=min(sum,min1);
    }
    cout<<min1;
    return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:45:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             for(i=0;i<v[nod].size();i++){
      |                     ~^~~~~~~~~~~~~~

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 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 0 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 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 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 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 9 ms 756 KB Output is correct
13 Correct 6 ms 348 KB Output is correct
14 Correct 132 ms 660 KB Output is correct
15 Correct 18 ms 600 KB Output is correct
16 Correct 552 ms 604 KB Output is correct
17 Correct 566 ms 604 KB Output is correct
18 Correct 562 ms 768 KB Output is correct