QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#642386#7781. Sheep Eat WolveszhangbojuAC ✓52ms14860kbC++141.8kb2024-10-15 13:44:112024-10-15 13:44:11

Judging History

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

  • [2024-10-15 13:44:11]
  • 评测
  • 测评结果:AC
  • 用时:52ms
  • 内存:14860kb
  • [2024-10-15 13:44:11]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
constexpr int N = 105;
int X, Y, P, Q;
bool vis[N][N][N][2];
int f[N][N][N][2];
int dfs(int x, int y, int xx, int cur) {
    int yy = X + Y - x - y - xx;
    if (x == 0) return 0; 
    if ((cur == 0 && yy > xx + Q && xx > 0) || (cur == 1 && y > x + Q && x > 0)) {
        return -1;
    }
    if (vis[x][y][xx][cur]) {
        return f[x][y][xx][cur];
    }
    vis[x][y][xx][cur] = 1;
    f[x][y][xx][cur] = 1e9;
    int minx = 1e9;
    if (cur == 0) {
        for (int j = 0; j <= y; j++) {
            for (int i = 0; i <= x && i + j <= P; i++) {
                // if (i == 0 && j == 0) continue;
                int t = dfs(x - i, y - j, xx + i, cur ^ 1);
				// if (x == 2 && y == 3) {
				// 	cerr << "asfhjsdfhjsd23 "<< i << " " << j << " " << t << endl;
				// }
                if (t == -1) continue;
                minx = min(minx, t + 1);
                // if (minx == t + 1) {
                //     cerr << x << " " << y << " " << xx << " " << i << " " << j << " " << t << endl;
                // }
            }
        }
    }
    else {
        for (int i = 0; i <= 0; i++) {
            for (int j = 0; j <= yy && i + j <= P; j++) {
                // if (i == 0 && j == 0) continue;
                int t = dfs(x + i, y + j, xx - i, cur ^ 1);
				// if (x == 2 && y == 2) {
				// 	cerr << "fsdjfghdjghdj22" << i << " " << j << " " << t << endl;
				// }
                if (t == -1) continue;
                minx = min(minx, t + 1);
                // if (minx == t + 1) {
                //     cerr << x << " " << y << " " << xx << " " << i << " " << j << " " << t << endl;
                // }
            }
        }
    }
    return f[x][y][xx][cur] = (minx < 1e9 ? minx : -1);
} 
int main() {
    cin >> X >> Y >> P >> Q;
    cout << dfs(X, Y, 0, 0) << endl;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3660kb

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

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

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

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

input:

1 1 1 0

output:

1

result:

ok 1 number(s): "1"

Test #5:

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

input:

3 3 1 1

output:

7

result:

ok 1 number(s): "7"

Test #6:

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

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

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

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

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

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

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

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

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

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

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

input:

60 60 8 4

output:

27

result:

ok 1 number(s): "27"

Test #12:

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

input:

60 60 8 8

output:

25

result:

ok 1 number(s): "25"

Test #13:

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

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

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

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

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

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

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

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

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

input:

75 15 1 1

output:

175

result:

ok 1 number(s): "175"

Test #18:

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

input:

50 100 1 0

output:

-1

result:

ok 1 number(s): "-1"

Test #19:

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

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

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

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

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

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

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

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

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

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

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

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

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

input:

100 100 5 0

output:

95

result:

ok 1 number(s): "95"

Test #26:

score: 0
Accepted
time: 7ms
memory: 13620kb

input:

100 100 25 3

output:

13

result:

ok 1 number(s): "13"

Test #27:

score: 0
Accepted
time: 8ms
memory: 13884kb

input:

100 100 30 4

output:

11

result:

ok 1 number(s): "11"

Test #28:

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

input:

95 100 3 3

output:

125

result:

ok 1 number(s): "125"

Test #29:

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

input:

98 99 50 6

output:

5

result:

ok 1 number(s): "5"

Test #30:

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

input:

100 100 45 4

output:

7

result:

ok 1 number(s): "7"

Test #31:

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

input:

100 100 40 39

output:

7

result:

ok 1 number(s): "7"

Test #32:

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

input:

100 100 45 19

output:

7

result:

ok 1 number(s): "7"

Test #33:

score: 0
Accepted
time: 48ms
memory: 14436kb

input:

100 100 49 99

output:

5

result:

ok 1 number(s): "5"

Test #34:

score: 0
Accepted
time: 49ms
memory: 14780kb

input:

100 100 49 100

output:

5

result:

ok 1 number(s): "5"

Test #35:

score: 0
Accepted
time: 49ms
memory: 14860kb

input:

100 100 49 98

output:

5

result:

ok 1 number(s): "5"

Test #36:

score: 0
Accepted
time: 52ms
memory: 14708kb

input:

100 100 49 97

output:

5

result:

ok 1 number(s): "5"

Test #37:

score: 0
Accepted
time: 47ms
memory: 14712kb

input:

100 100 49 96

output:

5

result:

ok 1 number(s): "5"

Test #38:

score: 0
Accepted
time: 42ms
memory: 14664kb

input:

100 100 49 95

output:

5

result:

ok 1 number(s): "5"

Test #39:

score: 0
Accepted
time: 49ms
memory: 14504kb

input:

100 100 100 0

output:

1

result:

ok 1 number(s): "1"

Test #40:

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

input:

1 100 1 0

output:

1

result:

ok 1 number(s): "1"

Test #41:

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

input:

90 100 5 5

output:

87

result:

ok 1 number(s): "87"

Test #42:

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

input:

100 1 1 0

output:

199

result:

ok 1 number(s): "199"

Test #43:

score: 0
Accepted
time: 7ms
memory: 13728kb

input:

94 61 22 35

output:

9

result:

ok 1 number(s): "9"

Test #44:

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

input:

61 92 36 6

output:

7

result:

ok 1 number(s): "7"

Test #45:

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

input:

73 89 12 4

output:

57

result:

ok 1 number(s): "57"

Test #46:

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

input:

71 80 4 3

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

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

input:

44 75 2 31

output:

85

result:

ok 1 number(s): "85"

Test #48:

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

input:

48 62 5 18

output:

35

result:

ok 1 number(s): "35"

Test #49:

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

input:

73 100 22 49

output:

9

result:

ok 1 number(s): "9"

Extra Test:

score: 0
Extra Test Passed