제출 #840905

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
840905		serifefedartar	Political Development (BOI17_politicaldevelopment)	C++17	62 / 100	3045 ms	26956 KiB

politicaldevelopment

#include <bits/stdc++.h>
using namespace std;
 
#define fast ios::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
#define f first
#define s second
#define MOD 1000000007
#define LOGN 20
#define MAXN 200005

vector<set<int>> graph;
vector<pair<int,int>> degree;
int main() {
	fast
	int N, K, x, D; 
	cin >> N >> K;

	graph = vector<set<int>>(N, set<int>());
	degree = vector<pair<int,int>>(N);
	for (int i = 0; i < N; i++)
		degree[i] = {0, i};
	for (int i = 0; i < N; i++) {
		cin >> D;
		for (int j = 0; j < D; j++) {
			cin >> x;
			graph[x].insert(i);
			graph[i].insert(x);
			degree[i].f++;
			degree[x].f++;
		}
	}
	sort(degree.begin(), degree.end());

	int ans = 1;
	for (auto u : degree) {
		int node = u.s;
		int degree = graph[node].size();

		vector<int> adj;
		for (auto u : graph[node])
			adj.push_back(u);
		
		int mx_mask = (1<<degree) - 1;
		for (int msk = 1; msk <= mx_mask; msk++) {
			vector<int> taken;
			taken.push_back(node);
			bool check = true;
			for (int j = 0; j < degree; j++) {
				if ((1<<j) & msk) {
					for (auto u : taken) {
						if (graph[adj[j]].count(u) == 0)
							check = false;
					}
					taken.push_back(adj[j]);
				}
			}

			if (check)
				ans = max(ans, (int)taken.size());
		}

		for (auto u : graph[node])
			graph[u].erase(node);
	}
	cout << ans << "\n";
}

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