QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#735812#7781. Sheep Eat WolvesSuhy#AC ✓18ms3940kbC++172.7kb2024-11-11 21:47:282024-11-11 21:47:29

Judging History

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

  • [2024-11-11 21:47:29]
  • 评测
  • 测评结果:AC
  • 用时:18ms
  • 内存:3940kb
  • [2024-11-11 21:47:28]
  • 提交

answer

#include <bits/stdc++.h>
#define ll long long
#define st first
#define nd second

using namespace std;

const int maxn = 102;

int x, y, p, q;
int sp[maxn][maxn][2];

int inf = 10000000;
queue <pair <pair<int, int>, int> > que;

signed main()
{
    cin>>x>>y>>p>>q;
    // for(int i = 0; i <= x; i ++)
    // {
    //     for(int j = 0; j <= y; j ++)
    //     {
    //         dp[i][j][0] = dp[i][j][1] = inf;
    //     }
    // }
    // dp[x][y][0] = 0;
    // for(int i = x; i >= 0; i --)
    // {
    //     for(int j = y; j >= 0; j --)
    //     {
    //         for(int tks = 0; tks + i <= x && tks <= p; tks ++)
    //         {
    //             for(int tkw = 0; tkw + j <= y && tkw + tks <= p; tkw ++)
    //             {
    //                 if(tks + tkw == 0) continue;
    //                 dp[i][j][1] = min(dp[i][j][1], dp[i + tks][j + tkw][0]);
    //             }
    //         }
    //     }
    //     for(int j = )
        
    // }
    que.push({{x, y}, 0});
    sp[x][y][0] = 1;
    int flag = 0;
    while(que.size())
    {
        auto in = que.front();
        que.pop();
        int sop = sp[in.st.st][in.st.nd][in.nd];
        if(in.st.st == 0 && in.nd == 1)
        {
            flag = 1;
            cout<<sop - 1<<endl;
            break;
        }
        //cout<<in.st.st<<' '<<in.st.nd<<' '<<in.nd<<' '<<sop<<endl;
        if(in.nd == 0)
        {
            for(int i = 0; i <= in.st.st && i <= p; i ++)
            {
                int nxs = in.st.st - i;
                //cout<<nxs<<endl;
                for(int j = 0; i + j <= p && j <= in.st.nd; j ++)
                {
                    int nxw = in.st.nd - j;
                    //cout<<nxs<<' '<<i<<' '<<j<<' '<<nxw<<endl;
                    if((nxw > nxs + q && nxs) || (sp[nxs][nxw][1] && (sp[nxs][nxw][1] <= sop + 1)))
                        continue;
                    sp[nxs][nxw][1] = sop + 1;
                    que.push({{nxs, nxw}, 1});
                }
            }
        }
        else
        {
            for(int i = 0; i + in.st.st <= x && i <= p; i ++)
            {
                int nxs = in.st.st + i;
                for(int j = 0; i + j <= p && j + in.st.nd <= y; j ++)
                {
                    int nxw = in.st.nd + j;
                    if(((y - nxw > x - nxs + q) && (x != nxs)) || (sp[nxs][nxw][0] && (sp[nxs][nxw][0] <= sop + 1)))
                        continue;
                    //cout<<' '<<nxs<<' '<<nxw<<endl;
                    sp[nxs][nxw][0] = sop + 1;
                    que.push({{nxs, nxw}, 0});
                }
            }
        }
    }
    if(!flag) cout<<-1<<endl;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

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

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

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

input:

1 1 1 0

output:

1

result:

ok 1 number(s): "1"

Test #5:

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

input:

3 3 1 1

output:

7

result:

ok 1 number(s): "7"

Test #6:

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

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

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

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

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

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

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

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

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

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

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

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

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

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

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

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

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

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

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

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

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: 1ms
memory: 3564kb

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

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

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

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

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

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

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

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

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

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

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

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

input:

100 100 5 0

output:

95

result:

ok 1 number(s): "95"

Test #26:

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

input:

100 100 25 3

output:

13

result:

ok 1 number(s): "13"

Test #27:

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

input:

100 100 30 4

output:

11

result:

ok 1 number(s): "11"

Test #28:

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

input:

95 100 3 3

output:

125

result:

ok 1 number(s): "125"

Test #29:

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

input:

98 99 50 6

output:

5

result:

ok 1 number(s): "5"

Test #30:

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

input:

100 100 45 4

output:

7

result:

ok 1 number(s): "7"

Test #31:

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

input:

100 100 40 39

output:

7

result:

ok 1 number(s): "7"

Test #32:

score: 0
Accepted
time: 12ms
memory: 3940kb

input:

100 100 45 19

output:

7

result:

ok 1 number(s): "7"

Test #33:

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

input:

100 100 49 99

output:

5

result:

ok 1 number(s): "5"

Test #34:

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

input:

100 100 49 100

output:

5

result:

ok 1 number(s): "5"

Test #35:

score: 0
Accepted
time: 18ms
memory: 3744kb

input:

100 100 49 98

output:

5

result:

ok 1 number(s): "5"

Test #36:

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

input:

100 100 49 97

output:

5

result:

ok 1 number(s): "5"

Test #37:

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

input:

100 100 49 96

output:

5

result:

ok 1 number(s): "5"

Test #38:

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

input:

100 100 49 95

output:

5

result:

ok 1 number(s): "5"

Test #39:

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

input:

100 100 100 0

output:

1

result:

ok 1 number(s): "1"

Test #40:

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

input:

1 100 1 0

output:

1

result:

ok 1 number(s): "1"

Test #41:

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

input:

90 100 5 5

output:

87

result:

ok 1 number(s): "87"

Test #42:

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

input:

100 1 1 0

output:

199

result:

ok 1 number(s): "199"

Test #43:

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

input:

94 61 22 35

output:

9

result:

ok 1 number(s): "9"

Test #44:

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

input:

61 92 36 6

output:

7

result:

ok 1 number(s): "7"

Test #45:

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

input:

73 89 12 4

output:

57

result:

ok 1 number(s): "57"

Test #46:

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

input:

71 80 4 3

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

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

input:

44 75 2 31

output:

85

result:

ok 1 number(s): "85"

Test #48:

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

input:

48 62 5 18

output:

35

result:

ok 1 number(s): "35"

Test #49:

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

input:

73 100 22 49

output:

9

result:

ok 1 number(s): "9"

Extra Test:

score: 0
Extra Test Passed