Submission #992883


Source Code Expand

#include <iostream>
#include <fstream>
#include <set>
#include <map>
#include <string>
#include <vector>
#include <bitset>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <cassert>
#include <queue>

#define mp make_pair
#define pb push_back


typedef long long ll;
typedef long double ld;

using namespace std;


ll dp[100][1200];
ll dp2[4][22010];
ll n, a;

int main() {
	cin >> n >> a;
	dp[0][0] = 1;
	for (int i = 1; i <= 40; ++i) {
		for (int j = 0; j <= 1000; ++j) {
			for (int k = 0; k <= j; ++k)
				dp[i][j] = max(dp[i][j], min(n, dp[i - 1][j - k] * k));
		}
	}
	ll ans = n;

	for (int i = 1; i <= 1200000; ++i)
		ans = min(ans, a + i + (n + i - 1) / i);

	for (int i = 1; i <= 40; ++i)
		for (int j = 0; j <= 1000; ++j) {
			if (dp[i][j] != 0)
				ans = min(ans, a * i + j + (n + dp[i][j] - 1) / dp[i][j]);
		}
	dp2[0][0] = 1;
	for (int i = 1; i <= 3; ++i) {
		for (int j = 0; j <= 21000; ++j) {
			if (i == 1) {
				dp2[i][j] = j;
				continue;
			}
			if (i == 2 && j > 5000)
				continue;
			for (int k = 0; k <= j; ++k)
				dp2[i][j] = max(dp2[i][j], min(n, dp2[i - 1][j - k] * k));
		}
	}
	for (int i = 1; i <= 3; ++i)
		for (int j = 0; j <= 21000; ++j) {
			if (dp2[i][j] != 0)
				ans = min(ans, a * i + j + (n + dp2[i][j] - 1) / dp2[i][j]);
		}

	cout << ans << "\n";
	return 0;
}


Submission Info

Submission Time
Task E - Cookies
User LHiC
Language C++14 (GCC 5.4.1)
Score 500
Code Size 1409 Byte
Status WA
Exec Time 470 ms
Memory 1152 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 500 / 500 0 / 500
Status
AC × 3
AC × 27
AC × 68
WA × 1
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
dataset1 sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt
dataset2 sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, 02-10.txt, 02-11.txt, 02-12.txt, 02-13.txt, 02-14.txt, 02-15.txt, 02-16.txt, 02-17.txt, 02-18.txt, 02-19.txt, 02-20.txt, 02-21.txt, 02-22.txt, 02-23.txt, 02-24.txt, 02-25.txt, 02-26.txt, 02-27.txt, 02-28.txt, 02-29.txt, 02-30.txt, 02-31.txt, 02-32.txt, 02-33.txt, 02-34.txt, 02-35.txt, 02-36.txt, 02-37.txt, 02-38.txt, 02-39.txt, 02-40.txt
Case Name Status Exec Time Memory
01-01.txt AC 458 ms 1024 KB
01-02.txt AC 457 ms 1024 KB
01-03.txt AC 457 ms 1024 KB
01-04.txt AC 458 ms 1024 KB
01-05.txt AC 457 ms 1024 KB
01-06.txt AC 458 ms 1024 KB
01-07.txt AC 458 ms 1024 KB
01-08.txt AC 458 ms 1024 KB
01-09.txt AC 457 ms 1024 KB
01-10.txt AC 458 ms 1024 KB
01-11.txt AC 458 ms 1024 KB
01-12.txt AC 458 ms 1024 KB
01-13.txt AC 458 ms 1024 KB
01-14.txt AC 458 ms 1024 KB
01-15.txt AC 458 ms 1024 KB
01-16.txt AC 458 ms 1024 KB
01-17.txt AC 458 ms 1024 KB
01-18.txt AC 458 ms 1024 KB
01-19.txt AC 457 ms 1024 KB
01-20.txt AC 458 ms 1024 KB
01-21.txt AC 457 ms 1024 KB
01-22.txt AC 458 ms 1152 KB
01-23.txt AC 458 ms 1024 KB
01-24.txt AC 458 ms 1024 KB
01-25.txt AC 458 ms 1024 KB
01-26.txt AC 458 ms 1024 KB
02-01.txt AC 458 ms 1024 KB
02-02.txt AC 458 ms 1024 KB
02-03.txt AC 458 ms 1024 KB
02-04.txt AC 458 ms 1024 KB
02-05.txt AC 458 ms 1024 KB
02-06.txt AC 458 ms 1024 KB
02-07.txt AC 458 ms 1024 KB
02-08.txt AC 458 ms 1024 KB
02-09.txt AC 458 ms 1024 KB
02-10.txt AC 458 ms 1024 KB
02-11.txt AC 458 ms 1024 KB
02-12.txt AC 457 ms 1024 KB
02-13.txt AC 458 ms 1024 KB
02-14.txt AC 458 ms 1024 KB
02-15.txt AC 458 ms 1024 KB
02-16.txt AC 458 ms 1024 KB
02-17.txt AC 458 ms 1024 KB
02-18.txt AC 458 ms 1024 KB
02-19.txt AC 458 ms 1024 KB
02-20.txt AC 458 ms 1024 KB
02-21.txt AC 458 ms 1024 KB
02-22.txt AC 458 ms 1024 KB
02-23.txt AC 458 ms 1024 KB
02-24.txt AC 458 ms 1024 KB
02-25.txt AC 458 ms 1024 KB
02-26.txt AC 458 ms 1024 KB
02-27.txt AC 458 ms 1024 KB
02-28.txt AC 458 ms 1024 KB
02-29.txt AC 458 ms 1024 KB
02-30.txt AC 458 ms 1024 KB
02-31.txt AC 458 ms 1024 KB
02-32.txt AC 457 ms 1024 KB
02-33.txt AC 458 ms 1024 KB
02-34.txt AC 470 ms 1024 KB
02-35.txt AC 458 ms 1024 KB
02-36.txt AC 458 ms 1024 KB
02-37.txt AC 458 ms 1024 KB
02-38.txt AC 458 ms 1024 KB
02-39.txt WA 458 ms 1024 KB
02-40.txt AC 458 ms 1024 KB
sample-01.txt AC 458 ms 1152 KB
sample-02.txt AC 458 ms 1024 KB
sample-03.txt AC 457 ms 1024 KB