Submission #112169

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <complex>
#include <cmath>
using namespace std;

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

  bool con[15][15]={};
  int N,M;
  cin >> N >> M;
  int a,b;
  for(int i=0;i<M;++i){
    cin >> a >> b;
    --a;--b;
    con[a][b] = con[b][a] = true;
  }

  int ans=0;
  for(int S = S << N ;--S;){
    int t=bitset<32>(S).count();
    if(t <= ans)continue;

    bool ok = true;
    for(int i=0;i<N;++i){
      for(int j=0;j<i;++j){
	if(S >> i & S >> j & 1 && !con[i][j]){
	  ok = false;
	}
      }
      if(ok) ans = t;
    }
  }
  cout << ans << endl;
}

Submission Info

Judge Result