QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#698109	#9521. Giving Directions in Harbin	Lanmosheng	WA	0ms	3688kb	C++14	1.3kb	2024-11-01 17:26:10	2024-11-01 17:26:11

Judging History

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

[2024-11-01 17:26:11]
评测

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

查看

[2024-11-01 17:26:10]
提交

answer

#include <bits/stdc++.h>
using namespace std;
void solve()
{
    int n;
    cin >> n;
    cout << (2 * n - 1) << " ";
    char now;
    cin >> now;
    int x;
    cin >> x;
    cout << now << endl;
    cout << "Z" << " " << x << endl;
    for (int i = 1; i < n; i++)
    {
        char c;
        cin >> c >> x;
        if (now == 'S')
        {
            if (c == 'W')
                cout << "R" << endl;
            if (c == 'E')
                cout << "L" << endl;
        }
        if (now == 'N')
        {
            if (c == 'W')
                cout << "L" << endl;
            if (c == 'E')
                cout << "R" << endl;
        }
        if (now == 'L')
        {
            if (c == 'N')
                cout << "R" << endl;
            if (c == 'S')
                cout << "L" << endl;
        }
        if (now == 'R')
        {
            if (c == 'N')
                cout << "L" << endl;
            if (c == 'S')
                cout << "R" << endl;
        }
        cout << "Z" << " " << x << endl;
        now = c;
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}
/*
2 2
4 0
5 1
7 1
*/

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3664kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 0ms

memory: 3688kb

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

result:

wrong answer Same direction appears twice (test case 1)