QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#472924#7516. Robot ExperimentasitshouldbeAC ✓18ms3836kbC++142.4kb2024-07-11 20:22:522024-07-11 20:22:52

Judging History

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

  • [2024-07-11 20:22:52]
  • 评测
  • 测评结果:AC
  • 用时:18ms
  • 内存:3836kb
  • [2024-07-11 20:22:52]
  • 提交

answer

#include <bits/stdc++.h>
//#pragma GCC optimize(2)
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <unordered_set>
#include <unordered_map>
#define x first
#define y second
#define endl '\n'
#define pi acos(-1.0)
using namespace std;
typedef pair<int, int> PII;
typedef pair<double, int> PDI;
typedef pair<PII, int> PIII;
typedef pair<PII, char> PIIC;
typedef long long LL;
int dx[] = {1, 0, 0, -1, -1, -1, 1, 1}, dy[] = {0, -1, 1, 0, -1, 1, -1, 1};
int mou[] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
const int N = 1e4 + 10, M = 110, mod = 998244353, INF = 0x3f3f3f3f;
const double eps = 1e-8;
int n,m,t;
string str;
set<PII>s;

void dfs(int u,int x,int y,map<PII,int>st)
{
    if(u==n)
    {
        s.insert({x,y});
        return;
    }
    char t=str[u];
    st[{x,y}]=1;
    if(t=='L')
    {
        if(st[{x-1,y}]!=2) dfs(u+1,x-1,y,st);
        //if(!st[{x-1,y}]) dfs(u+1,x,y,st);
        //st[{x,y}]=0;
        if(st[{x-1,y}]!=1)
        {
            st[{x-1,y}]=2;
            dfs(u+1,x,y,st);
            //st[{x,y}]=0;
        }
    }
    else if(t=='R')
    {
        if(st[{x+1,y}]!=2) dfs(u+1,x+1,y,st);
        //if(!st[{x+1,y}]) dfs(u+1,x,y,st);
        //st[{x,y}]=0;
        if(st[{x+1,y}]!=1)
        {
            st[{x+1,y}]=2;
            dfs(u+1,x,y,st);
            //st[{x,y}]=0;  
        }
    }
    else if(t=='U')
    {
        if(st[{x,y+1}]!=2) dfs(u+1,x,y+1,st);
        //if(!st[{x,y+1}]) dfs(u+1,x,y,st);
        //st[{x,y}]=0;
        if(st[{x,y+1}]!=1)
        {
            st[{x,y+1}]=2;
            dfs(u+1,x,y,st);
            //st[{x,y}]=0;
        }
    }
    else  
    {
        if(st[{x,y-1}]!=2) dfs(u+1,x,y-1,st);
        //if(!st[{x,y-1}]) dfs(u+1,x,y,st);
        //st[{x,y}]=0;
        if(st[{x,y-1}]!=1)
        {
            st[{x,y-1}]=2;
            dfs(u+1,x,y,st);
            //st[{x,y}]=0;
        }
    }
}

void solve()
{
    cin>>n>>str;
    map<PII,int>mt;
    dfs(0,0,0,mt);
    cout<<s.size()<<endl;
    for(auto it:s) cout<<it.x<<" "<<it.y<<endl;
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0),cout.precision(10);
    // freopen("in.in","r",stdin);
    // freopen("test.out","w",stdout);  
    t=1; // cin >> t;
    while (t--) solve();
    return 0;
}

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

詳細信息

Test #1:

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

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

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

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

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

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

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: 1ms
memory: 3836kb

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

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

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

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

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: 18ms
memory: 3564kb

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