oj.uz

Submission #114091

# Submission time Handle Problem Language Result Execution time Memory
114091 2019-05-30T06:11:13 Z rajarshi_basu Bosses (BOI16_bosses) C++14
100 / 100
 722 ms 760 KB 
#include <iostream>
#include <vector>
#include <set>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <complex>
#include <stack>
#include <set>
#include <fstream>

#define FOR(i,n) for(int i=0;i<n;i++)
#define FORE(i,a,b) for(int i=a;i<=b;i++)
#define ll long long int
#define vi vector<int>
#define v vector
#define ii pair<int,int>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define pll pair<ll,ll>
#define cd complex<double> 
#define iil pair<ii,ll>

const int INF = 1e9;
using namespace std;
const int MAXN = 151;



int main(){
	int n;
	cin >> n;
	vi g[n];
	FOR(i,n){
		int k;
		cin >> k;
		FOR(j,k){
			int a;cin >> a;
			a--;
			g[a].pb(i);
		}
	}
	int best = n;
	int mnsum = INF;
	FOR(i,n){
		bool vis[n];FOR(i,n)vis[i] = 0;
		int dpt[n];
		queue<ii> q;
		q.push({i,0});
		while(!q.empty()){
			auto e = q.front();q.pop();
			if(vis[e.ff])continue;
			vis[e.ff] = 1;
			dpt[e.ff] = e.ss;
			for(auto v:g[e.ff]){
				q.push({v,e.ss+1});
			}
		} 
		int mx = 0;
		//FOR(j,n)mx =max(mx,dpt[j]);
		int rchd = 0;
		FOR(j,n)if(vis[j])rchd++;
		if(rchd != n)continue;
		int sum = 0;
		FOR(j,n)sum += dpt[j]+1;
		mnsum = min(mnsum,sum);
	}
	cout << mnsum << endl;

	return 0;
}

Compilation message

bosses.cpp: In function 'int main()':
bosses.cpp:66:7: warning: unused variable 'mx' [-Wunused-variable]
   int mx = 0;
       ^~
bosses.cpp:50:6: warning: unused variable 'best' [-Wunused-variable]
  int best = n;
      ^~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 3 ms 256 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 27 ms 512 KB Output is correct
13 Correct 21 ms 512 KB Output is correct
14 Correct 166 ms 644 KB Output is correct
15 Correct 28 ms 640 KB Output is correct
16 Correct 631 ms 760 KB Output is correct
17 Correct 720 ms 640 KB Output is correct
18 Correct 722 ms 752 KB Output is correct