QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#723342	#7781. Sheep Eat Wolves	PoorGhost	WA	62ms	4160kb	C++20	2.8kb	2024-11-07 21:53:17	2024-11-07 21:53:18

Judging History

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

[2024-11-07 21:53:18]
评测

测评结果：WA
用时：62ms
内存：4160kb

查看

[2024-11-07 21:53:17]
提交

answer

#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> pii;
const int N = 1e2 + 5, M = 1e4 + 5;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f3f3f3f3f;
int x, y, p, q;
int dp[N][N][2];//0在家对面,1在家
bool st[N][N][2];
struct node
{
    int cx, cy, idx, sum;
};
void solve()
{
    cin >> x >> y >> p >> q;
    for (int i = 0; i <= x; i++)
    {
        for (int j = 0; j <= y; j++)
        {
            for (int k = 0; k <= 1; k++)
            {
                dp[i][j][k] = inf;
            }
        }
    }
    dp[x][y][0] = 0;
    queue<node>op;
    op.push({x, y, 0, 0});
    while (op.size())
    {
        int cx = op.front().cx;
        int cy = op.front().cy;
        int id = op.front().idx;
        int sum = op.front().sum;
        op.pop();
        if (!id) //要往家的那侧走
        {
            for (int i = 0; i <= cx; i++)
            {
                for (int j = 0; j <= cy; j++)
                {
                    int tx = cx - i;
                    int ty = cy - j;
                    if (i + j > p) continue;
                    if (tx + q < ty && tx > 0) continue;
                    // if (x - tx + q < y - ty) continue;
                    if (st[tx][ty][1]) continue;
                    st[tx][ty][1] = true;
                    dp[tx][ty][1] = sum + 1;
                    op.push({tx, ty, 1, sum + 1});
                }
            }
        }
        else
        {
            for (int i = 0; i <= x - cx; i++)
            {
                for (int j = 0; j <= y - cy; j++)
                {
                    int tx = cx + i;
                    int ty = cy + j;
                    if (i + j > p) continue;
                    // if (tx + q < ty) continue;
                    if (x - tx + q < y - ty && x - tx + q > 0) continue;
                    if (st[tx][ty][0]) continue;
                    st[tx][ty][0] = true;
                    dp[tx][ty][0] = sum + 1;
                    op.push({tx, ty, 0, sum + 1});
                }
            }
        }
    }
    int ans = inf;
    // cout << "dp[2][3][1] = " << dp[2][3][1] << endl;
    // cout << "dp[2][3][0] = " << dp[2][3][0] << endl;
    // cout << "dp[0][3][1] = " << dp[0][3][1] << endl;
    for (int i = 0; i <= y; i++)
    {
        // if (dp[0][i][1] != inf)
        // {
        //     cout << "0 " << i << " sum = " << dp[0][i][1] << endl;
        // }
        ans = min(ans, dp[0][i][1]);
    }
    if (ans == inf) ans = -1;
    cout << ans << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int test = 1;
    // cin >> test;
    for (int i = 1; i <= test; i++)
    {
        solve();
    }
    return 0;
}

源文件, 语言: C++20

详细

Test #1:

score: 100

Accepted

time: 0ms

memory: 3760kb

input:

4 4 3 1

output:

result:

ok 1 number(s): "3"

Test #2:

score: 0

Accepted

time: 0ms

memory: 3608kb

input:

3 5 2 0

output:

result:

ok 1 number(s): "5"

Test #3:

score: 0

Accepted

time: 0ms

memory: 3568kb

input:

2 5 1 1

output:

-1

result:

ok 1 number(s): "-1"

Test #4:

score: 0

Accepted

time: 0ms

memory: 3536kb

input:

1 1 1 0

output:

result:

ok 1 number(s): "1"

Test #5:

score: 0

Accepted

time: 0ms

memory: 3828kb

input:

3 3 1 1

output:

result:

ok 1 number(s): "7"

Test #6:

score: 0

Accepted

time: 0ms

memory: 3540kb

input:

3 3 2 1

output:

result:

ok 1 number(s): "3"

Test #7:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

10 9 1 10

output:

result:

ok 1 number(s): "19"

Test #8:

score: 0

Accepted

time: 1ms

memory: 3628kb

input:

15 20 2 5

output:

result:

ok 1 number(s): "27"

Test #9:

score: 0

Accepted

time: 1ms

memory: 3864kb

input:

18 40 16 7

output:

result:

ok 1 number(s): "5"

Test #10:

score: 0

Accepted

time: 2ms

memory: 3740kb

input:

60 60 8 1

output:

result:

ok 1 number(s): "27"

Test #11:

score: 0

Accepted

time: 3ms

memory: 3952kb

input:

60 60 8 4

output:

result:

