QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#678405#7781. Sheep Eat Wolvesyumingsk#AC ✓15ms5948kbC++202.3kb2024-10-26 14:50:482024-10-26 14:50:49

Judging History

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

  • [2024-10-26 14:50:49]
  • 评测
  • 测评结果:AC
  • 用时:15ms
  • 内存:5948kb
  • [2024-10-26 14:50:48]
  • 提交

answer

#pragma GCC optimize(3, "Ofast", "inline")
#include <iostream>
#include <bits/stdc++.h>
#define IOS ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
#define INF 0x3f3f3f3f
#define L_INF 0x7f3f3f3f3f3f3f3f
#define db cout << "debug\n";

using namespace std;
const int Mod = 998244353;
using ll = long long;
ll x, y, q, p, L, R, dp[114][114][2], X[114514], Y[114514], M[114514];

ll min(ll a, ll b) { return a < b ? a : b; }
void solve()
{
    cin >> x >> y >> p >> q;
    dp[x][y][0] = 1;
    L = 1;
    R = 1;
    X[1] = x;
    Y[1] = y;
    M[1] = 0;
    while (R >= L)
    {
        // cout << X[L] << ' ' << Y[L] << ' ' << M[L] << ' ' << dp[X[L]][Y[L]][M[L]] << '\n';
        if (M[L] == 0)
        {
            for (int kx = 0; kx <= p; kx++)
                for (int ky = 0; ky <= p - kx; ky++)
                    if (X[L] - kx >= 0 && Y[L] - ky >= 0 && ((X[L] - kx + q) >= (Y[L] - ky) || X[L] - kx == 0) && dp[X[L] - kx][Y[L] - ky][1] == 0)
                    {
                        X[++R] = X[L] - kx;
                        Y[R] = Y[L] - ky;
                        M[R] = 1;
                        if (X[R] == 0)
                        {
                            cout << dp[X[L]][Y[L]][0] << '\n';
                            return;
                        }
                        dp[X[L] - kx][Y[L] - ky][1] = dp[X[L]][Y[L]][0] + 1;
                    }
        }
        else
        {
            for (int kx = 0; kx <= p; kx++)
                for (int ky = 0; ky <= p - kx; ky++)
                    if (X[L] + kx <= x && Y[L] + ky <= y && ((x - X[L] - kx + q) >= (y - Y[L] - ky) || x - X[L] - kx == 0) && dp[X[L] + kx][Y[L] + ky][0] == 0)
                    {
                        X[++R] = X[L] + kx;
                        Y[R] = Y[L] + ky;
                        M[R] = 0;
                        dp[X[L] + kx][Y[L] + ky][0] = dp[X[L]][Y[L]][1] + 1;
                    }
        }
        L++;
    }
    cout << "-1\n";
}
int main()
{
    IOS;
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#ifndef ONLINE_JUDGE
    clock_t start_time = clock();
#endif
    int t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
#ifndef ONLINE_JUDGE
    cout << "Used " << (double)(clock() - start_time) << " ms" << endl;
#endif
    return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

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

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

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

input:

1 1 1 0

output:

1

result:

ok 1 number(s): "1"

Test #5:

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

input:

3 3 1 1

output:

7

result:

ok 1 number(s): "7"

Test #6:

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

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

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

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

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

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

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

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

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

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

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

input:

60 60 8 4

output:

27

result:

ok 1 number(s): "27"

Test #12:

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

input:

60 60 8 8

output:

25

result:

ok 1 number(s): "25"

Test #13:

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

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

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

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

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

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

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

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

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

input:

75 15 1 1

output:

175

result:

ok 1 number(s): "175"

Test #18:

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

input:

50 100 1 0

output:

-1

result:

ok 1 number(s): "-1"

Test #19:

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

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

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

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

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

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

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

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

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

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

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

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

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

input:

100 100 5 0

output:

95

result:

ok 1 number(s): "95"

Test #26:

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

input:

100 100 25 3

output:

13

result:

ok 1 number(s): "13"

Test #27:

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

input:

100 100 30 4

output:

11

result:

ok 1 number(s): "11"

Test #28:

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

input:

95 100 3 3

output:

125

result:

ok 1 number(s): "125"

Test #29:

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

input:

98 99 50 6

output:

5

result:

ok 1 number(s): "5"

Test #30:

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

input:

100 100 45 4

output:

7

result:

ok 1 number(s): "7"

Test #31:

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

input:

100 100 40 39

output:

7

result:

ok 1 number(s): "7"

Test #32:

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

input:

100 100 45 19

output:

7

result:

ok 1 number(s): "7"

Test #33:

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

input:

100 100 49 99

output:

5

result:

ok 1 number(s): "5"

Test #34:

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

input:

100 100 49 100

output:

5

result:

ok 1 number(s): "5"

Test #35:

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

input:

100 100 49 98

output:

5

result:

ok 1 number(s): "5"

Test #36:

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

input:

100 100 49 97

output:

5

result:

ok 1 number(s): "5"

Test #37:

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

input:

100 100 49 96

output:

5

result:

ok 1 number(s): "5"

Test #38:

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

input:

100 100 49 95

output:

5

result:

ok 1 number(s): "5"

Test #39:

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

input:

100 100 100 0

output:

1

result:

ok 1 number(s): "1"

Test #40:

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

input:

1 100 1 0

output:

1

result:

ok 1 number(s): "1"

Test #41:

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

input:

90 100 5 5

output:

87

result:

ok 1 number(s): "87"

Test #42:

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

input:

100 1 1 0

output:

199

result:

ok 1 number(s): "199"

Test #43:

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

input:

94 61 22 35

output:

9

result:

ok 1 number(s): "9"

Test #44:

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

input:

61 92 36 6

output:

7

result:

ok 1 number(s): "7"

Test #45:

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

input:

73 89 12 4

output:

57

result:

ok 1 number(s): "57"

Test #46:

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

input:

71 80 4 3

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

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

input:

44 75 2 31

output:

85

result:

ok 1 number(s): "85"

Test #48:

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

input:

48 62 5 18

output:

35

result:

ok 1 number(s): "35"

Test #49:

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

input:

73 100 22 49

output:

9

result:

ok 1 number(s): "9"

Extra Test:

score: 0
Extra Test Passed