QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#841696 | #9746. 平方根 | liujunyi123 | AC ✓ | 8ms | 4960kb | C++14 | 478b | 2025-01-03 22:43:23 | 2025-01-03 22:43:24 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1e6+5;;
char s[N];
int n;
double solve(int n){
double sum=0;
for(int i=1;i<=(n+1)/2;i++){
int res=n-(i-1);
int x=res/i,r=res%i;
double ans=(i-1)*sqrt(x)+sqrt(x+r);
sum=max(sum,ans);
}
return sum;
}
int main(){
scanf("%s",s+1);
n=strlen(s+1);
int p=0;
double sum=0;
for(int i=1;i<=n;i++)if(s[i]=='1')p++;else sum+=solve(p),p=0;
sum+=solve(p);
printf("%.12lf",sum);
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3860kb
input:
1100110111
output:
4.828427124746
result:
ok found '4.828427125', expected '4.828427125', error '0.000000000'
Test #2:
score: 0
Accepted
time: 0ms
memory: 3988kb
input:
0
output:
0.000000000000
result:
ok found '0.000000000', expected '0.000000000', error '-0.000000000'
Test #3:
score: 0
Accepted
time: 0ms
memory: 3864kb
input:
1
output:
1.000000000000
result:
ok found '1.000000000', expected '1.000000000', error '0.000000000'
Test #4:
score: 0
Accepted
time: 5ms
memory: 4812kb
input:
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
0.000000000000
result:
ok found '0.000000000', expected '0.000000000', error '-0.000000000'
Test #5:
score: 0
Accepted
time: 5ms
memory: 4928kb
input:
111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...
output:
500000.414213562384
result:
ok found '500000.414213562', expected '500000.414213562', error '0.000000000'
Test #6:
score: 0
Accepted
time: 8ms
memory: 4960kb
input:
010101111011001000011101100000011110101010000110011110101010111011010011100001100000001011100111110000100101100011101101000100110100111101001100011000101000000101011101000011011001111011101101100010110110001111011001010100110011111101000010010011011101100001101001101010011011100110101001101111010101...
output:
367851.986787611502
result:
ok found '367851.986787612', expected '367851.986787086', error '0.000000000'
Test #7:
score: 0
Accepted
time: 2ms
memory: 4900kb
input:
000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...
output:
299931.313708499016
result:
ok found '299931.313708499', expected '299931.313708499', error '0.000000000'
Extra Test:
score: 0
Extra Test Passed