QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #724428 | #7781. Sheep Eat Wolves | juan_123# | WA | 1ms | 3856kb | C++14 | 995b | 2024-11-08 13:06:43 | 2024-11-08 13:06:43 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define double long double
#define lowbit(x) (x&(-x))
const int inf = 1000000000;
int dis[2][105][105];
int X,Y,p,q;
bool check(int x,int y){return y-x<=p;}
signed main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> X >> Y >> p >> q;
queue<pair<int,pair<int,int> > >q;
for(int i =0;i<=X;i++)for(int j =0;j<=Y;j++)dis[0][i][j]=dis[1][i][j]=inf;
q.push({0,{X,Y}});dis[0][X][Y]=0;
while(!q.empty()){
int tp = q.front().first,x = q.front().second.first,y = q.front().second.second;
q.pop();
for(int i =0;i<=x;i++){
for(int j =0;j<=y;j++){
if(i+j>p or !check(x-i,y-j))continue;
int xx = X-(x-i),yy = Y-(y-j);
if(dis[tp^1][xx][yy]>dis[tp][x][y]){
dis[tp^1][xx][yy] = dis[tp][x][y]+1;
q.push({tp^1,{xx,yy}});
}
}
}
}
int ans = inf;
for(int i = 0;i<=Y;i++)ans = min(ans,dis[1][X][i]);
if(ans == inf)ans = -1;
cout << ans << endl;
return 0;
}/*
4 4 3 1
*/
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3824kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 1ms
memory: 3556kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3556kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3856kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: -100
Wrong Answer
time: 1ms
memory: 3556kb
input:
3 3 1 1
output:
9
result:
wrong answer 1st numbers differ - expected: '7', found: '9'