QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#715036 | #9521. Giving Directions in Harbin | retired_midlights | WA | 1ms | 3720kb | C++14 | 1.5kb | 2024-11-06 10:03:02 | 2024-11-06 10:03:02 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
#define no { puts("No"); return; }
#define yes { puts("Yes"); return; }
using namespace std;
void solve() {
int n;
cin >> n;
int x = 0, y = 0;
rep(i, 1, n) {
char ch;
int t;
cin >> ch >> t;
// cout << ch << " " << t << endl;
if(ch == 'N') x -= t;
else if(ch == 'S') x += t;
else if(ch == 'W') y -= t;
else y += t;
}
int res = (x == 0) + (y == 0);
if(res == 2) {
cout << "7 S\nZ 1\nL\nZ 1\nL\nZ 1\nL\nZ 1\n";
}
else if(res == 1) {
if(x < 0) cout << "1 N\nZ " << -x << '\n';
else if(x > 0) cout << "1 S\nZ " << x << '\n';
else if(y < 0) cout << "1 W\nZ " << -y << '\n';
else cout << "1 E\nZ " << y << '\n';
} else {
if(x < 0) {
if(y < 0) cout << "3 N\nZ " << -x << "\nL\nZ " << -y << '\n';
else cout << "3 N\nZ " << -x << "\nR\nZ" << y << '\n';
} else {
if(y < 0) cout << "3 S\nZ " << x << "\nR\nZ " << -y << '\n';
else cout << "3 S\nZ " << x << "\nL\nZ " << y << '\n';
}
}
}
int main() {
#ifdef LOCAL
freopen("data.in", "r", stdin);
#endif
ios :: sync_with_stdio(false);
cin.tie(nullptr), cout.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: 3660kb
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: 3720kb
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 Z12 3 N Z 7 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 N Z 18 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 7 S Z 1 L Z 1 L Z 1 L Z 1 3 S Z 3 L Z 9 1 W Z 10 7 S Z 1 L Z 1 L Z 1 L Z 1 3 S Z 16 R ...
result:
wrong answer Token parameter [name=g] equals to "Z12", doesn't correspond to pattern "[ZLR]" (test case 3)