CSES - Datatähti Open 2019 - Results
Submission details
Task:Bit string
Sender:bogdan10bos
Submission time:2019-01-20 11:29:46
Language:C++
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED21
#2ACCEPTED27
#3ACCEPTED52
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1details
#2ACCEPTED0.02 s1details
#3ACCEPTED0.01 s1details
#4ACCEPTED0.01 s1details
#5ACCEPTED0.01 s1details
#6ACCEPTED0.03 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.02 s3details
#16ACCEPTED0.03 s3details
#17ACCEPTED0.02 s3details
#18ACCEPTED0.03 s3details
#19ACCEPTED0.03 s3details
#20ACCEPTED0.02 s3details
#21ACCEPTED0.02 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:22:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s + 1);
     ~~~~~^~~~~~~~~~~~~

Code

#include <bits/stdc++.h>

using namespace std;

//#define FILE_IO

typedef long long LL;

const int NMAX = 5e5;

int N;
int fq[2];
char s[NMAX + 5];

int main()
{
    #ifdef FILE_IO
    freopen("1.in", "r", stdin);
    //freopen(".out", "w", stdout);
    #endif

    scanf("%s", s + 1);
    N = strlen(s + 1);

    fq[0] = 1;
    int sum = 0;
    for(int i = 1; i <= N; i++)
    {
        sum ^= (s[i] - '0');
        fq[sum]++;
    }

    LL ans = 1LL * fq[0] * (fq[0] - 1) / 2 + 1LL * fq[1] * (fq[1] - 1) / 2;
    cout << ans << '\n';

    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