QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #548926 | #7516. Robot Experiment | Stelor | WA | 66ms | 3728kb | C++17 | 1.2kb | 2024-09-05 22:10:00 | 2024-09-05 22:10:02 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,num;
string s;
map<pair<int,int>,int> mp;
set<pair<int,int>> ans;
void dfs(int x,int y,int now)
{
if(now==n)
{
ans.insert({x,y});
return;
}
if(s[now]=='L')
{
if(mp.count({x-1,y}))
{
dfs(x-1,y,now+1);
}
else
{
dfs(x,y,now+1);
mp[{x-1,y}]=1;
dfs(x-1,y,now+1);
mp.erase({x-1,y});
}
}
else if(s[now]=='R')
{
if(mp.count({x+1,y}))
{
dfs(x+1,y,now+1);
}
else
{
dfs(x,y,now+1);
mp[{x+1,y}]=1;
dfs(x+1,y,now+1);
mp.erase({x+1,y});
}
}
else if(s[now]=='U')
{
if(mp.count({x,y+1}))
{
dfs(x,y+1,now+1);
}
else
{
dfs(x,y,now+1);
mp[{x,y+1}]=1;
dfs(x,y+1,now+1);
mp.erase({x,y+1});
}
}
else if(s[now]=='D')
{
if(mp.count({x,y-1}))
{
dfs(x,y-1,now+1);
}
else
{
dfs(x,y,now+1);
mp[{x,y-1}]=1;
dfs(x,y-1,now+1);
mp.erase({x,y-1});
}
}
}
void solve()
{
cin>>n>>s;
mp[{0,0}]=1;
dfs(0,0,0);
int len=ans.size();
cout<<len<<"\n";
for(auto [x,y]:ans)
{
cout<<x<<" "<<y<<'\n';
}
}
int main()
{
ios::sync_with_stdio(0),cin.tie(0);
solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 3652kb
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: 3600kb
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: 66ms
memory: 3672kb
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: 3588kb
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: 3676kb
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: 3728kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: -100
Wrong Answer
time: 1ms
memory: 3652kb
input:
20 RUDLUULDRURLDURLDURR
output:
31 -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 4 0 4 1
result:
wrong answer 1st lines differ - expected: '29', found: '31'