QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #768878 | #7781. Sheep Eat Wolves | guodong# | WA | 7ms | 6004kb | C++17 | 1.3kb | 2024-11-21 15:01:06 | 2024-11-21 15:01:15 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int vis[101][101][2];
int mark[101][101][2];
#define For(i,a,b) for(int i = a; i <= b; ++i)
int x,y,p,q;
int Dfs(int w,int s,int flag){
if((flag == 0 && (y - s && x - w > y - s + q)) || (flag == 1 && (s && w > s + q)))
return 1e9;
if(vis[w][s][flag] < 300000){
return vis[w][s][flag];
}
if(mark[w][s][flag]) return 1e9;
mark[w][s][flag] = 1;
if(flag == 1 && s == 0){
return vis[w][s][flag] = 0;
}
int ans = 1e9;
int cw = flag == 1 ? x - w : w;
int cs = flag == 1 ? y - s : s;
for(int i = 0; i <= min(cw,p); ++ i){
for(int j = 0; j <= cs && j + i <= p; ++j){
if(cw - i <= cs - j + q || cs - j == 0){
ans = min(ans,Dfs(w + (flag == 1 ? i : -i),s + (flag == 1 ? j : -j),flag ^ 1) + 1);
}
}
}
return vis[w][s][flag] = ans;
}
signed main()
{
#ifdef NICEGUODONG
freopen("data.in","r",stdin);
#endif
ios::sync_with_stdio(false);
cin >> x >> y >> p >> q;
swap(x,y);
For(i,0,100) For(j,0,100) vis[i][j][0] = vis[i][j][1] = 1e8;
int ans = 1e9;
ans = Dfs(x,y,0);
if(ans <= 300000)
cout << ans;
else
cout << -1;
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3672kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3756kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3748kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3732kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3760kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3848kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3780kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3832kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 0ms
memory: 3928kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3912kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 2ms
memory: 3932kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 3ms
memory: 4092kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 4ms
memory: 4280kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 1ms
memory: 3896kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 2ms
memory: 4180kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 1ms
memory: 4016kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 3ms
memory: 4636kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 4ms
memory: 4940kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 7ms
memory: 5908kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 2ms
memory: 6004kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: -100
Wrong Answer
time: 1ms
memory: 3848kb
input:
100 100 5 0
output:
97
result:
wrong answer 1st numbers differ - expected: '95', found: '97'