#include <bits/stdc++.h>
using namespace std;
int w[305];
struct result {
int total;
vector<int> nodes;
result() : total(0) {}
result(int t, const vector<int>& n) : total(t), nodes(n) {}
bool operator< (const result& other) const {
return total < other.total;
}
};
struct graph {
vector<int> u;
map<int, vector<int>> e;
void dfs(int x, graph& puni, bool* vis) {
vis[x] = true;
puni.u.push_back(x);
for (int y : e[x]) {
puni.e[x].push_back(y);
if (!vis[y]) {
dfs(y, puni, vis);
}
}
}
vector<graph> find_cc() {
vector<graph> r;
bool vis[305] = {0};
for (int x : u) {
if (!vis[x]) {
r.push_back(graph());
dfs(x, r.back(), vis);
}
}
return r;
}
graph complement() {
graph r;
r.u = u;
for (int x : u) {
bool ima[305] = {0};
for (int y : e[x]) {
ima[y] = true;
}
for (int y : u) {
if (!ima[y] && y != x) {
r.e[x].push_back(y);
}
}
}
return r;
}
result max_clique() {
if (u.size() == 1) {
int x = u[0];
return {w[x], {x}};
}
auto cc = find_cc();
if (cc.size() == 1) {
return complement().max_independent();
}
result r;
for (auto g : cc) {
r = max(r, g.max_clique());
}
return r;
}
result max_independent() {
if (u.size() == 1) {
int x = u[0];
return {w[x], {x}};
}
auto cc = find_cc();
if (cc.size() == 1) {
return complement().max_clique();
}
result r;
for (auto g : cc) {
auto t = g.max_independent();
r.total += t.total;
copy(t.nodes.begin(), t.nodes.end(), back_inserter(r.nodes));
}
return r;
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cerr.tie(nullptr);
graph g;
int n, m;
cin >> n >> m;
for (int i=1; i<=n; i++) {
cin >> w[i];
g.u.push_back(i);
}
for (int i=1; i<=m; i++) {
int u, v;
cin >> u >> v;
g.e[u].push_back(v);
g.e[v].push_back(u);
}
auto r = g.max_clique();
cout << r.total << '\n' << r.nodes.size() << '\n';
for (int x : r.nodes) {
cout << x << ' ';
}
} Write, Run & Share C++ code online using OneCompiler's C++ online compiler for free. It's one of the robust, feature-rich online compilers for C++ language, running on the latest version 17. Getting started with the OneCompiler's C++ compiler is simple and pretty fast. The editor shows sample boilerplate code when you choose language as C++ and start coding!
OneCompiler's C++ online compiler supports stdin and users can give inputs to programs using the STDIN textbox under the I/O tab. Following is a sample program which takes name as input and print your name with hello.
#include <iostream>
#include <string>
using namespace std;
int main()
{
string name;
cout << "Enter name:";
getline (cin, name);
cout << "Hello " << name;
return 0;
}
C++ is a widely used middle-level programming language.
When ever you want to perform a set of operations based on a condition If-Else is used.
if(conditional-expression) {
//code
}
else {
//code
}
You can also use if-else for nested Ifs and If-Else-If ladder when multiple conditions are to be performed on a single variable.
Switch is an alternative to If-Else-If ladder.
switch(conditional-expression){
case value1:
// code
break; // optional
case value2:
// code
break; // optional
......
default:
code to be executed when all the above cases are not matched;
}
For loop is used to iterate a set of statements based on a condition.
for(Initialization; Condition; Increment/decrement){
//code
}
While is also used to iterate a set of statements based on a condition. Usually while is preferred when number of iterations are not known in advance.
while (condition) {
// code
}
Do-while is also used to iterate a set of statements based on a condition. It is mostly used when you need to execute the statements atleast once.
do {
// code
} while (condition);
Function is a sub-routine which contains set of statements. Usually functions are written when multiple calls are required to same set of statements which increases re-usuability and modularity. Function gets run only when it is called.
return_type function_name(parameters);
function_name (parameters)
return_type function_name(parameters) {
// code
}