QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#401118#5075. Fenwick TreedoziccTL 1ms3608kbC++14758b2024-04-27 22:31:132024-04-27 22:31:14

Judging History

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

  • [2024-04-27 22:31:14]
  • 评测
  • 测评结果:TL
  • 用时:1ms
  • 内存:3608kb
  • [2024-04-27 22:31:13]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        int n; cin>>n;
        string s; cin>>s;
        int rez=0;
        for(int i=0; i<n; i++)
        {
            if(s[i]=='1' and i%2==0){rez++; continue;}
            int st=((i+1)&(-i-1))/2; int pos=i-st;
            if(st==2 and s[i]!=s[i-2]){rez++; continue;}
            if(s[i]=='0')continue;
            bool ch=false;
            while(pos<i)
            {
                if(s[pos]=='1'){ch=true; break;}
                pos+=st/2; st/=2;
            }
            if(!ch)rez++;
        }
        cout<<rez<<"\n";
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 1ms
memory: 3608kb

input:

3
5
10110
5
00000
5
11111

output:

3
0
3

result:

ok 3 number(s): "3 0 3"

Test #2:

score: -100
Time Limit Exceeded

input:

100000
10
0000000000
10
0000000100
10
0000000000
10
1000000000
10
0000010000
10
0000000000
10
0000000000
10
0000000000
10
0100000000
10
0000000000
10
0000000001
10
0000001000
10
0000000000
10
0000000000
10
0000000001
10
0000100000
10
0010000000
10
0000000000
10
0010000000
10
0000000001
10
0000000000...

output:


result: