-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathB_Haunted_House.cpp
60 lines (60 loc) · 1001 Bytes
/
B_Haunted_House.cpp
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
#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve(int tc)
{
int n;
cin>>n;
vector<int> v;
string s;
cin>>s;
int zero=0,one=0,k=n;
for(int i=n-1;i>=0;i--)
{
if(s[i]=='0')
{
zero++;
v.push_back(i+1);
}
else
{
if(one==0)
k=i;
one++;
}
}
if(zero==0 && n==1)
{
cout<<-1<<endl;
return;
}
int pos;
for(int i=0;i<zero;i++)
{
if(i==0)
{
pos=n-v[i];
cout<<pos<<' ';
n--;
}
else{
int temp=pos+(n-v[i]);
pos=temp;
cout<<pos<<' ';
n--;
}
}
for(int i=0;i<one;i++)
cout<<-1<<' ';
cout<<endl;
}
int32_t main()
{
int t;
cin>>t;
for(int i=1;i<=t;i++)
{
solve(t);
}
return 0;
}