1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
#include<bits/stdc++.h>
using namespace std;
string flip_prefix(const string&s,int x){
    string res=s;
    for(int i=0;i<x;++i){
        res[i]=(res[i]=='0')?'1':'0';
    }
    return res;
}
int count_distinct_strings(string s){
    int n=s.size();
    set<string> visited;
    queue<string> q;
    visited.insert(s);
    q.push(s);
    vector<int> valid_prefixes;
    int balance=0;
    for(int i=0;i<n;++i){
        if(s[i]=='1') balance++;
        else balance--;
        if(balance==0) valid_prefixes.push_back(i+1);
    }
    while(!q.empty()){
        string cur=q.front();q.pop();
        for(int x:valid_prefixes){
            string next_s=flip_prefix(cur,x);
            if(visited.count(next_s)==0){
                visited.insert(next_s);
                q.push(next_s);
            }
        }
    }
    return visited.size();
}
int main(){
    int t;
    cin>>t;
    while(t--){
        int n;
        string s;
        cin>>n>>s;
        cout<<count_distinct_strings(s)<<'\n';
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Subtask Info

Time Limit Exceeded

Submission ID: 1150946910

Time:1.00s

Memory:130.9M

Sub-Task	Task #	Result (time)
1	0	Correct (0.00)
1	1	Correct (0.00)
1	2	Correct (0.00)
1	3	Correct (0.10)
1	4	Correct (0.96)
1	5	Time Limit Exceeded (1.00)
Subtask Score: 0%		Result - Time Limit Exceeded
		Total Score = 0%