QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#697120	#9521. Giving Directions in Harbin	ygl	WA	0ms	3760kb	C++20	907b	2024-11-01 10:48:04	2024-11-01 10:48:04

Judging History

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

[2024-11-01 10:48:04]
评测

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

查看

[2024-11-01 10:48:04]
提交

answer

#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

void solve(){
	int n;
	cin >> n;

	char op[2];
	int cnt;
	map<char, int> mp = {{'N', 0}, {'S', 1}, {'W', 2}, {'E', 3}};
	vector<string> ans;
	char star;
	int d = -1;

	cin >> op >> cnt;
	star = op[0];
	ans.push_back("Z " + to_string(cnt));
	d = mp[op[0]];

	for (int i = 1; i < n; i ++ ){
		cin >> op >> cnt;
		int t = mp[op[0]];
		if (d != t){
			if ((d + 1) % 4 == t){
				ans.push_back("L");
			} else if ((d - 1 + 4) % 4 == t){
				ans.push_back("R");
			} else {
				ans.push_back("L");
			}
			d = t;
		}
		ans.push_back("Z " + to_string(cnt));
	}
	cout << ans.size() << " " << star<< "\n";
	for (int i = 0; i < ans.size(); i ++ ){
		cout << ans[i] << "\n";
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T;
	cin >> T;
	while(T -- ){
		solve();
	}
	return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3588kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3760kb

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
R
Z 8
15 W
Z 10
L
Z 1
R
Z 10
L
Z 2
L
Z 2
L
Z 2
L
Z 2
R
Z 1
17 N
Z 5
R
Z 4
L
Z 7
R
Z 6
L
Z 9
L
Z 8
L
Z 4
L
Z 6
L
Z 7
11 N
Z 6
R
Z 6
L
Z 8
L
Z 9
R
Z 7
L
Z 2
15 E
Z 6
L
Z 9
L
Z 5
R
Z 4
L
Z 6
L
Z 4
R
Z 5
L
Z 9
15 N
Z 6
L
Z 10
L
Z 6
L
Z 6
R
Z 6
L
Z 6
L
Z 6
L
Z 10
19 N
Z 7
L
Z 3
L
Z 5
...

result:

wrong answer Wrong destination (test case 1)