QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#724656	#9521. Giving Directions in Harbin	xydCatGirl^#	WA	0ms	3628kb	C++20	761b	2024-11-08 14:17:53	2024-11-08 14:17:54

Judging History

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

[2024-11-08 14:17:54]
评测

测评结果：WA
用时：0ms
内存：3628kb

查看

[2024-11-08 14:17:53]
提交

answer

#include <bits/stdc++.h>
using namespace std;
char d[11], x[11];
void Main() {
	int n; cin >> n;
	for (int i = 1; i <= n; i++) cin >> d[i] >> x[i];
	cout << 2 * n - 1 << ' ' << d[1] << '\n';
	for (int i = 1; i <= n; i++) {
		cout << "Z " << x[i] << '\n';
		if (i < n) {
			if (d[i] == 'N') {
				if (d[i + 1] == 'E') cout << 'R';
				else cout << 'L';
			}
			if (d[i] == 'S') {
				if (d[i + 1] != 'E') cout << 'R';
				else cout << 'L';				
			}
			if (d[i] == 'E') {
				if (d[i + 1] == 'N') cout << 'L';
				else cout << 'R';
			}
			if (d[i] == 'W') {
				if (d[i + 1] != 'N') cout << 'L';
				else cout << 'R';
			}			
			cout << '\n';
		}
	}
 	return;
}
int main() {
	int _; cin >> _;
	while (_ --) Main();
	return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3628kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3556kb

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
L
Z 2
L
Z 8
15 W
Z 1
L
Z N

Z E

Z 0

Z 2
L
Z 2
L
Z 2
L
Z 2
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-1 W
-...

result:

wrong output format Expected integer, but "N" found (test case 2)