fork download
  1. #include <iostream>
  2. #include<bits/stdc++.h>
  3. typedef long long int ll;
  4.  
  5.  
  6. using namespace std;
  7.  
  8. bool check(ll n , ll m , ll k , ll mid){
  9. vector<ll> arr(n+1,1);
  10. vector<ll> arr1(n+1,1);
  11.  
  12. arr[k]=mid;
  13. arr1[k]=mid;
  14. ll i=k+1;
  15. ll sum=0;
  16.  
  17. while(i<=n){
  18. arr[i]=arr[i-1]+1;
  19.  
  20. arr1[i]=max(1LL,arr1[i-1]-1);
  21.  
  22. i++;
  23. }
  24. i=k-1;
  25.  
  26. while(i>=1){
  27. arr[i]=arr[i+1]+1;
  28.  
  29. arr1[i]=max(1LL,arr1[i+1]-1);
  30.  
  31.  
  32. i--;
  33.  
  34. }
  35. ll low = 0;
  36. ll high = 0;
  37.  
  38. for(ll i=1;i<=n;i++){
  39.  
  40. low = low + arr1[i];
  41. high = high + arr[i];
  42.  
  43. }
  44.  
  45. if(m>=low && m<=high){
  46. return true;
  47. }
  48. return false;
  49.  
  50.  
  51.  
  52. }
  53.  
  54. int main() {
  55. // your code goes here
  56. ll n,m,k;
  57. cin>>n>>m>>k;
  58. ll low=1;
  59. ll high=m;
  60. ll ans = 1;
  61.  
  62. while(low<=high){
  63. ll mid = (low+high)/2;
  64.  
  65. if(check(n,m,k,mid)==true){
  66. ans=mid;
  67. low=mid+1;
  68. }
  69. else{
  70. high=mid-1;
  71. }
  72. }
  73.  
  74. cout<<ans<<endl;
  75.  
  76. return 0;
  77. }
Success #stdin #stdout 0s 544KB
stdin
5 11 3
stdout
3