#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int map[150][150];
struct node
{
int x1,y1,x2,y2,co;
};
node bl[30];
int flag[30];
int maxx,minn=0x7fffffff;
int m;
int s[100];
int sn;
void dfs(int num,int co)
{
int fll=0;
for(int i=1;i<=m;i++)
if(flag[i]==0)
{
fll=1;
break;
}
if(fll==0)
{
minn=min(minn,num);
return;
}
for(int i=1;i<=m;i++)
{
if(flag[i]==0)
{
int fl=0;
for(int j=bl[i].x1;j<=bl[i].x2;j++)
if(map[j][bl[i].y1]==0)
{
fl=1;
break;
}
if(fl==1)continue;
if(bl[i].co==co)
{
for(int j=bl[i].x1;j<=bl[i].x2;j++)
map[j][bl[i].y2]=1;
flag[i]=1;
dfs(num,co);
flag[i]=0;
for(int j=bl[i].x1;j<=bl[i].x2;j++)
map[j][bl[i].y2]=0;
}
else if(bl[i].co!=co)
{
for(int j=bl[i].x1;j<=bl[i].x2;j++)
map[j][bl[i].y2]=1;
flag[i]=1;
dfs(num+1,bl[i].co);
flag[i]=0;
for(int j=bl[i].x1;j<=bl[i].x2;j++)
map[j][bl[i].y2]=0;
}
}
}
}
int main()
{
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d%d%d%d%d",&bl[i].y1,&bl[i].x1,&bl[i].y2,&bl[i].x2,&bl[i].co);
if(bl[i].y1==0)
s[++sn]=bl[i].co;
}
for(int i=1;i<=sn;i++)
{
memset(map,0,sizeof(map));
memset(flag,0,sizeof(flag));
for(int j=0;j<=99;j++)
map[j][0]=1;
dfs(1,s[i]);
}
printf("%d",minn);
return 0;
}
1445:平板涂色
最新推荐文章于 2022-08-18 19:03:47 发布