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

Code

#include<bits/stdc++.h>
using namespace std;

int main() {
  string s; cin >> s;
  int n = s.length();
  bool b[501010]; for(int i = 0; i < n; i++) {
    if(s[i] == '0') b[i] = 0;
    else b[i] = 1;
  }
  long p = 0;
  long pp = 0;
  long on = 0;
  long ze = 0;
  long cc = 0;
  long zep = 0;
  for(int i = 0; i < n; i++) {
    if(!b[i]) {
      zep++;
    }

    else {
      for(int i = zep; i >= 1; i--) {
	cc += i;
      }
      zep = 0;
    }
    if(i == n-1) {
      for(int i = 1; i <= zep; i++) {
	cc += i;
      }
    }
  }
  for(int i = 0; i < n; i++) {
    if(b[i]) {
      on++;
      if(on%2==0) {
	pp += ze+1;
	cc += p;
      }
      else {
	p += ze+1;
	cc += pp;
      }
      ze = 0;
    }
    else {
      if(on%2==0) cc += p;
      else cc += pp;
      ze++;
    }
  }
  cout << cc << endl;
}

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