QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #672145 | #7781. Sheep Eat Wolves | KOH-# | AC ✓ | 10ms | 3924kb | C++14 | 2.2kb | 2024-10-24 15:50:19 | 2024-10-24 15:50:20 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
template <typename T>
inline void read(T &x){
x=0;char ch=getchar();bool f=false;
while(!isdigit(ch)) f|=ch=='-',ch=getchar();
while(isdigit(ch)) x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
x=f?-x:x;return;
}
template <typename T>
inline void print(T x){
if(x<0) putchar('-'),x=-x;
if(x>9) print(x/10);
putchar(x%10^48);return;
}
#define ll long long
const int N=103;
int f[2][N][N];
int x,y,p,q;
struct node{
int now,cx,cy;
};
void Dfs(int now,int cx,int cy){
// cout<<now<<" "<<cx<<" "<<cy<<" "<<f[now][cx][cy]<<"???\n";
if(now==0){
int tx=x-cx,ty=y-cy;
for(int i=0;i<=p&&i<=cx;++i){
for(int j=0;i+j<=p&&j<=cy;++j){
if(cx-i-(cy-j)<=p){
if(f[0][cx][cy]+1<f[1][cx-i][cy-j]){
f[1][cx-i][cy-j]=f[0][cx][cy]+1;
Dfs(1,cx-i,cy-j);
}
}
}
}
}
else{
int tx=x-cx,ty=y-cy;
for(int i=0;i<=p&&i<=tx;++i){
for(int j=0;i+j<=p&&j<=ty;++j){
if(tx-i-(ty-j)<=p){
if(f[1][cx][cy]+1<f[0][cx+i][cy+j]){
f[0][cx+i][cy+j]=f[1][cx][cy]+1;
Dfs(0,cx+i,cy+j);
}
}
}
}
}
}
queue<node> que;
void Bfs(){
que.push({0,x,y});
int ans=-1;
while(!que.empty()){
int now=que.front().now,cx=que.front().cx,cy=que.front().cy;
// cout<<now<<" "<<cx<<" "<<cy<<" "<<f[now][cx][cy]<<"??\n";
que.pop();
if(now==1&&cy==0){
ans=f[1][cx][cy];
break;
}
if(now==0){
int tx=x-cx,ty=y-cy;
for(int i=0;i<=p&&i<=cx;++i){
for(int j=0;i+j<=p&&j<=cy;++j){
if(cx-i-(cy-j)<=q||(cy-j)==0){
if(f[0][cx][cy]+1<f[1][cx-i][cy-j]){
f[1][cx-i][cy-j]=f[0][cx][cy]+1;
que.push({1,cx-i,cy-j});
}
}
}
}
}
else{
int tx=x-cx,ty=y-cy;
for(int i=0;i<=p&&i<=tx;++i){
for(int j=0;i+j<=p&&j<=ty;++j){
if(tx-i-(ty-j)<=q||(ty-j==0)){
if(f[1][cx][cy]+1<f[0][cx+i][cy+j]){
f[0][cx+i][cy+j]=f[1][cx][cy]+1;
que.push({0,cx+i,cy+j});
}
}
}
}
}
}
print(ans);
}
int main(){
read(y),read(x),read(p),read(q);
for(int i=0;i<=1;++i){
for(int j=0;j<=100;++j){
for(int k=0;k<=100;++k){
f[i][j][k]=2e9;
}
}
}
f[0][x][y]=0;
Bfs();
return 0;
}
/*
100 100 100 100
*/
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3820kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3616kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3680kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3888kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3544kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3852kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 1ms
memory: 3664kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3880kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 1ms
memory: 3816kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 1ms
memory: 3876kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 1ms
memory: 3596kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 0ms
memory: 3552kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 2ms
memory: 3828kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 3ms
memory: 3676kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3548kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 7ms
memory: 3620kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 7ms
memory: 3872kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 8ms
memory: 3924kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 6ms
memory: 3708kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 10ms
memory: 3732kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 10ms
memory: 3908kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 10ms
memory: 3676kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 10ms
memory: 3652kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 10ms
memory: 3716kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 6ms
memory: 3736kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: 0
Accepted
time: 0ms
memory: 3596kb
input:
90 100 5 5
output:
87
result:
ok 1 number(s): "87"
Test #42:
score: 0
Accepted
time: 0ms
memory: 3660kb
input:
100 1 1 0
output:
199
result:
ok 1 number(s): "199"
Test #43:
score: 0
Accepted
time: 2ms
memory: 3860kb
input:
94 61 22 35
output:
9
result:
ok 1 number(s): "9"
Test #44:
score: 0
Accepted
time: 1ms
memory: 3676kb
input:
61 92 36 6
output:
7
result:
ok 1 number(s): "7"
Test #45:
score: 0
Accepted
time: 0ms
memory: 3668kb
input:
73 89 12 4
output:
57
result:
ok 1 number(s): "57"
Test #46:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
71 80 4 3
output:
-1
result:
ok 1 number(s): "-1"
Test #47:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
44 75 2 31
output:
85
result:
ok 1 number(s): "85"
Test #48:
score: 0
Accepted
time: 0ms
memory: 3896kb
input:
48 62 5 18
output:
35
result:
ok 1 number(s): "35"
Test #49:
score: 0
Accepted
time: 2ms
memory: 3604kb
input:
73 100 22 49
output:
9
result:
ok 1 number(s): "9"
Extra Test:
score: 0
Extra Test Passed