oj.uz

Submission #124783

# Submission time Handle Problem Language Result Execution time Memory
124783 2019-07-04T01:59:01 Z model_code Political Development (BOI17_politicaldevelopment) C++17
100 / 100
 617 ms 7724 KB 
#include<iostream>
#include<vector>
#include<cstdio>
#include<queue>
#include<algorithm>
#include<bitset>

using namespace std;

int n,k;
vector<int> degree;
vector<vector<int> > G, Gshort;
vector<int> degOrdering;
vector<int> degOrderingPos;

//for debugging;
vector<int> maxCliqueFound;


void readInput() {
	scanf("%d%d", &n, &k);
	degree = vector<int> (n,0);
	for(int i = 0; i < n; ++i) {
		scanf("%d", &(degree[i]));
		G.push_back(vector<int> (degree[i], 0));
		for(int j = 0; j < degree[i]; ++j) {scanf("%d", &(G[i][j]));}
	}
}

void makeDegeneracyOrdering() {
		queue<int> Q;
		vector<int> reducedDegree(degree);
		
		for(int i = 0; i < n; ++i) {if(reducedDegree[i] <= k) Q.push(i);}
		
		while(!Q.empty()) {
			int v = Q.front(); Q.pop();
			degOrdering.push_back(v);
			for(int i = 0; i < G[v].size(); ++i) {
				int u = G[v][i];
				reducedDegree[u]--;
				if(reducedDegree[u] == k) Q.push(u);
		}}
		
		degOrderingPos = vector<int> (n,0);
		for(int i = 0; i < n; ++i) {degOrderingPos[degOrdering[i]] = i;}
}

void makeReducedAdjacencyList() {
	Gshort = vector<vector<int> > (n);
	for(int i = 0; i < n; ++i) {
		for(int j = 0; j < G[i].size(); ++j) {
			int u = G[i][j];
			if(degOrderingPos[i] < degOrderingPos[u]) Gshort[i].push_back(u);
}}}			

int isAdjacent(int i, int j) {
	if(degOrderingPos[i] > degOrderingPos[j]) return isAdjacent(j, i);
	if(i==j) return 1;
	for(int p = 0; p < Gshort[i].size(); ++p) {if(Gshort[i][p] == j) return 1;}
	return 0;
}

		
int maxCliqueSize(int pos) {
	// filter out active vertices
	vector<int> active(Gshort[pos]);
	active.push_back(pos);
	int t = active.size();
	//cerr << "num active vertices " << t << endl;
	
	// make adjacency matrix as bitmask
	vector<int> adj(t, 0);
	for(int i = 0; i < t; ++i) {
		for(int j = 0; j < t; ++j) {
			adj[i] |= isAdjacent(active[i],active[j]) << j;
	}}
	
	int ans = 0;
	int N = 1 << t;
	for(int s = 0; s < N; ++s) {
		// check if s is a clique:
		int isSet = s;
		for(int p = 0; p < t; ++p) {if(s & (1 << p)) isSet &= adj[p];}
		if(isSet != s) continue;
		
		int card = bitset<12>(s).count();
		ans = max(ans, card);
		
		// keep largest clique for debugginf
		if(card > maxCliqueFound.size()) {
			maxCliqueFound.clear();
			for(int i = 0; i < t; ++i) {if(s & (1 << i)) maxCliqueFound.push_back(active[i]);}
		}
	}
	return ans;
}

// ensure that the max clique found is actually a clique.
void assertClique() {
	for(int i = 0; i < maxCliqueFound.size(); ++i) {
		for(int j = 0; j < maxCliqueFound.size(); ++j) {
			if(i==j) continue;
			bool found = false;
			for(int p = 0; p < G[maxCliqueFound[j]].size(); ++p) {
				found |= G[maxCliqueFound[j]][p] == maxCliqueFound[i];
			}
			if(!found) {
				cerr << "WTF" << endl;
}}}}


