oj.uz

답안 #746527

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
746527 2023-05-22T16:28:42 Z pera Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 106 ms 5748 KB 
#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define ll long long
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

const ll mod = 1e9 + 7;

int dx[4] = {1 , -1 , 0 , 0};
int dy[4] = {0 , 0 , 1 , -1};

int w[4] = {2 , 4 , 1 , 3};

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	map<char , int> to;
	to['E'] = 1 , to['S'] = 2 , to['W'] = 3 , to['N'] = 4;
	int n , m;cin >> n >> m;
	vector<vector<int>> a(n + 1 , vector<int>(m + 1)) , d(n + 1 , vector<int>(m + 1));
	for(int i = 1;i <= n;i ++){
		for(int j = 1;j <= m;j ++){
			char c;cin >> c;
			a[i][j] = to[c];
		}
	}
	for(int i = 1;i <= n;i ++){
		for(int j = 1;j <= m;j ++){
			d[i][j] = INT_MAX;
		}
	}
	d[1][1] = 0;
	priority_queue<pair<int , pair<int , int>> , vector<pair<int , pair<int , int>>> , greater<pair<int , pair<int , int>>>> pq;
	pq.push({0 , {1 , 1}});
	while(!pq.empty()){
		auto x = pq.top(); pq.pop();
		int i = x.second.first , j = x.second.second , s = x.first;
		if(s != d[i][j] || !a[i][j]) continue;
		for(int k = 0;k < 4;k ++){
			int ti = i + dx[k] , tj = j + dy[k];
			if(1 <= ti && ti <= n && 1 <= tj && tj <= m){
				int c = 0;
				if(w[k] < a[i][j]) c = 4 - a[i][j] + w[k];
				else c = w[k] - a[i][j];
			//	cout << i << " " << j << "  to : " << ti << " " << tj << " c: " << c << endl;
				if(s + c < d[ti][tj]){
					d[ti][tj] = s + c;
					pq.push({d[ti][tj] , {ti , tj}});
				}
			}
		}
	}/*
	for(int i = 1;i <= n;i ++){
		for(int j = 1;j <= m;j ++){
			cout << d[i][j] << " ";
		}
		cout << endl;
	}*/
	cout << (d[n][m] == INT_MAX ? -1 : d[n][m]) << endl;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 320 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 320 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 320 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 316 KB Output is correct
25 Correct 1 ms 320 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 316 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 0 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 312 KB Output is correct
35 Correct 5 ms 468 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 6 ms 468 KB Output is correct
38 Correct 2 ms 596 KB Output is correct
39 Correct 55 ms 2592 KB Output is correct
40 Correct 64 ms 2588 KB Output is correct
41 Correct 9 ms 2516 KB Output is correct
42 Correct 57 ms 2580 KB Output is correct
43 Correct 106 ms 5748 KB Output is correct
44 Correct 10 ms 2512 KB Output is correct