zoukankan      html  css  js  c++  java
  • (GREEDY) 3D

    D. Least Cost Bracket Sequence
    time limit per test
    1 second
    memory limit per test
    64 megabytes
    input
    standard input
    output
    standard output

    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.

    Sample test(s)
    input
    (??)
    1 2
    2 8
    output
    4
    ()()
    #include<iostream>
    #include<cstdio>
    #include<cstring>
    #include<string>
    #include<cmath>
    #include<cstdlib>
    #include<algorithm>
    #include<queue>
    using namespace std;
    pair<int,int> t;
    priority_queue< pair<int,int> > q;
    char s[50010];
    int main()
    {
          scanf("%s",s);
          int len=strlen(s),sum=0;
          long long ans=0;
          for(int i=0;i<len;i++)
          {
                if(s[i]=='(')
                    sum++;
                else if(s[i]==')')
                    sum--;
                else if(s[i]=='?')
                {
                      int a,b;
                      scanf("%d%d",&a,&b);
                      ans+=b;
                      s[i]=')',sum--;
                      q.push( make_pair(b-a,i) );
                }
                if(sum<0)
                {
                    if(q.empty()) break;
                    t=q.top();
                    q.pop();
                    ans-=t.first,s[t.second]='(',sum+=2;
                }
          }
          if(sum) printf("-1
    ");
          else
          {
                printf("%I64d
    %s
    ",ans,s);
          }
          return 0;
    }
    

      

  • 相关阅读:
    [PAT] 1012 The Best Rank (25 分)Java
    scroll-view 隐藏滚动条
    python bool
    wx小程序 button 属性open-typ 用法 按钮分享
    python str 的常用方法
    node global文件夹和chace文件夹位置全局位置修改
    wx.showModal() 内容如何换行?
    自定义导航栏头部 并简单设置标题和返回按键
    jquery绑定事件如何传递参数
    复习第一天内容
  • 原文地址:https://www.cnblogs.com/a972290869/p/4250392.html
Copyright © 2011-2022 走看看