oj.uz

Submission #994885

# Submission time Handle Problem Language Result Execution time Memory
994885 2024-06-08T08:10:26 Z Baytoro Bosses (BOI16_bosses) C++17
100 / 100
 474 ms 800 KB 
#include <bits/stdc++.h>
using namespace std;
#define fr first
#define sc second
#define pb push_back
#define int long long 
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
void fopn(string name){
	freopen((name+".in").c_str(),"r",stdin);
	freopen((name+".out").c_str(),"w",stdout);
}
const int N=5005;
vector<int> g[N];
int cnt[N];
int n;
int bfs(int x){
	vector<int> used(N);
	queue<pair<int,int> > dq;
	dq.push(make_pair(x,1));
	int res=1;
	used[x]=1;
	while(!dq.empty()){
		int k=dq.front().fr;
		int d=dq.front().sc;
		dq.pop();
		for(auto it: g[k]){
			if(!used[it]){
				dq.push(make_pair(it,d+1));
				res+=d+1;
				used[it]=1;
			}
		}
	}
	for(int i=1;i<=n;i++) 
		if(!used[i]) 
			return 1000000000;
	return res;
}
void solve(){
	cin>>n;
	for(int i=1;i<=n;i++){
		int k;cin>>k;
		for(int j=0;j<k;j++){
			int x;cin>>x;
			g[x].pb(i);
		}
	}
	int ans=1e9;
	for(int i=1;i<=n;i++){
		ans=min(ans,bfs(i));
	}
	cout<<ans<<endl;
}
signed main(){
	//fopn("paint");
	int t=1;//cin>>t;
	while(t--) solve();
}

Compilation message

bosses.cpp: In function 'void fopn(std::string)':
bosses.cpp:10:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |  freopen((name+".in").c_str(),"r",stdin);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
bosses.cpp:11:9: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |  freopen((name+".out").c_str(),"w",stdout);
      |  ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
22.0 / 22.0

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

Subtask #2
45.0 / 45.0

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

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 4 ms 604 KB Output is correct
13 Correct 3 ms 604 KB Output is correct
14 Correct 120 ms 604 KB Output is correct
15 Correct 5 ms 600 KB Output is correct
16 Correct 466 ms 604 KB Output is correct
17 Correct 456 ms 600 KB Output is correct
18 Correct 474 ms 800 KB Output is correct