很简单一个二分图题,可是我RE+MLE + WA了将近40次
百思不得其解的问题
当我直接在char 数组上存放序号就是RE, 而当我用另一个数组存放序号就是AC WHY????????
RE代码
AC 代码
#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <queue>
#include <vector>
using namespace std;
#define MAXN 666
char gra[MAXN][MAXN];
bool Map[MAXN][MAXN];
int mx[MAXN], my[MAXN];
int pos[MAXN][MAXN];
bool vis[MAXN];
int cnt, n;
int Move[4][2] = {{0,1}, {0,-1}, {1, 0}, {-1, 0}};
bool dfs( int u)
{
for( int i = 1; i < cnt; i++)
{
if(Map[u][i] && !vis[i])
{
vis[i] = 1;
if(my[i] == -1 || dfs(my[i]))
{
my[i] = u;
mx[u] = i;
return true;
}
}
}
return false;
}
int solve( )
{
memset(mx, -1, sizeof(mx));
memset(my, -1, sizeof(my));
int ans = 0;
for(int i = 1; i < cnt; i++)
{
if(mx[i] == -1)
{
memset(vis, 0, sizeof(vis));
if(dfs(i)) ans++;
}
}
return ans;
}
void get_map()
{
for( int i = 0; i < n; i++)
{
for( int j = 0; j < n; j++)
{
if(gra[i][j] == '#')
{
for( int k = 0; k < 4; k++)
{
int x = i + Move[k][0];
int y = j + Move[k][1];
if(x >= 0 && x < n && y >= 0 && y < n && gra[x][y] == '#')
Map[pos[i][j]][pos[x][y]] = 1;
}
}
}
}
}
int main()
{
int t, ca = 1;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
memset(Map, 0, sizeof(Map));
cnt = 1;
for( int i = 0; i < n; i++)
{
getchar();
for( int j = 0; j < n; j++)
{
scanf("%c",&gra[i][j]);
if(gra[i][j] == '#')
pos[i][j] = cnt++;
}
}
get_map();
int res = solve();
printf("Case %d: %d\n",ca++,res / 2);
}
return 0;
}