QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#797473	#9521. Giving Directions in Harbin	KKT89	AC ✓	10ms	3652kb	C++17	2.4kb	2024-12-03 07:58:27	2024-12-03 07:58:29

Judging History

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

[2024-12-03 07:58:29]
评测

测评结果：AC
用时：10ms
内存：3652kb

查看

[2024-12-03 07:58:27]
提交

answer

#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) { return (ull)rng() % B; }
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q;
    cin >> q;
    while (q--) {
        int n;
        cin >> n;
        vector<pair<char, int>> res;
        vector<char> c(n);
        vector<int> d(n);
        for (int i = 0; i < n; ++i) {
            cin >> c[i] >> d[i];
        }
        res.emplace_back(c[0], -1);
        res.emplace_back('Z', d[0]);
        for (int i = 1; i < n; ++i) {
            if (c[i - 1] == 'S') {
                if (c[i] == 'E') res.emplace_back('L', -1);
                else if (c[i] == 'W') res.emplace_back('R', -1);
                else {
                    res.emplace_back('L', -1);
                    res.emplace_back('L', -1);
                }
            } else if (c[i - 1] == 'N') {
                if (c[i] == 'E') res.emplace_back('R', -1);
                else if (c[i] == 'W') res.emplace_back('L', -1);
                else {
                    res.emplace_back('R', -1);
                    res.emplace_back('R', -1);
                }
            } else if (c[i - 1] == 'E') {
                if (c[i] == 'N') res.emplace_back('L', -1);
                else if (c[i] == 'S') res.emplace_back('R', -1);
                else {
                    res.emplace_back('L', -1);
                    res.emplace_back('L', -1);
                }
            } else if (c[i - 1] == 'W') {
                if (c[i] == 'N') res.emplace_back('R', -1);
                else if (c[i] == 'S') res.emplace_back('L', -1);
                else {
                    res.emplace_back('R', -1);
                    res.emplace_back('R', -1);
                }
            }
            res.emplace_back('Z', d[i]);
        }
        cout << res.size() - 1 << " " << res[0].first << "\n";
        for (int i = 1; i < res.size(); ++i) {
            if (res[i].second == -1) cout << res[i].first << "\n";
            else cout << res[i].first << " " << res[i].second << "\n";
        }
    }
}

Source code, Language: C++17

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100

Accepted

time: 0ms

memory: 3652kb

input:

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0

Accepted

time: 0ms

memory: 3596kb

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

result:

ok ok (99 test cases)

Test #3:

score: 0

Accepted

time: 10ms

memory: 3648kb

input:

10000
1
W 9
1
N 3
10
W 10
N 7
W 5
S 9
W 9
S 8
E 9
S 6
E 5
S 5
2
E 8
S 10
2
N 7
W 5
5
S 4
W 3
S 7
E 4
N 7
8
N 7
E 8
N 3
E 9
S 5
W 5
S 9
W 10
9
W 9
S 6
E 6
N 8
W 5
N 6
W 3
N 8
W 7
3
S 9
W 2
N 10
5
N 6
E 4
N 6
E 10
N 1
10
S 7
W 4
N 3
E 5
S 7
W 8
N 2
E 8
N 4
W 8
8
S 9
W 1
N 4
E 6
N 1
W 8
N 6
W 6
4
W 10
...

output:

1 W
Z 9
1 N
Z 3
19 W
Z 10
R
Z 7
L
Z 5
L
Z 9
R
Z 9
L
Z 8
L
Z 9
R
Z 6
L
Z 5
R
Z 5
3 E
Z 8
R
Z 10
3 N
Z 7
L
Z 5
9 S
Z 4
R
Z 3
L
Z 7
L
Z 4
L
Z 7
15 N
Z 7
R
Z 8
L
Z 3
R
Z 9
R
Z 5
R
Z 5
L
Z 9
R
Z 10
17 W
Z 9
L
Z 6
L
Z 6
L
Z 8
L
Z 5
R
Z 6
L
Z 3
R
Z 8
L
Z 7
5 S
Z 9
R
Z 2
R
Z 10
9 N
Z 6
R
Z 4
L
Z 6
R
Z 10
L
...

result:

ok ok (10000 test cases)

Extra Test:

score: 0

Extra Test Passed