QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #276691 | #7516. Robot Experiment | ship2077 | AC ✓ | 136ms | 3952kb | C++14 | 955b | 2023-12-06 09:34:11 | 2023-12-06 09:34:11 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
constexpr int M=45;
char s[M];int n;map<pair<int,int>,bool>mp;
vector<pair<int,int>>vec,ans;bool vis[M][M];
bool chk(int sta){ int x=n,y=n;
if (vis[n][n]) return 0;
for (int i=0,f;i<n;i++){
int x_=x-(s[i]=='L')+(s[i]=='R'),
y_=y-(s[i]=='D')+(s[i]=='U');
if (vis[x_][y_]) f=1;
else x=x_,y=y_,f=0;
if ((sta>>i&1)^f) return 0;
}
return 1;
}
int main(){
scanf("%d%s",&n,s);
for (int sta=0;sta<(1<<n);sta++){
int x=n,y=n;
for (int i=0;i<n;i++){
int x_=x-(s[i]=='L')+(s[i]=='R'),
y_=y-(s[i]=='D')+(s[i]=='U');
if (sta>>i&1) vis[x_][y_]=1,vec.push_back({x_,y_});
else x=x_,y=y_;
}
if (chk(sta)&&!mp[{x,y}])
mp[{x,y}]=1,ans.push_back({x,y});
for (auto x:vec)
vis[x.first][x.second]=0;
vec.clear();
}
sort(ans.begin(),ans.end());
printf("%d\n",(int)ans.size());
for (auto x:ans) printf("%d %d\n",x.first-n,x.second-n);
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3864kb
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: 3856kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 107ms
memory: 3872kb
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: 3948kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 120ms
memory: 3756kb
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: 109ms
memory: 3792kb
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: 102ms
memory: 3872kb
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: 103ms
memory: 3952kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 112ms
memory: 3868kb
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: 136ms
memory: 3800kb
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