QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#789163#9746. 平方根ValenciaTravis#AC ✓13ms5264kbC++20486b2024-11-27 19:26:482024-11-27 19:26:49

Judging History

你现在查看的是最新测评结果

  • [2024-11-27 19:26:49]
  • 评测
  • 测评结果:AC
  • 用时:13ms
  • 内存:5264kb
  • [2024-11-27 19:26:48]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int n;
string s;
int main(){
    cin>>s;
    n = s.size();
    int ans1 = 0, ans2 = 0;
    for(int i=0;i<n;i++) {
        if(s[i] == '0') continue;
        int j = i;
        while(j < n && s[j] == '1') j++;
        int len = j-i;
        i = j-1;
        if(len & 1) ans1 += (len+1) / 2;
        else ans1 += (len-1) / 2, ans2++;
    }
    double ans = ans1 + ans2 * sqrt(2);
    printf("%.15lf\n", ans);
    return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3748kb

input:

1100110111

output:

4.828427124746190

result:

ok found '4.828427125', expected '4.828427125', error '0.000000000'

Test #2:

score: 0
Accepted
time: 0ms
memory: 3864kb

input:

0

output:

0.000000000000000

result:

ok found '0.000000000', expected '0.000000000', error '-0.000000000'

Test #3:

score: 0
Accepted
time: 0ms
memory: 3868kb

input:

1

output:

1.000000000000000

result:

ok found '1.000000000', expected '1.000000000', error '0.000000000'

Test #4:

score: 0
Accepted
time: 6ms
memory: 5264kb

input:

000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

0.000000000000000

result:

ok found '0.000000000', expected '0.000000000', error '-0.000000000'

Test #5:

score: 0
Accepted
time: 12ms
memory: 5200kb

input:

111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111...

output:

500000.414213562384248

result:

ok found '500000.414213562', expected '500000.414213562', error '0.000000000'

Test #6:

score: 0
Accepted
time: 13ms
memory: 5192kb

input:

010101111011001000011101100000011110101010000110011110101010111011010011100001100000001011100111110000100101100011101101000100110100111101001100011000101000000101011101000011011001111011101101100010110110001111011001010100110011111101000010010011011101100001101001101010011011100110101001101111010101...

output:

367851.986787086003460

result:

ok found '367851.986787086', expected '367851.986787086', error '0.000000000'

Test #7:

score: 0
Accepted
time: 8ms
memory: 5236kb

input:

000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000...

output:

299931.313708498957567

result:

ok found '299931.313708499', expected '299931.313708499', error '0.000000000'

Extra Test:

score: 0
Extra Test Passed