QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#543160#7781. Sheep Eat WolvesMaxDYFAC ✓182ms71460kbC++142.5kb2024-09-01 14:34:112024-09-05 08:24:13

Judging History

你现在查看的是测评时间为 2024-09-05 08:24:13 的历史记录

  • [2024-09-05 08:34:40]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:AC
  • 用时:183ms
  • 内存:71572kb
  • [2024-09-05 08:34:25]
  • hack成功,自动添加数据
  • (/hack/803)
  • [2024-09-05 08:24:13]
  • 自动重测本题所有获得100分的提交记录
  • 测评结果:100
  • 用时:182ms
  • 内存:71460kb
  • [2024-09-05 08:23:36]
  • hack成功,自动添加数据
  • (/hack/802)
  • [2024-09-01 14:34:12]
  • 评测
  • 测评结果:100
  • 用时:193ms
  • 内存:71652kb
  • [2024-09-01 14:34:11]
  • 提交

answer

// #pragma GCC optimize("Ofast,no-stack-protector")
#include <bits/stdc++.h>

using namespace std;

const int N = 200;
const int inf = 1 << 30;
const long long llinf = 1ll << 60;
const double PI = acos(-1);

#define lowbit(x) (x & -x)
typedef long long ll;
typedef double db;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<db, db> pdd;
typedef pair<ll, int> pli;

int dis[N][N][2];
bool vis[N][N][2];
int x, y, p, q;
struct Node
{
    int rx, ry;
    bool side;
};
bool check(int rx, int ry, bool side)
{
    int lx = x - rx, ly = y - ry;
    if (side == 0)
        return rx == 0 || (rx + q >= ry);
    else
        return lx == 0 || (lx + q >= ly);
}
int bfs()
{
    queue<Node> q;
    q.push(Node{0, 0, 0});
    memset(dis, 0x3f, sizeof dis);
    dis[0][0][0] = 0;
    int ans = inf;
    while (q.empty() == false)
    {
        auto now = q.front();
        q.pop();
        if (vis[now.rx][now.ry][now.side])
            continue;
        vis[now.rx][now.ry][now.side] = 1;

        if (now.side == 0)
        {
            for (int k1 = 0; k1 <= p && now.rx + k1 <= x; k1++)
                for (int k2 = 0; k1 + k2 <= p && now.ry + k2 <= y; k2++)
                {
                    auto nxt = Node{now.rx + k1, now.ry + k2, !now.side};
                    if (!check(nxt.rx, nxt.ry, nxt.side))
                        continue;
                    dis[nxt.rx][nxt.ry][nxt.side] = min(dis[nxt.rx][nxt.ry][nxt.side], dis[now.rx][now.ry][now.side] + 1);
                    if (nxt.rx == x)
                        ans = min(ans, dis[nxt.rx][nxt.ry][nxt.side]);
                    else
                        q.push(nxt);
                }
        }
        else
        {
            for (int k1 = 0; k1 <= p && now.rx - k1 >= 0; k1++)
                for (int k2 = 0; k1 + k2 <= p && now.ry - k2 >= 0; k2++)
                {
                    auto nxt = Node{now.rx - k1, now.ry - k2, !now.side};
                    if (!check(nxt.rx, nxt.ry, nxt.side))
                        continue;
                    dis[nxt.rx][nxt.ry][nxt.side] = min(dis[nxt.rx][nxt.ry][nxt.side], dis[now.rx][now.ry][now.side] + 1);
                    q.push(nxt);
                }
        }
    }
    return ans;
}
void work()
{
    cin >> x >> y >> p >> q;
    int ans = bfs();
    cout << (ans > 100000 ? -1 : ans) << endl;
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    while (t-- > 0)
    {
        work();
    }
}

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

详细

Test #1:

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

input:

4 4 3 1

output:

3

result:

ok 1 number(s): "3"

Test #2:

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

input:

3 5 2 0

output:

5

result:

ok 1 number(s): "5"

Test #3:

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

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

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

input:

1 1 1 0

output:

1

result:

ok 1 number(s): "1"

Test #5:

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

input:

3 3 1 1

output:

7

result:

ok 1 number(s): "7"

Test #6:

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

input:

3 3 2 1

output:

3

result:

ok 1 number(s): "3"

Test #7:

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

input:

10 9 1 10

output:

19

result:

ok 1 number(s): "19"

Test #8:

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

input:

15 20 2 5

output:

27

result:

ok 1 number(s): "27"

Test #9:

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

input:

18 40 16 7

output:

5

result:

ok 1 number(s): "5"

Test #10:

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

input:

60 60 8 1

output:

27

result:

ok 1 number(s): "27"

