QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#537501#7516. Robot ExperimentOIer_kzc#AC ✓1ms3948kbC++171.2kb2024-08-30 14:28:302024-08-30 14:28:30

Judging History

你现在查看的是最新测评结果

  • [2024-08-30 14:28:30]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3948kb
  • [2024-08-30 14:28:30]
  • 提交

answer

#include <stdio.h>
#include <string.h>

#include <set>
#include <vector>

#define LOG(FMT...) fprintf(stderr, FMT)

#define eb emplace_back

using namespace std;

typedef long long LL;
constexpr int N = 42, B = 21;
constexpr int dx[4] = {-1, 1, 0, 0}, dy[4] = {0, 0, -1, 1};

int n;
char a[N];
bool was[N][N], vis[N][N];
struct Res {
	int x, y;
	Res() {}
	Res(int _x, int _y) : x(_x), y(_y) {}
	bool operator < (const Res &t) const {
		return x != t.x ? x < t.x : y < t.y;
	}
};
set<Res> res;

void dfs(int t, int x, int y) {
	if (t == n) {
		res.emplace(x, y);
		return;
	}
	bool &cur = vis[x + B][y + B];
	bool bacc = cur;
	cur = true;
	int tx = x + dx[a[t]], ty = y + dy[a[t]];
	bool &obs = was[tx + B][ty + B];
	if (!obs) {
		dfs(t + 1, tx, ty);
	}
	if (!vis[tx + B][ty + B]) {
		bool bac = obs;
		obs = true;
		dfs(t + 1, x, y);
		obs = bac;
	}
	cur = bacc;
}

int main() {
	scanf("%d%s", &n, a);
	for (int i = 0; i < n; ++i) {
		for (int j = 0; j < 4; ++j) {
			if (a[i] == "LRDU"[j]) {
				a[i] = j;
			}
		}
	}
	dfs(0, 0, 0);
	printf("%ld\n", res.size());
	for (auto [x, y] : res) {
		printf("%d %d\n", x, y);
	}
	return 0;
}

这程序好像有点Bug,我给组数据试试?

詳細信息

Test #1:

score: 100
Accepted
time: 0ms
memory: 3912kb

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: 3772kb

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: 3808kb

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: 3824kb

input:

1
D

output:

2
0 -1
0 0

result:

ok 3 lines

Test #5:

score: 0
Accepted
time: 0ms
memory: 3752kb

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: 3916kb

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: 3812kb

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: 3892kb

input:

20
DUUDDUDUUDUDDUUDUDDU

output:

3
0 -1
0 0
0 1

result:

ok 4 lines

Test #9:

score: 0
Accepted
time: 0ms
memory: 3948kb

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: 3744kb

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