QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#708837	#9521. Giving Directions in Harbin	qzez^#	WA	1ms	3804kb	C++14	656b	2024-11-04 08:28:37	2024-11-04 08:28:37

Judging History

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

[2024-11-04 08:28:37]
评测

测评结果：WA
用时：1ms
内存：3804kb

查看

[2024-11-04 08:28:37]
提交

answer

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
int T,n;
char dir[5]="NWSE";
int trans(char c){
	return find(dir,dir+4,c)-dir;
}
void work(){
	scanf("%d",&n);
	int cur=-1;
	vector<pair<char,int>>ans;
	char st;
	for(;n--;){
		char str[9];
		int x;
		scanf("%s%d",str,&x);
		int p=trans(*str);
		if(cur==-1){
			st=dir[p];
			cur=p;
		}else{
			for(;cur!=p;)ans.push_back({'L',0}),(cur+=1)%=4;
		}
		ans.push_back({'Z',x});
	}
	printf("%ld %c\n",ans.size(),st);
	for(auto [x,y]:ans){
		if(x=='Z')printf("%c %d\n",x,y);
		else printf("%c\n",x);
	}
}
int main(){
	for(scanf("%d",&T);T--;)work();
	return 0;
}

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3792kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3804kb

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
21 W
Z 10
L
L
L
Z 1
L
L
L
Z 10
L
L
L
Z 2
L
Z 2
L
Z 2
L
Z 2
L
Z 1
25 N
Z 5
L
L
L
Z 4
L
Z 7
L
L
L
Z 6
L
L
L
Z 9
L
Z 8
L
Z 4
L
Z 6
L
L
L
Z 7
13 N
Z 6
L
L
L
Z 6
L
Z 8
L
Z 9
L
Z 7
L
Z 2
25 E
Z 6
L
L
L
Z 9
L
L
L
Z 5
L
Z 4
L
L
L
Z 6
L
L
L
Z 4
L
L
L
Z 5
L
Z 9
19 N
Z 6
L
Z 10
L
L
L
...

result:

wrong answer Integer parameter [name=m] equals to 21, violates the range [1, 20] (test case 2)