Accepted Code
Not Accepted Code
The only change in the two code is the value being assigned to l, when i normally implement binary search i use it like in the not accepted one but why in this problem its giving wrong answer?
# | User | Rating |
---|---|---|
1 | tourist | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
2 | adamant | 161 |
3 | maomao90 | 160 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
8 | TheScrasse | 146 |
8 | SecondThread | 146 |
10 | Petr | 145 |
Help needed in Packing Rectangles (Binary Search)
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a,b,n;
bool isfit(int mid){
return (mid/a)*(mid/b)>=n;
}
signed main(){
cin>>a>>b>>n;
int l=0,r=1;
while(isfit(r)==false){
r*=2;
}
while(r-l>1){
int mid=l+(r-l)/2;
if(isfit(mid)){
r=mid;
}
else{
l=mid;
}
}
if(isfit(l)) cout<<l<<endl;
else cout<<r<<endl;
}
#include<bits/stdc++.h>
using namespace std;
#define int long long
int a,b,n;
bool isfit(int mid){
return (mid/a)*(mid/b)>=n;
}
signed main(){
cin>>a>>b>>n;
int l=0,r=1;
while(isfit(r)==false){
r*=2;
}
while(r-l>1){
int mid=l+(r-l)/2;
if(isfit(mid)){
r=mid;
}
else{
l=mid+1;
}
}
cout<<l<<endl;
}
The only change in the two code is the value being assigned to l, when i normally implement binary search i use it like in the not accepted one but why in this problem its giving wrong answer?
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 |
![]() |
coder__12345 | 2024-02-04 00:12:50 | 95 | ||
en1 |
![]() |
coder__12345 | 2024-02-04 00:07:51 | 1141 | Initial revision (published) |
Name |
---|