Submission #993107

---

Source Code Expand

#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<algorithm>
#include<cmath>
#include<set>
using namespace std;
int64_t memo[1000000]={};

int64_t solv(int64_t N,int64_t A){//目標個数と待機時間
    if(A>=N/2){
        return N;
    }else{
        if(N<1000000 && memo[N]!=0){
            return memo[N];
        }
        int64_t res=N;
        for(int64_t j=2;j<=3000000;j++){
            int z=j*(j-1)/2;
            if(z>N+100){
                break;
            }else{
                int64_t tm;
                if(N%j==0){
                    tm=N/j;
                }else{
                    tm=N/j+1;
                }
                int64_t tmp = solv(tm,A)+j+A;
                res = min(res,tmp);
            }
        }
        if(N<1000000){
            memo[N]=res;
        }
        return res;
    }
    
}


int main(){
    
    int64_t N,A;
    cin>>N>>A;
    int64_t tes= solv(N,A);
    //tes++;
    cout<<tes<<endl;
    
    
    
    return 0;
}

Submission Info

Judge Result