QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #347487 | #7516. Robot Experiment | ucup-team1209 | AC ✓ | 1ms | 3764kb | C++20 | 1001b | 2024-03-09 14:01:15 | 2024-03-09 14:01:16 |
Judging History
answer
#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
const int N = 100;
int map[N][N];
std::set<std::pair<int, int>> ans;
int n;
char s[N];
void dfs(int x, int y, int id) {
if(id == n) {
ans.emplace(x, y);
return ;
}
int dx = 0;
int dy = 0;
if(s[id] == 'L') dx = -1;
if(s[id] == 'R') dx = +1;
if(s[id] == 'D') dy = -1;
if(s[id] == 'U') dy = +1;
int gx = x + dx, gy = y + dy;
if(map[gx][gy] == -1) {
map[gx][gy] = 0;
dfs(gx, gy, id + 1);
map[gx][gy] = 1;
dfs(x, y, id + 1);
map[gx][gy] = -1;
} else if(map[gx][gy]) {
dfs(x, y, id + 1);
} else {
dfs(gx, gy, id + 1);
}
}
int main() {
#ifdef zqj
freopen("1.in", "r", stdin);
#endif
std::ios::sync_with_stdio(false), cin.tie(0);
cin >> n >> s;
memset(map, -1, sizeof(map));
map[50][50] = 0;
dfs(50, 50, 0);
cout << ans.size() << '\n';
for(auto [x, y] : ans) {
cout << x - 50 << ' ' << y - 50 << '\n';
}
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3764kb
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: 3700kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 0ms
memory: 3640kb
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: 3692kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 0ms
memory: 3708kb
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: 0ms
memory: 3700kb
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: 0ms
memory: 3704kb
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: 0ms
memory: 3640kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 0ms
memory: 3760kb
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: 1ms
memory: 3656kb
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