QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#450709 | #7516. Robot Experiment | Rainbow_Automaton | AC ✓ | 150ms | 3692kb | C++14 | 1.3kb | 2024-06-22 17:18:50 | 2024-06-22 17:18:50 |
Judging History
answer
#include <iostream>
#include <set>
#include <cstring>
const int maxn = 45;
int n;
char a[maxn];
bool vis[maxn][maxn];
bool mark[maxn][maxn];
std::set< std::pair<int, int> > ans;
int main () {
std::cin >> n;
for (int i = 1; i <= n; i++) { std::cin >> a[i]; }
for (int S = 0; S <= (1 << n) - 1; S++) {
memset (mark, 0, sizeof (mark));
memset (vis, 0, sizeof (vis));
int now_x = 0, now_y = 0;
for (int i = 1; i <= n; i++) {
vis[now_x + 22][now_y + 22] = true;
int nx = now_x; int ny = now_y;
if (a[i] == 'L') { nx --; }
if (a[i] == 'R') { nx ++; }
if (a[i] == 'U') { ny ++; }
if (a[i] == 'D') { ny --; }
if ((S & (1 << (i - 1))) and not mark[nx + 22][ny + 22]) {
now_x = nx; now_y = ny;
} else {
mark[nx + 22][ny + 22] = true;
if (vis[nx + 22][ny + 22]) { goto illegal; }
}
}
ans.insert ({ now_x, now_y });
illegal: continue;
}
std::cout << ans.size () << "\n";
for (auto now : ans) {
std::cout << now.first << " " << now.second << "\n";
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3592kb
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: 3592kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 73ms
memory: 3692kb
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: 3632kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 150ms
memory: 3544kb
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: 60ms
memory: 3564kb
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: 73ms
memory: 3540kb
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: 70ms
memory: 3640kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 64ms
memory: 3568kb
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: 147ms
memory: 3524kb
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