QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#700382	#9521. Giving Directions in Harbin	CCSU_YZT^#	WA	0ms	3644kb	C++20	1022b	2024-11-02 12:52:19	2024-11-02 12:52:19

Judging History

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

[2024-11-02 12:52:19]
评测

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

查看

[2024-11-02 12:52:19]
提交

answer

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

#define ll long long

void solve() {
	int n;
	cin>>n;
	vector<int> ans;
	char u[] = {'E', 'S', 'W', 'N'}; 
	char st, last;
	for (int i = 1; i <= n; i++) {
		char ch;
		int num = 0;
		cin>>ch>>num;
		if (i == 1) {
			st = ch;
			ans.push_back(num);
		} else {
			int pos = 0;
			for (int j = 0; j < 4; j++) {
				if (u[j] == last) pos = j;
			}
			if ((pos-1+4)%4 == ch) {
				ans.push_back(-1);
			} else {
				ans.push_back(1);
			}
			ans.push_back(num);
		}
		last = ch;
	}
	cout<<ans.size()<<' '<<st<<'\n';
	for (int i = 0; i < ans.size(); i++) {
		if(i%2 == 0) cout<<"Z"<<' '<<ans[i]<<'\n';
		else {
			char ch;
			if (ans[i] == -1) ch = 'R';
			else ch = 'L';
			cout<<ch<<'\n';
		}
	}
}

int main()
{
	if (ifstream("test.in")) {
		freopen("test.in", "r", stdin);
//		freopen("test.out", "w", stdout);
	}
	ios::sync_with_stdio(false);
	cin.tie(0);
	int T = 1;
	cin>>T;
	while (T--) {
		solve();
	}
	return 0;
}

源文件, 语言: C++20

詳細信息

Test #1:

score: 100

Accepted

time: 0ms

memory: 3528kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3644kb

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