제출 #1128407

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1128407		stdfloat	Political Development (BOI17_politicaldevelopment)	C++20	16 / 100	3106 ms	314912 KiB

politicaldevelopment

#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
 
int mx;
 
vector<int> v;
 
vector<bool> vis;
 
vector<vector<bool>> edg;
 
vector<vector<int>> E;
 
void dfs(int x) {
	mx = max(mx, (int)v.size());
	for (auto i : E[x]) {
		if (vis[i]) continue;
 
		bool ok = true;
		for (auto j : v) {
			if (!edg[i][j] || !edg[j][i]) {
				ok = false;
				break;
			}
		}
 
		if (!ok) continue;
 
		vis[i] = true;
		v.push_back(i);
 
		dfs(i);
 
		vis[i] = false;
		v.pop_back();
	}
}
 
int main() {
	ios::sync_with_stdio(false); cin.tie(nullptr);
 
	int n, k;
	cin	>> n >> k;
 
	edg.assign(n, vector<bool>(n));
	for (int i = 0; i < n; i++) {
		int d;
		cin >> d;
		while (d--) {
			int y;
			cin >> y;
 
			edg[i][y] = true;
		}
	}
 
	E.assign(n, {});
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			if (edg[i][j] && edg[j][i]) {
				E[i].push_back(j);
				E[j].push_back(i);
			}
		}
	}
 
	for (int i = 0; i < n; i++) {
		v = {i};
		vis.assign(n, false);
		vis[i] = true;
 
		dfs(i);
	}
 
	cout << mx;
}

• Subtask 1: 4 / 4
• Subtask 2: 12 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 38
• Subtask 5: 0 / 23