QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#714906	#9521. Giving Directions in Harbin	ljljljlj^#	AC ✓	8ms	3840kb	C++20	3.2kb	2024-11-06 09:07:27	2024-11-06 09:07:28

Judging History

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

[2024-11-06 09:07:28]
评测

测评结果：AC
用时：8ms
内存：3840kb

查看

[2024-11-06 09:07:27]
提交

answer

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
using i64 = long long;
const int inf = 1e18;

// pair<int, int> dir = {}

inline pair<int, int> dir(char ch)
{
    if (ch == 'N')
        return make_pair(0, 1);
    else if (ch == 'S')
        return make_pair(0, -1);
    else if (ch == 'W')
        return make_pair(-1, 0);
    else
        return make_pair(1, 0);
}

map<pair<char, char>, char> mp;

void solve()
{
    int n;
    cin >> n;
    pair<int, int> pos = {0, 0};
    vector<pair<char, int>> a(n + 1);
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i].first >> a[i].second;
        // auto [dx, dy] = dir(ch);
        // pos.first += dx * step, pos.second += dy * step;
    }

    cout << (n * 2 - 1) << " " << a[1].first << endl;
    cout << "Z " << a[1].second << endl;
    for (int i = 2; i <= n; i++)
    {
        cout << mp[make_pair(a[i - 1].first, a[i].first)] << endl;
        cout << "Z " << a[i].second << endl;
    }

    // if (pos.second == 0)
    // {
    //     if (pos.first != 0)
    //     {
    //         cout << "1 ";
    //         if (pos.first < 0)
    //         {
    //             cout << "W" << endl;
    //             cout << "Z " << abs(pos.first) << endl;
    //         }
    //         else if (pos.first > 0)
    //         {
    //             cout << "E" << endl;
    //             cout << "Z " << abs(pos.first) << endl;
    //         }
    //     }
    //     else
    //     {
    //         cout << "7 N" << endl;
    //         cout << "Z 1" << endl;
    //         cout << "L" << endl;
    //         cout << "Z 1" << endl;
    //         cout << "L" << endl;
    //         cout << "Z 1" << endl;
    //         cout << "L" << endl;
    //         cout << "Z 1" << endl;
    //     }
    // }
    // else
    // {
    //     if (pos.first > 0 && pos.second == 0)
    //     {
    //         cout << "1 N" << endl;
    //         cout << "Z " << pos.first << endl;
    //     }
    //     else if (pos.first < 0 && pos.second == 0)
    //     {
    //         cout << "1 S" << endl;
    //         cout << "Z " << abs(pos.first) << endl;
    //     }
    //     else if (pos.first != 0 && pos.second != 0)
    //     {
    //         cout << "3 ";
    //         if (pos.second > 0)
    //             cout << "N" << endl;
    //         else
    //             cout << "S" << endl;
    //         cout << "Z " << abs(pos.second) << endl;
    //         if (pos.second * pos.first > 0)
    //             cout << "R" << endl;
    //         else
    //             cout << "L" << endl;
    //         cout << "Z " << abs(pos.first) << endl;
    //     }
    // }
}

signed main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    int T = 1;
    cin >> T;
    mp[make_pair('S', 'E')] = 'L';
    mp[make_pair('S', 'W')] = 'R';
    mp[make_pair('N', 'E')] = 'R';
    mp[make_pair('N', 'W')] = 'L';
    mp[make_pair('E', 'N')] = 'L';
    mp[make_pair('E', 'S')] = 'R';
    mp[make_pair('W', 'N')] = 'R';
    mp[make_pair('W', 'S')] = 'L';
    while (T--)
        solve();
    // system("pause");
    return 0;
}

源文件, 语言: C++20

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

详细

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: 0

Accepted

time: 0ms

memory: 3840kb

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: 8ms

memory: 3548kb

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