QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #192002 | #7516. Robot Experiment | ucup-team1525# | AC ✓ | 1ms | 3848kb | C++14 | 883b | 2023-09-30 13:16:49 | 2023-09-30 13:16:49 |
Judging History
你现在查看的是测评时间为 2023-09-30 13:16:49 的历史记录
- [2023-11-04 11:38:55]
- hack成功，自动添加数据
- (//qoj.ac/hack/418)
- [2023-09-30 13:16:49]
- 提交
answer
#include<bits/stdc++.h>
using namespace std;
const int N=25;
int n;
char s[N];
set<pair<int,int> > ss;
int a[50][50];
void dfs(int x,int y,int p)
{
if (p==n)
{
ss.insert({x,y});
return;
}
int nx=x,ny=y;
if (s[p]=='L')
--nx;
if (s[p]=='R')
++nx;
if (s[p]=='D')
--ny;
if (s[p]=='U')
++ny;
if (a[nx][ny]==0)
{
a[nx][ny]=1;
dfs(nx,ny,p+1);
a[nx][ny]=-1;
dfs(x,y,p+1);
a[nx][ny]=0;
}
else
{
if (a[nx][ny]==1)
dfs(nx,ny,p+1);
else
dfs(x,y,p+1);
}
}
int main()
{
scanf("%d",&n);
scanf("%s",s);
a[20][20]=1;
dfs(20,20,0);
printf("%d\n",(int)ss.size());
for (auto p:ss)
printf("%d %d\n",p.first-20,p.second-20);
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3664kb
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: 3540kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 1ms
memory: 3696kb
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: 3848kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 0ms
memory: 3624kb
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: 3800kb
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: 1ms
memory: 3548kb
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: 3540kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 0ms
memory: 3600kb
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: 1ms
memory: 3616kb
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