-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathhaunted_house(greedy).cpp
More file actions
46 lines (38 loc) · 1.13 KB
/
Copy pathhaunted_house(greedy).cpp
File metadata and controls
46 lines (38 loc) · 1.13 KB
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
#include<bits/stdc++.h>
using namespace std;
#define faster_ayman ios_base::sync_with_stdio(false);cin.tie(NULL);
#define int long long
#define pb push_back
#define rep(i, a, b) for (auto i = a; i < b; i++)
#define all(a) (a).begin(), (a).end()
#define testcase int tt;cin >> tt;while (tt--)
#define inf 1e18
typedef vector<int> vi;
typedef vector<pair<int,int>> vp;
typedef vector<double> vd;
typedef vector<char> vc;
typedef set<int> si;
typedef set<char> sc;
typedef unordered_set<int> usi;
void solve() {
int n; cin >> n;
string s; cin >> s;
vi ans (n, -1);
int j = 0;
int op = 0;
for (int i = n - 1, k = 0; i >= 0; i--, k++) {
if (s[i] == '0') {
op += k - j;
ans[j++] = op;
}
}
for (auto it : ans) cout << it << ' ';
cout << '\n';
}
signed main() {
faster_ayman
testcase {
solve();
}
return 0;
}