QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#708593	#9521. Giving Directions in Harbin	k4sum1	WA	0ms	3704kb	C++20	1.6kb	2024-11-04 00:22:21	2024-11-04 00:22:22

Judging History

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

[2024-11-04 00:22:22]
评测

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

查看

[2024-11-04 00:22:21]
提交

answer

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

void solve()
{
	int n;
	cin>>n;
	int x=0,y=0;
	
	char op;
	int temp;
	for(int i=1;i<=n;i++)
	{
		cin>>op>>temp;
		if(op=='N')
		{
			y=y+temp;
		}
		
		if(op=='S')
		{
			y=y-temp;
		}
		
		if(op=='W')
		{
			x=x-temp;
		}
		
		if(op=='E')
		{
			x=x+temp;
		}
	}
	
	if(x==0&&y==0)
	{
		cout<<7<<' '<<'S'<<'\n';
		cout<<'Z'<<' '<<1<<'\n';
		cout<<'L'<<'\n';
		cout<<'Z'<<' '<<1<<'\n';
		cout<<'L'<<'\n';
		cout<<'Z'<<' '<<1<<'\n';
		cout<<'L'<<'\n';
		cout<<'Z'<<' '<<1<<'\n';
		return;
	}
	
	if(x==0)
	{
		if(y>0)
		{
			cout<<1<<' '<<'E'<<'\n';
			cout<<'Z'<<' '<<y<<'\n';
			return;
		}
		
		if(y<0)
		{
			cout<<1<<' '<<'W'<<'\n';
			cout<<'Z'<<' '<<-y<<'\n';
			return;
		}
	}
	
	if(y==0)
	{
		if(x>0)
		{
			cout<<1<<' '<<'N'<<'\n';
			cout<<'Z'<<' '<<x<<'\n';
			return;
		}
		
		if(x<0)
		{
			cout<<1<<' '<<'S'<<'\n';
			cout<<'Z'<<' '<<-x<<'\n';
			return;
		}
	}
	
	if(y>0)
	{
		cout<<3<<' '<<'N'<<'\n';
		cout<<'Z'<<' '<<y<<'\n';
		
		if(x>0)
		{
			cout<<'R'<<'\n';
			cout<<'Z'<<' '<<x<<'\n';
			return;
		}
		
		if(y<0)
		{
			cout<<'L'<<'\n';
			cout<<'Z'<<' '<<-x<<'\n';
			return;
		}
	
	}
	if(y<0)
	{
		cout<<3<<' '<<'S'<<'\n';
		cout<<'Z'<<' '<<-y<<'\n';
		
		if(x>0)
		{
			cout<<'L'<<'\n';
			cout<<'Z'<<' '<<x<<'\n';
			return;
		}
		
		if(x<0)
		{
			cout<<'R'<<'\n';
			cout<<'Z'<<' '<<-x<<'\n';
			return;
		}
	}
}

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

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3704kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3576kb

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:

3 S
Z 7
L
Z 4
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 N
Z 14
R
Z 12
3 N
Z 7
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 N
Z 18
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 S
Z 3
L
Z 9
1 S
Z 10
7 S
Z 1
L
Z 1
L
Z 1
L
Z 1
3 S
Z 16
R
Z 9
3 N
Z 4...

result:

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