Playrix Codescapes Cup (Codeforces Round #413, rated, Div. 1 + Div. 2) D. Field expansion

#include <iostream>  
#include <stdio.h>  
#include <string.h>   
#include <stack>  
#include <queue>   
#include <map>  
#include <set>  
#include <vector>  
#include <math.h>  
#include <bitset>  
#include <algorithm>  
#include <climits>
using namespace std;
typedef long long ll;
#define int long long 
const int N=1e5+10;
const int mod=1e5+7;
int a,b,h,w,n,c[N];
int dp[50][N];
bool cmp(int x,int y){return x>y;}
int sol(int a,int b,int h,int w){
    if(a<=h&&b<=w) return 0;
    memset(dp,-1,sizeof dp); 
    dp[0][h]=w;
    for(int i=1;i<=min((int)34,n);i++){
        for(int j=h;j<N;j++){
        	if(j*c[i]<N) dp[i][j*c[i]]=max(dp[i][j*c[i]],dp[i-1][j]);
        	else{
        		if(dp[i-1][j]>=b) return i;
        	}
            dp[i][j]=max(dp[i][j],min(mod,dp[i-1][j]*c[i]));
            // cout<<j<<" "<<dp[i][j]<<endl;
            if(j>=a&&dp[i][j]!=-1&&dp[i][j]>=b) return i;
        }
    }
    return -1;
}

int32_t main(){
    scanf("%lld%lld%lld%lld%lld",&a,&b,&h,&w,&n);
    for(int i=1;i<=n;i++) scanf("%lld",&c[i]);
    sort(c+1,c+1+n,cmp);
    int res=1e9,tp1=sol(a,b,h,w),tp2=sol(a,b,w,h);
    if(tp1!=-1) res=min(res,tp1);
    if(tp2!=-1) res=min(res,tp2);
    if(res==1e9) cout<<-1<<endl;
    else cout<<res<<endl;
}