CSES - Datatähti 2019 loppu - Results
Submission details
Task:Bittijono
Sender:Kauri Pälsi
Submission time:2019-01-17 15:02:14 +0200
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.02 s1details
#20.01 s1details
#30.02 s1details
#40.01 s1details
#5ACCEPTED0.01 s1details
#6ACCEPTED0.02 s1details
#7ACCEPTED0.03 s1details
#80.02 s2details
#90.01 s2details
#100.03 s2details
#110.02 s2details
#12ACCEPTED0.01 s2details
#13ACCEPTED0.02 s2details
#14ACCEPTED0.02 s2details
#150.04 s3details
#160.05 s3details
#170.04 s3details
#180.06 s3details
#190.05 s3details
#20ACCEPTED0.01 s3details
#21ACCEPTED0.01 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:40:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         if(found==string::npos) {
            ~~~~~^~~~~~~~

Code

//c++
#include <bits/stdc++.h>
#include <bitset>
using namespace std;
int consum(int num) {
return num*(num+1)/2;
}
int main() {
string bits;
long total = 0;
long zero0 = 0;
long zero1 = 0;
long zero2 = 0;
int runs = 0;
cin >> bits;
long marker = -1;
int found = 0;
bool end = false;
while (!end) {
runs += 1;
found=bits.find_first_of("1",marker+1);
zero0 = zero1;
zero1 = zero2;
if(found==string::npos) {
zero2 = bits.length()-marker-1;
end = true;
} else {
zero2 = found-marker-1;
}
marker = found;
//cout << "r:" << runs << " z:" << zero0 << ":" << zero1 << ":" << zero2 << " s:" << consum(zero2)+(zero0+1)*(zero2+1) << "\n" ;
total += consum(zero2);
if(runs > 2) {
total += (zero0+1)*(zero2+1);
}
}
cout << total;
//vector<bool> bits;
return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
111111111111111111111111111111...

correct output
2500

user output
99

Test 2

Group: 1

Verdict:

input
111101111111101111111011011110...

correct output
2502

user output
144

Test 3

Group: 1

Verdict:

input
000110011101101000000000101010...

correct output
2590

user output
349

Test 4

Group: 1

Verdict:

input
110101000010001000101100011000...

correct output
2502

user output
655

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:

input
111111111111111111111111111111...

correct output
6250000

user output
4999

Test 9

Group: 2

Verdict:

input
111111111110101111111010111011...

correct output
6250342

user output
8259

Test 10

Group: 2

Verdict:

input
110110111000000001011100000011...

correct output
6252352

user output
15051

Test 11

Group: 2

Verdict:

input
000000001000101001001110100011...

correct output
6253422

user output
34661

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:

input
111111111111111111111111111111...

correct output
62500000000

user output
499999

Test 16

Group: 3

Verdict:

input
101101100110111101111011111101...

correct output
62500057360

user output
833075

Test 17

Group: 3

Verdict:

input
011100000010000011110101010001...

correct output
62500117306

user output
1506455

Test 18

Group: 3

Verdict:

input
001010011010000001100011001101...

correct output
62500144780

user output
3462199

Test 19

Group: 3

Verdict:

input
000000000000000000000000000000...

correct output
125000250000

user output
446198416

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