Submission #448066

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
448066	2021-07-28T17:08:55 Z	bigo	Awesome Arrowland Adventure (eJOI19_adventure)	C++14	34 / 100	1 ms	332 KB

adventure

#include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
const ll sz = 500;
const ll INF = 1e18;
ll n, m;
#define pii pair<ll,ll>
vector<vector<pii>>gra;
vector<ll> dist;
bitset<sz>done;
void solve(ll su) {
	for (ll i = 0; i < n*m; i++) {
		dist[i] = INF;
	}
	dist[su] = 0;
	priority_queue<pii, vector<pii>, greater<pii>>pq;
	pq.push({ 0,su });
	while (!pq.empty()) {
		pii tmp = pq.top();
		pq.pop();
		ll u = tmp.second, d = tmp.first;
		if (done[u])
			continue;
		done[u] = true;
		for (auto ii : gra[tmp.second]) {
			ll v = ii.first, w = ii.second;
			if (dist[v] > dist[u] + w) {
				dist[v] = dist[u] + w;
				pq.push({ dist[v],v });
			}
		}
	}
}
int main() {
	cin >> n >> m;
	vector<vector<char>>vec1(n, vector<char>(m));
	for (ll i = 0; i < n; i++) {
		for (ll j = 0; j < m; j++) {
			cin >> vec1[i][j];
		}
	}
	vector<vector<ll>>vec(n, vector<ll>(m));
	for (ll i = 0; i < n; i++) {
		for (ll j = 0; j < m; j++) {
			if (vec1[i][j] == 'N')
				vec[i][j] = 1;
			if (vec1[i][j] == 'E')
				vec[i][j] = 2;
			if (vec1[i][j] == 'S')
				vec[i][j] = 3;
			if (vec1[i][j] == 'W')
				vec[i][j] = 4;
		}
	}
	ll tmp = 0;
	dist.resize(n * m);
	gra.resize(n * m);
	for (ll i = 0; i < n; i++) {
		for (ll j = 0; j < m; j++) {
			if (vec1[i][j] != 'X') {
				if (i != 0) {
					gra[tmp].push_back({ tmp - m,vec[i][j] - 1 });
				}
				if (i != n - 1) {
					if (vec[i][j] > 3)
						gra[tmp].push_back({ tmp + m,4 - (vec[i][j] - 3) });
					else
						gra[tmp].push_back({ tmp + m,3 - vec[i][j] });
				}
				if (j != m - 1) {
					if (vec[i][j] > 2)
						gra[tmp].push_back({ tmp + 1,4 - (vec[i][j] - 2) });
					else
						gra[tmp].push_back({ tmp + 1,2 - vec[i][j] });
				}
				if (j != 0) {
					gra[tmp].push_back({ tmp - 1 ,4 - vec[i][j] });
				}
			}
			tmp++;
		}
	}
	solve(0);
	if (dist[n * m - 1] == INF)
		cout << -1;
	else
		cout << dist[n * m - 1];
}

Compilation message

adventure.cpp: In function 'void solve(ll)':
adventure.cpp:22:22: warning: unused variable 'd' [-Wunused-variable]
   22 |   ll u = tmp.second, d = tmp.first;
      |                      ^

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct

Subtask #2

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	204 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	332 KB	Output is correct

Subtask #3

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct

Subtask #4

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	332 KB	Output is correct
2	Incorrect	0 ms	204 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

Subtask #5

0 / 50.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	332 KB	Output is correct
14	Correct	0 ms	204 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	332 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Correct	1 ms	204 KB	Output is correct
23	Correct	0 ms	204 KB	Output is correct
24	Correct	0 ms	204 KB	Output is correct
25	Correct	1 ms	332 KB	Output is correct
26	Incorrect	0 ms	204 KB	Output isn't correct
27	Halted	0 ms	0 KB	-