#315871 (C) No.323 yuki国

• 問題: No.323 yuki国
• ユーザー: akakimidori
• 提出日時: 2019-02-10 18:21:20
• 言語: C (gcc 13.3.0)
• 結果: AC
• 実行時間: 72 ms / 5,000 ms
• コード長: 2,370 bytes
• コンパイル時間: 804 ms
• コンパイル使用メモリ: 31,744 KB
• 実行使用メモリ: 6,944 KB
• 最終ジャッジ日時: 2024-07-06 15:17:38
• 合計ジャッジ時間: 2,546 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 6
other	AC * 32

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
#include<stdio.h>
#include<stdlib.h>
typedef int DequeVal;
typedef struct Deque {
  DequeVal *array;
  size_t front;
  size_t last;
  size_t mask;
} Deque;
Deque* newDeque(void){
  const size_t len=2;
  Deque *d=(Deque *)calloc(len,sizeof(Deque));
  d->array=(DequeVal *)calloc(len,sizeof(DequeVal));
  d->front=d->last=0;
  d->mask=len-1;
  return d;
}
void initDeque(Deque *d){
  d->front=d->last=0;
}
void freeDeque(Deque *d){
  free(d->array);
  free(d);
}
int isEmpty(Deque *d){
  return d->front==d->last;
}
void deque_realloc(Deque *d){
  DequeVal *array=(DequeVal *)calloc(2*(d->mask+1),sizeof(DequeVal));
  size_t k=0;
  for(size_t i=d->front;i!=d->last;i=(i+1)&d->mask) array[k++]=d->array[i];
  free(d->array);
  d->array=array;
  d->front=0;
  d->last=k;
  d->mask=2*d->mask+1;
}
DequeVal pop_front(Deque *d){
  DequeVal res=d->array[d->front];
  d->front=(d->front+1)&d->mask;
  return res;
}
DequeVal pop_back(Deque *d){
  d->last=(d->last+d->mask)&d->mask;
  return d->array[d->last];
}
DequeVal get_front(Deque *d){
  return d->array[d->front];
}
DequeVal get_back(Deque *d){
  return d->array[(d->last+d->mask)&d->mask];
}
void push_front(Deque *d,DequeVal v){
  if(((d->last+1)&d->mask)==d->front){
    deque_realloc(d);
  }
  d->front=(d->front+d->mask)&d->mask;
  d->array[d->front]=v;
}
void push_back(Deque *d,DequeVal v){
  if(((d->last+1)&d->mask)==d->front){
    deque_realloc(d);
  }
  d->array[d->last]=v;
  d->last=(d->last+1)&d->mask;
}
#define POS(i,j,k) (((i)*h+(j))*w+(k))
void run(void){
  int h,w;
  scanf("%d%d",&h,&w);
  int a,sx,sy;
  scanf("%d%d%d",&a,&sx,&sy);
  int b,gx,gy;
  scanf("%d%d%d",&b,&gx,&gy);
  char *board=(char *)calloc(h*w+1,sizeof(char));
  for(int i=0;i<h;i++) scanf("%s",board+i*w);
  const int m=1111;
  char *used=(char *)calloc((m+1)*h*w,sizeof(char));
  Deque *q=newDeque();
  push_back(q,POS(a,sx,sy));
  while(!isEmpty(q)){
    int v=pop_front(q);
    int s=v/(h*w);
    int x=v/w%h;
    int y=v%w;
    if(s==0 || s==m) continue;
    int d[]={-1,0,1,0};
    for(int i=0;i<4;i++){
      int nx=x+d[i];
      int ny=y+d[i^1];
      if(0<=nx && nx<h && 0<=ny && ny<w){
    int ns=s+(board[nx*w+ny]=='*'?1:-1);
    if(used[POS(ns,nx,ny)]) continue;
    used[POS(ns,nx,ny)]=1;
    push_back(q,POS(ns,nx,ny));
      }
    }
  }
  puts(used[POS(b,gx,gy)]?"Yes":"No");
}
int main(void){
  run();
  return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX