题目链接
思考了一会,发现是状压dp,
dp[sta][j], 状态为sta,最后填j号矩形的最小值。
注意的是每个矩形(除了最上面的)都有自己的先导状态。我们必须记录。这里我用pre[i]记录。即如果想填色第i块。必须达到的状态。详细记录过程看代码。比较好懂。
//mp[i][j]意思是(i,j)坐标位置,被那个编号的矩形占用了(-1为空)
for (int i = 0; i < n; i++)
{
for (int j = m[i].y1; j< m[i].y2; j++)
{
if (m[i].x1 == 0)
{
dp[1<<i][i] = 1;//顺便判定起始条件。
continue;
}
pre[i] |= (1 << mp[m[i].x1-1][j]);
if (pre[i]==0) dp[1<<i][i] = 1;
}
}
记录好先导状态后,就是标准状压dp。对于从第j个矩形转移到第k个,如果两个矩形颜色一样则权值为0,否则为1。
下面是ac代码:
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#define ll long long
using namespace std;
const int inf = 0x3f3f3f3f;
struct Node
{
int x1, x2, y1, y2;
int g;
}m[32];
int mp[128][128];
int dp[1<<17][20];
int pre[32];
int main()
{
int n;
cin >> n;
memset(mp, -1, sizeof(mp));
memset(dp, inf, sizeof(dp));
for (int i = 0; i < n; i++)
{
scanf("%d%d%d%d%d", &m[i].x1, &m[i].y1, &m[i].x2, &m[i].y2, &m[i].g);
for (int k = m[i].x1; k < m[i].x2; k++)
for (int j = m[i].y1; j < m[i].y2; j++)
mp[k][j] = i;
}
// for (int i = 0; i <= 6; i++)
// {
// for (int j = 0; j <= 6; j++)
// cout <<mp[i][j] <<" ";
// cout <<endl;
// }
for (int i = 0; i < n; i++)
{
for (int j = m[i].y1; j< m[i].y2; j++)
{
if (m[i].x1 == 0)
{
dp[1<<i][i] = 1;
continue;
}
pre[i] |= (1 << mp[m[i].x1-1][j]);
if (pre[i]==0) dp[1<<i][i] = 1;
}
}
int mx = (1<<n)-1;
for (int sta = 0; sta <= mx; sta++)
{
for (int j = 0; j < n; j++)
{
if (dp[sta][j] == inf) continue;
for (int k = 0; k < n; k++)
{
if (j==k) continue;
if (sta&(1<<k)) continue;
if (!(sta&(1<<j))) continue;
if ((sta|pre[k]) != sta) continue;
dp[sta|(1<<k)][k] = min(dp[sta|(1<<k)][k], dp[sta][j] + (m[j].g != m[k].g));
}
}
}
int ans = inf;
for (int i = 0; i < n; i++) ans = min(ans, dp[mx][i]);
printf("%d\n", ans);
return 0;
}