oj.uz

Submission #39427

# Submission time Handle Problem Language Result Execution time Memory
39427 2018-01-15T03:42:13 Z WhipppedCream Bosses (BOI16_bosses) C++14
100 / 100
 943 ms 2508 KB 
#include <bits/stdc++.h>
//#ifdef atom #else #endif
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
#define X first
#define Y second
#define vi vector<int>
#define vvi vector< vi >
#define vii vector< ii >
#define mp make_pair
#define pb push_back
const int maxn = 5005;
vector<int> adj[maxn];
int n;
int vis2[maxn];
int p[maxn];
int inq[maxn];
ll cost[maxn];
ll solve(int x)
{
    memset(vis2, 0, sizeof vis2);
    memset(cost, 0, sizeof cost);
    memset(p, -1, sizeof p);
    vector<int> rev;
    queue<int> Q;
    Q.push(x);
    vis2[x] = 1;
    while(!Q.empty())
    {
        int u = Q.front(); Q.pop();
        rev.pb(u);
        for(int v : adj[u])
        {
            if(!vis2[v])
            {
                vis2[v] = 1;
                p[v] = u;
                Q.push(v);
            }
        }
    }
    if(rev.size() != n) return 1e18;
    reverse(rev.begin(), rev.end());
    ll tot = 0;
    for(int i = 0; i< (int) rev.size(); i++)
    {
        int u = rev[i];
        cost[u]++;
        tot += cost[u];
        if(p[u] != -1) cost[p[u]] += cost[u];
    }
    return tot;
}
int main()
{
    //#ifndef atom
    //freopen(".in", "r", stdin);
    //freopen(".out", "w", stdout);
    //#endif
    scanf("%d", &n);
    for(int i = 1; i<= n; i++)
    {
        int k; scanf("%d", &k);
        for(int j = 1; j<= k; j++)
        {
            int x; scanf("%d", &x);
            adj[x].pb(i);
        }
    }
    ll best = 1e18;
    for(int i = 1; i<= n; i++) best = min(best, solve(i));
    printf("%lld\n", best);
}

Compilation message

bosses.cpp: In function 'll solve(int)':
bosses.cpp:43:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(rev.size() != n) return 1e18;
                   ^
bosses.cpp: In function 'int main()':
bosses.cpp:61:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
bosses.cpp:64:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int k; scanf("%d", &k);
                               ^
bosses.cpp:67:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             int x; scanf("%d", &x);
                                   ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2232 KB Output is correct
2 Correct 0 ms 2232 KB Output is correct
3 Correct 0 ms 2232 KB Output is correct
4 Correct 0 ms 2232 KB Output is correct
5 Correct 0 ms 2232 KB Output is correct
6 Correct 0 ms 2232 KB Output is correct
7 Correct 0 ms 2232 KB Output is correct
8 Correct 0 ms 2232 KB Output is correct
9 Correct 0 ms 2232 KB Output is correct
10 Correct 0 ms 2232 KB Output is correct
11 Correct 0 ms 2232 KB Output is correct
12 Correct 3 ms 2364 KB Output is correct
13 Correct 3 ms 2364 KB Output is correct
14 Correct 179 ms 2364 KB Output is correct
15 Correct 23 ms 2364 KB Output is correct
16 Correct 726 ms 2508 KB Output is correct
17 Correct 936 ms 2496 KB Output is correct
18 Correct 943 ms 2496 KB Output is correct