oj.uz

Submission #936260

# Submission time Handle Problem Language Result Execution time Memory
936260 2024-03-01T13:45:34 Z wateronenn Bosses (BOI16_bosses) C++14
0 / 100
 1 ms 2904 KB 
#include<bits/stdc++.h>
using namespace std;

const int N = 1e5+9;
vector<int> g[N];
bool visit[N]={0};
int dfs(int u){
	visit[u] = true;
	int nub = 1;
	for(auto v : g[u]){
		if(!visit[v]){
			nub+=dfs(v);
		}
	}
	
	return nub;
}

int main(){
	cin.tie(0)->sync_with_stdio(false);
	int n,m;
	cin>>n;
	for(int i=1;i<=n;i++){
		int k;
		cin>>k;
		for(int j=1;j<=k;j++){
			cin>>m;
			g[i].push_back(m);
		}
	}
	int sum = 0;
	for(int i=1;i<=n;i++){
		if(!visit[i]) {
			int res = dfs(i);
		//	cout<<res<<" ";
			sum += 1<<(res-1);
		}

	}
	cout<<sum;
	
	return 0;
}
/*

4
1 4
3 1 3 4
2 1 2
1 3


*/

Subtask #1
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Incorrect 1 ms 2648 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Incorrect 1 ms 2648 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2904 KB Output is correct
2 Incorrect 1 ms 2648 KB Output isn't correct
3 Halted 0 ms 0 KB -