int main() {
	readInput();
	makeDegeneracyOrdering();
	makeReducedAdjacencyList();
	
	int best = 0;
	for(int i = 0; i < n; ++i) {
		int c = maxCliqueSize(i); 
		best = max(best, c);	
	}
	
	assertClique();
	
	printf("%d\n", best);
	return 0;
}

Compilation message

politicaldevelopment.cpp: In function 'void makeDegeneracyOrdering()':
politicaldevelopment.cpp:39:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int i = 0; i < G[v].size(); ++i) {
                   ~~^~~~~~~~~~~~~
politicaldevelopment.cpp: In function 'void makeReducedAdjacencyList()':
politicaldevelopment.cpp:52:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < G[i].size(); ++j) {
                  ~~^~~~~~~~~~~~~
politicaldevelopment.cpp: In function 'int isAdjacent(int, int)':
politicaldevelopment.cpp:60:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int p = 0; p < Gshort[i].size(); ++p) {if(Gshort[i][p] == j) return 1;}
                 ~~^~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp: In function 'int maxCliqueSize(int)':
politicaldevelopment.cpp:91:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if(card > maxCliqueFound.size()) {
      ~~~~~^~~~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp: In function 'void assertClique()':
politicaldevelopment.cpp:101:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < maxCliqueFound.size(); ++i) {
                 ~~^~~~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:102:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < maxCliqueFound.size(); ++j) {
                  ~~^~~~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:105:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int p = 0; p < G[maxCliqueFound[j]].size(); ++p) {
                   ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp: In function 'void readInput()':
politicaldevelopment.cpp:21:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &n, &k);
  ~~~~~^~~~~~~~~~~~~~~~
politicaldevelopment.cpp:24:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &(degree[i]));
   ~~~~~^~~~~~~~~~~~~~~~~~~~
politicaldevelopment.cpp:26:44: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   for(int j = 0; j < degree[i]; ++j) {scanf("%d", &(G[i][j]));}
                                       ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 6 ms 1016 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 1020 KB Output is correct
7 Correct 6 ms 1016 KB Output is correct
8 Correct 3 ms 696 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 4 ms 696 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 6 ms 1016 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 1020 KB Output is correct
7 Correct 6 ms 1016 KB Output is correct
8 Correct 3 ms 696 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 4 ms 696 KB Output is correct
11 Correct 6 ms 1016 KB Output is correct
12 Correct 6 ms 1016 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 1016 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 7 ms 1016 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 6 ms 1016 KB Output is correct
19 Correct 3 ms 696 KB Output is correct
20 Correct 5 ms 888 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 4 ms 696 KB Output is correct
23 Correct 7 ms 888 KB Output is correct
24 Correct 4 ms 696 KB Output is correct
25 Correct 7 ms 888 KB Output is correct
26 Correct 6 ms 888 KB Output is correct
27 Correct 6 ms 888 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 6 ms 888 KB Output is correct
30 Correct 7 ms 1016 KB Output is correct
31 Correct 7 ms 888 KB Output is correct
32 Correct 7 ms 1016 KB Output is correct
33 Correct 7 ms 888 KB Output is correct
34 Correct 7 ms 888 KB Output is correct
35 Correct 4 ms 632 KB Output is correct
36 Correct 4 ms 632 KB Output is correct
37 Correct 4 ms 632 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 8 ms 892 KB Output is correct
41 Correct 3 ms 504 KB Output is correct
42 Correct 8 ms 1016 KB Output is correct
43 Correct 8 ms 888 KB Output is correct

Subtask #3
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 696 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 380 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 605 ms 7724 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 606 ms 7696 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 617 ms 7696 KB Output is correct
16 Correct 603 ms 7680 KB Output is correct
17 Correct 605 ms 7596 KB Output is correct
18 Correct 604 ms 7596 KB Output is correct

