fork download 
  1. /*
  2. * @Author: hungeazy
  3. * @Date:   2025-11-24 14:55:06
  4. * @Last Modified by:   hungeazy
  5. * @Last Modified time: 2025-11-24 15:27:09
  6. */
  7. #include <bits/stdc++.h>
  8. #include <ext/pb_ds/assoc_container.hpp> 
  9. #include <ext/pb_ds/tree_policy.hpp> 
  10. // #pragma GCC optimize("O3")  
  11. // #pragma GCC optimize("unroll-loops")  
  12. // #pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")  
  13. using namespace std;
  14. using namespace __gnu_pbds; 
  15. bool M1;
  16. #define fast ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
  17. #define int long long
  18. #define ll long long 
  19. #define ull unsigned long long
  20. #define sz(x) x.size()
  21. #define sqr(x) (1LL * (x) * (x))
  22. #define all(x) x.begin(), x.end()
  23. #define fill(f,x) memset(f,x,sizeof(f))
  24. #define FOR(i,l,r) for(int i=l;i<=r;i++)
  25. #define FOD(i,r,l) for(int i=r;i>=l;i--)
  26. #define debug(x) cout << #x << " = " << x << '\n'
  27. #define ii pair<int,int>
  28. #define iii pair<int,ii>
  29. #define di pair<ii,ii>
  30. #define vi vector<int>
  31. #define vii vector<ii>
  32. #define mii map<int,int>
  33. #define fi first
  34. #define se second
  35. #define pb push_back
  36. #define MOD 1000000007
  37. #define __lcm(a,b) (1ll * ((a) / __gcd((a), (b))) * (b))
  38. #define YES cout << "YES\n"
  39. #define NO cout << "NO\n" 
  40. #define MASK(i) (1LL << (i))
  41. #define c_bit(i) __builtin_popcountll(i)
  42. #define BIT(x,i) ((x) & MASK(i))
  43. #define SET_ON(x,i) ((x) | MASK(i))
  44. #define SET_OFF(x,i) ((x) & ~MASK(i))
  45. #define oo 1e18
  46. #define name "GUESS"
  47. #define endl '\n'
  48. #define memory() cerr << abs(&M2-&M1)/1024.0/1024 << " MB" << endl
  49. #define time() cerr << endl << "-------------Time:" << 1000.0 * clock() / CLOCKS_PER_SEC << "ms." << endl
  50. template<typename T> bool maximize(T &res, const T &val) { if (res < val){ res = val; return true; }; return false; }
  51. template<typename T> bool minimize(T &res, const T &val) { if (res > val){ res = val; return true; }; return false; }
  52. template <class T> using ordered_set = tree <T, null_type, less_equal <T>, rb_tree_tag,tree_order_statistics_node_update>;
  53. const int N = (int)1e5+10;
  54. int n;
  55.  
  56. namespace hungeazy {
  57.  
  58.     int dp[N];
  59.  
  60. 	void solve(void)
  61. 	{
  62.         if (n <= 1)
  63.         {
  64.             cout << 0;
  65.             return;
  66.         }
  67.         dp[1] = 0;
  68.         FOR(m,2,n)
  69.         {
  70.             int l = 1, r = m-1, ans;
  71.             while (l <= r)
  72.             {
  73.                 int mid = (l+r)>>1;
  74.                 if (dp[mid]-dp[m-mid]+1 >= 0) r = mid-1;
  75.                 else l = mid+1;
  76.             }
  77.             // cout << l << " " << r << endl;
  78.             int best = oo;
  79.             FOR(k,max(1LL,l-1),min(l+1,m-1))
  80.                 minimize(best,max(2+dp[k],1+dp[m-k]));
  81.             dp[m] = best;
  82.         }
  83.         // FOR(i,1,n) cout << dp[i] << " ";
  84.         // cout << endl;
  85.         cout << dp[n];
  86. 	}
  87.  
  88. }
  89.  
  90. bool M2;
  91. signed main()
  92. {
  93.     fast;
  94.     if (fopen(name".inp","r"))
  95.     {
  96.     	freopen(name".inp","r",stdin);
  97.     	freopen(name".out","w",stdout);
  98.     }
  99.     cin >> n;
  100.     hungeazy::solve();
  101.     time();
  102.     memory();
  103.     return 0;
  104. }
  105. // ██░ ██  █    ██  ███▄    █   ▄████
  106. //▓██░ ██▒ ██  ▓██▒ ██ ▀█   █  ██▒ ▀█▒
  107. //▒██▀▀██░▓██  ▒██░▓██  ▀█ ██▒▒██░▄▄▄░
  108. //░▓█ ░██ ▓▓█  ░██░▓██▒  ▐▌██▒░▓█  ██▓
  109. //░▓█▒░██▓▒▒█████▓ ▒██░   ▓██░░▒▓███▀▒
  110. // ▒ ░░▒░▒░▒▓▒ ▒ ▒ ░ ▒░   ▒ ▒  ░▒   ▒
  111. // ▒ ░▒░ ░░░▒░ ░ ░ ░ ░░   ░ ▒░  ░   ░
  112. // ░  ░░ ░ ░░░ ░ ░    ░   ░ ░ ░ ░   ░
  113. // ░  ░  ░   ░              ░       ░
Success #stdin #stdout #stderr 0.01s 5288KB
comments (?)
stdin 
Standard input is empty
stdout 
Standard output is empty
stderr 
-------------Time:5.684ms.
0.763054 MB
https://ideone.com/qOhlWD
language:
C++14 (gcc 8.3)
created:
4 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!