QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#708598 | #9521. Giving Directions in Harbin | k4sum1 | WA | 0ms | 3684kb | C++20 | 1.7kb | 2024-11-04 00:27:30 | 2024-11-04 00:27:30 |
Judging History
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;
}
cout<<x<<' '<<y<<'\n';
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(x<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();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3684kb
input:
1 2 S 2 E 1
output:
1 -2 3 S Z 2 L Z 1
result:
wrong answer Token parameter [name=f] equals to "-2", doesn't correspond to pattern "[NSWE]" (test case 1)