oj.uz

Submission #107353

# Submission time Handle Problem Language Result Execution time Memory
107353 2019-04-23T12:21:58 Z MohamedAhmed0 Bosses (BOI16_bosses) C++14
67 / 100
 1500 ms 98748 KB 
#include <bits/stdc++.h>
 
using namespace std;

#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")

const int MAX = 5005 ;
int vis[MAX] , par[MAX][MAX] , can[MAX] ;
long long dp[MAX] , cost = 0;
 
vector< vector<int> >adj(MAX) ;
 
int n , cnt = 0 ;
 
void bfs(int src)
{
    queue<int>q ;
    q.push(src) ;
    vis[src] = src ;
    par[src][src] = 0 ;
    while(!q.empty())
    {
        int node = q.front() ;
        q.pop() ;
        cnt++ ;
        for(auto &child : adj[node])
        {
            if(vis[child] == src)
                continue ;
            vis[child] = src ;
            par[src][child] = node ;
            q.push(child) ;
        }
    }
    return ;
}
 
int src ;
 
void dfs(int node)
{
    for(auto &child : adj[node])
    {
        if(par[src][child] == node)
        {
            dfs(child) ;
            dp[node] += dp[child] ;
        }
    }
    dp[node]++;
    cost += dp[node] * 1ll;
    return ;
}
 
int readint()
{
    char c ;
    c = getchar() ;
    while(true)
    {
        if(c >= '0' && c <= '9')
            break ;
        c = getchar() ;
    }
    int result = (c - '0') ;
    c = getchar() ;
    while(true)
    {
        if(c < '0' || c > '9')
            break ;
        result = result * 10 + (c - '0') ;
        c = getchar() ;
    }
    return result ;
}
 
int main()
{
    n = readint() ;
    for(int i = 1 ; i <= n ; ++i)
    {
        int m ;
        m = readint() ;
        while(m--)
        {
            int x ;
            x = readint() ;
            adj[x].push_back(i) ;
        }
    }
    long long ans = 1e18 ;
    for(int i = 1 ; i <= n ; ++i)
    {
        cnt = 0 ;
        bfs(i) ;
        if(cnt == n)
            can[i] = 1 ;
    }
    for(int i = 1 ; i <= n ; ++i)
    {
        if(can[i] == 0)
            continue ;
        memset(dp , 0 , sizeof(dp)) ;
        src = i ;
        cnt = 0 , cost = 0;
        dfs(i) ;
        ans = min(ans , cost) ;
    }
    return printf("%lld" , ans) , 0 ;
}

Compilation message

bosses.cpp:6:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("O3")
 
bosses.cpp:7:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
 #pragma GCC optimization ("unroll-loops")

Subtask #1
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 560 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct

Subtask #2
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 560 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 896 KB Output is correct
11 Correct 4 ms 896 KB Output is correct

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 512 KB Output is correct
2 Correct 1 ms 560 KB Output is correct
3 Correct 2 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 2 ms 512 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 3 ms 896 KB Output is correct
8 Correct 3 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 4 ms 896 KB Output is correct
11 Correct 4 ms 896 KB Output is correct
12 Correct 11 ms 1544 KB Output is correct
13 Correct 9 ms 1280 KB Output is correct
14 Correct 214 ms 63552 KB Output is correct
15 Correct 40 ms 41240 KB Output is correct
16 Correct 728 ms 80876 KB Output is correct
17 Execution timed out 1561 ms 98748 KB Time limit exceeded
18 Halted 0 ms 0 KB -