CF3D

最新推荐文章于 2018-10-14 23:39:21 发布

三级头不怕通

最新推荐文章于 2018-10-14 23:39:21 发布

阅读量411

点赞数

http://blog.csdn.net/black_miracle/article/details/69307458

This is yet another problem on regular bracket sequences.

A bracket sequence is called regular, if by inserting "+" and "1" into it we get a correct mathematical expression. For example, sequences "(())()", "()" and "(()(()))" are regular, while ")(", "(()" and "(()))(" are not. You have a pattern of a bracket sequence that consists of characters "(", ")" and "?". You have to replace each character "?" with a bracket so, that you get a regular bracket sequence.

For each character "?" the cost of its replacement with "(" and ")" is given. Among all the possible variants your should choose the cheapest.

Input

The first line contains a non-empty pattern of even length, consisting of characters "(", ")" and "?". Its length doesn't exceed 5·104. Then there follow m lines, where m is the number of characters "?" in the pattern. Each line contains two integer numbers ai and bi(1 ≤ ai, bi ≤ 106), where ai is the cost of replacing the i-th character "?" with an opening bracket, and bi — with a closing one.

Output

Print the cost of the optimal regular bracket sequence in the first line, and the required sequence in the second.

Print -1, if there is no answer. If the answer is not unique, print any of them.

        Examples 
      
          input 
        
(??)
1 2
2 8

          output 
        
4
()()

题意：给你一串序列每个问号变成 ( 的代价和变成 ) 的代价问最小匹配代价和匹配后的序列是什么

题解：我们可以假设?全部是右括号那么for过去如果发现一个点左括号个数小于右括号那么我们可以从前面的问号拿出一个转化代价最小的转化为左括号

这么做下去判掉不可能的情况即可

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
typedef long long ll;
struct node{
    int num,lab;
    bool operator<(const node& a)const{
        return num>a.num;
    }
}e[50005];
char s[50005];
priority_queue<node,vector<node>,less<node> >sp;
int main(){
    int n,i,j;
    scanf("%s",s+1);
    int len=strlen(s+1);
    ll ans=0;
    int l=0,r=0,flag=1,x,y;
    for(i=1;i<=len;i++){
        if(s[i]=='(')l++;
        else if(s[i]==')')r++;
        else{
            scanf("%d%d",&x,&y);
            ans+=y;
            sp.push((node){x-y,i});
            r++;
        }
        if(l<r){
            if(sp.empty())flag=0;
            else{
                ans+=sp.top().num;
                s[sp.top().lab]='(';
                sp.pop();
                r--;
                l++;
            }
        }
    }
    if(!flag||l!=r)printf("-1\n");
    else{
        printf("%lld\n",ans);
        for(i=1;i<=len;i++)printf("%c",s[i]=='?'?')':s[i]);
        printf("\n");
    }
    return 0;
}