QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #239305 | #7516. Robot Experiment | Harry27182 | AC ✓ | 245ms | 3716kb | C++14 | 1.1kb | 2023-11-04 19:57:43 | 2023-11-04 19:57:43 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int n,ban[105][105];vector<pair<int,int> >ans;char s[25];
int main()
{
cin.tie(0)->sync_with_stdio(0);
cin>>n>>s;
for(int i=0;i<(1<<n);i++)
{
int x=0,y=0;
for(int j=0;j<n;j++)
{
int nx=x,ny=y;
if(s[j]=='L')nx--;
if(s[j]=='R')nx++;
if(s[j]=='U')ny++;
if(s[j]=='D')ny--;
if(i&(1<<j))x=nx,y=ny;
else ban[nx+20][ny+20]=1;
}
x=0;y=0;int flag=1;
for(int j=0;j<n;j++)
{
int nx=x,ny=y;
if(ban[x+20][y+20])flag=0;
if(s[j]=='L')nx--;
if(s[j]=='R')nx++;
if(s[j]=='U')ny++;
if(s[j]=='D')ny--;
if(i&(1<<j))x=nx,y=ny;
}
if(ban[x+20][y+20])flag=0;
x=0;y=0;
for(int j=0;j<n;j++)
{
int nx=x,ny=y;
if(s[j]=='L')nx--;
if(s[j]=='R')nx++;
if(s[j]=='U')ny++;
if(s[j]=='D')ny--;
if(i&(1<<j))x=nx,y=ny;
else ban[nx+20][ny+20]=0;
}
if(flag)ans.emplace_back(make_pair(x,y));
}
sort(ans.begin(),ans.end());
int pos=unique(ans.begin(),ans.end())-ans.begin();
cout<<pos<<'\n';
for(int i=0;i<pos;i++)cout<<ans[i].first<<' '<<ans[i].second<<'\n';
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3648kb
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: 3560kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 204ms
memory: 3648kb
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: 224ms
memory: 3716kb
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: 229ms
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: 242ms
memory: 3652kb
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: 245ms
memory: 3584kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 231ms
memory: 3592kb
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: 237ms
memory: 3688kb
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