oj.uz

Submission #208757

# Submission time Handle Problem Language Result Execution time Memory
208757 2020-03-12T06:34:44 Z arnold518 Bosses (BOI16_bosses) C++14
100 / 100
 724 ms 760 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;
int dist[MAXN+10];
vector<int> adj[MAXN+10];

int main()
{
	int i, j;

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

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

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:16:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
bosses.cpp:18:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
bosses.cpp:21:15: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   int t; scanf("%d", &t);
          ~~~~~^~~~~~~~~~
bosses.cpp:25: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 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 480 KB Output is correct
6 Correct 5 ms 504 KB Output is correct

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 480 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 6 ms 504 KB Output is correct
12 Correct 10 ms 504 KB Output is correct
13 Correct 9 ms 504 KB Output is correct
14 Correct 139 ms 760 KB Output is correct
15 Correct 11 ms 504 KB Output is correct
16 Correct 589 ms 760 KB Output is correct
17 Correct 719 ms 712 KB Output is correct
18 Correct 724 ms 716 KB Output is correct