답안 #828759

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
828759	2023-08-17T15:21:48 Z	ZeroCool	Awesome Arrowland Adventure (eJOI19_adventure)	C++14	100 / 100	43 ms	7308 KB

adventure

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

#define int long long
#define mp make_pair
#define pb push_back

using ll = long long;
using ld = long double;


void solve(int T);
void pre();

const int mxn = 1e5 + 5;
const int SQRT = 500;
const int LOG = 20;
const int inf = 1e18;
const int mod = 1e9 + 7;
const ld eps = 1e-9;

int32_t main(){
	pre();
	int tt = 1;
	//cin>>tt;
	for(int i = 1;i<=tt;i++)solve(i);
    return 0;
}



void pre(){
	#ifdef ONLINE_JUDGE
    ios::sync_with_stdio(false);
    cin.tie(0);
	#endif
	
}

int dir[4][2] = {
	{0,-1}, //N
	{1,0}, // E
	{0,1},//  S
	{-1,0}//  W
};

int val(char c){
	if(c == 'N')return 0;
	if(c == 'E')return 1;
	if(c == 'S')return 2;
	if(c == 'W')return 3;
	return -1;
}

struct Node{
	int x;
	int y;
	int cost;
};

bool operator<(Node a,Node b){
	return a.cost > b.cost;
}

int n,m;

bool in(int x,int y){
	return x >= 0 && y >= 0 && x<n && y < m;
}

void solve(int T){
	cin>>n>>m;
	char A[n][m];
	bool vis[n][m];

	for(int i = 0;i<n;i++){
		for(int j = 0;j<m;j++){
			char c;
			cin>>c;
			vis[i][j] = false;
			A[i][j] = c;
		}
	}

	priority_queue<Node> pq;
	pq.push({0,0,0});

	while(pq.size()){
		Node t = pq.top();
		pq.pop();
		int x = t.x;
		int y = t.y;
		int cost = t.cost;
		if(vis[x][y])continue;
		vis[x][y] = true;

		int arrow = val(A[x][y]);
		
		if(x == n-1 && y == m-1){
			cout<<cost<<endl;
			return;
		}
		if(arrow == -1)continue;
		for(int i = 0;i<4;i++){
			int d = (i + arrow)% 4;

			int nx = x + dir[d][1];
			int ny = y + dir[d][0];

			if(!in(nx,ny))continue;
			if(!vis[nx][ny])pq.push({nx,ny,cost + i});
		}
	}
	cout<<-1<<endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

#	결과	메모리	Grader output
1	Correct	212 KB	Output is correct
2	Correct	212 KB	Output is correct
3	Correct	212 KB	Output is correct
4	Correct	212 KB	Output is correct

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	1 ms	296 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	1 ms	296 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	300 KB	Output is correct
9	Correct	1 ms	296 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	0 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	296 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	340 KB	Output is correct
18	Correct	1 ms	300 KB	Output is correct
19	Correct	0 ms	300 KB	Output is correct
20	Correct	0 ms	304 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	0 ms	300 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	1 ms	300 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	1 ms	300 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	4 ms	360 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	5 ms	340 KB	Output is correct
38	Correct	2 ms	340 KB	Output is correct
39	Correct	42 ms	1072 KB	Output is correct
40	Correct	42 ms	1112 KB	Output is correct
41	Correct	11 ms	1036 KB	Output is correct
42	Correct	41 ms	1100 KB	Output is correct
43	Correct	43 ms	7308 KB	Output is correct
44	Correct	9 ms	1012 KB	Output is correct

답안 #828759

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 12.0 / 12.0

Subtask #4 16.0 / 16.0

Subtask #5 50.0 / 50.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
12.0 / 12.0

Subtask #4
16.0 / 16.0

Subtask #5
50.0 / 50.0