fork download 
  1. // #pragma GCC optimize("O3", "unroll-loops")
  2. // #pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
  3.  
  4. #include <bits/stdc++.h>
  5. #define ldb long double
  6. //#define double ldb
  7. #define db double
  8. #define unomap unordered_map
  9. #define unoset unordered_set
  10. #define endl '\n'
  11. #define str string
  12. #define strstr stringstream
  13. #define sz(a) (int)a.size()
  14. #define ll long long
  15. // #define int ll
  16. #define pii pair <int, int>
  17. #define pll pair <ll, ll>
  18. #define Unique(a) a.resize(unique(all(a)) - a.begin())
  19. #define ull unsigned ll
  20. #define fir first
  21. #define sec second
  22. #define idc cin.ignore()
  23. #define lb lower_bound
  24. #define ub upper_bound
  25. #define all(s) s.begin(), s.end()
  26. #define rev reverse
  27. #define gcd __gcd
  28. #define pushb push_back
  29. #define popb pop_back
  30. #define pushf push_front
  31. #define popf pop_front
  32. #define mul2x(a, x) a << x
  33. #define div2x(a, x) a >> x
  34. #define lcm(a, b) (a / __gcd(a, b) * b)
  35. #define log_base(x, base) log(x) / log(base)
  36. #define debug cerr << "No errors!"; exit(0);
  37. #define forw(i, a, b)  for (int i = a; i <= b; ++i)
  38. #define forw2(i, a, b) for (ll i = a; i <= b; ++i)
  39. #define fors(i, a, b)  for (int i = a; i >= b; --i)
  40. #define fors2(i, a, b) for (ll i = a; i >= b; --i)
  41. #define pqueue priority_queue
  42. #define sqrt sqrtl
  43. #define i128 __int128
  44. #define popcount __builtin_popcountll
  45. #define BIT(x, i) (((x) >> (i)) & 1)
  46. #define MASK(x) ((1LL) << (x))
  47. #define want_digit(x) cout << fixed << setprecision(x);
  48. #define excuting_time 1000.0 * clock() / CLOCKS_PER_SEC
  49. #define mapa make_pair
  50. using namespace std;
  51. const int MOD = 1e9 + 7; // 998244353
  52. const int inf = 1e9;
  53. const ll INF = 1e18; // MASK(63) - 1
  54. const int limN = 1e5 + 5;
  55.  
  56. mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  57. ll random(const ll &L, const ll &R) {
  58.     return uniform_int_distribution<ll> (L, R) (rng);
  59. }
  60.  
  61. int n, m, a[limN];
  62.  
  63. bool ok(ll x) {
  64.     ll r = 0; int cnt = 0;
  65.     fors (i, n, 1) {
  66.         if (a[i] <= r) {
  67.             r -= a[i];
  68.             continue;
  69.         }
  70.         int k = ((a[i] - r) + (x - i) - 1) / (x - i);
  71.         cnt += k;
  72.         if (cnt > m) return false;
  73.         r += k * (x - i) - a[i];
  74.     }
  75.     return true;
  76. }
  77.  
  78. void solve() {
  79.     cin >> n >> m;
  80.     forw (i, 1, n) cin >> a[i];
  81.  
  82.     ll l = n + 1, r = INF, mid, ans = -1;
  83.     while (l <= r) {
  84.         mid = (l + r) >> 1;
  85.         if (ok(mid)) {
  86.             ans = mid;
  87.             r = mid - 1;
  88.         }
  89.         else l = mid + 1;
  90.     }
  91.     cout << ans << endl;
  92. }
  93.  
  94. signed main() {
  95.     ios::sync_with_stdio(false), cin.tie(nullptr);
  96.     srand(time(NULL));
  97.     #define name "test"
  98.     /*
  99.     if (fopen(name".INP", "r")) {
  100.         freopen(name".INP", "r", stdin);
  101.         freopen(name".OUT", "w", stdout);
  102.     }
  103.     */
  104.     bool testCase = false;
  105.     int numTest = 1;
  106.     // cin >> numTest;
  107.     forw (i, 1, numTest) {
  108.         if (testCase) cout << "Case " << i << ": ";
  109.         solve();
  110.     }
  111.     return 0;
  112. }
  113.  
Success #stdin #stdout 0s 5308KB
comments (?)
stdin 
Standard input is empty
stdout 
1
https://ideone.com/1GPV7E
language:
C++14 (gcc 8.3)
created:
3 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!