Submission #448035

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
448035	2021-07-28T15:27:23 Z	bigo	Awesome Arrowland Adventure (eJOI19_adventure)	C++14	22 / 100	1 ms	204 KB

adventure

#include <bits/stdc++.h>
#include <cmath>
using namespace std;
typedef unsigned long long ll;
int main() {
	int n, m;
	cin >> n >> m;
	vector<char>vec(m);
	for (int i = 0; i < m; i++) {
		cin >> vec[i];
	}
	bool flag = true;
	for (int i = 0; i < m - 1; i++) {
		if (vec[i] == 'X') {
			cout << -1;
			flag = false;
			break;
		}
	}
	if (flag) {
		vector<int>vec1(m-1);
		for (int i = 0; i < m - 1; i++) {
			if (vec[i] == 'N')
				vec1[i] = 1;
			if (vec[i] == 'E')
				vec1[i] = 2;
			if (vec[i] == 'S')
				vec1[i] = 3;
			if (vec[i] == 'W')
				vec1[i] = 4;
		}
		ll ans = 0;
		for (int i = 0; i < m - 1; i++) {
			if (vec1[i] > 2) {
				ans += 4 - abs(vec1[i] - 2);
			}
			else {
				ans += abs(vec1[i] - 2);
			}
		}
		cout << ans;
	}
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 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
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 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	1 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
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 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	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 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	0 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct

Subtask #3

0 / 12.0

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

Subtask #4

0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 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	1 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
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	0 ms	204 KB	Output is correct
9	Correct	0 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	0 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 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	0 ms	204 KB	Output is correct
20	Correct	1 ms	204 KB	Output is correct
21	Correct	0 ms	204 KB	Output is correct
22	Incorrect	0 ms	204 KB	Output isn't correct
23	Halted	0 ms	0 KB	-