题解思路:已知一只马可以废掉8个位置,那么最优的方法就是让多匹马废掉的位置尽量相同就可以了。
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mx = 1e3 + 10;
const int N = 101;
const int dx[8] = {1,-1,2,-2,1,-1,2,-2};
const int dy[8] = {2,2,1,1,-2,-2,-1,-1};
int n,m,ans;
bool vis[mx][mx];
bool check(int x,int y)
{
if(x<=0||x>n) return 0;
if(y<=0||y>m) return 0;
return !vis[x][y];
}
struct node
{
int x,y,v;
node(){}
node(int xx,int yy,int vv):x(xx),y(yy),v(vv){}
};
void bfs(int x,int y)
{
queue<node> que;
ans++,vis[x][y] = 1;
que.push(node(x,y,0));
while(!que.empty()){
node no = que.front();
que.pop();
for(int i=0;i<8;i++){
int fx = no.x + dx[i];
int fy = no.y + dy[i];
if(check(fx,fy)){
vis[fx][fy] = 1;
ans += no.v;
que.push(node(fx,fy,no.v^1));
}
}
}
}
int main()
{
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
if(!vis[i][j]) bfs(i,j);
cout << ans << endl;
return 0;
}