【52.49%】【codeforces 556A】Case of the Zeros and Ones
time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Andrewid the Android is a galaxy-famous detective. In his free time he likes to think about strings containing zeros and ones.
Once he thought about a string of length n consisting of zeroes and ones. Consider the following operation: we choose any two adjacent positions in the string, and if one them contains 0, and the other contains 1, then we are allowed to remove these two digits from the string, obtaining a string of length n - 2 as a result.
Now Andreid thinks about what is the minimum length of the string that can remain after applying the described operation several times (possibly, zero)? Help him to calculate this number.
Input
First line of the input contains a single integer n (1 ≤ n ≤ 2·105), the length of the string that Andreid has.
The second line contains the string of length n consisting only from zeros and ones.
Output
Output the minimum length of the string that may remain after applying the described operations several times.
Examples
input
4
1100
output
0
input
5
01010
output
1
input
8
11101111
output
6
Note
In the first sample test it is possible to change the string like the following: .
In the second sample test it is possible to change the string like the following: .
In the third sample test it is possible to change the string like the following: .
【题目链接】:http://codeforces.com/contest/556/problem/A
【题解】
让你消除相邻的01子串;
因为看到挺多人过的,就用函数写了个暴力;
然后就过了。
不过…998ms…….
用数组模拟链表应该更快.
不过挺麻烦的吧.
【完整代码】
#include <bits/stdc++.h>
using namespace std;
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define LL long long
#define rep1(i,a,b) for (int i = a;i <= b;i++)
#define rep2(i,a,b) for (int i = a;i >= b;i--)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define rei(x) scanf("%d",&x)
#define rel(x) scanf("%I64d",&x)
#define pri(x) printf("%d",x)
#define prl(x) printf("%I64d",x)
typedef pair<int,int> pii;
typedef pair<LL,LL> pll;
const int MAXN = 2e5+100;
const int dx[9] = {0,1,-1,0,0,-1,-1,1,1};
const int dy[9] = {0,0,0,-1,1,-1,1,-1,1};
const double pi = acos(-1.0);
string s;
int n;
int main()
{
//freopen("F:\\rush.txt","r",stdin);
cin>>n;
cin >> s;
s=' '+s;
int len = s.size();
len--;
int i = 1;
while (i <= len-1)
{
if (s[i]!=s[i+1])
{
s.erase(i,2);
i--;
if (i==0) i=1;
}
else
i++;
len = s.size()-1;
}
cout << len;
return 0;
}
相关文章
- Performs the analysis process on a text and return the tokens breakdown of the text
- (纪录片)科学的故事:权力、证据与激情 The Story Of Science: Power, Proof And Passion
- [Preact] Use State and Props in the Component Render Function
- [CSS] Specify grid columns, rows, and areas at once with the grid-template shorthand
- [Grid Layout] Use auto-fill and auto-fit if the number of repeated grid tracks is not to be def
- [Angular2 Form] Understand the Angular 2 States of Inputs: Pristine and Untouched
- [Node.js]30. Level 6: Listen 'Question' from client, and then Answer the Question
- [转]HDFS Metadata Directories Explained - An overview of files and configurations under the HDFS meta-directory
- (纪录片)科学的故事:权力、证据与激情 The Story Of Science: Power, Proof And Passion
- [AngularJS] Store the entry url and redirect to entry url after Logged in
- [React] Create a queue of Ajax requests with redux-observable and group the results.
- There is no source code available for the current location
- ETAG is returned by the first read
- content of maven-uilib-pom - the eslint and jslint are configured here
- 【codeforces 602E】Kleofáš and the n-thlon
- 【hdu 3987】Harry Potter and the Forbidden Forest
- 成功解决Future Warning: The sklearn.neighbors.dist_metrics module is deprecated in version 0.22 and wil
- Pape之DL之CNN:2019《A Survey of the Recent Architectures of Deep Convolutional Neural Networks》翻译并解读第四章
- RuntimeError: Input type (torch.cuda.FloatTensor) and weight type (torch.FloatTensor) should be the
- 【人工智能】Responsible AI 负责任的人工智能:人工智能安全和隐私的未来 The Future of AI Security and Privacy
- POJ 2567 Code the Tree & POJ 2568 Decode the Tree Prufer序列
- HDU3988-Harry Potter and the Hide Story(数论-质因数分解)