Parenthesis CSU - 1809

最新推荐文章于 2018-09-10 18:08:45 发布

haha294182852

最新推荐文章于 2018-09-10 18:08:45 发布

阅读量183

点赞数

分类专栏：日常练习文章标签： c++ 计算机

本文链接：https://blog.csdn.net/haha294182852/article/details/77102617

版权

日常练习专栏收录该内容

24 篇文章 0 订阅

订阅专栏

1809: Parenthesis
Time Limit: 5 Sec Memory Limit: 128 Mb Submitted: 2226 Solved: 592
Description
Bobo has a balanced parenthesis sequence P=p1 p2…pn of length n and q questions.
The i-th question is whether P remains balanced after pai and pbi swapped. Note that questions are individual so that they have no affect on others.
Parenthesis sequence S is balanced if and only if:
1. S is empty;
2. or there exists balanced parenthesis sequence A,B such that S=AB;
3. or there exists balanced parenthesis sequence S' such that S=(S').
Input
The input contains at most 30 sets. For each set:
The first line contains two integers n,q (2≤n≤105,1≤q≤105).
The second line contains n characters p1 p2…pn.
The i-th of the last q lines contains 2 integers ai,bi (1≤ai,bi≤n,ai≠bi).

Output
For each question, output "Yes" if P remains balanced, or "No" otherwise.
Sample Input

4 2
(())
1 3
2 3
2 1
()
1 2

Sample Output

No
Yes
No

Hint
Source
湖南省第十二届大学生计算机程序设计竞赛

【题解】：

【代码】：

#include<cmath>
#include<cstdio>
#include<string>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main()
{
    char s[200000];
    int sss[200000];
    int n,m;
    while(~scanf("%d %d",&n,&m)){
        memset(sss,0,sizeof(sss));
        scanf("%s",s);int flag=0;
        int sum=0;
        for(int i=0;i<n;i++){
            if(s[i]=='('){sum++;}
            else{sum--;}
            sss[i]=flag;
            if(sum<2){
                flag++;
               }
            
        }
        for(int i=0;i<m;i++){
            int a,b;
            scanf("%d %d",&a,&b);
            a=a-1;b=b-1;
            if(a>b){
                int t;t=a;a=b;b=t;
            }
            if(s[a]=='('&&s[b]==')'){
                if((sss[a]!=sss[b]))printf("No\n");
                else  printf("Yes\n");
            }
            else
                printf("Yes\n");
        }
    }
}