QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #192026 | #7516. Robot Experiment | PhantomThreshold# | AC ✓ | 230ms | 3952kb | C++14 | 1.3kb | 2023-09-30 13:20:25 | 2023-09-30 13:20:25 |
Judging History
你现在查看的是测评时间为 2023-09-30 13:20:25 的历史记录
- [2023-11-04 11:38:55]
- hack成功，自动添加数据
- (//qoj.ac/hack/418)
- [2023-09-30 13:20:25]
- 提交
answer
#include <bits/stdc++.h>
using namespace std;
const int dx[]={-1,1,0,0};
const int dy[]={0,0,-1,1};
int n;
string str;
int a[100050];
int main(){
ios_base::sync_with_stdio(false);
cin >> n;
cin >> str;
for (int i=0;i<n;i++){
if (str[i]=='L') a[i]=0;
if (str[i]=='R') a[i]=1;
if (str[i]=='D') a[i]=2;
if (str[i]=='U') a[i]=3;
}
// for (int i=0;i<n;i++) cout << a[i] << " \n"[i==n-1];
vector<pair<int,int>> ans;
for (int mask=0;mask<(1<<n);mask++){
bool flag=1;
int nowx=0,nowy=0;
set<pair<int,int>> s;
set<pair<int,int>> vis;
vis.emplace(nowx,nowy);
for (int i=0;i<n;i++){
int nxtx=nowx+dx[a[i]];
int nxty=nowy+dy[a[i]];
if ((mask>>i)&1){
if (vis.count(make_pair(nxtx,nxty))){
flag=0;
break;
}
s.emplace(nxtx,nxty);
}
else{
if (s.count(make_pair(nxtx,nxty))){
flag=0;
break;
}
nowx=nxtx;
nowy=nxty;
vis.emplace(nowx,nowy);
}
}
// cerr << mask << "\n";
// cerr << nowx << " " << nowy << endl;
if (flag){
ans.emplace_back(nowx,nowy);
}
}
sort(ans.begin(),ans.end());
ans.resize(unique(ans.begin(),ans.end())-ans.begin());
cout << (int)ans.size() << "\n";
for (auto [x,y]:ans){
cout << x << " " << y << "\n";
}
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3620kb
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: 3868kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 90ms
memory: 3624kb
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: 3616kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 97ms
memory: 3864kb
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: 148ms
memory: 3600kb
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: 89ms
memory: 3564kb
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: 101ms
memory: 3560kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 182ms
memory: 3564kb
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: 230ms
memory: 3952kb
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