QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #536945 | #7516. Robot Experiment | JEdward | AC ✓ | 3ms | 3876kb | C++17 | 2.9kb | 2024-08-29 18:12:50 | 2024-08-29 18:12:50 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
string a;
int n;
set<pair<int, int>> se;
map<int, map<int, int>> mp;
map<int, map<int, int>> mp2;
void dfs(int k, int x, int y)
{
mp[x][y]++;
// for(int i=3;i>=-3;i--){
// for(int j=-3;j<=3;j++){
// cout<<mp[j][i]<<" ";
// }
// cout<<endl;
// }
// cout<<"-----------"<<endl;
// cout<<a[k]<<endl;
// if (a[k]=='R')
// cout << x << " " <<y << endl;
if (k == n + 1)
{
se.insert({x, y});
mp[x][y]--;
// cout<<"1"<<endl;
return;
// cout << x << " " << y << endl;
}
// if (!(x == 0 && y == 0)){
//
// dfs(k + 1, x, y);
//
// }
if (a[k] == 'L')
{
if (mp2[x - 1][y] == -1)
{
dfs(k + 1, x, y);
}
else
{
if (mp2[x - 1][y] != -1)
dfs(k + 1, x - 1, y);
if (mp[x - 1][y] == 0)
{
mp2[x - 1][y] = -1;
dfs(k + 1, x, y);
mp2[x - 1][y] = 0;
}
}
}
if (a[k] == 'R')
{
if (mp2[x + 1][y] == -1)
{
dfs(k + 1, x, y);
}
else
{
if (mp2[x + 1][y] != -1)
dfs(k + 1, x + 1, y);
if (mp[x + 1][y] == 0)
{
mp2[x + 1][y] = -1;
dfs(k + 1, x, y);
mp2[x + 1][y] = 0;
}
}
// dfs(k + 1, x + 1, y);
}
if (a[k] == 'D')
{
if (mp2[x][y - 1] == -1)
{
dfs(k + 1, x, y);
}
else
{
if (mp2[x][y - 1] != -1)
dfs(k + 1, x, y - 1);
if (mp[x][y - 1] == 0)
{
mp2[x][y - 1] = -1;
dfs(k + 1, x, y);
mp2[x][y - 1] = 0;
}
}
}
if (a[k] == 'U')
{
if (mp2[x][y + 1] == -1)
{
dfs(k + 1, x, y);
}
else
{
if (mp2[x][y + 1] != -1)
dfs(k + 1, x, y + 1);
if (mp[x][y + 1] == 0)
{
mp2[x][y + 1] = -1;
dfs(k + 1, x, y);
mp2[x][y + 1] = 0;
}
}
// dfs(k + 1, x + 1, y);
// dfs(k + 1, x, y - 1);
// dfs(k + 1, x, y + 1);
}
mp[x][y]--;
return;
}
signed main()
{
ios::sync_with_stdio(0), cin.tie(0);
cin >> n;
cin >> a;
a = " " + a;
// mp[-1][0]=-1;
// mp[0][-1]=-1;
// mp[1][1]=-1;
// mp[0][2]=-1;
dfs(1, 0, 0);
cout << se.size() << endl;
// int l = se.size();
for (auto x : se)
{
cout << x.first << " " << x.second << endl;
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3632kb
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: 3576kb
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: 3632kb
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: 1ms
memory: 3868kb
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: 3876kb
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: 3672kb
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: 3804kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 1ms
memory: 3576kb
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: 3ms
memory: 3588kb
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