QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #699098 | #7781. Sheep Eat Wolves | imtx | AC ✓ | 55ms | 3988kb | C++17 | 2.6kb | 2024-11-02 01:13:23 | 2024-11-02 01:13:24 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int N = 105;
constexpr int inf = 1e9;
int f[N][N][2];
void solve() {
int x, y, p, q;
cin >> x >> y >> p >> q;
for (int i = 0; i <= x; i++) {
for (int j = 0; j <= y; j++) {
f[i][j][0] = f[i][j][1] = -1;
}
}
//f[i][j][0/1]表示i只羊 j只狼 现在在岸的某一边的
f[x][y][0] = 0;
queue<array<int, 3>> que;
que.push({x, y, 0});
while (!que.empty()) {
auto [nx, ny, k] = que.front();
que.pop();
//还有nx个羊 ny只狼 0/1代表左右侧
if (k == 0) {
//枚举运走i只羊 j只狼
for (int i = 0; i <= p; i++) {
for (int j = 0; i + j <= p; j++) {
// if (i != 0 && j > i + q) {
// continue;
// }
if (i > nx || j > ny) {
continue;
}
int nnx = nx - i, nny = ny - j; //留下nnx只羊 nny只狼
if (nnx != 0 && nny > nnx + q) {
continue;
}
if (f[nnx][nny][1] == -1) {
f[nnx][nny][1] = f[nx][ny][0] + 1;
que.push({nnx, nny, 1});
}
}
}
} else {
for (int i = 0; i <= p; i++) {
for (int j = 0; i + j <= p; j++) {
if (i != 0 && j > i + q) {
continue;
}
if (i > x - nx || j > y - ny) {
continue;
}
int nnx = x - nx - i, nny = y - ny - j;
if (nnx != 0 && nny > nnx + q) {
continue;
}
if (f[nx + i][ny + j][0] == -1) {
f[nx + i][ny + j][0] = f[nx][ny][1] + 1;
que.push({nx + i, ny + j, 0});
}
}
}
}
}
constexpr int inf = 1e9;
int ans = inf;
for (int j = 0; j <= y; j++) {
if (f[0][j][0] != -1) {
ans = min(ans, f[0][j][1]);
}
}
if (ans == inf) {
ans = -1;
}
cout << ans << '\n';
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
// cin >> T;
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: 3580kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3572kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3528kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 1ms
memory: 3588kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3892kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 1ms
memory: 3636kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 2ms
memory: 3700kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 2ms
memory: 3900kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 1ms
memory: 3636kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 1ms
memory: 3616kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 1ms
memory: 3752kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 2ms
memory: 3700kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 2ms
memory: 3964kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 3ms
memory: 3936kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3756kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 2ms
memory: 3668kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 7ms
memory: 3936kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 1ms
memory: 3880kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 19ms
memory: 3692kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 14ms
memory: 3988kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 18ms
memory: 3696kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 21ms
memory: 3652kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 39ms
memory: 3728kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 39ms
memory: 3796kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 39ms
memory: 3788kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 39ms
memory: 3688kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 38ms
memory: 3776kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 39ms
memory: 3784kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 55ms
memory: 3740kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 1ms
memory: 3868kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
90 100 5 5
output:
87
result:
ok 1 number(s): "87"
Test #42:
score: 0
Accepted
time: 1ms
memory: 3952kb
input:
100 1 1 0
output:
199
result:
ok 1 number(s): "199"
Test #43:
score: 0
Accepted
time: 5ms
memory: 3764kb
input:
94 61 22 35
output:
9
result:
ok 1 number(s): "9"
Test #44:
score: 0
Accepted
time: 4ms
memory: 3704kb
input:
61 92 36 6
output:
7
result:
ok 1 number(s): "7"
Test #45:
score: 0
Accepted
time: 0ms
memory: 3700kb
input:
73 89 12 4
output:
57
result:
ok 1 number(s): "57"
Test #46:
score: 0
Accepted
time: 1ms
memory: 3732kb
input:
71 80 4 3
output:
-1
result:
ok 1 number(s): "-1"
Test #47:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
44 75 2 31
output:
85
result:
ok 1 number(s): "85"
Test #48:
score: 0
Accepted
time: 1ms
memory: 3572kb
input:
48 62 5 18
output:
35
result:
ok 1 number(s): "35"
Test #49:
score: 0
Accepted
time: 6ms
memory: 3656kb
input:
73 100 22 49
output:
9
result:
ok 1 number(s): "9"
Extra Test:
score: 0
Extra Test Passed