QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#758656#9521. Giving Directions in HarbinW_Trace2#WA 0ms3708kbC++20563b2024-11-17 19:15:042024-11-17 19:15:05

Judging History

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

  • [2024-11-17 19:15:05]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3708kb
  • [2024-11-17 19:15:04]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int a[200],b[20];
char ch[20];
int main()
{
	a['N']=0,a['E']=1,a['S']=2,a['W']=3;
	int T;
	scanf("%d",&T);
	while(T--)
	{
		int n;
		cin>>n;
		int dir=-1,sum=0;
		for(int i=1;i<=n;i++)
		{
			cin>>ch[i]>>b[i];
			sum+=b[i];
		}
		dir=a[ch[1]];
		cout<<sum<<" "<<ch[1]<<"\n";
		cout<<"Z "<<b[1]<<"\n";
		for(int i=2;i<=n;i++)
		{
			int rev=dir-a[ch[i]];
			if(rev==3) rev=-1;
			if(rev==-3) rev=1;
			if(rev==1) cout<<"L\n";
			else cout<<"R\n";
			cout<<"Z "<<b[i]<<"\n"; 
		}
	}
 } 

详细

Test #1:

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

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: 0ms
memory: 3688kb

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:

17 E
Z 6
L
Z 1
R
Z 2
R
Z 8
30 W
Z 10
R
Z 1
R
Z 10
L
Z 2
R
Z 2
R
Z 2
R
Z 2
L
Z 1
56 N
Z 5
R
Z 4
R
Z 7
R
Z 6
R
Z 9
R
Z 8
R
Z 4
L
Z 6
R
Z 7
38 N
Z 6
R
Z 6
R
Z 8
L
Z 9
R
Z 7
R
Z 2
48 E
Z 6
R
Z 9
R
Z 5
R
Z 4
R
Z 6
L
Z 4
R
Z 5
L
Z 9
56 N
Z 6
L
Z 10
R
Z 6
L
Z 6
R
Z 6
R
Z 6
R
Z 6
R
Z 10
69 N
Z 7
L
Z 3
R
Z 5...

result:

wrong answer Token parameter [name=g] equals to "30", doesn't correspond to pattern "[ZLR]" (test case 1)