oj.uz

답안 #1119315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1119315 2024-11-26T18:48:16 Z Dan4Life Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 32 ms 10324 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
using ar4 = array<int,4>;
const int N = (int)5e2+10;
string s[N];
int X[] = {-1,0,1,0};
int Y[] = {0,1,0,-1};
int n, m, dis[N][N][5];

void bfs01(){
	deque<ar4> dq;
	memset(dis,0x3f,sizeof(dis));
	dq.pb({0,0,0,s[0][0]}); dis[0][0][s[0][0]]=0;
	while(sz(dq)){
		auto [D,i,j,d] = dq[0]; dq.pop_front();
		if(d==4) continue; 
		int x = i+X[d], y = j+Y[d]; d++; d%=4;
		if(x>=0 and y>=0 and x<n and y<m and dis[x][y][s[x][y]]>D)
			dis[x][y][s[x][y]]=D, dq.push_front({D,x,y,s[x][y]});
		if(dis[i][j][d]-1>D) dis[i][j][d]=D+1,dq.push_back({D+1,i,j,d});
	}
	int ans = N*N*N;
	for(int i : {0,1,2,3,4}) 
		ans=min(ans,dis[n-1][m-1][i]);
	if(ans==N*N*N) ans=-1; cout << ans;
}

int32_t main(){
	cin >> n >> m;
	for(int i = 0; i < n; i++){
		cin >> s[i];
		for(int j = 0; j < m; j++){
			char c = s[i][j];
			if(c=='N') c = 0;
			else if(c=='E') c = 1;
			else if(c=='S') c = 2;
			else if(c=='W') c = 3;
			else c = 4;
			s[i][j] = c;
		}
	}
	bfs01();
}

Compilation message

adventure.cpp: In function 'void bfs01()':
adventure.cpp:15:43: warning: array subscript has type 'char' [-Wchar-subscripts]
   15 |  dq.pb({0,0,0,s[0][0]}); dis[0][0][s[0][0]]=0;
      |                                           ^
adventure.cpp:20:57: warning: array subscript has type 'char' [-Wchar-subscripts]
   20 |   if(x>=0 and y>=0 and x<n and y<m and dis[x][y][s[x][y]]>D)
      |                                                         ^
adventure.cpp:21:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   21 |    dis[x][y][s[x][y]]=D, dq.push_front({D,x,y,s[x][y]});
      |                     ^
adventure.cpp:27:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   27 |  if(ans==N*N*N) ans=-1; cout << ans;
      |  ^~
adventure.cpp:27:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   27 |  if(ans==N*N*N) ans=-1; cout << ans;
      |                         ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5460 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 5 ms 5460 KB Output is correct
4 Correct 5 ms 5336 KB Output is correct
5 Correct 5 ms 5460 KB Output is correct
6 Correct 5 ms 5460 KB Output is correct
7 Correct 5 ms 5460 KB Output is correct
8 Correct 6 ms 5460 KB Output is correct
9 Correct 6 ms 5460 KB Output is correct
10 Correct 7 ms 5460 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5460 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 5 ms 5460 KB Output is correct
4 Correct 5 ms 5336 KB Output is correct
5 Correct 5 ms 5460 KB Output is correct
6 Correct 5 ms 5460 KB Output is correct
7 Correct 5 ms 5460 KB Output is correct
8 Correct 6 ms 5460 KB Output is correct
9 Correct 6 ms 5460 KB Output is correct
10 Correct 7 ms 5460 KB Output is correct
11 Correct 5 ms 5472 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 4 ms 5460 KB Output is correct
14 Correct 5 ms 5632 KB Output is correct
15 Correct 6 ms 5460 KB Output is correct
16 Correct 5 ms 5460 KB Output is correct
17 Correct 6 ms 5304 KB Output is correct
18 Correct 4 ms 5460 KB Output is correct
19 Correct 5 ms 5460 KB Output is correct
20 Correct 6 ms 5460 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 5460 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 5 ms 5504 KB Output is correct
4 Correct 5 ms 5460 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 5460 KB Output is correct
2 Correct 5 ms 5324 KB Output is correct
3 Correct 5 ms 5332 KB Output is correct
4 Correct 5 ms 5628 KB Output is correct
5 Correct 5 ms 5468 KB Output is correct
6 Correct 5 ms 5464 KB Output is correct
7 Correct 5 ms 5460 KB Output is correct
8 Correct 4 ms 5468 KB Output is correct
9 Correct 6 ms 5452 KB Output is correct
10 Correct 5 ms 5460 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5460 KB Output is correct
2 Correct 4 ms 5460 KB Output is correct
3 Correct 5 ms 5460 KB Output is correct
4 Correct 5 ms 5336 KB Output is correct
5 Correct 5 ms 5460 KB Output is correct
6 Correct 5 ms 5460 KB Output is correct
7 Correct 5 ms 5460 KB Output is correct
8 Correct 6 ms 5460 KB Output is correct
9 Correct 6 ms 5460 KB Output is correct
10 Correct 7 ms 5460 KB Output is correct
11 Correct 5 ms 5472 KB Output is correct
12 Correct 5 ms 5460 KB Output is correct
13 Correct 4 ms 5460 KB Output is correct
14 Correct 5 ms 5632 KB Output is correct
15 Correct 6 ms 5460 KB Output is correct
16 Correct 5 ms 5460 KB Output is correct
17 Correct 6 ms 5304 KB Output is correct
18 Correct 4 ms 5460 KB Output is correct
19 Correct 5 ms 5460 KB Output is correct
20 Correct 6 ms 5460 KB Output is correct
21 Correct 4 ms 5460 KB Output is correct
22 Correct 4 ms 5460 KB Output is correct
23 Correct 5 ms 5504 KB Output is correct
24 Correct 5 ms 5460 KB Output is correct
25 Correct 5 ms 5460 KB Output is correct
26 Correct 5 ms 5324 KB Output is correct
27 Correct 5 ms 5332 KB Output is correct
28 Correct 5 ms 5628 KB Output is correct
29 Correct 5 ms 5468 KB Output is correct
30 Correct 5 ms 5464 KB Output is correct
31 Correct 5 ms 5460 KB Output is correct
32 Correct 4 ms 5468 KB Output is correct
33 Correct 6 ms 5452 KB Output is correct
34 Correct 5 ms 5460 KB Output is correct
35 Correct 7 ms 5468 KB Output is correct
36 Correct 4 ms 5460 KB Output is correct
37 Correct 8 ms 5460 KB Output is correct
38 Correct 7 ms 5460 KB Output is correct
39 Correct 27 ms 6228 KB Output is correct
40 Correct 30 ms 6228 KB Output is correct
41 Correct 10 ms 6228 KB Output is correct
42 Correct 32 ms 6228 KB Output is correct
43 Correct 28 ms 10324 KB Output is correct
44 Correct 14 ms 6132 KB Output is correct