Submission #994230

---

Source Code Expand

//TLE
//自明な部分点
#include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cassert>
using namespace std;
 
int n, a;
int dp[1000001];	//dp[i] = 初期状態(x=1, 0枚)からi枚焼くまでの最小時間
 
signed main() {
	int i, j;
	
	cin >> n >> a;
	
	dp[0] = 0;
	for (i = 1; i <= n; i++) {
		dp[i] = i;
		
		int now;
		bool flag = true;
		for (j = 1; j < i; j = ((now == 1) ? i : (i + now - 2) / (now - 1))) {
			now = (i + j - 1) / j;
			//cout << dp[now] + a + j << " ";
			if (dp[now] + a + j == dp[i - 1]) { flag = false; break; }
		}
		if (flag) {
			dp[i] = dp[i-1] + 1;
		}
		else {
			dp[i] = dp[i-1];
		}
	}
	
	//for (i = 0; i <= n; i++) { cout << dp[i] << " "; }
	//cout << endl;
	
	cout << dp[n] << endl;
	return 0;
}

Submission Info

Judge Result