結果

問題 No.323 yuki国
ユーザー LayCurse
提出日時 2015-12-16 00:07:45
言語 C++11(廃止可能性あり)
(gcc 13.3.0)
結果
AC  
実行時間 137 ms / 5,000 ms
コード長 4,294 bytes
コンパイル時間 1,296 ms
コンパイル使用メモリ 161,524 KB
実行使用メモリ 27,980 KB
最終ジャッジ日時 2024-06-28 12:15:48
合計ジャッジ時間 4,277 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 6
other AC * 32
権限があれば一括ダウンロードができます
コンパイルメッセージ
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);}
      |                        ~~~~~^~~~~~~~~

ソースコード

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
struct dimensionCompress2 {
int B;
void set(int b){B=b;}
void set(int a, int b){B=b;}
int mask(int a, int b){return a*B+b;}
void para(int mask, int *a, int *b){*a=mask/B;*b=mask%B;}
};
struct dimensionCompress3 {
int B, C;
void set(int b, int c){B=b;C=c;}
void set(int a, int b, int c){B=b;C=c;}
int mask(int a, int b, int c){return(a*B+b)*C+c;}
void para(int mask, int *a, int *b, int *c){*a=mask/(B*C);*b=mask%(B*C)/C;*c=mask%C;}
};
struct dimensionCompress4 {
int B, C, D;
void set(int b, int c, int d){B=b;C=c;D=d;}
void set(int a, int b, int c, int d){B=b;C=c;D=d;}
int mask(int a, int b, int c, int d){return((a*B+b)*C+c)*D+d;}
void para(int mask, int *a, int *b, int *c, int *d){*a=mask/(B*C*D);*b=mask%(B*C*D)/(C*D);*c=mask%(C*D)/D;*d=mask%D;}
};
struct dimensionCompress5 {
int B, C, D, E;
void set(int b, int c, int d, int e){B=b;C=c;D=d;E=e;}
void set(int a, int b, int c, int d, int e){B=b;C=c;D=d;E=e;}
int mask(int a, int b, int c, int d, int e){return(((a*B+b)*C+c)*D+d)*E+e;}
void para(int mask, int *a, int *b, int *c, int *d, int *e){*a=mask/(B*C*D*E);*b=mask%(B*C*D*E)/(C*D*E);*c=mask%(C*D*E)/(D*E);*d=mask%(D*E)/E;*e
      =mask%E;}
};
int X, Y;
int A, Sx, Sy;
int B, Gx, Gy;
char mp[100][100];
int vis[4500000], st[4500000], sts;
int main(){
int i, j, k, mask, smask;
int x, y, s, nx, ny, ns, d;
int dx[4] = {-1,1,0,0}, dy[4] = {0,0,-1,1};
dimensionCompress3 dim;
reader(&X,&Y);
reader(&A,&Sx,&Sy);
reader(&B,&Gx,&Gy);
rep(i,X) reader(mp[i]);
dim.set(X, Y, 1800);
// k = B-A+Gx-Sa+Gy-Sy;
// if(k%2){ writerLn("No"); return 0; }
sts = 0;
mask = dim.mask(Sx,Sy,A);
vis[mask] = 1;
st[sts++] = mask;
while(sts){
mask = st[--sts];
dim.para(mask, &x, &y, &s);
if(x==Gx && y==Gy && s==B){
writerLn("Yes");
return 0;
}
rep(d,4){
nx = x + dx[d];
ny = y + dy[d];
if(nx < 0 || ny < 0 || nx >= X || ny >= Y) continue;
if(mp[nx][ny]=='.') ns = s-1; else ns = s+1;
if(ns <= 0 || ns >= 1800) continue;
smask = dim.mask(nx, ny, ns);
if(!vis[smask]) vis[smask] = 1, st[sts++] = smask;
}
}
writerLn("No");
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0