Submission #8069314

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

 
#define rep(i,n) for(int i=0 ; i<(n) ; i++)
#define repr(i,n) for(int i=(n) ; i>=0 ; i--)
#define ALL(x) (x).begin(),(x).end()

typedef long long ll;
typedef unsigned long long ull;
 
const ll INF = 1LL<<60;
const int mINF = 1e9;
const int MOD = 1e9+7;

template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

template<typename T>
T GCD(T a,T b){ return b ? GCD(b,a%b) : a ;}
template<typename T>
T LCM(T a,T b){ return a*b / GCD(a,b) ;}

template<typename T>//文字列の置換/Boost:replace_all()
T replace_str(T str, string target, string str_to) {
    string::size_type pos = 0;
    while (pos = str.find(target, pos), pos != string::npos) {
        str.replace(pos, target.length(), str_to);
        pos += str_to.length();
    }
    return str;
}

int main(){
    int n;cin >> n;
    int m;cin >> m;
    vector<int> friends(n);
    rep(i,n)friends[i] = 1<<i;
    rep(i,m){
        int x,y;cin >> x >> y;
        x--;y--;
        friends[x] |= (1<<y);
        friends[y] |= (1<<x);
    }
    int ans = 0;
    for(int b=0;b<(1<<n);b++){
        int tmp = 0;
        for(int i=0;i<n;i++)if(b & (1<<i))tmp++;
        int check = 0;
        for(int i=0;i<n;i++){
            if((b & friends[i])==b)check++;
        }
        if(tmp==check)chmax(ans,tmp);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result