fork download
  1. #include <iostream>
  2. #include<bits/stdc++.h>
  3. typedef long long int ll;
  4.  
  5.  
  6. using namespace std;
  7.  
  8. ll 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 1;
  47. }
  48.  
  49. if(m>high){
  50. return 2;
  51. }
  52.  
  53. if(m<low){
  54. return 3;
  55. }
  56. return 0;
  57.  
  58.  
  59.  
  60.  
  61.  
  62. }
  63.  
  64. int main() {
  65. // your code goes here
  66. ll n,m,k;
  67. cin>>n>>m>>k;
  68. ll low=1;
  69. ll high=m;
  70. ll ans = 1;
  71.  
  72. while(low<=high){
  73. ll mid = (low+high)/2;
  74. ll a = check(n,m,k,mid);
  75. if(a==1){
  76. ans=mid;
  77. low=mid+1;
  78. }
  79. else{
  80. if(a==2){
  81. low=mid+1;
  82. }
  83. else{
  84. high=mid-1;
  85. }
  86. }
  87. }
  88.  
  89. cout<<ans<<endl;
  90.  
  91. return 0;
  92. }
  93.  
Success #stdin #stdout 0s 544KB
stdin
5 11 3
stdout
3