Submission #993144

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const ll inf=1e15;
int main(){
	ll n,m;
	cin>>n>>m;
	if(n>10000000)return 1;
	vi dp(n+1,inf);
	loop(i,1,n+1)dp[i]=i+m;
	dp[1]=0;
	loop(i,2,n+1){
		ll t=i,tt=dp[i]+1;
		while(t+i<n+1){
			t+=i;
			tt++;
			dp[t]=min(dp[t],tt+m);
		}
	}
	ll out=inf;
	rep(i,n){
		ll t=dp[i+1];
		out=min(out,t+(ll)ceil((double)n/(i+1)));
	}
	cout<<out<<endl;
}

Submission Info

Judge Result