oj.uz

Submission #42388

# Submission time Handle Problem Language Result Execution time Memory
42388 2018-02-26T15:46:47 Z Hassoony Bosses (BOI16_bosses) C++11
100 / 100
 686 ms 1132 KB 
#include<bits/stdc++.h>
#include<unordered_map>
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef long double D;
const ll inf=(1ll<<61);
const ll mod=1e9+7;
const int MX=5002;
int n,k,x;
bool vis[MX];
int val[MX];
vector<int>v[MX],v1[MX];
int ans,mn=1e9;
int main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%d",&k);
        while(k--){
            scanf("%d",&x);
            v[x].push_back(i);
        }
    }
    for(int i=1;i<=n;i++){
        for(int j=1;j<=n;j++)vis[j]=0,val[j]=0;
        queue<int>q;
        q.push(i);
        val[i]=vis[i]=1;
        while(!q.empty()){
            int x=q.front();q.pop();
            for(auto pp:v[x]){
                if(!vis[pp]){
                    vis[pp]=1;
                    q.push(pp);
                    val[pp]=val[x]+1;
                }
            }
        }
        ans=0;
        for(int j=1;j<=n;j++)ans+=val[j];
        bool b=1;
        for(int j=1;j<=n;j++)if(!vis[j])b=0;
        if(b)mn=min(mn,ans);
    }
    printf("%d\n",mn);
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:17:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
bosses.cpp:19:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&k);
                       ^
bosses.cpp:21:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d",&x);
                           ^

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
3 Correct 2 ms 680 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 752 KB Output is correct
6 Correct 2 ms 780 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
3 Correct 2 ms 680 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 752 KB Output is correct
6 Correct 2 ms 780 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 2 ms 780 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
3 Correct 2 ms 680 KB Output is correct
4 Correct 2 ms 752 KB Output is correct
5 Correct 2 ms 752 KB Output is correct
6 Correct 2 ms 780 KB Output is correct
7 Correct 2 ms 780 KB Output is correct
8 Correct 2 ms 780 KB Output is correct
9 Correct 2 ms 780 KB Output is correct
10 Correct 2 ms 780 KB Output is correct
11 Correct 2 ms 780 KB Output is correct
12 Correct 6 ms 832 KB Output is correct
13 Correct 5 ms 832 KB Output is correct
14 Correct 171 ms 960 KB Output is correct
15 Correct 56 ms 1004 KB Output is correct
16 Correct 650 ms 1004 KB Output is correct
17 Correct 686 ms 1132 KB Output is correct
18 Correct 668 ms 1132 KB Output is correct