| Task: | Bit string |
| Sender: | shashwatchandra |
| Submission time: | 2019-01-18 21:33:43 +0200 |
| Language: | C++ |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 21 |
| #2 | ACCEPTED | 27 |
| #3 | ACCEPTED | 52 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.02 s | 1 | details |
| #2 | ACCEPTED | 0.01 s | 1 | details |
| #3 | ACCEPTED | 0.01 s | 1 | details |
| #4 | ACCEPTED | 0.02 s | 1 | details |
| #5 | ACCEPTED | 0.02 s | 1 | details |
| #6 | ACCEPTED | 0.01 s | 1 | details |
| #7 | ACCEPTED | 0.02 s | 1 | details |
| #8 | ACCEPTED | 0.03 s | 2 | details |
| #9 | ACCEPTED | 0.01 s | 2 | details |
| #10 | ACCEPTED | 0.01 s | 2 | details |
| #11 | ACCEPTED | 0.02 s | 2 | details |
| #12 | ACCEPTED | 0.01 s | 2 | details |
| #13 | ACCEPTED | 0.01 s | 2 | details |
| #14 | ACCEPTED | 0.01 s | 2 | details |
| #15 | ACCEPTED | 0.03 s | 3 | details |
| #16 | ACCEPTED | 0.02 s | 3 | details |
| #17 | ACCEPTED | 0.03 s | 3 | details |
| #18 | ACCEPTED | 0.04 s | 3 | details |
| #19 | ACCEPTED | 0.02 s | 3 | details |
| #20 | ACCEPTED | 0.01 s | 3 | details |
| #21 | ACCEPTED | 0.02 s | 3 | details |
Code
/*input
01011
*/
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define f first
#define s second
#define mp make_pair
#define pb push_back
#define RE(i,n) for (int i = 1; i <= n; i++)
#define RED(i,n) for (int i = n; i > 0; i--)
#define REPS(i,n) for(int i = 1; (i*i) <= n; i++)
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
#define pii pair<int,int>
#define mii map<int,int>
#define vi vector<int>
#define vvi vector<vi>
#define WL(t) while(t --)
#define gcd(a,b) __gcd((a),(b))
#define lcm(a,b) ((a)*(b))/gcd((a),(b))
#define print(arr) for (auto it = arr.begin(); it != arr.end(); ++it) cout << *it << " "; cout << endl;
#define debug(x) cout << x << endl;
#define debug2(x,y) cout << x << " " << y << endl;
#define debug3(x,y,z) cout << x << " " << y << " " << z << endl;
const int INF = 1e18+1;
const int MOD = 1e9+7;
const double PI = 3.14159265358979323846264338;
int fast_ex(int a,int n,int m){
if(n == 0)return 1;
if(n == 1)return a;
int x = 1;
x *= fast_ex(a,n/2,m);
x %= m;
x *= x;
x %= m;
if(n%2)x*= a;
x %= m;
return x;
}
int pref[2];
void solve(){
int n;
string s;cin >> s;
n = s.size();
pref[0] = 1;
int sum = 0;
int ans = 0;
REP(i,n){
sum += s[i]-'0';
if(sum%2)ans += pref[1];
else ans += pref[0];
pref[sum%2]++;
}
cout << ans;
}
signed main(){
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//freopen(".in","r",stdin);freopen(".out","w",stdout);
int t = 1;//cin >> t;
WL(t)solve();
return 0;
}Test details
Test 1
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 111111111111111111111111111111... |
| correct output |
|---|
| 2500 |
| user output |
|---|
| 2500 |
Test 2
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 111101111111101111111011011110... |
| correct output |
|---|
| 2502 |
| user output |
|---|
| 2502 |
Test 3
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 000110011101101000000000101010... |
| correct output |
|---|
| 2590 |
| user output |
|---|
| 2590 |
Test 4
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 110101000010001000101100011000... |
| correct output |
|---|
| 2502 |
| user output |
|---|
| 2502 |
Test 5
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 000000000000000000000000000000... |
| correct output |
|---|
| 5050 |
| user output |
|---|
| 5050 |
Test 6
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 0 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 7
Group: 1
Verdict: ACCEPTED
| input |
|---|
| 1 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 8
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 111111111111111111111111111111... |
| correct output |
|---|
| 6250000 |
| user output |
|---|
| 6250000 |
Test 9
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 111111111110101111111010111011... |
| correct output |
|---|
| 6250342 |
| user output |
|---|
| 6250342 |
Test 10
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 110110111000000001011100000011... |
| correct output |
|---|
| 6252352 |
| user output |
|---|
| 6252352 |
Test 11
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 000000001000101001001110100011... |
| correct output |
|---|
| 6253422 |
| user output |
|---|
| 6253422 |
Test 12
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 000000000000000000000000000000... |
| correct output |
|---|
| 12502500 |
| user output |
|---|
| 12502500 |
Test 13
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 0 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 14
Group: 2
Verdict: ACCEPTED
| input |
|---|
| 1 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
Test 15
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 111111111111111111111111111111... |
| correct output |
|---|
| 62500000000 |
| user output |
|---|
| 62500000000 |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 101101100110111101111011111101... |
| correct output |
|---|
| 62500057360 |
| user output |
|---|
| 62500057360 |
Test 17
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 011100000010000011110101010001... |
| correct output |
|---|
| 62500117306 |
| user output |
|---|
| 62500117306 |
Test 18
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 001010011010000001100011001101... |
| correct output |
|---|
| 62500144780 |
| user output |
|---|
| 62500144780 |
Test 19
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 000000000000000000000000000000... |
| correct output |
|---|
| 125000250000 |
| user output |
|---|
| 125000250000 |
Test 20
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 0 |
| correct output |
|---|
| 1 |
| user output |
|---|
| 1 |
Test 21
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1 |
| correct output |
|---|
| 0 |
| user output |
|---|
| 0 |
