Submission #4342766

---

Source Code Expand

#include <bits/stdc++.h>
#include <bitset>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;
typedef vector<vector<int> > vvi;
typedef vector<int> vi;
typedef vector<string> vst;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
 
int dy[]={0, 0, 1, -1, 0};
int dx[]={1, -1, 0, 0, 0};


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);  


    int n,m;
    cin >> n >> m;
    vvi tmp(n,vi(n,0));
    REP(i,m) {
        int x,y;
        cin >> x >> y;
        x--;y--;
        tmp[x][y] = tmp[y][x] = 1;
    }
    REP(i,n)tmp[i][i] = 1;

    int maxi=0;

    REP(i,1<<n){
        vi id;
        REP(j,n) if(i & (1<<j)) id.pb(j);

        bool f=true;
        REP(j,id.size()){
            REP(k,id.size()){
                if(tmp[id[j]][id[k]]==0) f=false;
            }
        }
        if(f)maxi=max(maxi,(int)id.size());
    }

    cout << maxi << endl;
    
    return 0;
}

Submission Info

Judge Result