QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#191153 | #7516. Robot Experiment | ucup-team133# | AC ✓ | 603ms | 3820kb | C++23 | 1.7kb | 2023-09-29 19:12:51 | 2023-09-29 19:12:52 |
Judging History
你现在查看的是测评时间为 2023-09-29 19:12:52 的历史记录
- [2023-11-04 11:38:55]
- hack成功,自动添加数据
- (//qoj.ac/hack/418)
- [2023-09-29 19:12:51]
- 提交
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
set<pair<int, int>> st;
for (int mask = 0; mask < (1 << n); mask++) {
set<pair<int, int>> ng;
int x = 0, y = 0;
for (int i = 0; i < n; i++) {
if (mask & (1 << i)) {
if (s[i] == 'U') {
ng.emplace(x, y + 1);
} else if (s[i] == 'D') {
ng.emplace(x, y - 1);
} else if (s[i] == 'L') {
ng.emplace(x - 1, y);
} else {
ng.emplace(x + 1, y);
}
} else {
if (s[i] == 'U') {
y++;
} else if (s[i] == 'D') {
y--;
} else if (s[i] == 'L') {
x--;
} else {
x++;
}
}
}
if (ng.count(make_pair(0, 0))) {
continue;
}
x = 0, y = 0;
for (int i = 0; i < n; i++) {
int nx = x, ny = y;
if (s[i] == 'U') {
ny++;
} else if (s[i] == 'D') {
ny--;
} else if (s[i] == 'L') {
nx--;
} else {
nx++;
}
if (ng.count(make_pair(nx, ny))) {
continue;
}
x = nx;
y = ny;
}
st.emplace(x, y);
}
cout << st.size() << '\n';
for (auto [x, y] : st) {
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: 3820kb
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: 3596kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 334ms
memory: 3780kb
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: 3744kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 346ms
memory: 3744kb
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: 548ms
memory: 3612kb
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: 347ms
memory: 3524kb
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: 347ms
memory: 3744kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 603ms
memory: 3608kb
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: 520ms
memory: 3612kb
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