QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #376755 | #7781. Sheep Eat Wolves | knightzzz1 | AC ✓ | 15ms | 3952kb | C++17 | 3.1kb | 2024-04-04 16:18:38 | 2024-04-04 16:18:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 110;
const int INF = 1e9;
int x,y,p,q;
int dis[N][N][2];
int main(){
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cin >> x >> y >> p >> q;
for(int i = 0; i <= x; ++i)
for(int j = 0; j <= y; ++j)
dis[i][j][0] = dis[i][j][1] = -1;
queue<array<int,3>> qu;
qu.push({x, y, 0});
dis[x][y][0] = 0;
while(qu.size()){
auto [a,b,c] = qu.front();
qu.pop();
if(a == 0 && c == 1){
cout << dis[a][b][c] << "\n";
return 0;
}
if(c == 0){
for(int k = 0; k <= p && k <= a; ++k)
for(int u = 0; u + k <= p && u <= b; ++u)
if(a - k == 0 || b - u <= a - k + q){
if(dis[a - k][b - u][1] == -1){
qu.push({a - k, b - u, 1});
dis[a - k][b - u][1] = dis[a][b][0] + 1;
}
}
}
else{
int c1 = x - a, c2 = y - b;
for(int k = 0; k <= p && k <= c1; ++k)
for(int u = 0; u + k <= p && u <= c2; ++u){
if(c1 + k <= x && c2 + u <= y){
if(c1 - k == 0 || c2 - u <= c1 - k + q){
if(dis[a + k][b + u][0] == -1){
dis[a + k][b + u][0] = dis[a][b][1] + 1;
qu.push({a + k, b + u, 0});
}
}
}
}
}
}
cout << -1 << "\n";
// dp[x][y][0] = 0;
// for(int i = x; i >= 0; --i)
// for(int j = y; j >= 0; --j)
// for(int k = 0; k <= p; ++k)
// for(int u = 0; u + k <= p; ++u)
// for(int t = 0; t < 2; ++t){
// if(t == 0){
// if((j - u <= i - k + q || i - k == 0) && k <= i && u <= j)
// dp[i - k][j - u][1] = min(dp[i - k][j - u][1], dp[i][j][0] + 1);
// }
// else{
// int c1 = x - i, c2 = y - j;
// if((c2 - u <= c1 - k + q || c1 - k == 0) && k <= c1 && u <= c2){
// if(c1 + k <= x && c2 + u <= y)
// dp[c1 + k][c2 + u][0] = min(dp[c1 + k][c2 + u][0], dp[i][j][1] + 1);
// }
// }
// }
// int c1 = x - (i - k), c2 = y - (j - u);
// if(i - k == 0) dp[i - k][j - u] = min(dp[i - k][j - u], dp[i][j] + 1);
// else{
// if(j - u <= i - k + q && (c2 <= c1 + q || c1 == 0))
// dp[i - k][j - u] = min(dp[i - k][j - u], dp[i][j] + 2);
// }
//cout << dp[2][4] << "\n";
return 0;
}
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3536kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3532kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3472kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3764kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3496kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3836kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 1ms
memory: 3544kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3592kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3548kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 1ms
memory: 3820kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 1ms
memory: 3680kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 1ms
memory: 3612kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 1ms
memory: 3640kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 0ms
memory: 3632kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 1ms
memory: 3888kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3660kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3844kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 3ms
memory: 3860kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 2ms
memory: 3708kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 8ms
memory: 3652kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 9ms
memory: 3744kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 10ms
memory: 3752kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 11ms
memory: 3900kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 15ms
memory: 3700kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 15ms
memory: 3756kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 15ms
memory: 3952kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 15ms
memory: 3684kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 15ms
memory: 3688kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 15ms
memory: 3640kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 4ms
memory: 3652kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3600kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
90 100 5 5
output:
87
result:
ok 1 number(s): "87"
Test #42:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
100 1 1 0
output:
199
result:
ok 1 number(s): "199"
Test #43:
score: 0
Accepted
time: 3ms
memory: 3852kb
input:
94 61 22 35
output:
9
result:
ok 1 number(s): "9"
Test #44:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
61 92 36 6
output:
7
result:
ok 1 number(s): "7"
Test #45:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
73 89 12 4
output:
57
result:
ok 1 number(s): "57"
Test #46:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
71 80 4 3
output:
-1
result:
ok 1 number(s): "-1"
Test #47:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
44 75 2 31
output:
85
result:
ok 1 number(s): "85"
Test #48:
score: 0
Accepted
time: 1ms
memory: 3668kb
input:
48 62 5 18
output:
35
result:
ok 1 number(s): "35"
Test #49:
score: 0
Accepted
time: 3ms
memory: 3876kb
input:
73 100 22 49
output:
9
result:
ok 1 number(s): "9"
Extra Test:
score: 0
Extra Test Passed