QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #379255 | #7781. Sheep Eat Wolves | ucup-team2230# | AC ✓ | 51ms | 3972kb | C++23 | 3.2kb | 2024-04-06 16:47:04 | 2024-04-06 16:47:05 |
Judging History
answer
#ifndef LOCAL
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#endif
#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using uint=unsigned;
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(),x.end()
#define si(x) int(x.size())
#define a first
#define b second
#define fr first
#define sc second
#define mp make_pair
template<class t>using vc=vector<t>;
template<class t,class u> bool chmax(t&a,u b){if(a<b){a=b; return true;}else return false;}
template<class t,class u> bool chmin(t&a,u b){if(a>b){a=b; return true;}else return false;}
template<class t,class u>
ostream& operator<<(ostream&os,const pair<t,u>&p){
return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t>ostream& operator<<(ostream&os,const vector<t>&v){
os<<"{";
for(auto e:v)os<<e<<",";
return os<<"}";
}
using P=pair<int,int>;
int x,y,p,q;
int dp[2][102][102];
bool used[2][102][102];
void solve(){
cin>>x>>y>>p>>q;
rep(i,2)rep(j,102)rep(k,102){
dp[i][j][k]=-1;
used[i][j][k]=false;
}
queue<pair<int,pair<int,int>>> que;
dp[0][x][y]=0;
que.push(mp(0,mp(x,y)));
while(!que.empty()){
auto r=que.front(); que.pop();
if(used[r.fr][r.sc.fr][r.sc.sc])continue;
used[r.fr][r.sc.fr][r.sc.sc]=true;
if(r.fr==0){
for(int i=0;i<=p;i++){
for(int j=0;i+j<=p;j++){
if(r.sc.fr<i)continue;
if(r.sc.sc<j)continue;
if(r.sc.fr-i+q<r.sc.sc-j&&r.sc.fr-i>0)continue;
if(dp[1][r.sc.fr-i][r.sc.sc-j]==-1){
dp[1][r.sc.fr-i][r.sc.sc-j]=dp[0][r.sc.fr][r.sc.sc]+1;
que.push(mp(1,mp(r.sc.fr-i,r.sc.sc-j)));
}
}
}
}
else {
for(int i=0;i<=p;i++){
for(int j=0;i+j<=p;j++){
if(x-r.sc.fr<i)continue;
if(y-r.sc.sc<j)continue;
if(x-r.sc.fr-i+q<y-r.sc.sc-j&&x-r.sc.fr-i>0)continue;
if(dp[0][r.sc.fr+i][r.sc.sc+j]==-1){
dp[0][r.sc.fr+i][r.sc.sc+j]=dp[1][r.sc.fr][r.sc.sc]+1;
que.push(mp(0,mp(r.sc.fr+i,r.sc.sc+j)));
}
}
}
}
}
/*rep(i,2)rep(j,x+1)rep(k,y+1){
cerr<<i<<" "<<j<<" "<<k<<" "<<dp[i][j][k]<<endl;
}*/
const int inf=1000000000;
int ret=inf;
for(int j=0;j<=y;j++){
if(dp[1][0][j]!=-1)chmin(ret,dp[1][0][j]);
}
if(ret==inf)cout<<-1<<endl;
else cout<<ret<<endl;
//cout<<dp[1][0][0]<<endl;
}
signed main(){
cin.tie(0);
ios::sync_with_stdio(0);
cout<<fixed<<setprecision(20);
solve();
}
/*
4 4 3 1
0 0 0 6
0 0 1 6
0 0 2 6
0 0 3 6
0 0 4 6
0 1 0 6
0 1 1 4
0 1 2 4
0 1 3 4
0 1 4 4
0 2 0 -1
0 2 1 4
0 2 2 4
0 2 3 2
0 2 4 2
0 3 0 -1
0 3 1 -1
0 3 2 2
0 3 3 2
0 3 4 2
0 4 0 -1
0 4 1 -1
0 4 2 -1
0 4 3 2
0 4 4 0
1 0 0 5
1 0 1 5
1 0 2 -1
1 0 3 -1
1 0 4 -1
1 1 0 5
1 1 1 3
1 1 2 3
1 1 3 -1
1 1 4 -1
1 2 0 3
1 2 1 3
1 2 2 3
1 2 3 1
1 2 4 -1
1 3 0 3
1 3 1 3
1 3 2 1
1 3 3 1
1 3 4 1
1 4 0 3
1 4 1 1
1 4 2 1
1 4 3 1
1 4 4 1
5
*/
/*
3 5 2 0
0 0 0 -1
0 0 1 -1
0 0 2 -1
0 0 3 -1
0 0 4 -1
0 0 5 -1
0 1 0 -1
0 1 1 -1
0 1 2 -1
0 1 3 -1
0 1 4 -1
0 1 5 -1
0 2 0 -1
0 2 1 -1
0 2 2 -1
0 2 3 -1
0 2 4 -1
0 2 5 -1
0 3 0 -1
0 3 1 -1
0 3 2 -1
0 3 3 -1
0 3 4 -1
0 3 5 0
1 0 0 -1
1 0 1 -1
1 0 2 -1
1 0 3 -1
1 0 4 -1
1 0 5 -1
1 1 0 -1
1 1 1 -1
1 1 2 -1
1 1 3 -1
1 1 4 -1
1 1 5 -1
1 2 0 -1
1 2 1 -1
1 2 2 -1
1 2 3 -1
1 2 4 -1
1 2 5 -1
1 3 0 -1
1 3 1 -1
1 3 2 -1
1 3 3 1
1 3 4 -1
1 3 5 -1
-1
*/
这程序好像有点Bug，我给组数据试试？
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3628kb
input:
4 4 3 1
output:
3
result:
ok 1 number(s): "3"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3708kb
input:
3 5 2 0
output:
5
result:
ok 1 number(s): "5"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
2 5 1 1
output:
-1
result:
ok 1 number(s): "-1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
1 1 1 0
output:
1
result:
ok 1 number(s): "1"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
3 3 1 1
output:
7
result:
ok 1 number(s): "7"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
3 3 2 1
output:
3
result:
ok 1 number(s): "3"
Test #7:
score: 0
Accepted
time: 1ms
memory: 3916kb
input:
10 9 1 10
output:
19
result:
ok 1 number(s): "19"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
15 20 2 5
output:
27
result:
ok 1 number(s): "27"
Test #9:
score: 0
Accepted
time: 1ms
memory: 3632kb
input:
18 40 16 7
output:
5
result:
ok 1 number(s): "5"
Test #10:
score: 0
Accepted
time: 0ms
memory: 3684kb
input:
60 60 8 1
output:
27
result:
ok 1 number(s): "27"
Test #11:
score: 0
Accepted
time: 0ms
memory: 3916kb
input:
60 60 8 4
output:
27
result:
ok 1 number(s): "27"
Test #12:
score: 0
Accepted
time: 1ms
memory: 3628kb
input:
60 60 8 8
output:
25
result:
ok 1 number(s): "25"
Test #13:
score: 0
Accepted
time: 1ms
memory: 3920kb
input:
60 60 16 1
output:
13
result:
ok 1 number(s): "13"
Test #14:
score: 0
Accepted
time: 1ms
memory: 3584kb
input:
60 60 16 8
output:
11
result:
ok 1 number(s): "11"
Test #15:
score: 0
Accepted
time: 2ms
memory: 3920kb
input:
60 60 16 16
output:
11
result:
ok 1 number(s): "11"
Test #16:
score: 0
Accepted
time: 2ms
memory: 3648kb
input:
60 60 16 24
output:
9
result:
ok 1 number(s): "9"
Test #17:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
75 15 1 1
output:
175
result:
ok 1 number(s): "175"
Test #18:
score: 0
Accepted
time: 0ms
memory: 3624kb
input:
50 100 1 0
output:
-1
result:
ok 1 number(s): "-1"
Test #19:
score: 0
Accepted
time: 1ms
memory: 3692kb
input:
100 100 10 10
output:
35
result:
ok 1 number(s): "35"
Test #20:
score: 0
Accepted
time: 0ms
memory: 3580kb
input:
100 100 10 1
output:
37
result:
ok 1 number(s): "37"
Test #21:
score: 0
Accepted
time: 1ms
memory: 3656kb
input:
100 100 10 20
output:
33
result:
ok 1 number(s): "33"
Test #22:
score: 0
Accepted
time: 2ms
memory: 3584kb
input:
100 100 10 30
output:
31
result:
ok 1 number(s): "31"
Test #23:
score: 0
Accepted
time: 2ms
memory: 3680kb
input:
100 100 10 80
output:
21
result:
ok 1 number(s): "21"
Test #24:
score: 0
Accepted
time: 1ms
memory: 3576kb
input:
100 100 1 100
output:
199
result:
ok 1 number(s): "199"
Test #25:
score: 0
Accepted
time: 1ms
memory: 3644kb
input:
100 100 5 0
output:
95
result:
ok 1 number(s): "95"
Test #26:
score: 0
Accepted
time: 4ms
memory: 3648kb
input:
100 100 25 3
output:
13
result:
ok 1 number(s): "13"
Test #27:
score: 0
Accepted
time: 6ms
memory: 3948kb
input:
100 100 30 4
output:
11
result:
ok 1 number(s): "11"
Test #28:
score: 0
Accepted
time: 0ms
memory: 3648kb
input:
95 100 3 3
output:
125
result:
ok 1 number(s): "125"
Test #29:
score: 0
Accepted
time: 19ms
memory: 3724kb
input:
98 99 50 6
output:
5
result:
ok 1 number(s): "5"
Test #30:
score: 0
Accepted
time: 14ms
memory: 3720kb
input:
100 100 45 4
output:
7
result:
ok 1 number(s): "7"
Test #31:
score: 0
Accepted
time: 19ms
memory: 3732kb
input:
100 100 40 39
output:
7
result:
ok 1 number(s): "7"
Test #32:
score: 0
Accepted
time: 19ms
memory: 3724kb
input:
100 100 45 19
output:
7
result:
ok 1 number(s): "7"
Test #33:
score: 0
Accepted
time: 33ms
memory: 3768kb
input:
100 100 49 99
output:
5
result:
ok 1 number(s): "5"
Test #34:
score: 0
Accepted
time: 34ms
memory: 3912kb
input:
100 100 49 100
output:
5
result:
ok 1 number(s): "5"
Test #35:
score: 0
Accepted
time: 31ms
memory: 3780kb
input:
100 100 49 98
output:
5
result:
ok 1 number(s): "5"
Test #36:
score: 0
Accepted
time: 33ms
memory: 3972kb
input:
100 100 49 97
output:
5
result:
ok 1 number(s): "5"
Test #37:
score: 0
Accepted
time: 33ms
memory: 3696kb
input:
100 100 49 96
output:
5
result:
ok 1 number(s): "5"
Test #38:
score: 0
Accepted
time: 35ms
memory: 3740kb
input:
100 100 49 95
output:
5
result:
ok 1 number(s): "5"
Test #39:
score: 0
Accepted
time: 51ms
memory: 3672kb
input:
100 100 100 0
output:
1
result:
ok 1 number(s): "1"
Test #40:
score: 0
Accepted
time: 0ms
memory: 3704kb
input:
1 100 1 0
output:
1
result:
ok 1 number(s): "1"
Test #41:
score: 0
Accepted
time: 1ms
memory: 3684kb
input:
90 100 5 5
output:
87
result:
ok 1 number(s): "87"
Test #42:
score: 0
Accepted
time: 0ms
memory: 3924kb
input:
100 1 1 0
output:
199
result:
ok 1 number(s): "199"
Test #43:
score: 0
Accepted
time: 5ms
memory: 3728kb
input:
94 61 22 35
output:
9
result:
ok 1 number(s): "9"
Test #44:
score: 0
Accepted
time: 4ms
memory: 3688kb
input:
61 92 36 6
output:
7
result:
ok 1 number(s): "7"
Test #45:
score: 0
Accepted
time: 1ms
memory: 3716kb
input:
73 89 12 4
output:
57
result:
ok 1 number(s): "57"
Test #46:
score: 0
Accepted
time: 0ms
memory: 3636kb
input:
71 80 4 3
output:
-1
result:
ok 1 number(s): "-1"
Test #47:
score: 0
Accepted
time: 0ms
memory: 3644kb
input:
44 75 2 31
output:
85
result:
ok 1 number(s): "85"
Test #48:
score: 0
Accepted
time: 1ms
memory: 3648kb
input:
48 62 5 18
output:
35
result:
ok 1 number(s): "35"
Test #49:
score: 0
Accepted
time: 5ms
memory: 3692kb
input:
73 100 22 49
output:
9
result:
ok 1 number(s): "9"
Extra Test:
score: 0
Extra Test Passed