oj.uz

Submission #39779

# Submission time Handle Problem Language Result Execution time Memory
39779 2018-01-18T13:23:39 Z nonocut Bosses (BOI16_bosses) C++14
67 / 100
 1500 ms 2712 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 vis[maxn], cnt;
long long cur, val[maxn];
vector<int> way[maxn], p[maxn];
queue<int> q;

void dfs(int u) {
    val[u] = 1;
	for(auto v : p[u]) dfs(v), val[u] += val[v];
	cur += val[u]; cnt++;
}

ll bfs(int u) {
    int i;
    memset(vis,0,sizeof(vis));
	for(i=1;i<=n;i++) p[i].clear();

	vis[u] = 1;
	q.push(u);
	while(!q.empty()) {
		int x = q.front(); q.pop();
		for(auto y : way[x]) {
			if(!vis[y]) {
				vis[y] = 1;
				p[x].push_back(y);
				q.push(y);
			}
		}
	}

	cur = cnt = 0;
	dfs(u);
	if(cnt==n) return cur;
	return inf;
}
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:46:16: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
bosses.cpp:48:17: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&k);
                 ^
bosses.cpp:50: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 2316 KB Output is correct
2 Correct 0 ms 2316 KB Output is correct
3 Correct 0 ms 2316 KB Output is correct
4 Correct 0 ms 2316 KB Output is correct
5 Correct 0 ms 2316 KB Output is correct
6 Correct 0 ms 2316 KB Output is correct

Subtask #2
45.0 / 45.0

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

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2316 KB Output is correct
2 Correct 0 ms 2316 KB Output is correct
3 Correct 0 ms 2316 KB Output is correct
4 Correct 0 ms 2316 KB Output is correct
5 Correct 0 ms 2316 KB Output is correct
6 Correct 0 ms 2316 KB Output is correct
7 Correct 0 ms 2316 KB Output is correct
8 Correct 0 ms 2316 KB Output is correct
9 Correct 0 ms 2316 KB Output is correct
10 Correct 1 ms 2316 KB Output is correct
11 Correct 0 ms 2316 KB Output is correct
12 Correct 6 ms 2448 KB Output is correct
13 Correct 2 ms 2448 KB Output is correct
14 Correct 380 ms 2448 KB Output is correct
15 Correct 44 ms 2448 KB Output is correct
16 Correct 1292 ms 2580 KB Output is correct
17 Execution timed out 1500 ms 2712 KB Execution timed out
18 Halted 0 ms 0 KB -