QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#301887#7781. Sheep Eat Wolveszzuqy#AC ✓30ms3936kbC++141.6kb2024-01-10 13:50:342024-10-14 07:46:55

Judging History

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

  • [2024-10-14 07:46:55]
  • 管理员手动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:30ms
  • 内存:3936kb
  • [2024-09-05 08:34:25]
  • hack成功,自动添加数据
  • (/hack/803)
  • [2024-09-05 08:23:36]
  • hack成功,自动添加数据
  • (/hack/802)
  • [2024-01-10 13:50:34]
  • 评测
  • 测评结果:100
  • 用时:35ms
  • 内存:3972kb
  • [2024-01-10 13:50:34]
  • 提交

answer

#include <bits/stdc++.h>
#define N 109
using namespace std;
int x, y, p, q;
int d[N][N][2];

struct node {
	int x, y, side;
};

bool check(int x, int y) {
	if (x == 0)
		return 1;
	return x + q >= y;
}

void bfs() {
	fill(d[0][0], d[0][0] + 2 * N * N, 1000000000);
	queue<node>q;
	q.push((node) {
		x, y, 0
	});
	d[x][y][0] = 0;
	while (!q.empty()) {
		node tmp = q.front();
		q.pop();
		if (tmp.side == 0) {
			for (int a = 0; a <= tmp.x; a++)
				for (int b = 0; b <= tmp.y && a + b <= p; b++) {
					if (!check(tmp.x - a, tmp.y - b))
						continue;
					if (d[tmp.x - a][tmp.y - b][1] != 1000000000)
						continue;
					d[tmp.x - a][tmp.y - b][1] = d[tmp.x][tmp.y][0] + 1;
					q.push((node) {
						tmp.x - a, tmp.y - b, 1
					});
					//cout << tmp.x - a << " " << tmp.y - b << " " << 1 << " " << d[tmp.x - a][tmp.y - b][1] << endl;
				}
		} else {
			for (int a = 0; a <= x - tmp.x; a++)
				for (int b = 0; b <= y - tmp.y && a + b <= p; b++) {
					if (!check(x - tmp.x - a, y - tmp.y - b))
						continue;
					if (d[tmp.x + a][tmp.y + b][0] != 1000000000)
						continue;
					d[tmp.x + a][tmp.y + b][0] = d[tmp.x][tmp.y][1] + 1;
					q.push((node) {
						tmp.x + a, tmp.y + b, 0
					});
					//cout << tmp.x + a << " " << tmp.y + b << " " << 0 << " " << d[tmp.x + a][tmp.y + b][0] << endl;
				}
		}
	}
	int ans = 1000000000;
	for (int i = 0; i <= y; i++)
		ans = min(ans, d[0][i][1]);
	if (ans == 1000000000)
		cout << -1;
	else
		cout << ans;
}

