Submission #995039
Source Code Expand
#include <bits/stdc++.h>
using namespace std;
#ifdef _WIN32
#define scanfll(x) scanf("%I64d", x)
#define printfll(x) printf("%I64d", x)
#else
#define scanfll(x) scanf("%lld", x)
#define printfll(x) printf("%lld", x)
#endif
#define rep(i,n) for(long long i = 0; i < (long long)(n); i++)
#define repi(i,a,b) for(long long i = (long long)(a); i < (long long)(b); i++)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mt make_tuple
#define mp make_pair
template<class T1, class T2> bool chmin(T1 &a, T2 b) { return b < a && (a = b, true); }
template<class T1, class T2> bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }
using ll = long long; using vll = vector<ll>; using vvll = vector<vll>;
using ld = long double; using vld = vector<ld>;
using vi = vector<int>; using vvi = vector<vi>;
vll conv(vi& v) { vll r(v.size()); rep(i, v.size()) r[i] = v[i]; return r; }
using P = pair<ll, ll>;
template <typename T, typename U> ostream &operator<<(ostream &o, const pair<T, U> &v) { o << "(" << v.first << ", " << v.second << ")"; return o; }
template<size_t...> struct seq{}; template<size_t N, size_t... Is> struct gen_seq : gen_seq<N-1, N-1, Is...>{}; template<size_t... Is> struct gen_seq<0, Is...> : seq<Is...>{};
template<class Ch, class Tr, class Tuple, size_t... Is>
void print_tuple(basic_ostream<Ch,Tr>& os, Tuple const& t, seq<Is...>){ using s = int[]; (void)s{0, (void(os << (Is == 0? "" : ", ") << get<Is>(t)), 0)...}; }
template<class Ch, class Tr, class... Args>
auto operator<<(basic_ostream<Ch, Tr>& os, tuple<Args...> const& t) -> basic_ostream<Ch, Tr>& { os << "("; print_tuple(os, t, gen_seq<sizeof...(Args)>()); return os << ")"; }
ostream &operator<<(ostream &o, const vvll &v) { rep(i, v.size()) { rep(j, v[i].size()) o << v[i][j] << " "; cout << endl; } return o; }
template <typename T> ostream &operator<<(ostream &o, const vector<T> &v) { o << '['; rep(i, v.size()) o << v[i] << (i != v.size()-1 ? ", " : ""); o << "]"; return o; }
template <typename T> ostream &operator<<(ostream &o, const set<T> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it << (next(it) != m.end() ? ", " : ""); o << "]"; return o; }
template <typename T, typename U> ostream &operator<<(ostream &o, const unordered_map<T, U> &m) { o << '['; for (auto it = m.begin(); it != m.end(); it++) o << *it; o << "]"; return o; }
string bits_to_string(ll mask, ll n) { string s; rep(i, n) s += '0' + !!(mask & (1ll << i)); return s; }
#define ldout fixed << setprecision(40)
static const double EPS = 1e-14;
static const long long INF = 1e18;
static const long long mo = 1e9+7;
ll n, a;
ll solve(ll l, ll r) {
ll ret = INF;
repi(dt, -1000000, 1000000) {
ll t1 = a+dt;
if (t1 < 2) {
t1 = 2;
}
ll k = 1;
ll t = 0;
while (1) {
ll no_eat_time = (n - 1) / k + 1;
if (no_eat_time <= t1 + a + ((n - 1) / (t1 * k) + 1)) {
// cout << t + (n - 1) / k + 1 << endl;
chmin(ret, t + (n - 1) / k + 1);
break;
} else {
t += t1 + a;
k = t1 * k;
}
}
}
return ret;
}
int main(void) {
cin >> n >> a;
ll ret = INF;
chmin(ret, solve(-1000000, 1000000));
chmin(ret, solve(18000000, 20000000));
chmin(ret, solve(-20000000, -18000000));
cout << ret << endl;
return 0;
}
Submission Info
Submission Time |
|
Task |
E - Cookies |
User |
hamko |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3761 Byte |
Status |
WA |
Exec Time |
2102 ms |
Memory |
384 KB |
Judge Result
Set Name |
sample |
dataset1 |
dataset2 |
Score / Max Score |
0 / 0 |
0 / 500 |
0 / 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 |
1165 ms |
256 KB |
01-02.txt |
AC |
1164 ms |
256 KB |
01-03.txt |
AC |
1106 ms |
256 KB |
01-04.txt |
WA |
1105 ms |
256 KB |
01-05.txt |
AC |
1106 ms |
256 KB |
01-06.txt |
AC |
1106 ms |
256 KB |
01-07.txt |
AC |
1046 ms |
256 KB |
01-08.txt |
AC |
987 ms |
256 KB |
01-09.txt |
AC |
968 ms |
256 KB |
01-10.txt |
AC |
861 ms |
256 KB |
01-11.txt |
AC |
825 ms |
256 KB |
01-12.txt |
AC |
70 ms |
256 KB |
01-13.txt |
AC |
70 ms |
256 KB |
01-14.txt |
AC |
819 ms |
256 KB |
01-15.txt |
AC |
1082 ms |
256 KB |
01-16.txt |
AC |
1081 ms |
256 KB |
01-17.txt |
AC |
1046 ms |
256 KB |
01-18.txt |
AC |
124 ms |
256 KB |
01-19.txt |
AC |
232 ms |
256 KB |
01-20.txt |
AC |
71 ms |
256 KB |
01-21.txt |
AC |
70 ms |
256 KB |
01-22.txt |
AC |
71 ms |
256 KB |
01-23.txt |
AC |
70 ms |
256 KB |
01-24.txt |
AC |
70 ms |
256 KB |
01-25.txt |
AC |
71 ms |
256 KB |
01-26.txt |
AC |
123 ms |
256 KB |
02-01.txt |
AC |
71 ms |
256 KB |
02-02.txt |
TLE |
2102 ms |
256 KB |
02-03.txt |
TLE |
2102 ms |
256 KB |
02-04.txt |
TLE |
2102 ms |
256 KB |
02-05.txt |
TLE |
2102 ms |
256 KB |
02-06.txt |
TLE |
2102 ms |
256 KB |
02-07.txt |
TLE |
2102 ms |
256 KB |
02-08.txt |
TLE |
2102 ms |
256 KB |
02-09.txt |
TLE |
2102 ms |
256 KB |
02-10.txt |
TLE |
2102 ms |
256 KB |
02-11.txt |
TLE |
2102 ms |
256 KB |
02-12.txt |
TLE |
2102 ms |
256 KB |
02-13.txt |
TLE |
2102 ms |
256 KB |
02-14.txt |
TLE |
2102 ms |
256 KB |
02-15.txt |
TLE |
2102 ms |
256 KB |
02-16.txt |
TLE |
2102 ms |
256 KB |
02-17.txt |
TLE |
2102 ms |
384 KB |
02-18.txt |
AC |
1998 ms |
256 KB |
02-19.txt |
AC |
1940 ms |
256 KB |
02-20.txt |
AC |
1815 ms |
256 KB |
02-21.txt |
AC |
1605 ms |
256 KB |
02-22.txt |
AC |
181 ms |
256 KB |
02-23.txt |
WA |
70 ms |
256 KB |
02-24.txt |
AC |
70 ms |
256 KB |
02-25.txt |
AC |
1465 ms |
256 KB |
02-26.txt |
TLE |
2102 ms |
256 KB |
02-27.txt |
TLE |
2102 ms |
256 KB |
02-28.txt |
TLE |
2075 ms |
256 KB |
02-29.txt |
TLE |
2102 ms |
256 KB |
02-30.txt |
TLE |
2102 ms |
256 KB |
02-31.txt |
TLE |
2102 ms |
256 KB |
02-32.txt |
TLE |
2102 ms |
256 KB |
02-33.txt |
TLE |
2102 ms |
256 KB |
02-34.txt |
TLE |
2102 ms |
256 KB |
02-35.txt |
TLE |
2102 ms |
256 KB |
02-36.txt |
TLE |
2102 ms |
256 KB |
02-37.txt |
AC |
1866 ms |
256 KB |
02-38.txt |
AC |
1766 ms |
256 KB |
02-39.txt |
AC |
390 ms |
256 KB |
02-40.txt |
WA |
177 ms |
256 KB |
sample-01.txt |
AC |
123 ms |
256 KB |
sample-02.txt |
AC |
70 ms |
256 KB |
sample-03.txt |
AC |
821 ms |
256 KB |