Submission #994700

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<iterator>
#include<set>
#include<queue>

#define rep(i,n) for(int i = 0; i < n; i++)

using namespace std;

/*
bool taberuBeki(int speed, int cookie, int n, int a, int i, vector<int>& iByouGoKuu){
	bool flag = false;
	if(cookie <= speed)
		return false;
	else{
		int tabenaiToki = (n - cookie - 1) / speed + 1;
		int imaKuu = iByouGoKuu[i % a];
		iByouGoKuu[i % a] = a + a + (n - 1) / (speed * a + cookie) + 1;
	}
	return flag;
}*/

int fdiv(int n, int a){
	if(n % a == 0)
		return n / a;
	else
		return n / a + 1;
}

int main(){
	int n, a; cin >> n >> a;
	int cookie = 2;
	int speed = 1;
	int tabeTeru = 0;
	/*
	rep(i,a){
		if(i*speed + cookie <= speed)
			iByouGokuu.push_back(n + 100);
		else{
			iByouGokuu.push_back(i + a + (n - 1) / (speed * i + cookie) + 1);
		}
	}*/
	int i = 2;
	if(n == 1){
		cout << 1 << endl;
		return 0;
	}
	else if(n == 2){
		cout << 2 << endl;
		return 0;
	}

	while(1){
		/*
		if(cookie >= n){
			cout << i << endl;
			return 0;
		}*/

		int noEat = fdiv(n - cookie, speed);
		int nowmin = n + 100;
		int itr = -1;
		rep(j,a + 1){
			int jAfter = fdiv(n, cookie + speed*j) + j + a;
			if(nowmin > jAfter){
				nowmin = jAfter;
				itr = j;
			}
		}
		if(noEat <= nowmin){
			cout<<  i + noEat << endl;
			return 0;
		}
		else{
			speed = cookie + itr*speed;
			i += a + itr + 2;
			cookie = 2*speed;
			if(cookie >= n){
				cout << i << endl;
				return 0;
			}
		}
	}
}

Submission Info

Judge Result