oj.uz

답안 #383267

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
383267 2021-03-29T11:28:44 Z MODDI Awesome Arrowland Adventure (eJOI19_adventure) C++14
50 / 100
 11 ms 3564 KB 
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vl vector<ll>
#define mp make_pair
#define pb push_back
using namespace std;
int n, m;
char mat[501][501];
vector<pii> G[25000];
bool in_range(int i, int j){
	if(i >= 0 && i < n && j >= 0 && j < m)
		return true;
	return false;
}
void dijkstra(){
	int dist[n * m];
	for(int i = 0; i < n * m; i++)
	{
		dist[i] = 1e9;
	}
	priority_queue<pii> pq;
	pq.push(mp(0,0));
	dist[0] = 0;
	while(!pq.empty()){
		pii state = pq.top();
		pq.pop();
		for(auto next : G[state.second]){
			int next_city = next.first, len = next.second;
			if(dist[next_city] > dist[state.second] + len){
				dist[next_city] = dist[state.second] + len;
				pq.push(mp(-dist[next_city], next_city));
			}
		}
	}
	if(dist[(n - 1) * m + m-1] == 1e9)
		cout<<-1<<endl;
	else
		cout<<dist[(n - 1) * m + m-1]<<endl;
}
int main(){
	cin>>n>>m;
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			cin>>mat[i][j];
		}
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(mat[i][j]=='X')
				continue;
			else if(mat[i][j]=='N'){
				if(in_range(i - 1, j))
					G[i * m + j].pb(mp((i-1)*m + j, 0));
				if(in_range(i + 1, j))
					G[i * m + j].pb(mp((i+1)*m + j, 2));
				if(in_range(i, j + 1))
					G[i * m + j].pb(mp(i*m + j + 1, 1));
				if(in_range(i, j - 1))
					G[i * m + j].pb(mp(i*m + j-1, 3));
			}
			else if(mat[i][j]=='E'){
				if(in_range(i - 1, j))
					G[i * m + j].pb(mp((i-1)*m + j, 3));
				if(in_range(i + 1, j))
					G[i * m + j].pb(mp((i+1)*m + j, 1));
				if(in_range(i, j + 1))
					G[i * m + j].pb(mp(i*m + j+1, 0));
				if(in_range(i, j - 1))
					G[i * m + j].pb(mp(i*m + j -1, 2));
			}
			else if(mat[i][j]=='S'){
				if(in_range(i - 1, j))
					G[i * m + j].pb(mp((i-1)*m + j, 2));
				if(in_range(i + 1, j))
					G[i * m + j].pb(mp((i+1)*m + j, 0));
				if(in_range(i, j + 1))
					G[i * m + j].pb(mp(i*m + j+1, 3));
				if(in_range(i, j - 1))
					G[i * m + j].pb(mp(i*m + j-1, 1));
			}
			else if(mat[i][j]=='W'){
				if(in_range(i - 1, j))
					G[i * m + j].pb(mp((i-1)*m + j, 1));
				if(in_range(i + 1, j))
					G[i * m + j].pb(mp((i+1)*m + j, 3));
				if(in_range(i, j + 1))
					G[i * m + j].pb(mp(i*m + j + 1, 2));
				if(in_range(i, j - 1))
					G[i * m + j].pb(mp(i*m + j-1, 0));
			}
		}
	}
	dijkstra();
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 876 KB Output is correct
2 Correct 1 ms 876 KB Output is correct
3 Correct 1 ms 876 KB Output is correct
4 Correct 1 ms 876 KB Output is correct
5 Correct 1 ms 876 KB Output is correct
6 Correct 1 ms 876 KB Output is correct
7 Correct 1 ms 876 KB Output is correct
8 Correct 1 ms 876 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 1 ms 876 KB Output is correct
11 Correct 1 ms 876 KB Output is correct
12 Correct 1 ms 876 KB Output is correct
13 Correct 1 ms 876 KB Output is correct
14 Correct 2 ms 876 KB Output is correct
15 Correct 1 ms 876 KB Output is correct
16 Correct 1 ms 876 KB Output is correct
17 Correct 1 ms 876 KB Output is correct
18 Correct 1 ms 876 KB Output is correct
19 Correct 1 ms 876 KB Output is correct
20 Correct 2 ms 876 KB Output is correct
21 Correct 1 ms 876 KB Output is correct
22 Correct 1 ms 876 KB Output is correct
23 Correct 1 ms 876 KB Output is correct
24 Correct 1 ms 876 KB Output is correct
25 Correct 2 ms 1004 KB Output is correct
26 Correct 1 ms 876 KB Output is correct
27 Correct 1 ms 876 KB Output is correct
28 Correct 1 ms 876 KB Output is correct
29 Correct 2 ms 1004 KB Output is correct
30 Correct 2 ms 1004 KB Output is correct
31 Correct 1 ms 876 KB Output is correct
32 Correct 1 ms 876 KB Output is correct
33 Correct 2 ms 876 KB Output is correct
34 Correct 1 ms 876 KB Output is correct
35 Correct 11 ms 1900 KB Output is correct
36 Correct 2 ms 1004 KB Output is correct
37 Runtime error 8 ms 3564 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -