oj.uz

Submission #329297

# Submission time Handle Problem Language Result Execution time Memory
329297 2020-11-20T11:03:20 Z NicolaAbusaad2014 Bosses (BOI16_bosses) C++14
100 / 100
 1038 ms 784 KB 
/**
 * Prof.Nicola
**/
#include <bits/stdc++.h>

using namespace std;
vector<vector<long> >edges;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    long n,x,z;
    cin>>n;
    edges.resize(n+1);
    for(long i=0;i<n;i++){
        cin>>x;
        for(long j=0;j<x;j++){
            cin>>z;
            edges[z].push_back(i+1);
        }
    }
    long long ans=1e9;
    for(long i=1;i<=n;i++){
        queue<pair<long long,long> >pq;
        bool vis[n+1]={};
        vector<long long>best(n+1,-1e9);
        long long cost=0,m=0;
        pq.push(make_pair(0,i));
        while(!pq.empty()){
            z=pq.front().first;
            x=pq.front().second;
            pq.pop();
            if(!vis[x]){
                m++;
                cost+=-z+1;
                vis[x]=true;
                for(long j=0;j<edges[x].size();j++){
                    if(z-1>best[edges[x][j]]){
                        best[edges[x][j]]=z-1;
                        pq.push(make_pair(z-1,edges[x][j]));
                    }
                }
            }
        }
        if(m==n){
            ans=min(ans,cost);
        }
    }
    cout<<ans<<endl;
    return 0;
}

Compilation message

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

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 236 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 376 KB Output is correct
4 Correct 0 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 1 ms 236 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 8 ms 492 KB Output is correct
13 Correct 6 ms 492 KB Output is correct
14 Correct 253 ms 620 KB Output is correct
15 Correct 28 ms 640 KB Output is correct
16 Correct 908 ms 640 KB Output is correct
17 Correct 1038 ms 784 KB Output is correct
18 Correct 1034 ms 748 KB Output is correct