Submission #172958

---

Source Code Expand

#include<iostream>
#include<string>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<algorithm>

using namespace std;

int edge[13];

int main(){
	memset(edge,0,sizeof(edge));
	int n,m;cin>>n>>m;
	for(int i=0;i<n;i++) edge[i] |= (1<<i);
	for(int i=0;i<m;i++){
		int s,t;cin>>s>>t;
		s--;t--;
		edge[s] |= (1<<t);
		edge[t] |= (1<<s);
	}
	int size = 0;
	for(int i=0;i<(1<<n);i++){
		int ok = 1;
		for(int j=0;j<n;j++)if( (i&(1<<j)) > 0){
			if(i != (edge[j]&i) ) ok=0;
		}
		int tmpsize=0;
		for(int j=0;j<n;j++)if( i&(1<<j) ) tmpsize++;
		//cout<<i<<" "<<ok<<" "<<tmpsize<<endl;
		if (ok) size = max(tmpsize,size);
	}
	cout<<size<<endl;
}

Submission Info

Judge Result