Submission #112263

---

Source Code Expand

#include <iostream>
using namespace std;
#define REP(i,a,b) for(int i=a;i<b;++i)
#define rep(i,n) REP(i,0,n)

int a[16][16];
int main()
{
    int n, m;
    cin>>n>>m;
    rep(i, m) {
        int x, y; cin>>x>>y;
        x--, y--;
        a[x][y]=1;
    }

    int res=0;
    rep(i, (1<<n)) {
        int v[12]={0};
        rep(j, n) if (i&(1<<j)) v[j]=1;

        bool ok=true;
        rep(j, n) REP(k, j+1, n) if (v[j]&&v[k]&&!a[j][k]) ok=false;
        if (ok) res=max(res, __builtin_popcount(i));
    }
    cout<<res<<endl;
    return 0;
}

Submission Info

Judge Result