题目链接:
题目大意:
给出你一个矩阵,然后你只能从左上角起用一个矩形将围出的部分修改,问修改成指定样子需要多少步
题目分析:
这道题就是最最恶心的英语题,题看懂了一切都迎刃而解
主要就是枚举与当前点与右下角的曼哈顿距离,然后枚举满足这个距离的点集,作为右下角进行矩形染色,因为他们都是互不影响的,如果他们当前的颜色就是合法颜色,那么跳过,依次类推,染到左上角就好了,最坏复杂度是n^2*m^2,比较小,可做
代码如下:
原谅我人挫代码更挫。。。。
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <queue>
#define MAX 107
using namespace std;
int n,m,ans;
char s[MAX][MAX];
int mp[MAX][MAX];
struct Node
{
int x,y;
Node ( int a , int b )
{
x = a;
y = b;
}
};
int get ( char ch )
{
if ( ch == 'W' ) return 1;
else return -1;
}
/*void bfs ( int x , int y )
{
queue<Node> q;
q.push ( Node(x,y) );
while ( !q.empty() )
{
Node u = q.front();
q.pop();
int x = u.x;
int y = u.y;
if ( x <= 0 || y <= 0 ) continue;
int d = get(s[x][y]) - mp[x][y];
if ( d )
{
for ( int i = 1 ; i <= x ; i++ )
for ( int j = 1 ; j <= y ; j++ )
mp[i][j] += d;
ans++;
}
int tx = x-1 , ty = y;
if ( tx > 0 && ty > 0 ) q.push ( Node ( tx , ty ) );
tx = x , ty = y-1;
if ( tx > 0 && ty > 0 ) q.push ( Node ( tx , ty ) );
int tx = x-1 , ty = y;
}
}*/
void solve ( int x , int y )
{
ans = 1;
for ( int i = 1 ; i <= x ; i++ )
for ( int j = 1 ; j <= y ; j++ )
mp[i][j] = get ( s[x][y] );
for ( int i = 1 ; i < x+y-1 ; i++ )
for ( int j = 0 ; j <= i; j++ )
{
int tx = x-j;
int ty = y-i+j;
if ( tx <= 0 || ty <= 0 ) continue;
int d = get ( s[tx][ty] ) - mp[tx][ty];
if ( d )
{
for ( int k = 1 ; k <= tx ; k++ )
for ( int t = 1 ; t <= ty ; t ++ )
mp[k][t] += d;
ans++;
}
}
}
int main ( )
{
while ( ~scanf ( "%d%d" , &n , &m ) )
{
for ( int i = 1 ; i <= n ; i++ )
scanf ( "%s" , s[i]+1 );
for ( int i = 0 ; i <= n+1 ; i++ )
memset ( mp , 0 , sizeof ( mp ) );
ans = 0;
solve ( n , m );
printf ( "%d\n" , ans );
}
}