Submission #993162
Source Code Expand
#include <algorithm> #include <cstdio> #include <functional> #include <iostream> #include <cfloat> #include <climits> #include <cstdlib> #include <cstring> #include <cmath> #include <map> #include <queue> #include <set> #include <sstream> #include <stack> #include <string> #include <time.h> #include <vector> using namespace std; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> i_i; typedef pair<ll, int> ll_i; typedef pair<double, int> d_i; typedef pair<ll, ll> ll_ll; typedef pair<double, double> d_d; struct edge { int u, v; ll w; }; #define rep(i, N) for (int i = 0; i < N; i++) #define pb push_back ll MOD = 1000000007; ll _MOD = 1000000009; double EPS = 1e-10; int main() { ll N, A; cin >> N >> A; ll ans = N; for (int t = 1; t < 100; t++) { ll lb = -1, ub = N; while (ub - lb > 1) { ll mid = (lb + ub) / 2, n = N; double z = 1; rep(i, t + 1) { ll d = mid / (t + 1) + (i < mid % (t + 1)); z *= d; } if (z >= N) ub = mid; else lb = mid; } ans = min(ans, ub + t * A); } cout << ans << endl; return 0; if (N > 1000000) return 0; vector<int> v; for (int i = 1; i * i <= N; i++) { v.pb(i); v.pb((N + i - 1) / i); } sort(v.begin(), v.end()); v.erase(unique(v.begin(), v.end()), v.end()); while (v.back() > N) v.pop_back(); int M = v.size(); vector<ll> dp(M, LLONG_MAX); dp[0] = 1; for (int k = 1; k < M; k++) { int x = v[k]; dp[k] = x; for (int _k = 0; _k < k; _k++) { int y = v[_k]; int d = (x + y - 1) / y; dp[k] = min(dp[k], dp[_k] + d + A); } } cout << dp.back() << endl; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | sugim48 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 1663 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 KB |
Judge Result
Set Name | sample | dataset1 | dataset2 | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 500 / 500 | 500 / 500 | ||||||
Status |
|
|
|
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 | 3 ms | 256 KB |
01-02.txt | AC | 3 ms | 256 KB |
01-03.txt | AC | 3 ms | 256 KB |
01-04.txt | AC | 3 ms | 256 KB |
01-05.txt | AC | 3 ms | 256 KB |
01-06.txt | AC | 3 ms | 256 KB |
01-07.txt | AC | 3 ms | 256 KB |
01-08.txt | AC | 3 ms | 256 KB |
01-09.txt | AC | 3 ms | 256 KB |
01-10.txt | AC | 3 ms | 256 KB |
01-11.txt | AC | 3 ms | 256 KB |
01-12.txt | AC | 3 ms | 256 KB |
01-13.txt | AC | 3 ms | 256 KB |
01-14.txt | AC | 3 ms | 256 KB |
01-15.txt | AC | 3 ms | 256 KB |
01-16.txt | AC | 3 ms | 256 KB |
01-17.txt | AC | 3 ms | 256 KB |
01-18.txt | AC | 3 ms | 256 KB |
01-19.txt | AC | 3 ms | 256 KB |
01-20.txt | AC | 3 ms | 256 KB |
01-21.txt | AC | 3 ms | 256 KB |
01-22.txt | AC | 3 ms | 256 KB |
01-23.txt | AC | 3 ms | 256 KB |
01-24.txt | AC | 3 ms | 256 KB |
01-25.txt | AC | 3 ms | 256 KB |
01-26.txt | AC | 3 ms | 256 KB |
02-01.txt | AC | 3 ms | 256 KB |
02-02.txt | AC | 3 ms | 256 KB |
02-03.txt | AC | 3 ms | 256 KB |
02-04.txt | AC | 3 ms | 256 KB |
02-05.txt | AC | 3 ms | 256 KB |
02-06.txt | AC | 3 ms | 256 KB |
02-07.txt | AC | 3 ms | 256 KB |
02-08.txt | AC | 3 ms | 256 KB |
02-09.txt | AC | 3 ms | 256 KB |
02-10.txt | AC | 3 ms | 256 KB |
02-11.txt | AC | 3 ms | 256 KB |
02-12.txt | AC | 3 ms | 256 KB |
02-13.txt | AC | 3 ms | 256 KB |
02-14.txt | AC | 3 ms | 256 KB |
02-15.txt | AC | 3 ms | 256 KB |
02-16.txt | AC | 3 ms | 256 KB |
02-17.txt | AC | 3 ms | 256 KB |
02-18.txt | AC | 3 ms | 256 KB |
02-19.txt | AC | 3 ms | 256 KB |
02-20.txt | AC | 3 ms | 384 KB |
02-21.txt | AC | 3 ms | 256 KB |
02-22.txt | AC | 3 ms | 256 KB |
02-23.txt | AC | 3 ms | 256 KB |
02-24.txt | AC | 3 ms | 256 KB |
02-25.txt | AC | 3 ms | 256 KB |
02-26.txt | AC | 3 ms | 256 KB |
02-27.txt | AC | 3 ms | 256 KB |
02-28.txt | AC | 3 ms | 256 KB |
02-29.txt | AC | 3 ms | 256 KB |
02-30.txt | AC | 3 ms | 384 KB |
02-31.txt | AC | 3 ms | 256 KB |
02-32.txt | AC | 3 ms | 256 KB |
02-33.txt | AC | 3 ms | 256 KB |
02-34.txt | AC | 3 ms | 256 KB |
02-35.txt | AC | 3 ms | 256 KB |
02-36.txt | AC | 3 ms | 256 KB |
02-37.txt | AC | 3 ms | 256 KB |
02-38.txt | AC | 3 ms | 256 KB |
02-39.txt | AC | 3 ms | 256 KB |
02-40.txt | AC | 3 ms | 256 KB |
sample-01.txt | AC | 3 ms | 256 KB |
sample-02.txt | AC | 3 ms | 256 KB |
sample-03.txt | AC | 3 ms | 256 KB |