oj.uz

Submission #39780

# Submission time Handle Problem Language Result Execution time Memory
39780 2018-01-18T13:32:44 Z nonocut Bosses (BOI16_bosses) C++14
100 / 100
 761 ms 2348 KB 
#include<bits/stdc++.h>
using namespace std;

#define ll long long
const int maxn = 5e3 + 5;
const long long inf = 1e15;

int n;
int par[maxn], q[maxn];
long long dp[maxn];
vector<int> way[maxn];

ll bfs(int u) {
    int i,l,r,x;
    memset(par,0,sizeof(par));
    memset(dp,0,sizeof(dp));

    l = 1; r = 0;
    par[u] = u; q[++r] = u;
	while(l<=r) {
        x = q[l++];
        for(auto y : way[x]) {
            if(!par[y]) par[y] = x, q[++r] = y;
        }
	}

	long long ret = 0;
	for(i=r;i>=1;i--) {
        x = q[i]; dp[x]++;
        if(i>1) dp[par[x]] += dp[x];
        ret += dp[x];
	}

	if(r<n) return inf;
	return ret;
}
int main() {
	int i,x,k;

	scanf("%d",&n);
	for(i=1;i<=n;i++) {
		scanf("%d",&k);
		while(k--) {
			scanf("%d",&x);
			way[x].push_back(i);
		}
	}

	ll ans = inf;
	for(i=1;i<=n;i++) ans = min(ans, bfs(i));
	printf("%lld",ans);
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:40:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
bosses.cpp:42:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&k);
                 ^
bosses.cpp:44:18: 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 0 ms 2216 KB Output is correct
2 Correct 0 ms 2216 KB Output is correct
3 Correct 2 ms 2216 KB Output is correct
4 Correct 0 ms 2216 KB Output is correct
5 Correct 0 ms 2216 KB Output is correct
6 Correct 0 ms 2216 KB Output is correct

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2216 KB Output is correct
2 Correct 0 ms 2216 KB Output is correct
3 Correct 2 ms 2216 KB Output is correct
4 Correct 0 ms 2216 KB Output is correct
5 Correct 0 ms 2216 KB Output is correct
6 Correct 0 ms 2216 KB Output is correct
7 Correct 1 ms 2216 KB Output is correct
8 Correct 0 ms 2216 KB Output is correct
9 Correct 0 ms 2216 KB Output is correct
10 Correct 1 ms 2216 KB Output is correct
11 Correct 1 ms 2216 KB Output is correct
12 Correct 6 ms 2348 KB Output is correct
13 Correct 2 ms 2348 KB Output is correct
14 Correct 155 ms 2348 KB Output is correct
15 Correct 16 ms 2348 KB Output is correct
16 Correct 582 ms 2348 KB Output is correct
17 Correct 761 ms 2348 KB Output is correct
18 Correct 749 ms 2348 KB Output is correct