QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #547918 | #7516. Robot Experiment | retired_midlights# | AC ✓ | 62ms | 4012kb | C++14 | 1.5kb | 2024-09-05 13:07:46 | 2024-09-05 13:07:46 |
Judging History
answer
#include <bits/stdc++.h>
#define rep(i, a, b) for(int i = (int)a; i <= (int)b; i ++)
#define per(i, a, b) for(int i = (int)a; i >= (int)b; i --)
#define ll long long
using namespace std;
const int maxn = 25 + 20;
int n, mp[maxn][maxn];
char s[maxn];
vector < pair < int, int > > ans;
int main() {
scanf("%d", &n);
scanf("%s", s);
for(int msk = 0; msk < (1 << n); msk ++) {
memset(mp, 0, sizeof(mp));
mp[20][20] = 1;
int x = 20, y = 20;
bool flag = true;
rep(i, 0, n - 1) {
if(msk >> i & 1) {
if(s[i] == 'L') x --;
else if(s[i] == 'R') x ++;
else if(s[i] == 'U') y ++;
else if(s[i] == 'D') y --;
if(mp[x][y] == 0) mp[x][y] = 1;
else if(mp[x][y] == 2) { flag = false; break; }
} else {
int nx = x, ny = y;
if(s[i] == 'L') nx --;
else if(s[i] == 'R') nx ++;
else if(s[i] == 'U') ny ++;
else if(s[i] == 'D') ny --;
if(mp[nx][ny] == 0) mp[nx][ny] = 2;
else if(mp[nx][ny] == 1) { flag = false; break; }
}
}
if(flag) ans.push_back(make_pair(x - 20, y - 20));
}
sort(ans.begin(), ans.end());
auto it = unique(ans.begin(), ans.end());
printf("%d\n", it - ans.begin());
for(auto i = ans.begin(); i < it; i ++) printf("%d %d\n", (*i).first, (*i).second);
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3800kb
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: 3876kb
input:
4 LRUD
output:
4 0 -1 0 0 1 -1 1 0
result:
ok 5 lines
Test #3:
score: 0
Accepted
time: 50ms
memory: 3800kb
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: 3868kb
input:
1 D
output:
2 0 -1 0 0
result:
ok 3 lines
Test #5:
score: 0
Accepted
time: 52ms
memory: 3952kb
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: 54ms
memory: 3808kb
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: 50ms
memory: 3952kb
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: 48ms
memory: 3892kb
input:
20 DUUDDUDUUDUDDUUDUDDU
output:
3 0 -1 0 0 0 1
result:
ok 4 lines
Test #9:
score: 0
Accepted
time: 55ms
memory: 3872kb
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: 62ms
memory: 4012kb
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