K Color Graph
题意:给定一个简单图,点个数<=16,对一些边涂色,使得该图中涂过色没有奇数的环,问涂色的边数最大为多少。
思路:如果一个图中不存在奇数环,那么这个图一定是二分图(首先如果没有环(树),那么一定是二分图,如果有偶数环,那么从左边的点出去到右边肯定是奇数次,如果要回到左边肯定得是偶数,所以粗略可得。)证明,然后点数很小,所以二进制枚举二分图左边的点数,取个最大值。
code
#pragma GCC optimize(2)
#include<bits/stdc++.h>
using namespace std;
const int man = 1e4+10;
#define IOS ios::sync_with_stdio(0)
template <typename T>
inline T read(){T sum=0,fl=1;int ch=getchar();
for(;!isdigit(ch);ch=getchar())if(ch=='-')fl=-1;
for(;isdigit(ch);ch=getchar())sum=sum*10+ch-'0';
return sum*fl;}
template <typename T>
inline void write(T x) {static int sta[35];int top=0;
do{sta[top++]= x % 10, x /= 10;}while(x);
while (top) putchar(sta[--top] + 48);}
template<typename T>T gcd(T a, T b) {return b==0?a:gcd(b, a%b);}
template<typename T>T exgcd(T a,T b,T &g,T &x,T &y){if(!b){g = a,x = 1,y = 0;}
else {exgcd(b,a%b,g,y,x);y -= x*(a/b);}}
#ifndef ONLINE_JUDGE
#define debug(fmt, ...) {printf("debug ");printf(fmt,##__VA_ARGS__);puts("");}
#else
#define debug(fmt, ...)
#endif
typedef long long ll;
const ll mod = 1e9+7;
vector<pair<int,int> >sp;
bool vis[20];
int main() {
#ifndef ONLINE_JUDGE
//freopen("in.txt", "r", stdin);
//freopen("out.txt","w",stdout);
#endif
IOS;
int t;
cin >>t;
int T = 1;
while(t--){
int n,m;
cin >> n >> m;
sp.clear();
memset(vis,0,sizeof(vis));
for(int i = 1;i <= m;++i){
int u,v;
cin >> u >> v;
sp.push_back(make_pair(u,v));
}
int ans = 0;
for(int i = 0;i < (1<<n);++i){
int tp = i;
for(int j = 1;j <= n;j++){
if(tp>>(j-1)&1)vis[j] = 1;
else vis[j] = 0;
}
int res = 0;
for(int j = 0;j < sp.size();++j){
if(vis[sp[j].first]!=vis[sp[j].second])res++;
}
ans = max(ans,res);
}
cout << "Case #" << T++ <<": ";
cout << ans << endl;
}
return 0;
}