oj.uz

Submission #854507

# Submission time Handle Problem Language Result Execution time Memory
854507 2023-09-27T19:06:21 Z IBory Conspiracy (POI11_kon) C++17
80 / 100
 1249 ms 35964 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAX = 5005;
bool G[MAX][MAX];
int N, V[MAX], out[MAX], no[MAX], cnt;

void Fail() {
	cout << 0;
	exit(0);
}

void DFS(int cur) {
	cnt++;
	for (int next = 1; next <= N; ++next) {
		if (V[next] || !G[cur][next]) continue;
		V[next] = 1;
		DFS(next);
	}
}

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	int ans = 1, E = 0;
	cin >> N;
	for (int i = 1; i <= N; ++i) {
		cin >> out[i];
		E += out[i];
		for (int j = 0; j < out[i]; ++j) {
			int n;
			cin >> n;
			G[i][n] = 1;
		}
	}

	int one = 0, comp = 0;
	vector<int> isolated;
	for (int i = 1; i <= N; ++i) {
		if (V[i]) continue;
		cnt = 0; V[i] = 1; DFS(i);
		if (cnt == 1) {
			one++;
			isolated.push_back(i);
		}
		else comp++;
	}

	if (comp > 1) Fail();

	int curNode = N - one;
	do {
		if (E == curNode * (curNode - 1)) break;
		int cand = 0, ec = 1e9;
		for (int i = 1; i <= N; ++i) {
			if (no[i]) continue;
			if (out[i] > 0 && ec > out[i]) {
				ec = out[i];
				cand = i;
			}
		}

		for (int i = 1; i <= N; ++i) {
			if (!G[cand][i]) continue;
			if (!G[i][cand]) Fail();
			out[i]--;
			G[cand][i] = 0;
			no[i] = 1;
		}

		if (!cand) Fail();

		out[cand] = 0;
		isolated.push_back(cand);
		E -= ec * 2;
	} while (--curNode);

	for (int i = 1; i <= N; ++i) {
		if (!out[i]) continue;
		int ok = 1;
		for (int n : isolated) {
			if (G[i][n]) {
				ok = 0;
				break;
			}
		}
		if (ok) ans++;
	}

	cout << ans;
	return 0;
}

Subtask #1
0 / 10.0

# 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 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 2 ms 2396 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 8796 KB Output is correct
2 Correct 36 ms 8796 KB Output is correct
3 Correct 147 ms 10816 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 8792 KB Output is correct
2 Correct 51 ms 10892 KB Output is correct
3 Correct 198 ms 12884 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 13136 KB Output is correct
2 Correct 117 ms 15188 KB Output is correct
3 Correct 357 ms 14932 KB Output is correct

Subtask #9
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 21076 KB Output is correct
2 Correct 257 ms 21072 KB Output is correct
3 Correct 729 ms 21596 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 538 ms 24912 KB Output is correct
2 Correct 439 ms 24916 KB Output is correct
3 Correct 1152 ms 24924 KB Output is correct
4 Incorrect 1249 ms 35964 KB Output isn't correct
5 Halted 0 ms 0 KB -