QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#692509 | #6749. Target | xuedinedtouzi# | WA | 0ms | 3952kb | C++23 | 701b | 2024-10-31 14:38:29 | 2024-10-31 14:38:56 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
double x,y;
int len;
vector<bool> ans(55);
int get(double a){
}
bool flag;
bool dfs(int dp,int max_dp,double a){
if(dp>max_dp){
return false;
}
if(abs(a-y)<=0.00001||flag){
flag=true;
len=dp;
return true;
}
if(a>y){
ans[dp]=0;
if(dfs(dp+1,max_dp,a/2)){
return true;
}
}else{
ans[dp]=1;
if(dfs(dp+1,max_dp,(a+1)/2)){
return true;
}
}
return false;
}
int main(){
cin>>x>>y;
for(int i=0;i<51;i++){
flag=false;
if(dfs(0,i,x)){
break;
}
}
for(int i=0;i<len;i++){
x/=2;
}
// cout<<fixed<<setprecision(10)<<abs(x-y);
for(int i=0;i<len;i++){
cout<<ans[i]+1;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3732kb
input:
0.5 0.25
output:
1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3724kb
input:
1 0.75
output:
12
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3824kb
input:
1 0
output:
11111111111111111
result:
ok ok
Test #4:
score: -100
Wrong Answer
time: 0ms
memory: 3952kb
input:
0.361954 0.578805
output:
result:
wrong answer wa