oj.uz

답안 #412294

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
412294 2021-05-26T16:48:10 Z ak2006 Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 244 ms 16024 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vc = vector<char>;
using vvc = vector<vc>;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
const vi dx = {-1,0,1,0};
const vi dy = {0,1,0,-1};
const int inf = 1e9;
void setIO()
{
	fast;
	// #ifndef ONLINE_JUDGE
	// freopen("input.txt","r",stdin);
	// freopen("output.txt","w",stdout);
	// #endif
}
int main()
{
	setIO();
	int n,m;//n rows, m columns
	cin>>n>>m;
	vvi g(n,vi(m));
	vvi dist(n,vi(m,inf));
	for (int i = 0;i<n;i++){
		for (int j = 0;j<m;j++){
			char x;
			cin>>x;
			if (x == 'N')g[i][j] = 0;
			if (x == 'E')g[i][j] = 1;
			if (x == 'S')g[i][j] = 2;
			if (x == 'W')g[i][j] = 3;
			if (x == 'X')g[i][j] = -1;
		}
	}
	priority_queue<vi>q;
	q.push({0,0,0});//{dist,i,j}
	dist[0][0] = 0;
	while (!q.empty()){
		int i = q.top()[1],j = q.top()[2];
		q.pop();
		if (g[i][j] == -1)continue;
		int x = g[i][j];
		int y = (x + 1)%4;
		int ni = i + dx[x];
		int nj = j + dy[x];
		if (ni >= 0 && ni <= n - 1 && nj >= 0 && nj <= m - 1){
			if (dist[ni][nj] > dist[i][j]){
				dist[ni][nj] = dist[i][j];
				q.push({-dist[ni][nj],ni,nj});
			}
		}
		int num = 1;
		while (y != x){
			ni = i + dx[y];
			nj = j + dy[y];
			if (ni >= 0 && ni <= n - 1 && nj >= 0 && nj <= m - 1){
				if (dist[ni][nj] > dist[i][j] + num){
					dist[ni][nj] = dist[i][j] + num;
					q.push({-dist[ni][nj],ni,nj});
				}
			}
			y = (y + 1)%4;
			num++;
		}
	}
	if (dist[n - 1][m - 1] >= inf)cout<<-1;
	else cout<<dist[n - 1][m - 1];
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 312 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 316 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 308 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 312 KB Output is correct
24 Correct 1 ms 204 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 312 KB Output is correct
35 Correct 8 ms 460 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 10 ms 584 KB Output is correct
38 Correct 2 ms 588 KB Output is correct
39 Correct 101 ms 2628 KB Output is correct
40 Correct 95 ms 2756 KB Output is correct
41 Correct 10 ms 2548 KB Output is correct
42 Correct 94 ms 2596 KB Output is correct
43 Correct 244 ms 16024 KB Output is correct
44 Correct 10 ms 2508 KB Output is correct