QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #194139 | #7516. Robot Experiment | ucup-team134# | AC ✓ | 107ms | 3756kb | C++14 | 1.0kb | 2023-09-30 19:15:37 | 2023-11-04 11:40:18 |
Judging History
This is the latest submission verdict.
- [2023-11-04 11:38:55]
- hack成功，自动添加数据
- (//qoj.ac/hack/418)
- [2023-09-30 19:15:37]
- Submitted
answer
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=25;
char s[N];
int mv[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int a[N];
int was[N*2][N*2];
int main(){
int n;
scanf("%i",&n);
scanf("%s",s);
for(int i=0;i<n;i++){
if(s[i]=='L')a[i]=0;
if(s[i]=='R')a[i]=1;
if(s[i]=='D')a[i]=2;
if(s[i]=='U')a[i]=3;
}
set<pair<int,int>> all;
for(int mask=0;mask<(1<<n);mask++){
int x=n,y=n;
vector<pair<int,int>> clr;
was[n][n]=1;
bool ok=true;
for(int i=0;i<n;i++){
if(mask>>i&1){
int nx=x+mv[a[i]][0];
int ny=y+mv[a[i]][1];
clr.pb({nx,ny});
if(was[nx][ny]==1){
ok=false;
break;
}
was[nx][ny]=-1;
}else{
x+=mv[a[i]][0];
y+=mv[a[i]][1];
clr.pb({x,y});
if(was[x][y]==-1){
ok=false;
break;
}
was[x][y]=1;
}
}
for(auto p:clr)was[p.first][p.second]=0;
if(ok)all.insert({x,y});
}
printf("%i\n",all.size());
for(auto p:all)printf("%i %i\n",p.first-n,p.second-n);
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3652kb
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: 3632kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 63ms
memory: 3660kb
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: 1ms
memory: 3620kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 68ms
memory: 3660kb
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: 80ms
memory: 3756kb
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: 65ms
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: 69ms
memory: 3584kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 95ms
memory: 3668kb
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: 107ms
memory: 3700kb
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