QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#777912#7781. Sheep Eat Wolves4eyebird#AC ✓24ms33036kbC++172.9kb2024-11-24 11:08:462024-11-24 11:08:46

Judging History

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

  • [2024-11-24 11:08:46]
  • 评测
  • 测评结果:AC
  • 用时:24ms
  • 内存:33036kb
  • [2024-11-24 11:08:46]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define Buff ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
//#define int long long

bool vis[110][110][110][110][2];

int p, q;
typedef pair<ll, int> p3;
int bfs(ll x0, ll y0)
{
    int ret = -1;
    queue<p3> qe;
    qe.push({(x0 * 1000 + y0) * 10000000, 0});
    vis[x0][y0][0][0][0] = 1;
    while (!qe.empty())
    {
        p3 nw = qe.front();
        qe.pop();
        int sp1 = p;
        ll xx0 = nw.first / 10000000;
        ll xx1 = nw.first % 10000000;
        int x1 = xx0 / 1000, y1 = xx0 % 1000;
        int x2 = xx1 / 1000, y2 = xx1 % 1000;
        int as = nw.second;
        if (as & 1)
            sp1 = min(x2, sp1);
        else
            sp1 = min(x1, sp1);
        bool bk = 0;
        for (int i = sp1; i >= 0; i--)
        {
            int sp2 = p - i;
            if (as & 1)
                sp2 = min(y2, sp2);
            else
                sp2 = min(y1, sp2);
            for (int j = sp2; j >= 0; j--)
            {
                if (as & 1)
                {
                    if (x2 - i == 0 || x2 - i + q >= y2 - j)
                    {
                        if (!vis[x1 + i][y1 + j][x2 - i][y2 - j][!(as & 1)])
                        {
                            vis[x1 + i][y1 + j][x2 - i][y2 - j][!(as & 1)] = 1;
                            ll px = (x1 + i) * 1000 + (y1 + j);
                            px *= 10000000;
                            px += (x2 - i) * 1000 + (y2 - j);
                            qe.push({px, as + 1});
                        }
                    }
                }
                else
                {
                    if (x1 - i == 0)
                    {
                        ret = as + 1;
                        bk = 1;
                        break;
                    }
                    if (x1 - i == 0 || x1 - i + q >= y1 - j)
                    {
                        if (!vis[x1 - i][y1 - j][x2 + i][y2 + j][!(as & 1)])
                        {
                            vis[x1 - i][y1 - j][x2 + i][y2 + j][!(as & 1)] = 1;
                            ll px = (x1 - i) * 1000 + (y1 - j);
                            px *= 10000000;
                            px += (x2 + i) * 1000 + (y2 + j);
                            qe.push({px, as + 1});
                        }
                    }
                }
            }
            if (bk)
                break;
        }
        if (bk)
            break;
    }
    return ret;
}

void solve()
{
    int x, y;
    cin >> x >> y >> p >> q;
    cout << bfs(x, y);
}

signed main()
{
#ifdef YGYYYGJ
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    Buff;
    int _T_ = 1;
    while (_T_--)
    {
        solve();
    }
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

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

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

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

input:

1 1 1 0

output:

1

result:

ok 1 number(s): "1"

Test #5:

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

input:

3 3 1 1

output:

7

result:

ok 1 number(s): "7"

Test #6:

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

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

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

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

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

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

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

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

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

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

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

input:

60 60 8 4

output:

27

result:

ok 1 number(s): "27"

Test #12:

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

input:

60 60 8 8

output:

25

result:

ok 1 number(s): "25"

Test #13:

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

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

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

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

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

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

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

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

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

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: 4ms
memory: 22788kb

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

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

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

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

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

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

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

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

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

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

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

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

input:

100 100 5 0

output:

95

result:

ok 1 number(s): "95"

Test #26:

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

input:

100 100 25 3

output:

13

result:

ok 1 number(s): "13"

Test #27:

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

input:

100 100 30 4

output:

11

result:

ok 1 number(s): "11"

Test #28:

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

input:

95 100 3 3

output:

125

result:

ok 1 number(s): "125"

Test #29:

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

input:

98 99 50 6

output:

5

result:

ok 1 number(s): "5"

Test #30:

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

input:

100 100 45 4

output:

7

result:

ok 1 number(s): "7"

Test #31:

score: 0
Accepted
time: 20ms
memory: 30616kb

input:

100 100 40 39

output:

7

result:

ok 1 number(s): "7"

Test #32:

score: 0
Accepted
time: 24ms
memory: 33036kb

input:

100 100 45 19

output:

7

result:

ok 1 number(s): "7"

Test #33:

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

input:

100 100 49 99

output:

5

result:

ok 1 number(s): "5"

Test #34:

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

input:

100 100 49 100

output:

5

result:

ok 1 number(s): "5"

Test #35:

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

input:

100 100 49 98

output:

5

result:

ok 1 number(s): "5"

Test #36:

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

input:

100 100 49 97

output:

5

result:

ok 1 number(s): "5"

Test #37:

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

input:

100 100 49 96

output:

5

result:

ok 1 number(s): "5"

Test #38:

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

input:

100 100 49 95

output:

5

result:

ok 1 number(s): "5"

Test #39:

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

input:

100 100 100 0

output:

1

result:

ok 1 number(s): "1"

Test #40:

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

input:

1 100 1 0

output:

1

result:

ok 1 number(s): "1"

Test #41:

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

input:

90 100 5 5

output:

87

result:

ok 1 number(s): "87"

Test #42:

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

input:

100 1 1 0

output:

199

result:

ok 1 number(s): "199"

Test #43:

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

input:

94 61 22 35

output:

9

result:

ok 1 number(s): "9"

Test #44:

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

input:

61 92 36 6

output:

7

result:

ok 1 number(s): "7"

Test #45:

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

input:

73 89 12 4

output:

57

result:

ok 1 number(s): "57"

Test #46:

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

input:

71 80 4 3

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

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

input:

44 75 2 31

output:

85

result:

ok 1 number(s): "85"

Test #48:

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

input:

48 62 5 18

output:

35

result:

ok 1 number(s): "35"

Test #49:

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

input:

73 100 22 49

output:

9

result:

ok 1 number(s): "9"

Extra Test:

score: 0
Extra Test Passed