QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#684074	#9521. Giving Directions in Harbin	Yshanqian	AC ✓	9ms	3592kb	C++20	2.9kb	2024-10-28 09:53:06	2024-10-28 09:53:11

Judging History

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

[2024-10-28 09:53:11]
评测

测评结果：AC
用时：9ms
内存：3592kb

查看

[2024-10-28 09:53:06]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define lowbit(x) x & (-x)
typedef pair<char, int> pii;
#define LF(x) fixed << setprecision(x)
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
void solve()
{
    int n;
    cin >> n;
    char ch = '#';
    vector<pii> ans;
    char pre = '#';
    for (int i = 1; i <= n; i++)
    {
        char s;
        int d;
        cin >> s >> d;
        if (i == 1)
            ch = s;
        if (pre == '#')
            ans.pb({'Z', d});
        else
        {
            if (pre == s)
            {
                ans.pb({'Z', d});
            }
            else
            {
                if (pre == 'S')
                {
                    if (s == 'E')
                    {
                        ans.pb({'L', 0});
                        ans.pb({'Z', d});
                    }
                    else if (s == 'W')
                    {
                        ans.pb({'R', 0});
                        ans.pb({'Z', d});
                    }
                }
                else if (pre == 'N')
                {
                    if (s == 'E')
                    {
                        ans.pb({'R', 0});
                        ans.pb({'Z', d});
                    }
                    else if (s == 'W')
                    {
                        ans.pb({'L', 0});
                        ans.pb({'Z', d});
                    }
                }
                else if (pre == 'E')
                {
                    if (s == 'N')
                    {
                        ans.pb({'L', 0});
                        ans.pb({'Z', d});
                    }
                    else if (s == 'S')
                    {
                        ans.pb({'R', 0});
                        ans.pb({'Z', d});
                    }
                }
                else
                {
                    if (s == 'N')
                    {
                        ans.pb({'R', 0});
                        ans.pb({'Z', d});
                    }
                    else if (s == 'S')
                    {
                        ans.pb({'L', 0});
                        ans.pb({'Z', d});
                    }
                }
            }
        }
        pre = s;
    }
    cout << ans.size() << ' ';
    cout << ch << '\n';
    for (auto [x, y] : ans)
    {
        if (x == 'Z')
            cout << x << " " << y << endl;
        else
            cout << x << endl;
    }
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}

Source code, Language: C++20

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

Details

Tip: Click on the bar to expand more detailed information

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

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

memory: 3552kb

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