forked from mpfeifer1/Kattis
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcoloring.cpp
70 lines (58 loc) · 1.35 KB
/
coloring.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
vector<int> split(string s) {
vector<string> temp = {""};
for(auto i : s) {
if(i == ' ') {
temp.push_back("");
}
else {
temp.back().push_back(i);
}
}
vector<int> ret;
for(auto i : temp) {
ret.push_back(stoi(i));
}
return ret;
}
int main() {
int n;
cin >> n;
vector<vector<bool>> adj;
adj.resize(n, vector<bool>(n, false));
cin.ignore();
for(int i = 0; i < n; i++) {
string s;
getline(cin, s);
for(auto j : split(s)) {
adj[i][j] = true;
}
}
int best = 2;
for(int mask = 0; mask < (1<<n); mask++) {
vector<int> subset;
for(int i = 0; i < n; i++) {
if(mask & (1<<i)) {
subset.push_back(i);
}
}
if(subset.size() <= best) {
continue;
}
bool clique = true;
for(int i = 0; i < subset.size(); i++) {
for(int j = i+1; j < subset.size(); j++) {
if(!adj[subset[i]][subset[j]]) {
clique = false;
break;
}
}
if(!clique) break;
}
if(clique) {
best = max(best, (int)subset.size());
}
}
cout << best << endl;
}