ok 1 number(s): "27"

Test #12:

score: 0

Accepted

time: 4ms

memory: 3700kb

input:

60 60 8 8

output:

result:

ok 1 number(s): "25"

Test #13:

score: 0

Accepted

time: 3ms

memory: 3676kb

input:

60 60 16 1

output:

result:

ok 1 number(s): "13"

Test #14:

score: 0

Accepted

time: 2ms

memory: 3964kb

input:

60 60 16 8

output:

result:

ok 1 number(s): "11"

Test #15:

score: 0

Accepted

time: 6ms

memory: 3736kb

input:

60 60 16 16

output:

result:

ok 1 number(s): "11"

Test #16:

score: 0

Accepted

time: 7ms

memory: 3736kb

input:

60 60 16 24

output:

result:

ok 1 number(s): "9"

Test #17:

score: 0

Accepted

time: 1ms

memory: 3748kb

input:

75 15 1 1

output:

result:

ok 1 number(s): "175"

Test #18:

score: 0

Accepted

time: 0ms

memory: 3624kb

input:

50 100 1 0

output:

-1

result:

ok 1 number(s): "-1"

Test #19:

score: 0

Accepted

time: 17ms

memory: 3796kb

input:

100 100 10 10

output:

result:

ok 1 number(s): "35"

Test #20:

score: 0

Accepted

time: 8ms

memory: 3816kb

input:

100 100 10 1

output:

result:

ok 1 number(s): "37"

Test #21:

score: 0

Accepted

time: 26ms

memory: 3724kb

input:

100 100 10 20

output:

result:

ok 1 number(s): "33"

Test #22:

score: 0

Accepted

time: 33ms

memory: 3812kb

input:

100 100 10 30

output:

result:

ok 1 number(s): "31"

Test #23:

score: 0

Accepted

time: 47ms

memory: 3700kb

input:

100 100 10 80

output:

result:

ok 1 number(s): "21"

Test #24:

score: 0

Accepted

time: 43ms

memory: 3744kb

input:

100 100 1 100

output:

result:

ok 1 number(s): "199"

Test #25:

score: 0

Accepted

time: 5ms

memory: 3792kb

input:

100 100 5 0

output:

result:

ok 1 number(s): "95"

Test #26:

score: 0

Accepted

time: 20ms

memory: 3776kb

input:

100 100 25 3

output:

result:

ok 1 number(s): "13"

Test #27:

score: 0

Accepted

time: 24ms

memory: 3852kb

input:

100 100 30 4

output:

result:

ok 1 number(s): "11"

Test #28:

score: 0

Accepted

time: 3ms

memory: 3768kb

input:

95 100 3 3

output:

result:

ok 1 number(s): "125"

Test #29:

score: 0

Accepted

time: 33ms

memory: 3892kb

input:

98 99 50 6

output:

result:

ok 1 number(s): "5"

Test #30:

score: 0

Accepted

time: 33ms

memory: 3892kb

input:

100 100 45 4

output:

result:

ok 1 number(s): "7"

Test #31:

score: 0

Accepted

time: 50ms

memory: 3816kb

input:

100 100 40 39

output:

result:

ok 1 number(s): "7"

Test #32:

score: 0

Accepted

time: 43ms

memory: 4060kb

input:

100 100 45 19

output:

result:

ok 1 number(s): "7"

Test #33:

score: 0

Accepted

time: 62ms

memory: 3832kb

input:

100 100 49 99

output:

result:

ok 1 number(s): "5"

Test #34:

score: 0

Accepted

time: 60ms

memory: 3900kb

input:

100 100 49 100

output:

result:

ok 1 number(s): "5"

Test #35:

score: 0

Accepted

time: 61ms

memory: 4152kb

input:

100 100 49 98

output:

result:

ok 1 number(s): "5"

Test #36:

score: 0

Accepted

time: 62ms

memory: 3836kb

input:

100 100 49 97

output:

result:

ok 1 number(s): "5"

Test #37:

score: 0

Accepted

time: 58ms

memory: 4160kb

input:

100 100 49 96

output:

result:

ok 1 number(s): "5"

Test #38:

score: 0

Accepted

time: 61ms

memory: 3964kb

input:

100 100 49 95

output:

result:

ok 1 number(s): "5"

Test #39:

score: 0

Accepted

time: 39ms

memory: 3852kb

input:

100 100 100 0

output:

result:

ok 1 number(s): "1"

Test #40:

score: 0

Accepted

time: 0ms

memory: 3536kb

input:

1 100 1 0

output:

result:

ok 1 number(s): "1"

Test #41:

score: -100

Wrong Answer

time: 4ms

memory: 3784kb

input:

90 100 5 5

output:

result:

wrong answer 1st numbers differ - expected: '87', found: '89'