Submission #110961

---

Source Code Expand

#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <list>
#include <cassert>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
#define EPS 1e-9
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;

bool g[12][12];
int main() {
	int n, m;
	cin >> n >> m;
	mset(g, 0);
	rep(i, m) {
		int x, y;
		cin >> x >> y; x --, y --;
		g[x][y] = g[y][x] = 1;
	}
	static bool dp[1<<12];
	mset(dp, 0);
	dp[0] = true;
	int x = 0;
	rep(i, 1<<n) if(dp[i]) {
		x = max(x, (int)__builtin_popcount(i));
		rep(j, n) if(~i >> j & 1) {
			bool ok = true;
			rep(k, n) if(i >> k & 1)
				ok &= g[j][k];
			if(ok) dp[i | 1 << j] = true;
		}
	}
	cout << x << endl;
	return 0;
}

Submission Info

Judge Result