結果

問題 No.157 2つの空洞
ユーザー LayCurse
提出日時 2015-02-27 01:07:21
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 3,007 bytes
コンパイル時間 1,738 ms
コンパイル使用メモリ 161,892 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-23 22:02:20
合計ジャッジ時間 2,289 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 16
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘void reader(double*)’:
main.cpp:15:29: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   15 | void reader(double *x){scanf("%lf",x);}
      |                        ~~~~~^~~~~~~~~
main.cpp: In function ‘int main()’:
main.cpp:26:44: warning: ‘res’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   26 | template<class T> void writerLn(T x){writer(x,'\n');}
      |                                      ~~~~~~^~~~~~~~
main.cpp:44:7: note: ‘res’ was declared here
   44 |   int res;
      |       ^~~
main.cpp:58:20: warning: ‘sj’ may be used uninitialized in this function [-Wmaybe-uninitialized]
   58 |   gridGetDistCost01(X,Y,cost,si,sj,dist,mem);
      |   ~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:58:20: warning: ‘si’ may be used uninitialized in this function [-Wmaybe-uninitialized]

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
#define ll long long
#define ull unsigned ll
void reader(int *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x
    =(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(ll *x){int k,m=0;*x=0;for(;;){mygc(k);if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){*x=k-'0';break;}}for(;;){mygc(k);if(k<'0'||k>'9')break;*x
    =(*x)*10+k-'0';}if(m)(*x)=-(*x);}
void reader(double *x){scanf("%lf",x);}
int reader(char c[]){int i,s=0;for(;;){mygc(i);if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF) break;}c[s++]=i;for(;;){mygc(i);if(i==' '||i=='\n'||i
    =='\r'||i=='\t'||i==EOF) break;c[s++]=i;}c[s]='\0';return s;}
template <class T, class S> void reader(T *x, S *y){reader(x);reader(y);}
template <class T, class S, class U> void reader(T *x, S *y, U *z){reader(x);reader(y);reader(z);}
template <class T, class S, class U, class V> void reader(T *x, S *y, U *z, V *w){reader(x);reader(y);reader(z);reader(w);}
void writer(int x, char c){int s=0,m=0;char f[10];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0'
    );mypc(c);}
void writer(ll x, char c){int s=0,m=0;char f[20];if(x<0)m=1,x=-x;while(x)f[s++]=x%10,x/=10;if(!s)f[s++]=0;if(m)mypc('-');while(s--)mypc(f[s]+'0');mypc
    (c);}
void writer(double x, char c){printf("%.15f",x);mypc(c);}
void writer(const char c[]){int i;for(i=0;c[i]!='\0';i++)mypc(c[i]);}
void writer(const char x[], char c){int i;for(i=0;x[i]!='\0';i++)mypc(x[i]);mypc(c);}
template<class T> void writerLn(T x){writer(x,'\n');}
template<class T, class S> void writerLn(T x, S y){writer(x,' ');writer(y,'\n');}
template<class T, class S, class U> void writerLn(T x, S y, U z){writer(x,' ');writer(y,' ');writer(z,'\n');}
template<class T> void writerArr(T x[], int n){int i;if(!n){mypc('\n');return;}rep(i,n-1)writer(x[i],' ');writer(x[n-1],'\n');}
char memarr[17000000]; void *mem = memarr;
#define MD 1000000007
void gridGetDistCost01(int X, int Y, int *cost, int sx, int sy, int *res, void *mem, int d=4){int i,j,k,x,y,XY=X*Y,s[8]={-1,1,0,0,-1,1,-1,1},t[8]={0,0
    ,-1,1,-1,-1,1,1},*q=(int*)mem,l,r;l=r=X*Y+1;q[r++]=sx*Y+sy;rep(i,XY)res[i]=-1;res[sx*Y+sy]=0;while(l!=r){k=q[l++];sx=k/Y;sy=k%Y;rep(i,d){x=sx+s[i]
    ;y=sy+t[i];j=x*Y+y;if(x<0||x>=X||y<0||y>=Y||cost[j]==-1)continue;if(res[j]==-1){res[j]=res[k]+cost[j];if(cost[j]==0)q[--l]=j;else q[r++]=j;}}}}
int X, Y;
char mp[222][222];
int cost[10000], dist[10000];
int main(){
  int i, j, k;
  int si, sj, ei, ej;
  int res;
  reader(&Y,&X);
  rep(i,X) reader(mp[i]);
  rep(i,X) rep(j,Y){
    cost[i*Y+j] = 0;
    if(mp[i][j]=='#') cost[i*Y+j] = 1;
  }
  rep(i,X) rep(j,Y) if(mp[i][j]=='.'){
    si = i;
    sj = j;
  }
  gridGetDistCost01(X,Y,cost,si,sj,dist,mem);
  rep(i,X*Y) if(dist[i]!=0 && cost[i]==0) res = dist[i];
  writerLn(res);
  return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0