답안 #976060

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
976060	2024-05-06T06:52:56 Z	vjudge1	Awesome Arrowland Adventure (eJOI19_adventure)	C++17	34 / 100	1 ms	348 KB

adventure

#include<bits/stdc++.h>
using namespace std;

int n, m, ans = 1e9+7;
char g[505][505];
void bf(int x, int y, int putar){
   // cout << x << ' ' << y << ' ' << putar << endl;
    if(x == n && y == m){
        ans = min(ans, putar);
    }else{
        if(g[x][y] == 'N'){
            if(y < m) bf(x, y + 1, putar + 1);
            if(x < n) bf(x + 1, y, putar + 2);
        }else if(g[x][y] == 'E'){
            if(y < m) bf(x, y + 1, putar);
            if(x < n) bf(x + 1, y, putar + 1);
        }else if(g[x][y] == 'S'){
            if(y < m) bf(x, y + 1, putar + 3);
            if(x < n) bf(x + 1, y, putar);
        }else if(g[x][y] == 'W'){
            if(y < m) bf(x, y + 1, putar + 2);
            if(x < n) bf(x + 1, y, putar + 3);
        }
    }
    
}
int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++) cin >> g[i][j];
    }
    bf(1, 1, 0);
    if(ans == 1e9+7) cout << -1;
    else cout << ans;
}
/*
3 3
ENS
SXN
WSX

N atas 
E kanan 
S bawah 
W kiri 

N -> E 
E -> S 
S -> W 
W -> N

4 3 
NXE
SNX 
XWN 
NNX 


*/

Subtask #1

10.0 / 10.0

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

Subtask #2

12.0 / 12.0

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

Subtask #3

12.0 / 12.0

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

Subtask #4

0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Incorrect	1 ms	344 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	344 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	1 ms	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	1 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	348 KB	Output is correct
22	Correct	0 ms	348 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	1 ms	348 KB	Output is correct
26	Incorrect	1 ms	344 KB	Output isn't correct
27	Halted	0 ms	0 KB	-