QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#791063	#9521. Giving Directions in Harbin	Yehhhh	WA	1ms	3556kb	C++20	2.3kb	2024-11-28 16:39:46	2024-11-28 16:39:47

Judging History

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

[2024-11-28 16:39:47]
评测

测评结果：WA
用时：1ms
内存：3556kb

查看

[2024-11-28 16:39:46]
提交

answer

#include <bits/stdc++.h>

using namespace std;

/*
    N
W       E
    S

面向N
W-L N-Z E-R
面向W
S-L W-Z N-R
面向S
E-L S-Z W-R
面向E
N-L E-Z S-R
*/

void solve() {
    int n;
    cin >> n;
    vector<pair<char, int>> ans;
    char begin;
    char pre = 'A';
    while (n--) {
        char x;
        int y;
        cin >> x >> y;
        if (pre == 'A') {
            pre = x;
            begin = x;
            ans.push_back({'Z', y});
            continue;
        }
        if (pre == 'N') {
            if (x == 'W') {
                ans.push_back({'L', 0});
                ans.push_back({'Z', y});
            } else if (x == 'N') {
                ans.push_back({'Z', y});
            } else if (x == 'E') {
                ans.push_back({'R', 0});
                ans.push_back({'Z', y});
            }
        } else if (pre == 'W') {
            if (x == 'S') {
                ans.push_back({'L', 0});
                ans.push_back({'Z', y});
            } else if (x == 'W') {
                ans.push_back({'Z', y});
            } else if (x == 'N') {
                ans.push_back({'R', 0});
                ans.push_back({'Z', y});
            }
        } else if (pre == 'S') {
            if (x == 'E') {
                ans.push_back({'L', 0});
                ans.push_back({'Z', y});
            } else if (x == 'S') {
                ans.push_back({'Z', y});
            } else if (x == 'W') {
                ans.push_back({'R', 0});
                ans.push_back({'Z', y});
            }
        } else if (pre == 'E') {
            if (x == 'N') {
                ans.push_back({'L', 0});
                ans.push_back({'Z', y});
            } else if (x == 'E') {
                ans.push_back({'Z', y});
            } else if (x == 'S') {
                ans.push_back({'R', 0});
                ans.push_back({'Z', y});
            }
        }
    }
    cout << ans.size() << " " << begin << '\n';
    for (auto x : ans) {
        if (x.second == 0) {
            cout << x.first << "\n";
        } else {
            cout << x.first << " " << x.second << "\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3556kb

input:

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

result:

wrong answer Wrong destination (test case 1)