qq_41780519的博客

There are a group of students. Some of them may know each other, while others don't. For example, A and B know each other, B and C know each other. But this may not imply that A and C know each other....

这个题是km算法板子题（加权二分图最大匹配）https://blog.youkuaiyun.com/chenshibo17/article/details/79933191不重复造轮子 这里推荐一篇博客 我感觉讲的很不错（这边建议如果不会匈牙利的话先学一下匈牙利比较好理解呢）贴一个板子//// Created by xingchaoyue on 2019/4/12.//#includ...

这个题还是属于二分匹配普通的二分匹配就是把边和列分别变成二分匹配中两边的点，两边点之间的线代表了图中该点是否可选择这个相当于为边和列加上了屏障 我们可以扩行和扩列如果存在X把行分成了两部分 那我们把边分成两份（我这里的操作是令mp[i+n][j]=1)列相同（相当于我把地图从n*n扩展成了2n*2n）#include<iostream>#include...

#include<iostream>#include<cstdio>#include<string.h>#include<vector>using namespace std;vector<int>ps[105];int linker[305];int used[305];int n,p;void init(int ...

先寻找二分图最大匹配然后根据最大匹配来判断匹配中的每个点是否是重要点（即删掉这个点匹配数是否变少）暴力循环判断一遍即可#include<iostream>#include<cstdio>#include<string.h>#include<vector>using namespace std;const int maxn = ...

https://blog.youkuaiyun.com/weyuli/article/details/10141881根据这篇博客作为模板