CF 282C Treasure

最新推荐文章于 2022-10-05 19:02:26 发布

Liao_Jingyi

最新推荐文章于 2022-10-05 19:02:26 发布

阅读量392

点赞数

分类专栏：模拟

本文链接：https://blog.csdn.net/Liao_Jingyi/article/details/42748021

版权

模拟专栏收录该内容

12 篇文章 0 订阅

订阅专栏

Malek has recently found a treasure map. While he was looking for a treasure he found a locked door. There was a string s written on the door consisting of characters '(', ')' and '#'. Below there was a manual on how to open the door. After spending a long time Malek managed to decode the manual and found out that the goal is to replace each '#' with one or more ')' characters so that the final string becomes beautiful.

Below there was also written that a string is called beautiful if for each i (1 ≤ i ≤ |s|) there are no more ')' characters than '(' characters among the first i characters of s and also the total number of '(' characters is equal to the total number of ')' characters.

Help Malek open the door by telling him for each '#' character how many ')' characters he must replace it with.

Input

The first line of the input contains a string s (1 ≤ |s| ≤ 10⁵). Each character of this string is one of the characters '(', ')' or '#'. It is guaranteed that s contains at least one '#' character.

Output

If there is no way of replacing '#' characters which leads to a beautiful string print - 1. Otherwise for each character '#' print a separate line containing a positive integer, the number of ')' characters this character must be replaced with.

If there are several possible answers, you may output any of them.

Sample test(s)

Input

(((#)((#)

Output

1
2

Input

()((#((#(#()

Output

2
2
1

Input

Output

-1

Input

(#)

Output

-1

Note

|s| denotes the length of the string s.

解析

模拟，前面的#都是1，最后一个#补完所有的前面欠的）

如果没法判断合法性就在输出的地方加个for循环判断。

#include<iostream>
#include<cstdio>
#include<string>

using namespace std;

//#define LOCAL

string s;
int tmp[100005];

void work()
{
	int N=s.size(),last=-1,cnt=0;
	for(int i=N-1;i>=0;i--) if(s[i]=='#') {last=i; break;}

	//First time: Have a try.
	for(int i=0;i<N;i++)
	{
		if(s[i]=='(') cnt++;
		if(s[i]==')') cnt--;
		if(s[i]=='#') tmp[i]=1,cnt--;
	}
	if(cnt>0) tmp[last]+=cnt;

	//Second time: check the answer.
	cnt=0;
	for(int i=0;i<N;i++)
	{
		if(s[i]=='(') cnt++;
		if(s[i]==')') cnt--;
		if(s[i]=='#') cnt-=tmp[i];
		if(cnt<0) {printf("-1");return;}
	}
	if(cnt!=0) printf("-1");
	else for(int i=0;i<N;i++) if(tmp[i]!=0) printf("%d\n",tmp[i]);
}

int main()
{
#ifdef LOCAL
	freopen("C.in","r",stdin);
#endif
	while(cin >> s)
	{
#ifdef LOCAL
		printf("\nCASE:\n");
#endif
		work();
	}
#ifdef LOCAL
	while(1);
#endif
	return 0;
}