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
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
|
#include <bits/stdc++.h>
#define all(vec) vec.begin(),vec.end()
#define CLR(i,a) memset(i,a,sizeof(i))
#define pb push_back
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cerr << #var <<":"<<var<<"\n";
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
using namespace std;
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using i128 = __int128;using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
constexpr ll MAXN=static_cast<ll>(1e6)+10,INF=static_cast<ll>(1e17)+9;
constexpr ll mod=static_cast<ll>(1e9)+7;
constexpr double eps=1e-8;
ll N,M,Q,X,K,lT;
char S[MAXN];
inline void init(){
}
inline void solve(){
cin>>N;
init();
ll cnt1=0,cnt0=0;
FOR(i,1,N){
cin>>S[i];
if(S[i]=='1') ++cnt1;
else if(S[i]=='0') ++cnt0;
}
S[N+1]='\0',S[0]='\0';
ll idx=1;
vector<vector<ll> > g(N+5);
FOR(i,1,N){
if(S[i]!='?') continue;
if(g[idx].empty() || i-g[idx].back()==1 ){
g[idx].pb(i);
}else{
++idx;
g[idx].pb(i);
}
}
ll oans=1;char up=S[1];
FOR(i,2,N){
char ch=S[i];
if(ch=='?') ch='0';
if(ch!=up){
++oans;
up=ch;
}
}
vector<vector<ll> > cnts(N+5);
FOR(i,1,idx){
if(g[i].empty()) continue;
ll l=g[i].front(),r=g[i].back();
ll id=S[l-1]-'0'+S[r+1]-'0';
cnts[id].pb(r-l+1);
}
sort(all(cnts[0]));
sort(all(cnts[1]),greater<ll>());
sort(all(cnts[2]),greater<ll>());
ll ans=oans;
#ifdef LOCAL
debug(ans);debug(oans);
#endif
vector<bool> alde(N+5,false);
FOR(i,0,N){
if(i<cnt1){
cout<<-1<<" ";
continue;
}
if(i>N-cnt0){
cout<<-1<<" ";
continue;
}
if(i==cnt1){
cout<<ans<<" ";
continue;
}
if(!cnts[2].empty()){
ll id=SZ(cnts[2])-1;
cnts[2][id]--;
if(cnts[2][id]<=0){
cnts[2].pop_back();
ans-=2;
}
cout<<ans<<" ";
continue;
}
if(!cnts[1].empty()){
ll id=SZ(cnts[1])-1;
cnts[1][id]--;
if(cnts[1][id]<=0){
cnts[1].pop_back();
}
cout<<ans<<" ";
continue;
}
if(!cnts[0].empty()){
ll id=SZ(cnts[0])-1;
if(!alde[id]) ans+=2;
cnts[0][id]--;
alde[id]=true;
if(cnts[0][id]<=0){
cnts[0].pop_back();
}
cout<<ans<<" ";
continue;
}
}
cout<<"\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
cin>>lT;
while(lT--){
solve();
}
return 0;
}
|