QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#701592	#9521. Giving Directions in Harbin	yzhx^#	WA	0ms	3644kb	C++20	955b	2024-11-02 14:24:20	2024-11-02 14:24:33

Judging History

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

[2024-11-02 14:24:33]
评测

测评结果：WA
用时：0ms
内存：3644kb

查看

[2024-11-02 14:24:20]
提交

answer

#include <stdlib.h>
#include <iostream>
using namespace std;

void slove() {
    // 0 W, 1 N, 2 E, 3 S
    int n;
    cin >> n;

    int dir = 0;

    char d;
    int dis;
    int tar = 0;

    cout << (n * 2 - 1) << " ";
    for (int i = 1; i <= n; i++) {
        cin >> d >> dis;
        if (d == 'W')
            tar = 0;
        else if (d == 'N')
            tar == 1;
        else if (d == 'E')
            tar == 2;
        else
            tar = 3;

        if (i != 1) {
            if ((dir + 1) % 4 == tar)
                cout << "R\n";
            else
                cout << "L\n";
        } else {
            cout << d << "\n";
        }

        cout << "Z " << dis << "\n";

        dir = tar;
    }
}

int main() {
    // freopen("in.txt", "r", stdin);
    // freopen("out.txt", "w", stdout);
    int cnt = 1;
    cin >> cnt;
    while (cnt--) {
        slove();
    }
    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: 3592kb

input:

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

result:

wrong answer Wrong destination (test case 2)