QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #663173 | #7781. Sheep Eat Wolves | Doubeecat | WA | 21ms | 3996kb | C++20 | 2.3kb | 2024-10-21 13:56:21 | 2024-10-21 13:56:22 |
Judging History
answer
/*
Undo the destiny.
*/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FO(x) {freopen(#x".in","r",stdin);freopen(#x".out","w",stdout);}
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mp make_pair
#define node pair<pair<pii,pii >,int>
const int N = 110;
int x,y,p,q;
int f[N][N][2];
bool valid(int a,int b) {
//cout << "(" << a << "," << b << ")\n";
if (a < 0 || b < 0) return 0;
if (a == 0) return 1;
return (a + q) >= b;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);//cout.tie(0);
cin >> x >> y >> p >> q;
queue <tuple<int,int,int> > Q;
Q.push(make_tuple(x,y,0));
memset(f,0x3f,sizeof f);
int ans = 0x3f3f3f3f;
f[x][y][0] = 0;
while (!Q.empty()) {
auto [xx,yy,cnt] = Q.front();Q.pop();
int xxx = x - xx,yyy = y - yy;
if (xx == 0) {
cout << f[xx][yy][cnt] << "\n";
return 0;
}
//cout << xx << " " << yy << " " << xxx << " " << yyy << " " << cnt << "\n";
if (cnt % 2 == 0) {
for (int i = 0;i <= p;++i) {
for (int nowx = 0;nowx <= min(i,xx);++nowx) {
int nx = xx - nowx,ny = yy - (i - nowx);
int nxx = xxx + nowx,nyy = yyy + (i - nowx);
if (valid(nx,ny) && valid(nowx,i-nowx)) {
if (f[nx][ny][(cnt + 1) & 1] > f[xx][yy][cnt & 1] + 1) {
f[nx][ny][(cnt + 1) & 1] = f[xx][yy][cnt & 1] + 1;
Q.push(make_tuple(nx,ny,cnt ^ 1));
}
}
}
}
} else {
for (int i = 0;i <= p;++i) {
for (int nowx = 0;nowx <= min(i,xxx);++nowx) {
int nx = xx + nowx,ny = yy + (i - nowx);
int nxx = xxx - nowx,nyy = yyy - (i - nowx);
if (valid(nxx,nyy) && valid(nowx,i-nowx)) {
if (f[nx][ny][(cnt + 1) & 1] > f[xx][yy][cnt & 1] + 1) {
f[nx][ny][(cnt + 1) & 1] = f[xx][yy][cnt & 1] + 1;
Q.push(make_tuple(nx,ny,cnt ^ 1));
}
}
}
}
}
}
cout << "-1\n";
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3896kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3908kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3740kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3968kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3664kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3744kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 1ms
memory: 3740kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3968kb
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: 3672kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 1ms
memory: 3672kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 2ms
memory: 3668kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 2ms
memory: 3752kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3704kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 3ms
memory: 3684kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 5ms
memory: 3744kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 10ms
memory: 3700kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 10ms
memory: 3996kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 17ms
memory: 3704kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 14ms
memory: 3996kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 21ms
memory: 3724kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 21ms
memory: 3984kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 21ms
memory: 3784kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 21ms
memory: 3724kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 21ms
memory: 3956kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 20ms
memory: 3724kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 1ms
memory: 3980kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3740kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
90 100 5 5
output:
87
result:
ok 1 number(s): "87"
Test #42:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
100 1 1 0
output:
199
result:
ok 1 number(s): "199"
Test #43:
score: 0
Accepted
time: 4ms
memory: 3980kb
input:
94 61 22 35
output:
9
result:
ok 1 number(s): "9"
Test #44:
score: 0
Accepted
time: 2ms
memory: 3980kb
input:
61 92 36 6
output:
7
result:
ok 1 number(s): "7"
Test #45:
score: -100
Wrong Answer
time: 1ms
memory: 3668kb
input:
73 89 12 4
output:
-1
result:
wrong answer 1st numbers differ - expected: '57', found: '-1'