QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#248506#7516. Robot ExperimentUFRJ#AC ✓929ms3488kbC++201.5kb2023-11-11 19:37:052023-11-11 19:37:06

Judging History

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

  • [2023-11-11 19:37:06]
  • 评测
  • 测评结果:AC
  • 用时:929ms
  • 内存:3488kb
  • [2023-11-11 19:37:05]
  • 提交

answer

#include "bits/stdc++.h"

using namespace std;
using lint = int64_t;

using pii = pair<int, int>;
pii next_pos(int x, int y, char c){
    if(c == 'L') return {x-1, y};
    if(c == 'R') return {x+1, y};
    if(c == 'U') return {x, y+1};
    return {x, y-1};
}

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    int n; cin>>n;
    string s; cin>>s;
    set<pii> ans;
    for(int m = 0; m < (1<<n); m++){
        set<pii> blocked, visited;
        visited.insert({0,0});
        int x = 0, y = 0;
        bool ok = true;
        for(int i = 0; i<n; i++){
            pii go = next_pos(x, y, s[i]);
            if((m>>i) & 1){
                blocked.insert(go);
                continue;
            }
            visited.insert(go);
            tie(x, y) = go;
        }
        for(auto [px, py] : visited)
            if(blocked.count({px, py}))
                ok = false;
        if(ok){
            ans.insert({x, y});
        
        }
    }
    cout<<ans.size()<<"\n";
    for(auto [x, y]: ans) cout<<x<<" "<<y<<"\n";
    
    return 0;
}




/*
LRUD
0000
0 0
-1 0
0 0
0 1
0 0
0001
0 0
1 0
1 1
1 0
0010
0 0
-1 0
-1 1
-1 0
0011
0 0
0 1
0 0
0100
0 0
-1 0
0 0
0 -1
0101
0 0
1 0
1 -1
0110
0 0
-1 0
-1 -1
0111
0 0
0 -1
1000
0 0
-1 0
0 0
0 1
1001
0 0
1 0
1 1
1010
0 0
-1 0
-1 1
1011
0 0
0 1
1100
0 0
-1 0
0 0
1101
0 0
1 0
1110
0 0
-1 0
1111
0 0
9
-1 -1
-1 0
-1 1
0 -1
0 0
0 1
1 -1
1 0
1 1


*/

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

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3476kb

input:

2
RU

output:

4
0 0
0 1
1 0
1 1

result:

ok 5 lines

Test #2:

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

input:

4
LRUD

output:

4
0 -1
0 0
1 -1
1 0

result:

ok 5 lines

Test #3:

score: 0
Accepted
time: 461ms
memory: 3396kb

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

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 617ms
memory: 3424kb

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: 865ms
memory: 3488kb

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: 497ms
memory: 3376kb

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: 484ms
memory: 3364kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

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

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: 741ms
memory: 3400kb

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