Submission #993129
Source Code Expand
#pragma comment(linker, "/STACK:512000000") #define _CRT_SECURE_NO_WARNINGS //#include "testlib.h" #include <bits/stdc++.h> using namespace std; #define all(a) a.begin(), a.end() typedef long long li; typedef long double ld; void solve(); void precalc(); clock_t start; //int timer = 1; int testNumber = 1; bool todo = true; int main() { #ifdef AIM freopen("/home/alexandero/ClionProjects/ACM/input.txt", "r", stdin); //freopen("out.txt", "w", stdout); #else //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif start = clock(); int t = 1; cout.sync_with_stdio(0); cin.tie(0); precalc(); cout.precision(10); cout << fixed; //cin >> t; int testNum = 1; while (t--) { //cerr << testNum << endl; //cout << "Case #" << testNum++ << ": "; solve(); ++testNumber; //++timer; } #ifdef AIM cerr << "\n\n time: " << (clock() - start) / 1.0 / CLOCKS_PER_SEC << "\n\n"; #endif return 0; } //BE CAREFUL: IS INT REALLY INT? template<typename T> T binpow(T q, T w, T mod) { if (!w) return 1 % mod; if (w & 1) return q * 1LL * binpow(q, w - 1, mod) % mod; return binpow(q * 1LL * q % mod, w / 2, mod); } template<typename T> T gcd(T q, T w) { while (w) { q %= w; swap(q, w); } return q; } template<typename T> T lcm(T q, T w) { return q / gcd(q, w) * w; } void precalc() { } #define int li //const int mod = 1000000007; bool more(int mn, int mins, int mx, int maxes, int n) { for (int i = 0; i < mins; ++i) { if (n < mn) { return true; } n = (n - 1) / mn + 1; } for (int i = 0; i < maxes; ++i) { if (n < mx) { return true; } n = (n - 1) / mx + 1; } return n <= 1; } void solve() { int n, A; cin >> n >> A; int res = n; for (int x = 2; x <= 60; ++x) { int L = x - 1, R = 1e9; while (L + 1 < R) { int M = (L + R) / 2; int min_val = M / x; int max_val = min_val + 1; int maxes = M - min_val * x; int mins = x - maxes; if (more(min_val, mins, max_val, maxes, n)) { R = M; } else { L = M; } //cout << x << ' ' << L << ' ' << R << endl; } res = min(res, R + (x - 1) * A); } cout << res << "\n"; }
Submission Info
Submission Time | |
---|---|
Task | E - Cookies |
User | Kostroma |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 2703 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 | 256 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 | 384 KB |
02-28.txt | AC | 3 ms | 256 KB |
02-29.txt | AC | 3 ms | 256 KB |
02-30.txt | AC | 3 ms | 256 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 |