CSES - Datatähti Open 2019 - Results
Submission details
Task:Bit string
Sender:egor.lifar
Submission time:2019-01-20 13:08:49
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED27
#3ACCEPTED52
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.01 s1details
#3ACCEPTED0.03 s1details
#4ACCEPTED0.02 s1details
#5ACCEPTED0.02 s1details
#6ACCEPTED0.01 s1details
#7ACCEPTED0.01 s1details
#8ACCEPTED0.02 s2details
#9ACCEPTED0.02 s2details
#10ACCEPTED0.02 s2details
#11ACCEPTED0.02 s2details
#12ACCEPTED0.02 s2details
#13ACCEPTED0.03 s2details
#14ACCEPTED0.01 s2details
#15ACCEPTED0.03 s3details
#16ACCEPTED0.03 s3details
#17ACCEPTED0.02 s3details
#18ACCEPTED0.02 s3details
#19ACCEPTED0.03 s3details
#20ACCEPTED0.01 s3details
#21ACCEPTED0.01 s3details

Code

/*
ЗАПУСКАЕМ 
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░ 
*/
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
#include <array>
       
        
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; } 
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const pair<T, U> &_p) { _out << _p.first << ' ' << _p.second; return _out; }
template<typename T, typename U> inline istream &operator>> (istream &_in, pair<T, U> &_p) { _in >> _p.first >> _p.second; return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const vector<T> &_v) { if (_v.empty()) { return _out; } _out << _v.front(); for (auto _it = ++_v.begin(); _it != _v.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline istream &operator>> (istream &_in, vector<T> &_v) { for (auto &_i : _v) { _in >> _i; } return _in; }
template<typename T> inline ostream &operator<< (ostream &_out, const set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_set<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T> inline ostream &operator<< (ostream &_out, const unordered_multiset<T> &_s) { if (_s.empty()) { return _out; } _out << *_s.begin(); for (auto _it = ++_s.begin(); _it != _s.end(); ++_it) { _out << ' ' << *_it; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
template<typename T, typename U> inline ostream &operator<< (ostream &_out, const unordered_map<T, U> &_m) { if (_m.empty()) { return _out; } _out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')'; for (auto _it = ++_m.begin(); _it != _m.end(); ++_it) { _out << ", (" << _it->first << ": " << _it->second << ')'; } return _out; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left228
#define right right228
#define rank rank228
#define y1 y1228                                                         
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
const string FILENAME = "input";



int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
   // read(FILENAME);
    string s;
    cin >> s;
    int cur = 0;
    int cnt[2] = {1, 0};
    long long ans = 0;
    for (int i = 0; i < sz(s); i++) {
        cur += s[i] - '0';
        ans += cnt[cur & 1];
        cnt[cur & 1]++;
    }
    cout << ans << endl;
    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