QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#692410#9521. Giving Directions in HarbinNyanya_#WA 2ms3704kbC++23914b2024-10-31 14:28:262024-10-31 14:28:37

Judging History

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

  • [2024-10-31 14:28:37]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3704kb
  • [2024-10-31 14:28:26]
  • 提交

answer

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

char s[30], anss[30];
int a[30], ansa[30];

map<char,int> st;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int T;
	cin>>T;
	
	st['E'] = 0;
	st['S'] = 1;
	st['W'] = 2;
	st['N'] = 3;
	
	while (T--)
	{
		int n, m = 0;
		cin >> n;
		
		for (int i = 1; i <= n; i++) {
			cin >> s[i] >> a[i];
		}
		
		char now = '0', init;
		
		for (int i = 1; i <= n; i++) {
			
			if (i == 1) {
				now = init = s[i];
				anss[++m] = 'Z';
				ansa[m] = a[i];
			} else {
				
				int x = st[now], y = st[s[i]];
				
				if ((x + 1) % 4 == y) anss[++m] = 'R';
				else anss[++m] = 'L';
				
				anss[++m] = 'Z';
				ansa[m] = a[i];
			}
		}
		
		cout << m << " " << init << endl;
		for (int i = 1; i <= m; i++) {
			cout <<anss[i];
			if (anss[i] == 'Z') cout << " " << ansa[i];
			cout << endl;
		}
	}	
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3704kb

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

result:

wrong answer Wrong destination (test case 1)