//x&y are on the left side
int main() {
	cin >> x >> y >> p >> q;
	bfs();;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

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

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

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

input:

1 1 1 0

output:

1

result:

ok 1 number(s): "1"

Test #5:

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

input:

3 3 1 1

output:

7

result:

ok 1 number(s): "7"

Test #6:

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

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

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

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

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

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

score: 0
Accepted
time: 1ms
memory: 3924kb

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

score: 0
Accepted
time: 1ms
memory: 3628kb

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

60 60 8 4

output:

27

result:

ok 1 number(s): "27"

Test #12:

score: 0
Accepted
time: 1ms
memory: 3888kb

input:

60 60 8 8

output:

25

result:

ok 1 number(s): "25"

Test #13:

score: 0
Accepted
time: 1ms
memory: 3856kb

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

score: 0
Accepted
time: 1ms
memory: 3932kb

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

score: 0
Accepted
time: 2ms
memory: 3736kb

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

score: 0
Accepted
time: 2ms
memory: 3936kb

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

score: 0
Accepted
time: 1ms
memory: 3636kb

input:

75 15 1 1

output:

175

result:

ok 1 number(s): "175"

Test #18:

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

input:

50 100 1 0

output:

-1

result:

ok 1 number(s): "-1"

Test #19:

score: 0
Accepted
time: 2ms
memory: 3692kb

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

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

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

score: 0
Accepted
time: 2ms
memory: 3736kb

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

score: 0
Accepted
time: 2ms
memory: 3692kb

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

score: 0
Accepted
time: 4ms
memory: 3932kb

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

score: 0
Accepted
time: 3ms
memory: 3640kb

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

score: 0
Accepted
time: 1ms
memory: 3628kb

input:

100 100 5 0

output:

95

result:

ok 1 number(s): "95"

Test #26:

score: 0
Accepted
time: 4ms
memory: 3700kb

input:

100 100 25 3

output:

13

result:

ok 1 number(s): "13"

Test #27:

score: 0
Accepted
time: 6ms
memory: 3708kb

input:

100 100 30 4

output:

11

result:

ok 1 number(s): "11"

Test #28:

score: 0
Accepted
time: 1ms
memory: 3596kb

input:

95 100 3 3

output:

125

result:

ok 1 number(s): "125"

Test #29:

score: 0
Accepted
time: 14ms
memory: 3732kb

input:

98 99 50 6

output:

5

result:

ok 1 number(s): "5"

Test #30:

score: 0
Accepted
time: 9ms
memory: 3720kb

input:

100 100 45 4

output:

7

result:

ok 1 number(s): "7"

Test #31:

score: 0
Accepted
time: 17ms
memory: 3732kb

input:

100 100 40 39

output:

7

result:

ok 1 number(s): "7"

Test #32:

score: 0
Accepted
time: 16ms
memory: 3728kb

input:

100 100 45 19

output:

7

result:

ok 1 number(s): "7"

Test #33:

score: 0
Accepted
time: 27ms
memory: 3688kb

input:

100 100 49 99

output:

5

result:

ok 1 number(s): "5"

Test #34:

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

input:

100 100 49 100

output:

5

result:

ok 1 number(s): "5"

Test #35:

score: 0
Accepted
time: 26ms
memory: 3724kb

input:

100 100 49 98

output:

5

result:

ok 1 number(s): "5"

Test #36:

score: 0
Accepted
time: 26ms
memory: 3692kb

input:

100 100 49 97

output:

5

result:

ok 1 number(s): "5"

Test #37:

score: 0
Accepted
time: 26ms
memory: 3632kb

input:

100 100 49 96

output:

5

result:

ok 1 number(s): "5"

Test #38:

score: 0
Accepted
time: 26ms
memory: 3760kb

input:

100 100 49 95

output:

5

result:

ok 1 number(s): "5"

Test #39:

score: 0
Accepted
time: 30ms
memory: 3736kb

input:

100 100 100 0

output:

1

result:

ok 1 number(s): "1"

Test #40:

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

input:

1 100 1 0

output:

1

result:

ok 1 number(s): "1"

Test #41:

score: 0
Accepted
time: 1ms
memory: 3684kb

input:

90 100 5 5

output:

87

result:

ok 1 number(s): "87"

Test #42:

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

input:

100 1 1 0

output:

199

result:

ok 1 number(s): "199"

Test #43:

score: 0
Accepted
time: 5ms
memory: 3904kb

input:

94 61 22 35

output:

9

result:

ok 1 number(s): "9"

Test #44:

score: 0
Accepted
time: 3ms
memory: 3712kb

input:

61 92 36 6

output:

7

result:

ok 1 number(s): "7"

Test #45:

score: 0
Accepted
time: 1ms
memory: 3700kb

input:

73 89 12 4

output:

57

result:

ok 1 number(s): "57"

Test #46:

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

input:

71 80 4 3

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

score: 0
Accepted
time: 1ms
memory: 3728kb

input:

44 75 2 31

output:

85

result:

ok 1 number(s): "85"

Test #48:

score: 0
Accepted
time: 1ms
memory: 3632kb

input:

48 62 5 18

output:

35

result:

ok 1 number(s): "35"

Test #49:

score: 0
Accepted
time: 2ms
memory: 3708kb

input:

73 100 22 49

output:

9

result:

ok 1 number(s): "9"

Extra Test:

score: 0
Extra Test Passed