QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#191153#7516. Robot Experimentucup-team133#AC ✓602ms3504kbC++231.7kb2023-09-29 19:12:512023-11-04 11:39:05

Judging History

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

  • [2023-11-04 11:39:05]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:602ms
  • 内存:3504kb
  • [2023-09-29 19:12:52]
  • 评测
  • 测评结果:100
  • 用时:603ms
  • 内存:3820kb
  • [2023-09-29 19:12:51]
  • 提交

answer

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

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    cin >> n;
    string s;
    cin >> s;
    set<pair<int, int>> st;
    for (int mask = 0; mask < (1 << n); mask++) {
        set<pair<int, int>> ng;
        int x = 0, y = 0;
        for (int i = 0; i < n; i++) {
            if (mask & (1 << i)) {
                if (s[i] == 'U') {
                    ng.emplace(x, y + 1);
                } else if (s[i] == 'D') {
                    ng.emplace(x, y - 1);
                } else if (s[i] == 'L') {
                    ng.emplace(x - 1, y);
                } else {
                    ng.emplace(x + 1, y);
                }
            } else {
                if (s[i] == 'U') {
                    y++;
                } else if (s[i] == 'D') {
                    y--;
                } else if (s[i] == 'L') {
                    x--;
                } else {
                    x++;
                }
            }
        }
        if (ng.count(make_pair(0, 0))) {
            continue;
        }
        x = 0, y = 0;
        for (int i = 0; i < n; i++) {
            int nx = x, ny = y;
            if (s[i] == 'U') {
                ny++;
            } else if (s[i] == 'D') {
                ny--;
            } else if (s[i] == 'L') {
                nx--;
            } else {
                nx++;
            }
            if (ng.count(make_pair(nx, ny))) {
                continue;
            }
            x = nx;
            y = ny;
        }
        st.emplace(x, y);
    }
    cout << st.size() << '\n';
    for (auto [x, y] : st) {
        cout << x << " " << y << '\n';
    }
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
RU

output:

4
0 0
0 1
1 0
1 1

result:

ok 5 lines

Test #2:

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

input:

4
LRUD

output:

4
0 -1
0 0
1 -1
1 0

result:

ok 5 lines

Test #3:

score: 0
Accepted
time: 342ms
memory: 3400kb

input:

20
LLLRLRLRLLLRLLRLRLLR

output:

8
-6 0
-5 0
-4 0
-3 0
-2 0
-1 0
0 0
1 0

result:

ok 9 lines

Test #4:

score: 0
Accepted
time: 0ms
memory: 3412kb

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 338ms
memory: 3412kb

input:

20
UUUUUUUUUUUUUUUUUUUU

output:

21
0 0
0 1
0 2
0 3
0 4
0 5
0 6
0 7
0 8
0 9
0 10
0 11
0 12
0 13
0 14
0 15
0 16
0 17
0 18
0 19
0 20

result:

ok 22 lines

Test #6:

score: 0
Accepted
time: 547ms
memory: 3412kb

input:

20
LRUDDULRUDRLLRDURLUD

output:

22
-2 0
-2 1
-1 -2
-1 -1
-1 0
-1 1
-1 2
0 -2
0 -1
0 0
0 1
0 2
1 -2
1 -1
1 0
1 1
1 2
2 -2
2 -1
2 0
2 1
2 2

result:

ok 23 lines

Test #7:

score: 0
Accepted
time: 338ms
memory: 3468kb

input:

20
UUDUDUUDUDUDUDUDLLRL

output:

12
-2 -1
-2 0
-2 1
-2 2
-1 -1
-1 0
-1 1
-1 2
0 -1
0 0
0 1
0 2

result:

ok 13 lines

Test #8:

score: 0
Accepted
time: 336ms
memory: 3416kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

score: 0
Accepted
time: 602ms
memory: 3504kb

input:

20
RUDLUULDRURLDURLDURR

output:

29
-3 3
-3 4
-2 2
-2 3
-2 4
-1 1
-1 2
-1 3
-1 4
0 -1
0 0
0 1
0 2
0 3
0 4
1 -1
1 0
1 1
1 2
1 3
2 -1
2 0
2 1
2 2
2 3
3 -1
3 0
3 1
3 2

result:

ok 30 lines

Test #10:

score: 0
Accepted
time: 509ms
memory: 3408kb

input:

20
DLDLDLDLLLDLLDLDLDLR

output:

108
-10 -8
-10 -7
-10 -6
-10 -5
-10 -4
-10 -3
-10 -2
-10 -1
-10 0
-9 -8
-9 -7
-9 -6
-9 -5
-9 -4
-9 -3
-9 -2
-9 -1
-9 0
-8 -8
-8 -7
-8 -6
-8 -5
-8 -4
-8 -3
-8 -2
-8 -1
-8 0
-7 -8
-7 -7
-7 -6
-7 -5
-7 -4
-7 -3
-7 -2
-7 -1
-7 0
-6 -8
-6 -7
-6 -6
-6 -5
-6 -4
-6 -3
-6 -2
-6 -1
-6 0
-5 -8
-5 -7
-5 -6
-5 -...

result:

ok 109 lines

Extra Test:

score: 0
Extra Test Passed