QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #539105 | #7516. Robot Experiment | Rykony | AC ✓ | 2ms | 3792kb | C++20 | 1.3kb | 2024-08-31 14:00:39 | 2024-08-31 14:00:39 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
struct node{
int x;
int y;
node(){}
node(int _x,int _y){
x=_x;
y=_y;
}
};
int main()
{
int n;
cin>>n;
string s;
cin>>s;
s=" "+s;
int to[4][2]={{0,1},{1,0},{0,-1},{-1,0}};
map<char,int> mp;
mp['L']=3; mp['R']=1; mp['U']=0; mp['D']=2;
map<pii,int> ans;
vector <vector <int> > wor(100,vector <int> (100,0));
int add=30;
wor[add][add]=-1;
function<void(node,int)> dfs=[&](node a,int id)
{
if (id==n+1){
ans[make_pair(a.x,a.y)]++;
return;
}
int cg=wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add];
if (!wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]||wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]==1){
wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]=1;
dfs(a,id+1);
}
if (!cg) wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]=0;
if (!wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]||wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]==-1){
wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]=-1;
dfs(node(a.x+to[mp[s[id]]][0],a.y+to[mp[s[id]]][1]),id+1);
}
if (!cg) wor[a.x+to[mp[s[id]]][0]+add][a.y+to[mp[s[id]]][1]+add]=0;
};
dfs(node(0,0),1);
cout<<ans.size()<<'\n';
for (auto [x,t]:ans){
cout<<x.first<<" "<<x.second<<'\n';
}
}
这程序好像有点Bug，我给组数据试试？
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3568kb
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: 3792kb
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: 3632kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 0ms
memory: 3568kb
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: 3632kb
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: 3636kb
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: 3628kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 0ms
memory: 3624kb
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: 3652kb
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