oj.uz

Submission #30905

# Submission time Handle Problem Language Result Execution time Memory
30905 2017-07-31T18:26:59 Z Navick Bosses (BOI16_bosses) C++14
100 / 100
 533 ms 2312 KB 
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back

using namespace std;

typedef long long ll;
typedef long double ld;

const int N = 5100, INF = 1e9;

int dis[N], que[N], st, en, n;
vector<int> adj[N];

inline int solve(int s){
	st = en = 0;
	que[en++] = s;
	for(int i=1; i<=n; i++)
		dis[i] = INF;
	dis[s] = 0;

	while(en - st){
		int v = que[st++];
		for(auto u : adj[v])
			if(dis[u] == INF){
				dis[u] = dis[v] + 1;
				que[en++] = u;
			}
	}

	int res = n;
	for(int i=1; i<=n; i++){
		if(dis[i] == INF)return INF;
		else res += dis[i];
	}
	return res;
}

int main(){
	scanf("%d", &n);
	for(int i=1; i<=n; i++){
		int k; scanf("%d", &k);
		while(k--){
			int v; scanf("%d", &v);
			adj[v].pb(i);
		}
	}

	int ans = INF;
	for(int i=1; i<=n; i++){
		ans = min(ans, solve(i));
	}

	printf("%d\n", ans);

}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:41:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
                 ^
bosses.cpp:43:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int k; scanf("%d", &k);
                         ^
bosses.cpp:45:26: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    int v; scanf("%d", &v);
                          ^

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2180 KB Output is correct
4 Correct 0 ms 2180 KB Output is correct
5 Correct 0 ms 2180 KB Output is correct
6 Correct 0 ms 2180 KB Output is correct
7 Correct 0 ms 2180 KB Output is correct
8 Correct 0 ms 2180 KB Output is correct
9 Correct 0 ms 2180 KB Output is correct
10 Correct 0 ms 2180 KB Output is correct
11 Correct 0 ms 2180 KB Output is correct
12 Correct 3 ms 2312 KB Output is correct
13 Correct 3 ms 2312 KB Output is correct
14 Correct 103 ms 2312 KB Output is correct
15 Correct 13 ms 2312 KB Output is correct
16 Correct 526 ms 2312 KB Output is correct
17 Correct 533 ms 2312 KB Output is correct
18 Correct 526 ms 2312 KB Output is correct