QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#545466#7516. Robot ExperimentLiangsheng298#AC ✓2ms3728kbC++141.9kb2024-09-03 13:21:402024-09-03 13:21:40

Judging History

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

  • [2024-09-03 13:21:40]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3728kb
  • [2024-09-03 13:21:40]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
template <typename T>
inline T read(){
    T x=0;char ch=getchar();bool fl=false;
    while(!isdigit(ch)){if(ch=='-')fl=true;ch=getchar();}
    while(isdigit(ch)){
        x=(x<<3)+(x<<1)+(ch^48);ch=getchar();
    }
    return fl?-x:x;
}
#define FASTIO ios::sync_with_stdio(false);cin.tie(0);
#define LL long long
#define read() read<int>()
int n;
char s[25];
#define Pair pair<int,int>
set<Pair> S;
map<Pair,int> mp;
void dfs(int de,int x,int y){
    if(de==n+1){
        S.insert(make_pair(x,y));return ;
    }
    if(s[de]=='L'){
        auto t=make_pair(x-1,y);
        if(!mp[t]){
            mp[t]=1;dfs(de+1,t.first,t.second);
            mp[t]=-1;dfs(de+1,x,y);
            mp[t]=0;
        }
        else if(mp[t]==1)dfs(de+1,t.first,t.second);
        else dfs(de+1,x,y);
    }
    else if(s[de]=='R'){
        auto t=make_pair(x+1,y);
        if(!mp[t]){
            mp[t]=1;dfs(de+1,t.first,t.second);
            mp[t]=-1;dfs(de+1,x,y);
            mp[t]=0;
        }
        else if(mp[t]==1)dfs(de+1,t.first,t.second);
        else dfs(de+1,x,y);
    }
    else if(s[de]=='U'){
        auto t=make_pair(x,y+1);
        if(!mp[t]){
            mp[t]=1;dfs(de+1,t.first,t.second);
            mp[t]=-1;dfs(de+1,x,y);
            mp[t]=0;
        }
        else if(mp[t]==1)dfs(de+1,t.first,t.second);
        else dfs(de+1,x,y);
    }
    else {
        auto t=make_pair(x,y-1);
        if(!mp[t]){
            mp[t]=1;dfs(de+1,t.first,t.second);
            mp[t]=-1;dfs(de+1,x,y);
            mp[t]=0;
        }
        else if(mp[t]==1)dfs(de+1,t.first,t.second);
        else dfs(de+1,x,y);
    }
}
int main(){
    FASTIO;
    cin>>n>>(s+1);
    mp[make_pair(0,0)]=true;
    dfs(1,0,0);
    cout<<S.size()<<'\n';
    for(auto t:S)cout<<t.first<<' '<<t.second<<'\n';
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

input:

4
LRUD

output:

4
0 -1
0 0
1 -1
1 0

result:

ok 5 lines

Test #3:

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

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

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

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

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: 0ms
memory: 3728kb

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: 0ms
memory: 3668kb

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: 0ms
memory: 3708kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

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

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: 2ms
memory: 3672kb

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