QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#692727 | #9521. Giving Directions in Harbin | xiey# | WA | 0ms | 3580kb | C++23 | 903b | 2024-10-31 14:57:44 | 2024-10-31 14:57:51 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
char pos(char p,char n)
{
if(p=='N')
{
if(n=='E')
return 'R';
else return 'L';
}else if(p=='E')
{
if(n=='N')
return 'L';
else return 'R';
}else if(p=='S')
{
if(n=='E')
return 'L';
else return 'R';
}else{
if(n=='S')
return 'L';
else return 'R';
}
}
void solve()
{
int n;
cin>>n;
string a[n];
cin.get();
for(int i=0;i<n;i++)
getline(cin,a[i]);
cout<<2*n-1<<' '<<a[0][0]<<'\n'<<"Z "<<a[0][2]<<'\n';
for(int i=1;i<n;i++)
{
cout<<pos(a[i-1][0],a[i][0])<<"\nZ "<<a[i][2]<<'\n';
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int t=1;
cin>>t;
while(t--)
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3580kb
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: 3548kb
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 15 W Z 1 R Z 1 R Z 1 R Z 2 L Z 2 L Z 2 L Z 2 L Z 1 17 N Z 5 R Z 4 L Z 7 R Z 6 R Z 9 L Z 8 L Z 4 L Z 6 R Z 7 11 N Z 6 R Z 6 L Z 8 L Z 9 L Z 7 L Z 2 15 E Z 6 R Z 9 R Z 5 L Z 4 R Z 6 R Z 4 R Z 5 L Z 9 15 N Z 6 L Z 1 R Z 6 L Z 6 L Z 6 L Z 6 R Z 6 L Z 1 19 N Z 7 L Z 3 R Z 5 L Z ...
result:
wrong answer Wrong destination (test case 7)