QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#706799#9521. Giving Directions in Harbinthe_foo#WA 0ms3644kbC++20961b2024-11-03 13:30:502024-11-03 13:31:00

Judging History

你现在查看的是最新测评结果

  • [2024-11-03 13:31:00]
  • 评测
  • 测评结果:WA
  • 用时:0ms
  • 内存:3644kb
  • [2024-11-03 13:30:50]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

using LL = long long;

char c[] {'N', 'E', 'S', 'W'};
string get(char a, char b) {
    for (int i = 0; i < 4; i++) {
        if (a == c[i] and b == c[(i + 1) % 4]) return "R";
    }
    return "L";
}

void solve() {
    int n;
    cin >> n;

    vector<char> a(n + 1);
    vector<int> b(n + 1);
    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];
    }

    vector<string> ans;
    ans.emplace_back("Z "s + to_string(b[1]));
    char now = a[1];
    for (int i = 2; i <= n; i++) {
        ans.emplace_back(get(now, a[i]));
        ans.emplace_back("Z "s + to_string(b[i]));
    }
    cout << ssize(ans) << " " << a[1] << "\n";
    for (auto x : ans) {
        cout << x << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}

/*
1
2
S 2
E 1
*/

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3640kb

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: 3644kb

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
R
Z 8
15 W
Z 10
R
Z 1
L
Z 10
L
Z 2
L
Z 2
R
Z 2
L
Z 2
L
Z 1
17 N
Z 5
R
Z 4
L
Z 7
R
Z 6
L
Z 9
R
Z 8
L
Z 4
L
Z 6
L
Z 7
11 N
Z 6
R
Z 6
L
Z 8
L
Z 9
L
Z 7
R
Z 2
15 E
Z 6
R
Z 9
L
Z 5
R
Z 4
L
Z 6
L
Z 4
L
Z 5
L
Z 9
15 N
Z 6
L
Z 10
L
Z 6
L
Z 6
L
Z 6
R
Z 6
L
Z 6
R
Z 10
19 N
Z 7
L
Z 3
L
Z 5
...

result:

wrong answer Wrong destination (test case 1)