QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#700856	#9521. Giving Directions in Harbin	ucup-team1412^#	WA	1ms	3672kb	C++23	970b	2024-11-02 13:27:30	2024-11-02 13:27:34

Judging History

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

[2024-11-02 13:27:34]
评测

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

查看

[2024-11-02 13:27:30]
提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
const ll maxn = 15;
map<char, ll> m;

struct node {
    char dir;
    ll l;
}ope[maxn];


signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll t;
    cin >> t;
    m['N'] = 0;
    m['E'] = 1;
    m['S'] = 2;
    m['W'] = 3;
    while (t--) {
        ll n;
        cin >> n;
        ll cnt = 2 * n - 1;
        for (ll i = 1; i <= n; i++) {
            cin >> ope[i].dir >> ope[i].l;
        }
        cout << cnt << ' ' << ope[1].dir << endl;
        ll nowdir = m[ope[1].dir];
        for (ll i = 1; i <= cnt; i++) {
            if (i & 1)
                cout << 'Z' << ' ' << ope[(i + 1) / 2].l << endl;
            else {
                if ((m[ope[i + 1].dir] - m[ope[i - 1].dir] + 4) % 4 == 1) cout << 'R';
                else cout << 'L';
                cout << endl;
            }
        }
    }

    return 0;
}

Source code, Language: C++23

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3608kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: -100

Wrong Answer

time: 1ms

memory: 3672kb

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
R
Z 2
L
Z 8
15 W
Z 10
L
Z 1
L
Z 10
L
Z 2
R
Z 2
L
Z 2
L
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
L
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
L
Z 5
L
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
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 1)