Subtask #4
38.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 6 ms 1016 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 1020 KB Output is correct
7 Correct 6 ms 1016 KB Output is correct
8 Correct 3 ms 696 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 4 ms 696 KB Output is correct
11 Correct 6 ms 1016 KB Output is correct
12 Correct 6 ms 1016 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 1016 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 7 ms 1016 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 6 ms 1016 KB Output is correct
19 Correct 3 ms 696 KB Output is correct
20 Correct 5 ms 888 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 4 ms 696 KB Output is correct
23 Correct 7 ms 888 KB Output is correct
24 Correct 4 ms 696 KB Output is correct
25 Correct 7 ms 888 KB Output is correct
26 Correct 6 ms 888 KB Output is correct
27 Correct 6 ms 888 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 6 ms 888 KB Output is correct
30 Correct 7 ms 1016 KB Output is correct
31 Correct 7 ms 888 KB Output is correct
32 Correct 7 ms 1016 KB Output is correct
33 Correct 7 ms 888 KB Output is correct
34 Correct 7 ms 888 KB Output is correct
35 Correct 4 ms 632 KB Output is correct
36 Correct 4 ms 632 KB Output is correct
37 Correct 4 ms 632 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 8 ms 892 KB Output is correct
41 Correct 3 ms 504 KB Output is correct
42 Correct 8 ms 1016 KB Output is correct
43 Correct 8 ms 888 KB Output is correct
44 Correct 38 ms 1016 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 9 ms 1016 KB Output is correct
47 Correct 15 ms 1016 KB Output is correct
48 Correct 8 ms 888 KB Output is correct
49 Correct 15 ms 1016 KB Output is correct
50 Correct 23 ms 1016 KB Output is correct
51 Correct 165 ms 1400 KB Output is correct
52 Correct 6 ms 888 KB Output is correct
53 Correct 272 ms 1528 KB Output is correct
54 Correct 340 ms 1528 KB Output is correct
55 Correct 6 ms 1016 KB Output is correct
56 Correct 6 ms 1016 KB Output is correct
57 Correct 3 ms 696 KB Output is correct
58 Correct 273 ms 1464 KB Output is correct
59 Correct 8 ms 888 KB Output is correct
60 Correct 6 ms 900 KB Output is correct
61 Correct 8 ms 888 KB Output is correct
62 Correct 8 ms 888 KB Output is correct
63 Correct 38 ms 1084 KB Output is correct
64 Correct 20 ms 1048 KB Output is correct
65 Correct 8 ms 888 KB Output is correct
66 Correct 8 ms 888 KB Output is correct
67 Correct 65 ms 1144 KB Output is correct
68 Correct 20 ms 1068 KB Output is correct
69 Correct 8 ms 888 KB Output is correct
70 Correct 22 ms 1016 KB Output is correct
71 Correct 63 ms 1120 KB Output is correct
72 Correct 58 ms 1144 KB Output is correct
73 Correct 6 ms 888 KB Output is correct
74 Correct 23 ms 1068 KB Output is correct
75 Correct 59 ms 1144 KB Output is correct
76 Correct 11 ms 888 KB Output is correct
77 Correct 118 ms 1192 KB Output is correct
78 Correct 6 ms 888 KB Output is correct
79 Correct 58 ms 760 KB Output is correct
80 Correct 11 ms 916 KB Output is correct
81 Correct 115 ms 1188 KB Output is correct
82 Correct 3 ms 504 KB Output is correct
83 Correct 59 ms 772 KB Output is correct
84 Correct 61 ms 1100 KB Output is correct
85 Correct 3 ms 508 KB Output is correct
86 Correct 61 ms 988 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 6 ms 760 KB Output is correct
4 Correct 6 ms 1016 KB Output is correct
5 Correct 6 ms 888 KB Output is correct
6 Correct 6 ms 1020 KB Output is correct
7 Correct 6 ms 1016 KB Output is correct
8 Correct 3 ms 696 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 4 ms 696 KB Output is correct
11 Correct 6 ms 1016 KB Output is correct
12 Correct 6 ms 1016 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 6 ms 1016 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 7 ms 1016 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 6 ms 1016 KB Output is correct
19 Correct 3 ms 696 KB Output is correct
20 Correct 5 ms 888 KB Output is correct
21 Correct 5 ms 888 KB Output is correct
22 Correct 4 ms 696 KB Output is correct
23 Correct 7 ms 888 KB Output is correct
24 Correct 4 ms 696 KB Output is correct
25 Correct 7 ms 888 KB Output is correct
26 Correct 6 ms 888 KB Output is correct
27 Correct 6 ms 888 KB Output is correct
28 Correct 6 ms 888 KB Output is correct
29 Correct 6 ms 888 KB Output is correct
30 Correct 7 ms 1016 KB Output is correct
31 Correct 7 ms 888 KB Output is correct
32 Correct 7 ms 1016 KB Output is correct
33 Correct 7 ms 888 KB Output is correct
34 Correct 7 ms 888 KB Output is correct
35 Correct 4 ms 632 KB Output is correct
36 Correct 4 ms 632 KB Output is correct
37 Correct 4 ms 632 KB Output is correct
38 Correct 3 ms 504 KB Output is correct
39 Correct 3 ms 504 KB Output is correct
40 Correct 8 ms 892 KB Output is correct
41 Correct 3 ms 504 KB Output is correct
42 Correct 8 ms 1016 KB Output is correct
43 Correct 8 ms 888 KB Output is correct
44 Correct 2 ms 372 KB Output is correct
45 Correct 107 ms 6824 KB Output is correct
46 Correct 58 ms 6352 KB Output is correct
47 Correct 103 ms 6864 KB Output is correct
48 Correct 100 ms 6912 KB Output is correct
49 Correct 42 ms 6632 KB Output is correct
50 Correct 107 ms 7240 KB Output is correct
51 Correct 104 ms 6784 KB Output is correct
52 Correct 42 ms 6572 KB Output is correct
53 Correct 41 ms 6572 KB Output is correct
54 Correct 16 ms 3696 KB Output is correct
55 Correct 109 ms 7240 KB Output is correct
56 Correct 32 ms 5552 KB Output is correct
57 Correct 42 ms 6616 KB Output is correct
58 Correct 56 ms 5932 KB Output is correct
59 Correct 32 ms 5668 KB Output is correct
60 Correct 31 ms 5660 KB Output is correct
61 Correct 57 ms 5932 KB Output is correct
62 Correct 53 ms 5912 KB Output is correct
63 Correct 67 ms 6188 KB Output is correct
64 Correct 31 ms 5676 KB Output is correct
65 Correct 83 ms 6496 KB Output is correct
66 Correct 46 ms 5804 KB Output is correct
67 Correct 67 ms 6316 KB Output is correct
68 Correct 77 ms 6408 KB Output is correct
69 Correct 82 ms 6496 KB Output is correct
70 Correct 45 ms 5836 KB Output is correct
71 Correct 78 ms 6408 KB Output is correct
72 Correct 62 ms 6408 KB Output is correct
73 Correct 91 ms 6456 KB Output is correct
74 Correct 45 ms 5904 KB Output is correct
75 Correct 36 ms 3220 KB Output is correct
76 Correct 64 ms 6536 KB Output is correct
77 Correct 92 ms 6456 KB Output is correct
78 Correct 46 ms 3372 KB Output is correct
79 Correct 36 ms 3252 KB Output is correct
80 Correct 17 ms 2012 KB Output is correct
81 Correct 46 ms 3392 KB Output is correct
82 Correct 71 ms 6060 KB Output is correct
83 Correct 17 ms 1972 KB Output is correct
84 Correct 70 ms 6060 KB Output is correct