QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#797215#9521. Giving Directions in HarbinSword1E1WA 1ms3616kbC++201.9kb2024-12-02 19:19:372024-12-02 19:19:38

Judging History

你现在查看的是最新测评结果

  • [2024-12-02 19:19:38]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3616kb
  • [2024-12-02 19:19:37]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long

#define dbg(x...) \
do { \
std::cout << #x << " -> "; \
err(x); \
} while (0)

void err() {
	std::cout << std::endl;
}

template<class T, class... Ts>
void err(T arg, Ts &... args) {
	std::cout << fixed << setprecision(10) << arg << ' ';
	err(args...);
}

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

void GENSHEN_START() {
	int n;cin >> n;
	vector <pair<char,int>> pi(n + 1);
	for (int i = 1;i <= n;i++) cin >> pi[i].first >> pi[i].second;
	vector <pair<char,int>> res;
	int now = -1;
	map <char,int> mp;
	mp['N'] = 0;
	mp['S'] = 1;
	mp['W'] = 2;
	mp['E'] = 3;
	vector <char> to(5);
	to[0] = 'N';
	to[1] = 'S';
	to[2] = 'W';
	to[3] = 'E';
	int st; 
	for (int i = 1;i <= n;i++) {
		auto [c,v] = pi[i];
		if (i == 1) {
			now = mp[c];
			st = now;
			res.push_back({'Z',v});
		}
		else {
			if (now == 0) {
				if (c == 'W') {
					res.push_back({'L',0});
					res.push_back({'Z',v});
				}
				else {
					res.push_back({'R',0});
					res.push_back({'Z',v});
				}
			}
			else if (now == 1) {
				if (c == 'W') {
					res.push_back({'R',0});
					res.push_back({'Z',v});
				}
				else {
					res.push_back({'L',0});
					res.push_back({'Z',v});
				}
			}
			else if (now == 2) {
				if (c == 'N') {
					res.push_back({'R',0});
					res.push_back({'Z',v});
				}
				else {
					res.push_back({'L',0});
					res.push_back({'Z',v});
				}
			}
			else {
				if (c == 'N') {
					res.push_back({'L',0});
					res.push_back({'Z',v});
				}
				else {
					res.push_back({'R',0});
					res.push_back({'Z',v});
				}
			}
		}
	}
	cout << res.size() << ' ' << to[st] << '\n';
	for (auto [c,v] : res) {
		if (c == 'Z') cout << c << ' ' << v << '\n';
		else cout << c << '\n';
	}
}

signed main()
{
	ios::sync_with_stdio(false);cin.tie(nullptr);
	int T = 1;
	cin >> T;
	while (T--) GENSHEN_START();
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3548kb

input:

1
2
S 2
E 1

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100
Wrong Answer
time: 0ms
memory: 3616kb

input:

99
4
E 6
N 1
W 2
S 8
8
W 10
N 1
E 10
S 2
E 2
N 2
W 2
S 1
9
N 5
E 4
N 7
E 6
S 9
E 8
N 4
W 6
N 7
6
N 6
E 6
N 8
W 9
S 7
E 2
8
E 6
S 9
W 5
S 4
W 6
N 4
E 5
N 9
8
N 6
W 10
N 6
W 6
S 6
E 6
S 6
E 10
10
N 7
W 3
N 5
W 5
S 8
W 10
N 6
E 9
N 8
E 8
8
W 9
N 10
E 6
S 10
E 9
S 10
W 6
N 10
4
W 5
N 1
E 5
S 1
4
W 4
S 8...

output:

7 E
Z 6
L
Z 1
R
Z 2
R
Z 8
15 W
Z 10
R
Z 1
L
Z 10
L
Z 2
L
Z 2
R
Z 2
L
Z 2
L
Z 1
17 N
Z 5
R
Z 4
R
Z 7
R
Z 6
R
Z 9
R
Z 8
R
Z 4
L
Z 6
R
Z 7
11 N
Z 6
R
Z 6
R
Z 8
L
Z 9
R
Z 7
R
Z 2
15 E
Z 6
R
Z 9
R
Z 5
R
Z 4
R
Z 6
L
Z 4
R
Z 5
L
Z 9
15 N
Z 6
L
Z 10
R
Z 6
L
Z 6
R
Z 6
R
Z 6
R
Z 6
R
Z 10
19 N
Z 7
L
Z 3
R
Z 5
...

result:

wrong answer Wrong destination (test case 1)