QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#736878	#9521. Giving Directions in Harbin	wsxcb^#	AC ✓	8ms	3620kb	C++17	1.2kb	2024-11-12 13:47:33	2024-11-12 13:47:33

Judging History

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

[2024-11-12 13:47:33]
评测

测评结果：AC
用时：8ms
内存：3620kb

查看

[2024-11-12 13:47:33]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define pb push_back
const int N = 55;
char ch[N];
int d[N];

void solve() {
	int n;
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> ch[i] >> d[i];
	}
	vector<pair<char, int>>ans;
	ans.pb({ch[1], -1});
	char x = ch[1];
	for (int i = 1; i < n; i++) {
		ans.pb({'Z', d[i]});
		if (x == 'S') {
			if (ch[i + 1] == 'E') {
				ans.pb({'L', -1});
			} else {
				ans.pb({'R', -1});
			}
		} else if (x == 'N') {
			if (ch[i + 1] == 'E') {
				ans.pb({'R', -1});
			} else {
				ans.pb({'L', -1});
			}
		} else if (x == 'W') {
			if (ch[i + 1] == 'N') {
				ans.pb({'R', -1});
			} else {
				ans.pb({'L', -1});
			}
		} else if (x == 'E') {
			if (ch[i + 1] == 'N') {
				ans.pb({'L', -1});
			} else {
				ans.pb({'R', -1});
			}
		}
		x = ch[i + 1];
	}
	ans.pb({'Z', d[n]});
	cout << ans.size() - 1 << ' ';
	for (int i = 0; i < ans.size(); i++) {
		cout << ans[i].fi << ' ';
		if (ans[i].se != -1)
			cout << ans[i].se;
		cout << '\n';

	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t = 1;
	cin >> t;
	while (t--)
		solve();
	return 0;
}

Source code, Language: C++17

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3552kb

input:

output:

3 S 
Z 2
L 
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3620kb

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

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 8ms

memory: 3556kb

input:

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

output:

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

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed