QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#609393#7781. Sheep Eat Wolvesucup-team2179#AC ✓61ms3936kbC++201.8kb2024-10-04 12:42:302024-10-14 07:50:29

Judging History

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

  • [2024-10-14 07:50:29]
  • 管理员手动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:61ms
  • 内存:3936kb
  • [2024-10-04 12:42:30]
  • 评测
  • 测评结果:100
  • 用时:61ms
  • 内存:3924kb
  • [2024-10-04 12:42:30]
  • 提交

answer

#include<bits/stdc++.h>
// #define int long long
#define ll long long
#define db double
#define pii pair<int, int>
using namespace std;
signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int x,y,p,q;
    cin>>x>>y>>p>>q;
    int dp[101][101][2];
    memset(dp, 0x3f, sizeof(dp));
    dp[0][0][0] = 0;
    // for (int i = 0; i <= x;i++)
    //     for (int j = 0; j <= y;j++){
    //         for (int a = 0; a <= i;a++)
    //             for (int b = 0; b <= j;b++){
    //                 if(a+b<=p)
    //                 if(i==0||i+q>=j)
    //                 if(x-i==0||x-i+q>=y-j)
    //                 dp[i][j] = min(dp[i][j], dp[i - a][j - b] + 1);
    //             }
    //     }
    queue<array<int,3> >que;
    que.push({0,0,0});
    while(!que.empty()){
        auto[a,b,u]=que.front();
        que.pop();
        if(u==0){
        for (int i = 0; i <= x-a;i++)
            for (int j = 0; j <= y-b;j++){
                if(i+j<=p)
                if(i+a==x||x-a-i+q>=y-b-j)
                if(dp[i+a][j+b][1]>dp[a][b][u]+1){
                    dp[i+a][j+b][1]=dp[a][b][u]+1;
                    que.push({i + a, j + b, 1});
                }
            }
        }
        else if(u==1){
        for (int i = 0; i <= a;i++)
            for (int j = 0; j <= b;j++){
                if(i+j<=p)
                if(a-i==0||a-i+q>=b-j)
                if(dp[a-i][b-j][0]>dp[a][b][u]+1){
                    dp[a-i][b-j][0]=dp[a][b][u]+1;
                    que.push({a - i, b - j, 0});
                }
            }            
        }
    }
    int ans = 1e9;
    for (int j = 0; j <= y;j++)
        ans = min(ans, dp[x][j][1]);
    if(ans>1e6)cout<<-1;
    else
        cout << ans;
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

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

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

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

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

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

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

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

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

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

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

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

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

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

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

input:

60 60 8 4

output:

27

result:

ok 1 number(s): "27"

Test #12:

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

input:

60 60 8 8

output:

25

result:

ok 1 number(s): "25"

Test #13:

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

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

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

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

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

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

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

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

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

input:

75 15 1 1

output:

175

result:

ok 1 number(s): "175"

Test #18:

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

input:

50 100 1 0

output:

-1

result:

ok 1 number(s): "-1"

Test #19:

score: 0
Accepted
time: 13ms
memory: 3824kb

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

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

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

score: 0
Accepted
time: 19ms
memory: 3556kb

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

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

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

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

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

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

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

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

input:

100 100 5 0

output:

95

result:

ok 1 number(s): "95"

Test #26:

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

input:

100 100 25 3

output:

13

result:

ok 1 number(s): "13"

Test #27:

score: 0
Accepted
time: 21ms
memory: 3876kb

input:

100 100 30 4

output:

11

result:

ok 1 number(s): "11"

Test #28:

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

input:

95 100 3 3

output:

125

result:

ok 1 number(s): "125"

Test #29:

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

input:

98 99 50 6

output:

5

result:

ok 1 number(s): "5"

Test #30:

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

input:

100 100 45 4

output:

7

result:

ok 1 number(s): "7"

Test #31:

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

input:

100 100 40 39

output:

7

result:

ok 1 number(s): "7"

Test #32:

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

input:

100 100 45 19

output:

7

result:

ok 1 number(s): "7"

Test #33:

score: 0
Accepted
time: 60ms
memory: 3756kb

input:

100 100 49 99

output:

5

result:

ok 1 number(s): "5"

Test #34:

score: 0
Accepted
time: 61ms
memory: 3748kb

input:

100 100 49 100

output:

5

result:

ok 1 number(s): "5"

Test #35:

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

input:

100 100 49 98

output:

5

result:

ok 1 number(s): "5"

Test #36:

score: 0
Accepted
time: 60ms
memory: 3680kb

input:

100 100 49 97

output:

5

result:

ok 1 number(s): "5"

Test #37:

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

input:

100 100 49 96

output:

5

result:

ok 1 number(s): "5"

Test #38:

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

input:

100 100 49 95

output:

5

result:

ok 1 number(s): "5"

Test #39:

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

input:

100 100 100 0

output:

1

result:

ok 1 number(s): "1"

Test #40:

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

input:

1 100 1 0

output:

1

result:

ok 1 number(s): "1"

Test #41:

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

input:

90 100 5 5

output:

87

result:

ok 1 number(s): "87"

Test #42:

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

input:

100 1 1 0

output:

199

result:

ok 1 number(s): "199"

Test #43:

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

input:

94 61 22 35

output:

9

result:

ok 1 number(s): "9"

Test #44:

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

input:

61 92 36 6

output:

7

result:

ok 1 number(s): "7"

Test #45:

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

input:

73 89 12 4

output:

57

result:

ok 1 number(s): "57"

Test #46:

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

input:

71 80 4 3

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

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

input:

44 75 2 31

output:

85

result:

ok 1 number(s): "85"

Test #48:

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

input:

48 62 5 18

output:

35

result:

ok 1 number(s): "35"

Test #49:

score: 0
Accepted
time: 22ms
memory: 3620kb

input:

73 100 22 49

output:

9

result:

ok 1 number(s): "9"

Extra Test:

score: 0
Extra Test Passed