QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#817898 | #9521. Giving Directions in Harbin | tselmegkh# | WA | 1ms | 3632kb | C++20 | 969b | 2024-12-17 14:30:18 | 2024-12-17 14:30:20 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
char get(char a, char b) {
if(a == 'S' && b == 'E')return 'L';
if(a == 'N' && b == 'W')return 'L';
if(a == 'E' && b == 'N')return 'L';
if(a == 'W' && b == 'S')return 'L';
if(a == 'E' && b == 'S')return 'R';
if(a == 'W' && b == 'N')return 'R';
if(a == 'S' && b == 'W')return 'R';
if(a == 'N' && b == 'E')return 'R';
}
void solve() {
int n;
cin >> n;
vector<pair<char, int>> a(n);
for(int i = 0; i < n; i++){
cin >> a[i].first >> a[i].second;
}
cout << n * 2 - 1 << ' ' << a[0].first << '\n';
cout << "Z " << a[0].second << '\n';
char lst = a[0].first;
for(int i = 1; i < n; i++){
char dir = get(lst, a[i].first);
cout << dir << '\n';
cout << "Z " << a[i].second <<'\n';
}
}
int main() {
int t = 1;
cin >> t;
while(t--){
solve();
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
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: 3420kb
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 R Z 2 R Z 8 15 W Z 10 R Z 1 R Z 10 L Z 2 R Z 2 R Z 2 R Z 2 L Z 1 17 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 11 N Z 6 R Z 6 R Z 8 L Z 9 R Z 7 R Z 2 15 E Z 6 R Z 9 R Z 5 R Z 4 R Z 6 L Z 4 R Z 5 L Z 9 15 N Z 6 L Z 10 R Z 6 L Z 6 R Z 6 R Z 6 R Z 6 R Z 10 19 N Z 7 L Z 3 R Z 5 ...
result:
wrong answer Wrong destination (test case 1)