oj.uz

Submission #260286

# Submission time Handle Problem Language Result Execution time Memory
260286 2020-08-10T03:43:38 Z arnold518 Bosses (BOI16_bosses) C++14
100 / 100
 710 ms 888 KB 
#include <bits/stdc++.h>
using namespace std;

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

const int MAXN = 5000;

int N;
vector<int> adj[MAXN+10];
int dist[MAXN+10];

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

	ll ans=1e18;
	for(int i=1; i<=N; i++)
	{
		memset(dist, 0, sizeof(dist));
		queue<int> Q;
		Q.push(i); dist[i]=1;
		while(!Q.empty())
		{
			int now=Q.front(); Q.pop();
			for(auto nxt : adj[now])
			{
				if(dist[nxt]) continue;
				dist[nxt]=dist[now]+1; Q.push(nxt);
			}
		}
		ll t=0;
		for(int i=1; i<=N; i++)
		{
			if(dist[i]==0) t=1e18;
			t+=dist[i];
		}
		ans=min(ans, t);
	}
	printf("%lld\n", ans);
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:16:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
bosses.cpp:20:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &p);
   ~~~~~^~~~~~~~~~
bosses.cpp:24:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &v);
    ~~~~~^~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 139 ms 512 KB Output is correct
15 Correct 29 ms 512 KB Output is correct
16 Correct 571 ms 888 KB Output is correct
17 Correct 709 ms 760 KB Output is correct
18 Correct 710 ms 716 KB Output is correct