QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #634691 | #7781. Sheep Eat Wolves | the_fool# | AC ✓ | 144ms | 282944kb | C++20 | 3.2kb | 2024-10-12 17:53:58 | 2024-10-14 07:50:53 |
Judging History
answer
#pragma GCC optimize("Ofast", "inline", "-ffast-math")
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ll = long long;
constexpr int N = 110;
vector<tuple<int, int, int>> adj[N][N][2];
int vis[N][N][2];
void solve() {
int x, y, p, q;
cin >> x >> y >> p >> q;
auto check = [&](int sheep, int wolf) {
return sheep == 0 or wolf <= sheep + q;
};
for (int i = 0; i <= x; i++) {
for (int j = 0; j <= y; j++) {
int sheep = i, wolf = j;
if (check(x - i, y - j)) {
for (int a = 0; a <= sheep and a <= p; a++) {
for (int b = 0; b <= wolf and a + b <= p; b++) {
int lfs = sheep - a, lfw = wolf - b;
if (check(lfs, lfw)) {
// cerr << "FROM " << sheep << " " << wolf << " " << 0 << "\n";
// cerr << "TO " << lfs << " " << lfw << " " << 1 << "\n";
adj[sheep][wolf][0].emplace_back(lfs, lfw, 1);
}
}
}
}
sheep = x - i, wolf = y - j;
if (check(i, j)) {
for (int a = 0; a <= sheep and a <= p; a++) {
for (int b = 0; b <= wolf and a + b <= p; b++) {
int lfs = sheep - a, lfw = wolf - b;
if (check(lfs, lfw)) {
// if (i == 3 and j == 3) {
// cerr << "FROM " << sheep << " " << wolf << " " << 1 << "\n";
// cerr << "TO " << sheep + a << " " << wolf + b << " " << 0 << "\n";
// }
adj[i][j][1].emplace_back(x - lfs, y - lfw, 0);
}
}
}
}
}
}
vector<tuple<int, int, int>> que;
que.emplace_back(x, y, 0);
vis[x][y][0] = 1;
for (int i = 0; i < que.size(); i++) {
auto [sheep, wolf, is] = que[i];
int t = vis[sheep][wolf][is];
// cerr << "??? " << sheep << " " << wolf << " " << is << " " << t << "\n";
for (auto [ts, tw, ti] : adj[sheep][wolf][is]) {
if (!vis[ts][tw][ti]) {
vis[ts][tw][ti] = t + 1;
que.emplace_back(ts, tw, ti);
}
}
}
// auto have = [&](int a, int b, int c, int d, int e, int f) {
// tuple to(d, e, f);
// return ranges::count(adj[a][b][c], to);
// };
//
// cerr << have(4, 4, 0, 3, 2, 1) << "\n";
// cerr << have(3, 2, 1, 3, 2, 0) << "\n";
// cerr << have(3, 2, 0, 0, 2, 1) << "\n";
int ans = 1E9;
for (int i = 0; i <= y; i++) {
if (vis[0][i][1]) {
ans = min(ans, vis[0][i][1]);
}
}
if (ans == 1E9) ans = 0;
cout << ans - 1 << "\n";
}
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifdef Debug
assert(freopen("in.txt", "r", stdin));
assert(freopen("out.txt", "w", stdout));
#endif
int t = 1;
// cin >> t;
while (t--) {
solve();
}
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3884kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 1ms
memory: 3792kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3560kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3520kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3576kb
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: 3976kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 1ms
memory: 4496kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 0ms
memory: 5004kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 2ms
memory: 5688kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 3ms
memory: 5824kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 2ms
memory: 9212kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 7ms
memory: 13536kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 9ms
memory: 16512kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 4248kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 6ms
memory: 9692kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 3ms
memory: 5900kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 3ms
memory: 14888kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 11ms
memory: 18888kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 18ms
memory: 31356kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 0ms
memory: 5580kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 0ms
memory: 4760kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 11ms
memory: 14760kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 10ms
memory: 22400kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 1ms
memory: 4288kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 25ms
memory: 57840kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 12ms
memory: 44932kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 35ms
memory: 144896kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 51ms
memory: 101012kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 111ms
memory: 281488kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 128ms
memory: 281312kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 144ms
memory: 281412kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 127ms
memory: 282944kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 96ms
memory: 282044kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 104ms
memory: 282192kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 43ms
memory: 119572kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3840kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: 0
Accepted
time: 1ms
memory: 4676kb
input:
90 100 5 5
output:
87
result:
ok 1 number(s): "87"
Test #42:
score: 0
Accepted
time: 1ms
memory: 4312kb
input:
100 1 1 0
output:
199
result:
ok 1 number(s): "199"
Test #43:
score: 0
Accepted
time: 15ms
memory: 53228kb
input:
94 61 22 35
output:
9
result:
ok 1 number(s): "9"
Test #44:
score: 0
Accepted
time: 6ms
memory: 7972kb
input:
61 92 36 6
output:
7
result:
ok 1 number(s): "7"
Test #45:
score: 0
Accepted
time: 0ms
memory: 4600kb
input:
73 89 12 4
output:
57
result:
ok 1 number(s): "57"
Test #46:
score: 0
Accepted
time: 1ms
memory: 4188kb
input:
71 80 4 3
output:
-1
result:
ok 1 number(s): "-1"
Test #47:
score: 0
Accepted
time: 1ms
memory: 4324kb
input:
44 75 2 31
output:
85
result:
ok 1 number(s): "85"
Test #48:
score: 0
Accepted
time: 1ms
memory: 4908kb
input:
48 62 5 18
output:
35
result:
ok 1 number(s): "35"
Test #49:
score: 0
Accepted
time: 12ms
memory: 51532kb
input:
73 100 22 49
output:
9
result:
ok 1 number(s): "9"
Extra Test:
score: 0
Extra Test Passed