Submission #521387

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i, n) for(int (i) = 0; (i) < (int)(n); ++(i))
#define rep1(i, n) for(int (i) = 1; (i) <= (int)(n); ++(i))
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long long int lli;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<lli> vlli;
typedef vector<vector<int>> vvi;
typedef vector<vector<double>> vvd;

int main(){
  int N, M;
  cin >> N >> M;
  bool A[12][12] = {false};
  rep(i, N) A[i][i] = true;
  rep(i, M){
    int x, y;
    cin >> x >> y;
    x--; y--;
    A[x][y] = true;
    A[y][x] = true;
  }

  int ans = 1;
  for(int i = 1; i < (1 << N); i++){
    vi man;
    for (int j = 0; j < N; ++j){
      if ((i >> j) % 2 == 1) man.push_back(j);
    }
    
    bool ok = true;
    int num = man.size();
    rep(j, num){
      for(int k = j; k < num; k++){
        if(!A[man[j]][man[k]]) ok = false;
      }
      if(!ok) break;
    }
    if(ok) ans = max(ans, num);
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result