C. Replace To Make Regular Bracket Sequence
来源:互联网 发布:淘宝运营提成比例 编辑:程序博客网 时间:2024/06/05 07:07
C. Replace To Make Regular Bracket Sequence
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
You are given string s consists of opening and closing brackets of four kinds <>, {}, [], (). There are two types of brackets: opening and closing. You can replace any bracket by another of the same type. For example, you can replace < by the bracket {, but you can’t replace it by ) or >.
The following definition of a regular bracket sequence is well-known, so you can be familiar with it.
Let’s define a regular bracket sequence (RBS). Empty string is RBS. Let s1 and s2 be a RBS then the strings s2, {s1}s2, [s1]s2, (s1)s2 are also RBS.
For example the string “[[(){}]<>]” is RBS, but the strings “[)()” and “][()()” are not.
Determine the least number of replaces to make the string s RBS.
Input
The only line contains a non empty string s, consisting of only opening and closing brackets of four kinds. The length of s does not exceed 106.
Output
If it’s impossible to get RBS from s print Impossible.
Otherwise print the least number of replaces needed to get RBS from s.
Examples
input
[<}){}
output
2
input
{()}[]
output
0
input
]]
output
Impossible
题的大致意思是输入的左括号可以变,而右括号不可以变,那么请你算一下至少要变多少次?
用stack,每次将左括号压进stack里面,遇到右括号就判断一下就好了
方法就很简单,看看栈最后是否还有,看看右括号的时候,左括号的栈是否为空。
代码如下:
#include <algorithm>#include<bits/stdc++.h>#include <cstdio>#include <math.h>#include <string.h>#include <stack> //栈头文件#include <queue> //队列头文件using namespace std;string s;stack<char> sta;int main(){ cin>>s; int ans = 0; for(int i=0;i<s.size();i++) { if(s[i]==']') { if(sta.empty()) return puts("Impossible"); if(sta.top()=='[') sta.pop(); else { ans++; sta.pop(); } } else if(s[i]==')') { if(sta.empty()) return puts("Impossible"); if(sta.top()=='(') sta.pop(); else { ans++; sta.pop(); } } else if(s[i]=='>') { if(sta.empty()) return puts("Impossible"); if(sta.top()=='<') sta.pop(); else { ans++; sta.pop(); } } else if(s[i]=='}') { if(sta.empty()) return puts("Impossible"); if(sta.top()=='{') sta.pop(); else { ans++; sta.pop(); } } else sta.push(s[i]); } if(!sta.empty()) return puts("Impossible"); printf("%d\n",ans);}
- C. Replace To Make Regular Bracket Sequence
- Codeforces 612C Replace To Make Regular Bracket Sequence 【stack】
- 【CodeForces】[612C]Replace To Make Regular Bracket Sequence
- CodeForces 612C Replace To Make Regular Bracket Sequence
- Codeforces 612C Replace To Make Regular Bracket Sequence
- codreforces C. Replace To Make Regular Bracket Sequence(栈)
- Codeforces 612C Replace To Make Regular Bracket Sequence 【stack】
- Codeforces-612C-Replace To Make Regular Bracket Sequence 【stack】
- Codeforces 612C Replace To Make Regular Bracket Sequence 【stack】
- Codeforces 612C Replace To Make Regular Bracket Sequence【栈】
- Codeforces 612C Replace To Make Regular Bracket Sequence 【stack】
- CodeForces 612C Replace To Make Regular Bracket Sequence
- codeforces 612C Replace To Make Regular Bracket Sequence
- Replace To Make Regular Bracket Sequence 【栈】
- 栈 Codeforces612C Replace To Make Regular Bracket Sequence
- codeforces_612C.Replace To Make Regular Bracket Sequence(stack)
- Replace To Make Regular Bracket Sequence(括号配对问题)
- Replace To Make Regular Bracket Sequence 括号配对
- 二叉树的面试题
- Android 远程监控摄像头 移动端+PC端 旧手札变废为宝
- Android应用逆向——分析反编译代码之大神器
- spring3多数据源时事务@Transactional注解的qualifier
- 数据结构
- C. Replace To Make Regular Bracket Sequence
- HTML5的小技巧(二)
- Android源码编译make的各类错误解决方案汇总
- Android Gradle BuildConfig的妙用
- 连续子数组的最大和
- HDU 5739 Fantasia
- table中cellspacing和cellpadding在css中如何设置
- ART世界探险(7) - 数组
- poj1416 Shredding Company