CodeForces 494A Treasure
来源:互联网 发布:mac brew 编辑:程序博客网 时间:2024/09/21 08:18
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.
(((#)((#)
12
()((#((#(#()
221
#
-1
(#)
-1
#include <cstdio>#include <cstring>const int maxn=100010;char s[maxn];int main(){ int a=0,b=0,c=0,i; scanf("%s",s); int len=strlen(s);if(s[0]==')'||s[len-1]=='('||s[0]=='#') { printf("-1\n"); return 0; }for(i=len-1;i>=0;i--){if(s[i]=='(')a++;if(s[i]==')')b++;if(a>b){printf("-1\n");return 0;}if(s[i]=='#')break;}a=0,b=0; for(i=0;i<len;i++) { if(s[i]=='(')//记录“(”的个数 a++; if(s[i]==')')//如果有合法的一对括号,把他们标记为“.”{if(s[i-1]=='('){s[i-1]='.';s[i]='.';b--;a--;} b++;} if(s[i]=='#'){b++; c++;}if(b>a)//判断“#”后面的左右括号数是否相等,左括号多则不合法{printf("-1\n");return 0;} }b-=c; if(a-b<c) { printf("-1\n"); return 0; }a=0;for(i=0;i<len;i++){if(s[i]=='(')a++;if(s[i]==')'){b--;a--;}if(s[i]=='#'){if(c>1){printf("1\n");a--;c--;}elseprintf("%d\n",a-b);}} return 0;}
,“#”,遇到#时把它转变成“)”,求每个#转换成几个“)”能使所有左右括号合法。
- CodeForces 494A Treasure
- codeforces 494A Treasure
- CodeForces 494A Treasure
- Treasure - CodeForces 494 A 水题
- CodeForces 494A Treasure 【greedy】
- Codeforces 494A Treasure (思维 模拟)
- Codeforces 494 A. Treasure && Codeforces Round #282 (Div. 1)
- Codeforces 817A Treasure Hunt
- Codeforces Round #282 (Div. 1) A. Treasure
- Codeforces Round #282 (Div. 1) A. Treasure
- Educational Codeforces Round 23 A. Treasure Hunt
- Educational Codeforces Round 23#A. Treasure Hunt
- 【DP】 Codeforces Round #286 A - Mr. Kitayuta, the Treasure Hunter
- CodeForces 506 Div.1 A. Mr. Kitayuta, the Treasure Hunter
- Codeforces Round #282 (Div. 1) A. Treasure (贪心)
- Codeforces Round #282 (Div. 2) A - Digital Counter B - Modular Equations C - Treasure
- Codeforces 106 D Treasure Island
- Codeforces 495C Treasure【贪心】
- ubuntu执行文件
- spring中配置log4j
- Onpaint和OnDraw的区别[转]
- 为什么Message创建对象使用Message.Obtain
- android屏幕试配,告诉你为什么安卓切图要出两套
- CodeForces 494A Treasure
- 鸟哥linux——Ext2文件系统基本原理
- 注册苹果企业开发账号遇到的问题
- Oracle 11g 开始使用时遇到的一些问题及解决。
- espeak和mbrola
- 文件属性结构体:WIN32_FIND_DATA
- 华为编程题之六:计算最后一个出列者的编号
- 让/etc/profile文件修改后立即生效
- 免费得到TexturePacker和PhysicsEditor正版授权