oj.uz

Submission #42380

# Submission time Handle Problem Language Result Execution time Memory
42380 2018-02-26T15:15:40 Z Hassoony Bosses (BOI16_bosses) C++11
67 / 100
 1500 ms 1260 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=5009;
int n,k,x,vis[MX],val[MX];
vector<int>v[MX],v1[MX];
int ans,mn=1e9;
void dfs(int x){
    if(v1[x].size()==0){
        val[x]=1;
        ans++;
        vis[x]=1;
        return;
    }
    if(vis[x])return;
    vis[x]=1;
    int &ret=val[x];
    for(auto pp:v1[x]){
        if(vis[pp])continue;
        dfs(pp);
        ret+=val[pp];
    }
    ++ret;
    ans+=ret;
}
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++)v1[j].clear(),vis[j]=0,val[j]=0;
        ans=0;
        queue<int>q;
        q.push(i);
        while(!q.empty()){
            int x=q.front();q.pop();
            vis[x]=1;
            for(auto pp:v[x]){
                if(vis[pp])continue;
                v1[x].push_back(pp);
                vis[pp]=1;
                q.push(pp);
            }
        }
        bool b=1;
        for(int j=1;j<=n;j++){
            if(!vis[j])b=0;
        }
        if(!b)continue;
        for(int j=1;j<=n;j++)vis[j]=0;
        dfs(i);
        b=1;
        for(int j=1;j<=n;j++){
            if(!vis[j])b=0;
        }
        if(b)mn=min(mn,ans);
    }
    printf("%lld\n",mn);
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:69:23: warning: format '%lld' expects argument of type 'long long int', but argument 2 has type 'int' [-Wformat=]
     printf("%lld\n",mn);
                       ^
bosses.cpp:33:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&n);
                   ^
bosses.cpp:35:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&k);
                       ^
bosses.cpp:37: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 508 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 716 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 788 KB Output is correct
9 Correct 2 ms 788 KB Output is correct
10 Correct 2 ms 788 KB Output is correct
11 Correct 2 ms 788 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 508 KB Output is correct
2 Correct 2 ms 608 KB Output is correct
3 Correct 2 ms 608 KB Output is correct
4 Correct 2 ms 660 KB Output is correct
5 Correct 2 ms 660 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 2 ms 716 KB Output is correct
8 Correct 2 ms 788 KB Output is correct
9 Correct 2 ms 788 KB Output is correct
10 Correct 2 ms 788 KB Output is correct
11 Correct 2 ms 788 KB Output is correct
12 Correct 11 ms 860 KB Output is correct
13 Correct 6 ms 900 KB Output is correct
14 Correct 273 ms 1244 KB Output is correct
15 Correct 89 ms 1244 KB Output is correct
16 Correct 818 ms 1260 KB Output is correct
17 Execution timed out 1553 ms 1260 KB Time limit exceeded
18 Halted 0 ms 0 KB -