Submission #7058881

---

Source Code Expand

#include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9+7;
const long long LINF = 1e18;
#define dump(x)  cout << 'x' << ' = ' << (x) << ` `;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define REPR(i,n) for(int i=n;i>=0;i--)
#define FOREACH(x,a) for(auto& (x) : (a) )
typedef long long ll;
using namespace std;
typedef pair<ll, ll> P;

int main(int argc, char const *argv[]) {
    int n,m; cin>>n>>m;
    vector<vector<int>> g(n);
    rep(i,m) {
        int x,y; cin>>x>>y;
        --x,--y;
        g[x].push_back(y); g[y].push_back(x);
    }

    int ans = 0;

    for (int bit = 0; bit < (1<<n); ++bit) {
        vector<int> group;
        rep(i,n) if (bit & (1<<i)) group.push_back(i);

        bool ok = true;
        for (auto &&e: group) {
            vector<bool> exist(n,false);
            for (auto &&f: g[e]) exist[f] = true;
            for (auto &&f: group) if (!exist[f]) ok = false;
        }
        if (ok) ans = max(ans,(int)group.size());
    }

    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result