oj.uz

Submission #27021

# Submission time Handle Problem Language Result Execution time Memory
27021 2017-07-08T17:18:15 Z bill_kondo Bosses (BOI16_bosses) C++14
100 / 100
 703 ms 2316 KB 
#include "bits/stdc++.h"
using namespace std;

#define pb push_back
#define debug(args...) fprintf(stderr,args)
#define FOR(i,a,b) for(int i = a; i <= b; ++i)
#define REP(i,a,b) for(int i = a; i >= b; --i)

typedef long long ll;
typedef pair<int,int>pii;

const int maxn = 5e3 + 10;
const ll INF = 1e18;

int n;
vector<int>g[maxn];

bool mrk[maxn];
ll dis[maxn];

ll solve(int root){
	FOR(i,1,n){
		mrk[i] = false;
		dis[i] = INF;
	}
	queue<int>Q;
	dis[root] = 1;
	mrk[root] = true;
	Q.push(root);
	while(!Q.empty()){
		int v = Q.front();
		Q.pop();
		for(auto u: g[v])
			if(!mrk[u]){
				mrk[u] = true;
				dis[u] = dis[v] + 1;
				Q.push(u);
			}
	}
	ll ret = 0;
	FOR(i,1,n){
		if(!mrk[i]) return INF;
		ret += dis[i];
	}
	return ret;
}

int main(){
	scanf("%d",&n);
	FOR(i,1,n){
		int k;
		scanf("%d",&k);
		while(k--){
			int node;
			scanf("%d",&node);
			g[node].pb(i);
		}
	}
	ll ans = INF;
	FOR(i,1,n) ans = min(ans,solve(i));
	printf("%lld\n",ans);
	return 0;
}

Compilation message

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

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2184 KB Output is correct
2 Correct 0 ms 2184 KB Output is correct
3 Correct 0 ms 2184 KB Output is correct
4 Correct 0 ms 2184 KB Output is correct
5 Correct 0 ms 2184 KB Output is correct
6 Correct 0 ms 2184 KB Output is correct
7 Correct 0 ms 2184 KB Output is correct
8 Correct 0 ms 2184 KB Output is correct
9 Correct 0 ms 2184 KB Output is correct
10 Correct 0 ms 2184 KB Output is correct
11 Correct 0 ms 2184 KB Output is correct
12 Correct 3 ms 2316 KB Output is correct
13 Correct 3 ms 2316 KB Output is correct
14 Correct 203 ms 2316 KB Output is correct
15 Correct 49 ms 2316 KB Output is correct
16 Correct 656 ms 2316 KB Output is correct
17 Correct 696 ms 2316 KB Output is correct
18 Correct 703 ms 2316 KB Output is correct