Submission #1024133

---

Source Code Expand

#include <bits/stdc++.h>
 
#define REP(i,n) for(int i=0; i<(int)(n); ++i)
#define FOR(i,k,n) for(int i=(k);i<(int)(n);++i)
typedef long long int ll;
using namespace std;

typedef pair<int, int> P;
int main(void) {
    int N, M;
    cin >> N >> M;
    vector<vector<int> > e(N, vector<int>(N, 0));
    REP(i, M) {
        int x, y;
        cin >> x >> y;
        --x; --y;
        e[x][y] = e[y][x] = 1;
    }
    int ans = 0;
    for(int dp=1; dp < pow(2, N); ++dp) {
        bool flag = true;
        REP(i, N) {
            REP(j, N) {
                if(i != j && (((dp >> i) & 1) && ((dp >> j) & 1) && e[i][j] != 1)) {
                    flag = false;
                    goto END;
                }
            }
        }
END:
        if(flag) {
            int p=0;
            REP(i, N) {
                if((dp >> i) & 1) p++;
            }
            ans = max(ans, p);
        }
    }
    cout << ans << endl;
}

Submission Info

Judge Result