题解：CF494A Treasure

#include <bits/stdc++.h>
using namespace std;
char s[100005];
int n, k = 0, cnt = 0, m = 0, t, cn = 0;
int main() {
	scanf("%s", s);
	n = strlen(s);
	for (int i = 0; i < n; i++) {
		if (s[i] == '(') k++;
		if (s[i] == ')') k--;
		if (s[i] == '#') cnt++, k--, t = i;
		if (k < 0) {
			cout<<-1<<endl;
			return 0;
		}
	}
	for (int i = t + 1; i <= n; i++) {
		if (s[i] == '(') cn++;
		if (s[i] == ')') cn--;
		cn = max(cn, 0);
	}
	if (cn > 0) {
		cout<<-1<<endl;
		return 0;
	}
	for (int i = 1; i < cnt; i++) cout<<1<<endl;
	cout<<k+1;
	return 0;
}