@[努力变强的cbx](/space/show?uid=215614) 发一下全部代码吧qwq
by Erusel @ 2019-09-28 15:52:34
@[Loveti](/space/show?uid=53807)
#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
#define maxn 405
vector<int> gra[maxn];
bool book[maxn];
int cp[maxn];
void clear(int& n){
int i;
for(i = 0; i <= n; i++){
gra[i].clear();
}
fill(cp, cp+2*n+1, 0);
}
bool found(int u){
int i, v;
for(i = 0; i < gra[u].size(); i++){
v = gra[u][i];
if(book[v]==false){
book[v] = true;
if(cp[v]==0||found(cp[v])){
cp[v] = u;
return true;
}
}
}
return false;
}
int main()
{
int t, i, j, n, a, sum;
scanf("%d", &t);
while(t--){
sum = 0;
scanf("%d", &n);
for(i = 1; i <= n; i++){
for(j = 1; j <= n; j++){
scanf("%d", &a);
if(a == 1){
gra[i].push_back(j+n);
}
}
}
for(i = 1; i <= n; i++){
fill(book, book+2*n+1, false);
if(found(i)){
sum++;
}
}
//printf("%d\n", sum);
if(sum >= n){
printf("Yes\n");
}
else{
printf("No\n");
}
clear(n);
}
}
by 努力变强的cbx @ 2019-09-28 15:59:59
@[Loveti](/space/show?uid=53807)
dalao，我改回第一种方法，又可以了。。。
打扰了，应该是我其他地方弄错了。。。（尴尬而不失礼貌的微笑）
话说dalao这是我第二次遇到你了，您是住在洛谷了吗？？？？？
by 努力变强的cbx @ 2019-09-28 16:05:07
@[努力变强的cbx](/space/show?uid=215614) ？？？
by Erusel @ 2019-09-28 16:05:56
@[Loveti](/space/show?uid=53807)
在LCA模板题那里。缘分就是这么奇妙
by 努力变强的cbx @ 2019-09-28 16:11:37
@[努力变强的cbx](/space/show?uid=215614) 好像是的唉qwq
by Erusel @ 2019-09-28 16:13:41
@[Loveti](/space/show?uid=53807)
嘻嘻嘻嘻，给dalao递茶~~~
by 努力变强的cbx @ 2019-09-28 16:15:48
@[努力变强的cbx](/space/show?uid=215614) 我不是dalao qwq
by Erusel @ 2019-09-28 16:16:49
@[Loveti](/space/show?uid=53807)
哈哈哈哈哈哈哈哈!!!
by 努力变强的cbx @ 2019-09-28 16:21:00