codeforces CF37E Trial for Chief BFS最短路

\(\rightarrow\) 戳我进CF原题

E. Trial for Chief

time limit per test: 2 seconds
memory limit per test: 256 megabytes
input: standard input
output: standard output

 

Having unraveled the Berland Dictionary,
the scientists managed to read the notes of the chroniclers of that time.
For example, they learned how the chief of the ancient Berland tribe was chosen.
 
As soon as enough pretenders was picked, the following test took place among them:
the chief of the tribe took a slab divided by horizontal and vertical stripes into identical squares
(the slab consisted of $ N $ lines and $ M $ columns)
and painted every square black or white.
Then every pretender was given a slab of the same size but painted entirely white.
Within a day a pretender could paint any side-linked set of the squares of the slab some color.
The set is called linked if for any two squares belonging to the set
there is a path belonging the set on which any two neighboring squares share a side.
The aim of each pretender is to paint his slab in the exactly the same way as the chief’s slab is painted.
The one who paints a slab like that first becomes the new chief.
 
Scientists found the slab painted by the ancient Berland tribe chief.
Help them to determine the minimal amount of days
needed to find a new chief if he had to paint his slab in the given way.
 

Input

The first line contains two integers $ N $ and $ M (1 ≤ N, M ≤ 50) $ — the number of lines and columns on the slab.
The next $ N $ lines contain $ M $ symbols each — the final coloration of the slab.
$ W $ stands for the square that should be painted white and $ B $ — for the square that should be painted black.
 

Output

In the single line output the minimal number of repaintings of side-linked areas
needed to get the required coloration of the slab.
 

Examples

input1
 3 3
WBW
BWB
WBW
output1
 2

input2
 2 3
BBB
BWB
output2
 1

 

题目大意

  • 要把一块大小为 $ N \times M $ 的白木板的某些格子涂成黑色。

  • 每次可以选择一个连通块,全涂白或者全涂黑,问最少要涂几次。

  • $ N, M \le 50 $
     

题解

  • 每个点与周围颜色相同的格子连边权为 $ 0 $ 的边

  • 每个点与周围颜色不同的格子连边权为 $ 1 $ 的边

  • 求每个点到最远的黑格子的最短路,取 $ min+1 $ 就是答案。
     

代码

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
#define inf 1e9+7
#define maxn 2510
int fx[]={0,0,1,-1};
int fy[]={1,-1,0,0};
struct edge{ int v,w,nxt; }e[maxn<<2];
int n,m,head[maxn],tot,dis[maxn],col[60][60],pot[60][60],bk[maxn],ans=inf;
char ch[maxn];
bool vis[maxn],fb;
void add(int u,int v,int w){ e[++tot].v=v; e[tot].w=w; e[tot].nxt=head[u]; head[u]=tot; }
void bfs(int s){
    memset(dis,0x3f,sizeof(dis)); memset(vis,0,sizeof(vis)); queue<int>q;
    q.push(s); dis[s]=0; vis[s]=1;
    while(!q.empty()){
        int u=q.front(); q.pop(); vis[u]=0;
        for(int i=head[u];i;i=e[i].nxt)
            if(dis[e[i].v]>dis[u]+e[i].w){
                dis[e[i].v]=dis[u]+e[i].w;
                if(!vis[e[i].v]){ vis[e[i].v]=1; q.push(e[i].v); }
            }
    }
}
int main(){
    scanf("%d %d",&n,&m);
    for(int i=1;i<=n;++i){
        scanf("%s",ch);
        for(int j=1;j<=m;++j){
            col[i][j]=(ch[j-1]=='B');
            fb|=col[i][j];
            pot[i][j]=++pot[0][0];
            if(col[i][j]) bk[++bk[0]]=pot[i][j];
        }
    }
    if(!fb){ puts("0"); return 0; }
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j)
            for(int nx,ny,k=0;k<4;++k){
                nx=i+fx[k]; ny=j+fy[k];
                if(nx<1||nx>n||ny<1||ny>m) continue;
                add(pot[i][j],pot[nx][ny],col[i][j]!=col[nx][ny]);
            }
    for(int i=1;i<=n;++i)
        for(int j=1;j<=m;++j){
            bfs(pot[i][j]);
            int temp=0;
            for(int j=1;j<=bk[0];++j) temp=max(temp,dis[bk[j]]);
            ans=min(ans,temp);
        }
    printf("%d",ans+1);
    return 0;
}
/*
#        40098602
When     2018-07-09 05:31:27
Who      PotremZ 
Problem  E - Trial for Chief 
Lang     GNU C++
Verdict  Accepted
Time     436 ms
Memory   200 KB
*/

转载于:https://www.cnblogs.com/PotremZ/p/CF37E.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
"educational codeforces round 103 (rated for div. 2)"是一个Codeforces平台上的教育性比赛,专为2级选手设计评级。以下是有关该比赛的回答。 "educational codeforces round 103 (rated for div. 2)"是一场Codeforces平台上的教育性比赛。Codeforces是一个为程序员提供竞赛和评级的在线平台。这场比赛是专为2级选手设计的,这意味着它适合那些在算法和数据结构方面已经积累了一定经验的选手参与。 与其他Codeforces比赛一样,这场比赛将由多个问题组成,选手需要根据给定的问题描述和测试用例,编写程序来解决这些问题。比赛的时限通常有两到三个小时,选手需要在规定的时间内提交他们的解答。他们的程序将在Codeforces的在线评测系统上运行,并根据程序的正确性和效率进行评分。 该比赛被称为"educational",意味着比赛的目的是教育性的,而不是针对专业的竞争性。这种教育性比赛为选手提供了一个学习和提高他们编程技能的机会。即使选手没有在比赛中获得很高的排名,他们也可以从其他选手的解决方案中学习,并通过参与讨论获得更多的知识。 参加"educational codeforces round 103 (rated for div. 2)"对于2级选手来说是很有意义的。他们可以通过解决难度适中的问题来测试和巩固他们的算法和编程技巧。另外,这种比赛对于提高解决问题能力,锻炼思维和提高团队合作能力也是非常有帮助的。 总的来说,"educational codeforces round 103 (rated for div. 2)"是一场为2级选手设计的教育性比赛,旨在提高他们的编程技能和算法能力。参与这样的比赛可以为选手提供学习和进步的机会,同时也促进了编程社区的交流与合作。

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值