Luogu P2335[SDOI2005]位图

最新推荐文章于 2024-03-01 17:25:54 发布

hhuhao

最新推荐文章于 2024-03-01 17:25:54 发布

阅读量338

点赞数 1

分类专栏：最短路径

本文链接：https://blog.csdn.net/hhuhao/article/details/71154256

版权

最短路径专栏收录该内容

1 篇文章 0 订阅

订阅专栏

直接一层一层推，就A了。

/*************************************************************************
    > File Name: 2335.cpp
    > Author: huhao
    > Mail: 826538400@qq.com 
    > Created Time: 2017/5/3 星期三 19:00:34
 ************************************************************************/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#include<string>
#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
#include<set>
#include<queue>
using namespace std;
#define inf 0x3f3f3f3f
#define eps 1e-8
#define rt return
#define gc getchar()
#define ll long long
#define fr(i,a,b) for(int i=a,_end_=b;i<=_end_;i++)
#define fd(i,a,b) for(int i=a,_end_=b;i>=_end_;i--)
void SWAP(int a,int b)
{
    a^=b^=a^=b;
}
int read()
{
    int r=1,t=0;
    char c=gc;
    while(c<'0'||c>'9')
    {
        if(c=='-')
            r=-1;
        else
            r=1;
        c=gc;
    }
    while(c>='0'&&c<='9')
    {
        t=t*10+c-48;
        c=gc;
    }
    rt r*t;
}
char readchar(int x,int y)
{
    char c=gc;
    while(c<x||c>y)
        c=gc;
    rt c;
}
int ans[160][160],n,m;
bool check()
{
    fr(i,1,n)
        fr(j,1,m)
            if(ans[i][j]!=min(ans[i][j],min(min(ans[i+1][j],ans[i-1][j]),min(ans[i][j+1],ans[i][j-1]))+1))
                rt 1;
    rt 0;
}
int main()
{
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
    n=read();
    m=read();
    fr(i,0,n+1)
        fr(j,0,m+1)
            ans[i][j]=inf;
    fr(i,1,n)
        fr(j,1,m)
            ans[i][j]=read()?0:inf;
    while(check())
        fr(i,1,n)
            fr(j,1,m)
                ans[i][j]=min(ans[i][j],min(min(ans[i+1][j],ans[i-1][j]),min(ans[i][j+1],ans[i][j-1]))+1);//把答案与四周比较，取优
    fr(i,1,n)
        fr(j,1,m)
            printf("%d%c",ans[i][j],j==m?'\n':' ');
    rt 0;
}

时间复杂度 $O(nm(n+m))$

#1
AC
0ms/11980kB

#2
AC
0ms/11980kB

#3
AC
1ms/11980kB

#4
AC
3ms/11980kB

#5
AC
0ms/11980kB

#6
AC
0ms/11980kB

#7
AC
0ms/11980kB
#8
AC
0ms/2269kB

#9
AC
0ms/11980kB

#10
AC
0ms/11980kB

 Accepted
100  3ms /  11.38MB
代码：0.68KB C++ [SDOI2005]位图
By rushcheyo @2017-05-01 00:20:06
  Accepted


100  4ms /  11.7MB
代码：1.64KB C++11 [SDOI2005]位图
By huhao @2017-05-03 20:15:32
  Accepted                                 [me]


100  8ms /  15.58MB
代码：1.35KB C++11 [SDOI2005]位图
By Davidson @2017-05-01 20:21:19
  Accepted
100  11ms /  18.12MB
代码：0.81KB C++ [SDOI2005]位图
By jpwang @2016-08-17 10:21:49
  Accepted
100  12ms /  18.16MB
代码：1.22KB Pas [SDOI2005]位图
By Space_chicken @2016-08-17 09:55:12
  Accepted
100  13ms /  10.77MB
代码：0.89KB Pas [SDOI2005]位图
By gdygdy @2016-08-26 20:05:25
  Accepted
100  14ms /  16.56MB
代码：0.8KB C++ [SDOI2005]位图
By lijialin @2017-02-10 14:40:45
  Accepted
100  14ms /  16.7MB
代码：0.76KB C++ [SDOI2005]位图
By 化学小哥 @2017-02-10 17:09:50
  Accepted
100  16ms /  16.37MB
代码：0.83KB C++ [SDOI2005]位图
By lijialin @2017-02-10 10:00:33
  Accepted
100  21ms /  12.19MB
代码：2.15KB C++11 [SDOI2005]位图
By huhao @2017-05-03 20:21:33
  Accepted
100  24ms /  16.7MB
代码：1.7KB C++ [SDOI2005]位图
By Blackie @2016-10-07 23:01:22
  Accepted
100  25ms /  26.12MB
代码：1.19KB C++ [SDOI2005]位图
By wzhwzhwzh @2016-08-24 21:56:52
  Accepted
100  26ms /  5.79MB
代码：1.02KB C++11 [SDOI2005]位图
By DexterYue @2017-03-18 11:18:39
  Accepted
100  30ms /  16.21MB
代码：1KB C++11 [SDOI2005]位图
By 东吴四杰 @2017-03-23 07:31:27
  Accepted
100  36ms /  16.03MB
代码：1.14KB C++ [SDOI2005]位图
By skylee @2017-03-19 19:54:54
  Accepted
100  37ms /  24.2MB
代码：1.51KB C++ [SDOI2005]位图
By wzhwzhwzh @2016-09-29 21:41:47
  Accepted
100  38ms /  26.12MB
代码：1.17KB C++ [SDOI2005]位图
By wzhwzhwzh @2016-08-24 22:08:16
  Accepted
100  41ms /  16.35MB
代码：1.09KB C++ [SDOI2005]位图
By ws_ccd @2016-10-21 18:07:20
  Accepted
100  46ms /  16.33MB
代码：0.81KB C++11 [SDOI2005]位图
By 归零者 @2017-03-17 15:22:32
  Accepted
100  46ms /  16.37MB
代码：0.9KB C++11