QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#727508 | #9521. Giving Directions in Harbin | klhwong | WA | 1ms | 3644kb | C++17 | 1.5kb | 2024-11-09 13:18:22 | 2024-11-09 13:18:36 |
Judging History
answer
#include <bits/stdc++.h>
#define eb emplace_back
using namespace std;
inline void work(){
int n;
cin >> n;
char d;
int x;
char prev;
vector<pair<char, int>> instructions(n);
vector<pair<char, int>> harbin;
cin >> d >> x;
instructions[0] = make_pair(d, x);
harbin.eb(make_pair(d, 0));
harbin.eb(make_pair('Z', x));
prev = d;
for(int i = 1; i < n; i++){
cin >> d >> x;
if(prev=='S' && d=='E') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
else if(prev=='S' && d=='W') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
else if(prev=='N' && d=='E') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
else if(prev=='N' && d=='W') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
else if(prev=='E' && d=='N') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
else if(prev=='E' && d=='S') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
else if(prev=='W' && d=='N') {harbin.eb(make_pair('R', 0)); harbin.eb(make_pair('Z', x));}
else if(prev=='W' && d=='S') {harbin.eb(make_pair('L', 0)); harbin.eb(make_pair('Z', x));}
}
cout << (harbin.size() - 1) << " ";
for(auto i: harbin){
if(i.second==0) cout << i.first << endl;
else cout << "Z " << i.second << endl;
}
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
int t;
cin >> t;
while(t--) work();
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3644kb
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: 1ms
memory: 3552kb
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:
5 E Z 6 L Z 1 R Z 8 9 W Z 10 R Z 1 L Z 2 R Z 2 L Z 1 9 N Z 5 R Z 4 R Z 6 R Z 8 L Z 6 7 N Z 6 R Z 6 L Z 9 R Z 2 9 E Z 6 R Z 9 R Z 4 L Z 4 L Z 9 9 N Z 6 L Z 10 L Z 6 R Z 6 R Z 10 11 N Z 7 L Z 3 L Z 5 L Z 10 R Z 9 R Z 8 9 W Z 9 R Z 10 L Z 10 L Z 10 R Z 10 5 W Z 5 R Z 1 L Z 1 5 W Z 4 L Z 8 R Z 8 5 S Z 1...
result:
wrong answer Wrong destination (test case 1)