Test #11:

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

input:

60 60 8 4

output:

27

result:

ok 1 number(s): "27"

Test #12:

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

input:

60 60 8 8

output:

25

result:

ok 1 number(s): "25"

Test #13:

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

input:

60 60 16 1

output:

13

result:

ok 1 number(s): "13"

Test #14:

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

input:

60 60 16 8

output:

11

result:

ok 1 number(s): "11"

Test #15:

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

input:

60 60 16 16

output:

11

result:

ok 1 number(s): "11"

Test #16:

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

input:

60 60 16 24

output:

9

result:

ok 1 number(s): "9"

Test #17:

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

input:

75 15 1 1

output:

175

result:

ok 1 number(s): "175"

Test #18:

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

input:

50 100 1 0

output:

-1

result:

ok 1 number(s): "-1"

Test #19:

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

input:

100 100 10 10

output:

35

result:

ok 1 number(s): "35"

Test #20:

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

input:

100 100 10 1

output:

37

result:

ok 1 number(s): "37"

Test #21:

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

input:

100 100 10 20

output:

33

result:

ok 1 number(s): "33"

Test #22:

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

input:

100 100 10 30

output:

31

result:

ok 1 number(s): "31"

Test #23:

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

input:

100 100 10 80

output:

21

result:

ok 1 number(s): "21"

Test #24:

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

input:

100 100 1 100

output:

199

result:

ok 1 number(s): "199"

Test #25:

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

input:

100 100 5 0

output:

95

result:

ok 1 number(s): "95"

Test #26:

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

input:

100 100 25 3

output:

13

result:

ok 1 number(s): "13"

Test #27:

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

input:

100 100 30 4

output:

11

result:

ok 1 number(s): "11"

Test #28:

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

input:

95 100 3 3

output:

125

result:

ok 1 number(s): "125"

Test #29:

score: 0
Accepted
time: 38ms
memory: 14192kb

input:

98 99 50 6

output:

5

result:

ok 1 number(s): "5"

Test #30:

score: 0
Accepted
time: 29ms
memory: 10148kb

input:

100 100 45 4

output:

7

result:

ok 1 number(s): "7"

Test #31:

score: 0
Accepted
time: 84ms
memory: 23896kb

input:

100 100 40 39

output:

7

result:

ok 1 number(s): "7"

Test #32:

score: 0
Accepted
time: 51ms
memory: 20852kb

input:

100 100 45 19

output:

7

result:

ok 1 number(s): "7"

Test #33:

score: 0
Accepted
time: 182ms
memory: 71040kb

input:

100 100 49 99

output:

5

result:

ok 1 number(s): "5"

Test #34:

score: 0
Accepted
time: 180ms
memory: 71020kb

input:

100 100 49 100

output:

5

result:

ok 1 number(s): "5"

Test #35:

score: 0
Accepted
time: 172ms
memory: 71312kb

input:

100 100 49 98

output:

5

result:

ok 1 number(s): "5"

Test #36:

score: 0
Accepted
time: 169ms
memory: 71076kb

input:

100 100 49 97

output:

5

result:

ok 1 number(s): "5"

Test #37:

score: 0
Accepted
time: 170ms
memory: 71008kb

input:

100 100 49 96

output:

5

result:

ok 1 number(s): "5"

Test #38:

score: 0
Accepted
time: 181ms
memory: 71460kb

input:

100 100 49 95

output:

5

result:

ok 1 number(s): "5"

Test #39:

score: 0
Accepted
time: 96ms
memory: 66752kb

input:

100 100 100 0

output:

1

result:

ok 1 number(s): "1"

Test #40:

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

input:

1 100 1 0

output:

1

result:

ok 1 number(s): "1"

Test #41:

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

input:

90 100 5 5

output:

87

result:

ok 1 number(s): "87"

Test #42:

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

input:

100 1 1 0

output:

199

result:

ok 1 number(s): "199"

Test #43:

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

input:

94 61 22 35

output:

9

result:

ok 1 number(s): "9"

Test #44:

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

input:

61 92 36 6

output:

7

result:

ok 1 number(s): "7"

Test #45:

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

input:

73 89 12 4

output:

57

result:

ok 1 number(s): "57"

Test #46:

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

input:

71 80 4 3

output:

-1

result:

ok 1 number(s): "-1"

Test #47:

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

input:

44 75 2 31

output:

85

result:

ok 1 number(s): "85"

Test #48:

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

input:

48 62 5 18

output:

35

result:

ok 1 number(s): "35"

Test #49:

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

input:

73 100 22 49

output:

9

result:

ok 1 number(s): "9"

Extra Test:

score: 0
Extra Test Passed