Submission #864659

# Submission time Handle Problem Language Result Execution time Memory
864659 2023-10-23T11:33:16 Z maks007 Political Development (BOI17_politicaldevelopment) C++14
4 / 100
4 ms 856 KB
// Bismi Allah
#include "bits/stdc++.h"

using namespace std;

signed main () {
	int n, k, T = 1, f = 0;
	cin >> n >> k;
	vector <int> g[n], used(n);
	function <void(int)> dfs=[&](int v) {
		used[v] = T ++;
		for(auto u : g[v]) {
			if(!used[u]) dfs(u);
			else if(used[v] - used[u] == 2) {
				f = 3;
			}
		}
	};
	for(int i = 0; i < n; i ++) {
		int sz;
		cin >> sz;
		if(sz) f = 2;
		for(int v;sz>=1;sz--) {
			cin >> v;
			g[i].push_back(v);
		}
	}
	if(k == 1) {
		cout << 1;
	}else
	if(!f) cout << 1;
	else {
		if(k <= 2) {
			cout << 2;
			return 0;
		}
		for(int i = 0; i < n; i ++) {
			if(!used[i]) dfs(i);
		}
		cout << f;
	}
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Incorrect 3 ms 604 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
6 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Incorrect 3 ms 604 KB Output isn't correct
13 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 3 ms 604 KB Output is correct
4 Correct 3 ms 712 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 3 ms 856 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Incorrect 3 ms 604 KB Output isn't correct
13 Halted 0 ms 0 KB -