原题链接:
http://codeforces.com/contest/495/problem/C
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.
The first line of the input contains a string s (1 ≤ |s| ≤ 105). Each character of this string is one of the characters '(', ')' or '#'. It is guaranteed that s contains at least one '#' character.
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.
(((#)((#)
1 2
()((#((#(#()
2 2 1
#
-1
(#)
-1
|s| denotes the length of the string s.
#include "stdio.h"
#include "string.h"
int main()
{
int n=0,nl=0,nr=0,ans[100010],nj=0,flag=1,last;
char a[200010],in;
memset(ans,0,sizeof(ans));
while(1)
{
in=getchar();
if(in=='\n')
{
break;
}
if(in=='#')
{
a[++n]=')';
a[++n]='#';
last=n;
}
else
a[++n]=in;
}
for(int i=1;i<last;i++)
{
if(a[i]=='(')
{
nl++;
}
else if(a[i]==')')
{
nl--;
}
if(nl<0)
{
flag=0;
break;
}
}
if(flag)
{
for(int i=n;i>=last+1;i--)
{
if(a[i]=='(')
nr++;
else if(a[i]==')')
nr--;
if(nr>0)
{
flag=0;
break;
}
}
}
nr=0;
if(flag)
{
for(int i=last+1;i<=n;i++)
{
if(a[i]=='(')
nr++;
else if(a[i]==')')
nr--;
if(nl+nr<0)
{
flag=0;
break;
}
}
}
if(flag)
{
for(int i=0;i<last;i++)
{
if(a[i]=='#')
printf("1\n");
}
printf("%d\n",nl+nr+1);
}
else
{
printf("-1\n");
}
return 0;
}