QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#711401	#9521. Giving Directions in Harbin	ucup-team1329^#	WA	1ms	3612kb	C++17	2.8kb	2024-11-05 10:33:59	2024-11-05 10:34:08

Judging History

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

[2024-11-05 10:34:08]
评测

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

查看

[2024-11-05 10:33:59]
提交

answer

#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define all1(x) x.begin() + 1, x.end()
#define bit1(x) __builtin_popcountll(x)
#define Pqueue priority_queue
#define lc p << 1
#define rc p << 1 | 1
#define IOS ios::sync_with_stdio(false), cin.tie(0);
#define fi first
#define se second
#define lowbit(x) (x & -x)

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<ll, ll> PII;

const ll mod = 1000000007;
const ll N = 1e6 + 10;
const ld eps = 1e-9;
const ll inf = 1e18;
const ll P = 131;
const ll dir[8][2] = {1, 0, 0, 1, -1, 0, 0, -1, 1, 1, 1, -1, -1, 1, -1, -1};

void solve()
{
    int n;
    cin >> n;
    vector<string> p(n + 1);
    vector<int> d(n + 1);
    vector<string> ans;
    for (int i = 1; i <= n; i++)
        cin >> p[i] >> d[i];

    auto get_dir = [&](string o, string n)
    {
        map<string, int> mp({{"N", 1}, {"E", 2}, {"S", 3}, {"W", 4}});

        if (o == n)
            return;

        if (abs(mp[o] - mp[n]) == 2)
        {
            ans.push_back("L");
            ans.push_back("L");
        }
        else
        {
            if (o == "N" && n == "W" || mp[n] < mp[o])
                ans.push_back("L");
            else
                ans.push_back("R");
        }
    };

    // ans.push_back(p[1]);
    ans.push_back("Z " + to_string(d[1]));
    for (int i = 2; i <= n; i++)
    {
        get_dir(p[i - 1], p[i]);
        ans.push_back("Z " + to_string(d[i]));
    }

    cout << ans.size() << " " << p[1] << "\n";
    for (auto i : ans)
        cout << i << "\n";
}
/*
1
2
S 2
E 1
*/

int main()
{
    IOS int T = 1;
    cin >> T;
    while (T--)
        solve();
    return 0;
}

/*
oxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxox
x                                                                                      o
o       _/_/_/_/                                                              _/       x
x      _/                                                                              o
o     _/_/_/_/ _/  _/_/   _/_/   _/_/_/ _/_/   _/_/_/     _/_/    _/_/_/    _/ _/   _/ x
x    _/       _/_/     _/    _/ _/   _/   _/  _/    _/ _/    _/  _/    _/  _/   _/ _/  o
o   _/       _/       _/    _/ _/   _/   _/  _/    _/ _/    _/  _/    _/  _/    _/_/   x
x  _/       _/         _/_/   _/   _/   _/  _/_/_/     _/_/ _/ _/    _/  _/      _/    o
o                                          _/                           _/      _/     x
x                                         _/                        _/_/       _/      o
o                                                                                      x
xoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxoxo
*/

源文件, 语言: C++17

详细

Test #1:

score: 100

Accepted

time: 1ms

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: 3612kb

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
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
L
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
L
Z 4
R
Z 5
L
Z 9
15 N
Z 6
L
Z 10
L
Z 6
L
Z 6
L
Z 6
L
Z 6
R
Z 6
L
Z 10
19 N
Z 7
L
Z 3
L
Z 5
...

result:

wrong answer Wrong destination (test case 2)