QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#684769#9521. Giving Directions in HarbinasxziillAC ✓9ms3660kbC++231.5kb2024-10-28 15:45:292024-10-28 15:45:31

Judging History

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

  • [2024-10-28 15:45:31]
  • 评测
  • 测评结果:AC
  • 用时:9ms
  • 内存:3660kb
  • [2024-10-28 15:45:29]
  • 提交

answer

#include <bits/stdc++.h>
using ll = long long;

//按题意模拟
//一开始的方向就是那个

//R +1
std::vector<char> di = {'N', 'E', 'S', 'W'};

void solve() {
    int n;
    std::cin >> n;
    char c;
    int d;
    std::vector<std::array<int, 2>> ans; 
    char ansD;
    char last;
    for (int i = 0; i < n; i++) {
        std::cin >> c >> d;
        if (i == 0) {
            ansD = c;
            ans.push_back({0, d});
        } else {
            if (c == last) {
                ans.push_back({0, d});
            } else {
                for (int x = 0; x < 4; x++) {
                    if (di[x] == last) {
                        if (di[(x + 1) % 4] == c) {
                            ans.push_back({1, 0});
                        } else {
                            ans.push_back({-1, 0});
                        }
                        ans.push_back({0, d});
                        break;
                    }
                }
            }
        }
        last = c;
    }
    std::cout << ans.size() << " " << ansD << "\n";
    for (auto &[x, y] : ans) {
        if (x != 0) {
            std::cout << (x == 1 ? 'R' : 'L') << "\n";
        } else {
            std::cout << "Z " << y << "\n";
        }
    }
}


int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int t;
    std::cin >> t;
    while (t--) {
        solve();
    }

    // solve();

    return 0;
}

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

详细

Test #1:

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

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

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

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