QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#695423#9521. Giving Directions in Harbin13924831942AC ✓8ms3856kbC++201.3kb2024-10-31 20:00:242024-10-31 20:00:25

Judging History

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

  • [2024-10-31 20:00:25]
  • 评测
  • 测评结果:AC
  • 用时:8ms
  • 内存:3856kb
  • [2024-10-31 20:00:24]
  • 提交

answer

#include <bits/stdc++.h>
#define endl '\n' 
using namespace std;
#pragma GCC optimize("O3")
typedef long long LL;

const int N = 2e5 + 10;
const LL mod = 1e9 + 7;
using PII = pair<int, int>;

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

void solve()
{
    int n; cin >>n;
    char st;
    char dir;
    vector<pair<char, int>> ans;
    {
        cin >>dir;
        st = dir;
        int x; cin >>x;
        ans.push_back({'Z', x});
    }
    for(int i = 2; i <= n; i++)
    {
        char to; int x;
        cin >>to >>x;
        ans.push_back({mp[dir][to], -1});
        ans.push_back({'Z', x});
        dir = to;
    }
    cout <<ans.size() <<' ' <<st <<endl;
    for(auto [x, y] : ans)
    {
        if(y == -1)
        {
            cout <<x <<endl;
        }
        else  
        {
            cout <<x <<' ' <<y <<endl;
        }
    }
}

signed main ()
{
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);

    mp['N']['N'] = 'Z';
    mp['N']['E'] = 'R';
    mp['N']['W'] = 'L';
    mp['S']['S'] = 'Z';
    mp['S']['E'] = 'L';
    mp['S']['W'] = 'R';
    mp['E']['E'] = 'Z';
    mp['E']['N'] = 'L';
    mp['E']['S'] = 'R';
    mp['W']['W'] = 'Z';
    mp['W']['S'] = 'L';
    mp['W']['N'] = 'R';
    int T; cin >>T;
    while(T--)
    {
        solve();
    }

    return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3816kb

input:

1
2
S 2
E 1

output:

3 S
Z 2
L
Z 1

result:

ok ok (1 test case)

Test #2:

score: 0
Accepted
time: 1ms
memory: 3560kb

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

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