Submission #1800901


Source Code Expand

#include <iostream>
#include <iomanip> // << fixed << setprecision(xxx)
#include <algorithm> // do { } while ( next_permutation(A, A+xxx) ) ;
#include <vector>
#include <string> // to_string(nnn) // substr(m, n) // stoi(nnn)
#include <complex>
#include <tuple> // get<n>(xxx)
#include <queue>
#include <stack>
#include <map> // if (M.find(key) != M.end()) { }
#include <set> // S.insert(M);
// if (S.find(key) != S.end()) { }
// for (auto it=S.begin(); it != S.end(); it++) { }
// auto it = S.lower_bound(M);
#include <random> // random_device rd; mt19937 mt(rd());
#include <cctype>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib> // atoi(xxx)
using namespace std;

#define DEBUG 0 // change 0 -> 1 if we need debug.
// insert #if<tab> by my emacs. #if DEBUG == 1 ... #end

typedef long long ll;

// const int dx[4] = {1, 0, -1, 0};
// const int dy[4] = {0, 1, 0, -1};

// const int C = 1e6+10;
// const ll M = 1000000007;

ll power(ll a, ll n) {
  if (n == 0) {
    return 1;
  } else if (n%2 == 0) {
    ll x = power(a, n/2);
    return x * x;
  } else {
    return power(a, n-1) * a;
  }
}

ll N, A;

int main () {
  cin >> N >> A;
  ll ub = sqrt(N)+1;
  ll lb = 2;
  ll ans = N;
  for (auto i = 2; i < 1000; ++i) {
    if (power(2, i) > N) break;
    if (i == 2) {
      while (ub - lb > 1) {
        ll t = (ub + lb)/2;
        if (power(t, i) > N) {
          ub = t;
        } else {
          lb = t;
        }
      }      
    } else {
      for (auto j = 1; j < 12000; ++j) {
        if (power(j, i) < N) {
          lb = j;
        } else {
          break;
        }
      }
    }
    // cerr << "i = " << i << ", lb = " << lb << endl;
    for (auto j = 0; j <= i; ++j) {
      if (power(lb, i-j) * power(lb+1, j) >= N) {
        ans = min(ans, lb * (i-j) + (lb+1) * j + A * (i-1));
        break;
      }
    }
    ub = lb;
    lb = 2;
  }
  cout << ans << endl;
}

Submission Info

Submission Time
Task E - Cookies
User kazunetakahashi
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1988 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name sample dataset1 dataset2
Score / Max Score 0 / 0 500 / 500 500 / 500
Status
AC × 3
AC × 27
AC × 72
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, sample-01.txt, sample-02.txt, sample-03.txt
Case Name Status Exec Time Memory
01-01.txt AC 1 ms 256 KB
01-02.txt AC 1 ms 256 KB
01-03.txt AC 1 ms 256 KB
01-04.txt AC 1 ms 256 KB
01-05.txt AC 1 ms 256 KB
01-06.txt AC 1 ms 256 KB
01-07.txt AC 1 ms 256 KB
01-08.txt AC 1 ms 256 KB
01-09.txt AC 1 ms 256 KB
01-10.txt AC 1 ms 256 KB
01-11.txt AC 1 ms 256 KB
01-12.txt AC 1 ms 256 KB
01-13.txt AC 1 ms 256 KB
01-14.txt AC 1 ms 256 KB
01-15.txt AC 1 ms 256 KB
01-16.txt AC 1 ms 256 KB
01-17.txt AC 1 ms 256 KB
01-18.txt AC 1 ms 256 KB
01-19.txt AC 1 ms 256 KB
01-20.txt AC 1 ms 256 KB
01-21.txt AC 1 ms 256 KB
01-22.txt AC 1 ms 256 KB
01-23.txt AC 1 ms 256 KB
01-24.txt AC 1 ms 256 KB
01-25.txt AC 1 ms 256 KB
01-26.txt AC 1 ms 256 KB
02-01.txt AC 1 ms 256 KB
02-02.txt AC 1 ms 256 KB
02-03.txt AC 1 ms 256 KB
02-04.txt AC 1 ms 256 KB
02-05.txt AC 1 ms 256 KB
02-06.txt AC 1 ms 256 KB
02-07.txt AC 1 ms 256 KB
02-08.txt AC 1 ms 256 KB
02-09.txt AC 1 ms 256 KB
02-10.txt AC 1 ms 256 KB
02-11.txt AC 1 ms 256 KB
02-12.txt AC 1 ms 256 KB
02-13.txt AC 1 ms 256 KB
02-14.txt AC 1 ms 256 KB
02-15.txt AC 1 ms 256 KB
02-16.txt AC 1 ms 256 KB
02-17.txt AC 1 ms 256 KB
02-18.txt AC 1 ms 256 KB
02-19.txt AC 1 ms 256 KB
02-20.txt AC 1 ms 256 KB
02-21.txt AC 1 ms 256 KB
02-22.txt AC 1 ms 256 KB
02-23.txt AC 1 ms 256 KB
02-24.txt AC 1 ms 256 KB
02-25.txt AC 1 ms 256 KB
02-26.txt AC 1 ms 256 KB
02-27.txt AC 1 ms 256 KB
02-28.txt AC 1 ms 256 KB
02-29.txt AC 1 ms 256 KB
02-30.txt AC 1 ms 256 KB
02-31.txt AC 1 ms 256 KB
02-32.txt AC 1 ms 256 KB
02-33.txt AC 1 ms 256 KB
02-34.txt AC 1 ms 256 KB
02-35.txt AC 1 ms 256 KB
02-36.txt AC 1 ms 256 KB
02-37.txt AC 1 ms 256 KB
02-38.txt AC 1 ms 256 KB
02-39.txt AC 1 ms 256 KB
02-40.txt AC 1 ms 256 KB
sample-01.txt AC 1 ms 256 KB
sample-02.txt AC 1 ms 256 KB
sample-03.txt AC 1 ms 256 KB