CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:retki5
Submission time:2015-10-05 21:13:17
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.05 s1details
#30.06 s1details
#40.06 s1details
#50.06 s1details
#6ACCEPTED0.05 s1details
#70.06 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.05 s1details
#100.05 s1details
#11ACCEPTED0.06 s1details
#12ACCEPTED0.05 s1details
#130.06 s1details
#14ACCEPTED0.04 s1details
#150.05 s1details
#16ACCEPTED0.05 s1details
#17ACCEPTED0.06 s1details
#18ACCEPTED0.05 s1details
#19ACCEPTED0.07 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.05 s2details
#220.06 s2details
#23ACCEPTED0.05 s2details
#24ACCEPTED0.05 s2details
#250.05 s2details
#260.05 s2details
#270.05 s2details
#280.05 s2details
#290.05 s2details
#300.06 s2details
#310.06 s2details
#32ACCEPTED0.05 s2details
#330.05 s2details
#340.05 s2details
#350.05 s2details
#36ACCEPTED0.06 s2details
#37ACCEPTED0.05 s2details
#380.06 s2details
#390.05 s2details
#400.04 s2details
#41ACCEPTED0.05 s3details
#420.05 s3details
#430.06 s3details
#440.04 s3details
#450.06 s3details
#46ACCEPTED0.06 s3details
#470.01 s3details
#48ACCEPTED0.06 s3details
#490.06 s3details
#500.05 s3details
#51ACCEPTED0.05 s3details
#52ACCEPTED0.05 s3details
#53ACCEPTED0.05 s3details
#540.05 s3details
#550.06 s3details
#56ACCEPTED0.07 s3details
#57ACCEPTED0.06 s3details
#580.06 s3details
#590.06 s3details
#600.05 s3details
#61ACCEPTED0.05 s4details
#62ACCEPTED0.05 s4details
#630.05 s4details
#64ACCEPTED0.06 s4details
#65ACCEPTED0.06 s4details
#66ACCEPTED0.05 s4details
#670.06 s4details
#680.06 s4details
#69ACCEPTED0.05 s4details
#700.05 s4details
#710.06 s4details
#720.05 s4details
#73ACCEPTED0.05 s4details
#740.05 s4details
#750.05 s4details
#76--4details
#77--4details
#78--4details
#79--4details
#80--4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:14:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 1; i < kuk.length(); i++) {
                    ^
input/code.cpp:43:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < kek.size(); i++) {
                     ^
input/code.cpp:61:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if (k == kek.size() - 1 || k == 0) {
           ^
input/code.cpp:72:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i = 0; i < kek.size(); i++) {
                       ^
input/code.cpp:91:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < kek.size(); i++) {
                    ^
input/code.cpp:95:20: warning: comparison between signed and unsigned integer expressions [-Wsign-com

Code

#include <iostream>
#include <vector>
int main() {
	std::string kuk;
	std::cin >> kuk;
	int cu[3];
	//1 or 0 - 1 or longer (2)
	std::vector<std::pair<int, int>> kek;
	std::vector<int> ans;
	int lasto = kuk[0] - 48;
	int lastn = 0;
	int ys = 0;
	int kas = 0;
	for (int i = 1; i < kuk.length(); i++) {
		if (lasto != kuk[i] - 48) {
			if (i - lastn > 1) {
				kek.push_back(std::make_pair(kuk[i - 1] - 48, 2));
				kas++;
			}
			else {
				kek.push_back(std::make_pair(kuk[i - 1] - 48, 1));
				ys++;
			}
			lastn = i;
		}
		lasto = kuk[i] - 48;
	}
	int asdf = 1;
	if (kuk.size() - lastn > 1) asdf = 2;
	kek.push_back(std::make_pair(kuk[kuk.size() - 1] - 48, asdf));
	
	int k = 1;
	int tt = 1;
	int found = -1;
	int dd = 1;
	bool aans = false;
	int cur = -1;
	while (true) {
		cur = kek.size() / 2 - 1;
		if (kek.size() % 2) cur = kek.size() / 2;
		bool rdy = true;
		bool fail = true;
		for (int i = 0; i < kek.size(); i++) {
			if (kek[i].second == 1) {
				rdy = false;
			}
			if (kek[i].second == 2) fail = false;
		}
		if (fail) {
			aans = true;
			break;
		}
		if (rdy) break;
		int in = 0;
		while (true) {
			//if ()
			k = cur + in;
			//std::cout << "k: " << k << ", in: " << in << std::endl;
			
			if (kek[k].second == 2) {
				if (k == kek.size() - 1 || k == 0) {
					kek.erase(kek.begin() + k);
					break;
				}
				kek.insert(kek.begin() + k - 1, std::make_pair(kek[k - 1].first, 2));
				for (int a = 0; a < 3; a++) {
					kek.erase(kek.begin() + k);
				}	
				ans.push_back(k);
				found = -1;
				break;
				for (int i = 0; i < kek.size(); i++) {
					std::cout << kek[i].first;
					if (kek[i].second == 2) {
						std::cout << kek[i].first;
					}
				}
				std::cout << std::endl;
				break;
			}

			//std::cout << "k: " << k << ", in: " << in << std::endl;
			if (in > 0) { in = -in; }
			else in = -in + 1;
		}
	}
	if (aans) {
		std::cout << "QAQ\n";
		//return 0;
	}
	for (int i = 0; i < kek.size(); i++) {
		ans.push_back(1);
	}
	std::cout << ans.size() << std::endl;
	for (int i = 0; i < ans.size(); i++) {
		std::cout << ans[i] << " ";
	}
	std::cout << "\n";
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ
4
3 2 1 1 

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
2 1 1 

Test 3

Group: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
3
3 1 1 

Test 4

Group: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
4
4 2 1 1 

Test 5

Group: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
2 1 1 

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
QAQ
2
1 1 

Test 8

Group: 1

Verdict: ACCEPTED

input
0111111000

correct output
2
1 1 

user output
2
1 1 

Test 9

Group: 1

Verdict: ACCEPTED

input
1111111100

correct output
2
1 1 

user output
2
1 1 

Test 10

Group: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
3
3 1 1 

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
2 1 1 

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

user output
5
2 1 1 1 1 

Test 13

Group: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
3
2 1 1 

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
5
3 2 1 1 1 

Test 15

Group: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ
3
2 1 1 

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
4
3 1 1 1 

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ
4
1 1 1 1 

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
4
2 1 1 1 

Test 19

Group: 1

Verdict: ACCEPTED

input
0110000100

correct output
3
2 1 1 

user output
3
2 1 1 

Test 20

Group: 1

Verdict: ACCEPTED

input
0000101000

correct output
QAQ

user output
QAQ
3
1 1 1 

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ
3
1 1 1 

Test 22

Group: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
3
1 1 1 

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
2 1 1 1 

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111

correct output
2
1 1 

user output
2
1 1 

Test 25

Group: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
2
1 1 

Test 26

Group: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 27

Group: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
3
3 1 1 

Test 28

Group: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
3
1 1 1 

Test 29

Group: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
3
2 1 1 

Test 30

Group: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
4
3 2 1 1 

Test 31

Group: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
4
3 2 1 1 

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
3
1 1 1 

Test 33

Group: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
4
3 2 1 1 

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
4
3 1 1 1 

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ
3
2 1 1 

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ
60
9 68 8 65 7 62 6 59 5 56 4 53 ...

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ
50
11 60 10 57 9 54 8 51 7 48 6 4...

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

correct output
31
1 20 20 20 20 20 20 20 20 20 2...

user output
40
19 38 18 35 17 32 16 29 15 26 ...

Test 39

Group: 2

Verdict:

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
48
47 46 45 44 43 42 41 40 39 38 ...

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...

correct output
23
13 13 12 11 11 11 11 10 9 9 9 ...

user output
23
24 20 21 19 18 17 16 15 14 13 ...

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ
5
1 1 1 1 1 

Test 42

Group: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
4
2 3 1 1 

Test 43

Group: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 44

Group: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
2
1 1 

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
3
2 1 1 

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
4
1 1 1 1 

Test 47

Group: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
3
2 1 1 

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
4
2 1 1 1 

Test 49

Group: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
4
4 2 1 1 

Test 50

Group: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 51

Group: 3

Verdict: ACCEPTED

input
1000111011

correct output
3
2 1 1 

user output
3
2 1 1 

Test 52

Group: 3

Verdict: ACCEPTED

input
1000111111

correct output
2
1 1 

user output
2
1 1 

Test 53

Group: 3

Verdict: ACCEPTED

input
0110011100

correct output
3
2 1 1 

user output
3
2 1 1 

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
3
2 1 1 

Test 55

Group: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ
3
2 1 1 

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ
3000
499 3498 498 3495 497 3492 496...

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

correct output
QAQ

user output
QAQ
2500
623 3122 622 3119 621 3116 620...

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
1501
1 1000 1000 1000 1000 1000 100...

user output
2000
999 1998 998 1995 997 1992 996...

Test 59

Group: 3

Verdict:

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
2498
2497 2496 2495 2494 2493 2492 ...

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

correct output
1272
1 1 648 647 646 646 645 645 64...

user output
1272
1270 1269 1268 1267 1266 1265 ...

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ
3
4 1 1 

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 63

Group: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
3
2 1 1 

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

user output
3
2 1 1 

Test 65

Group: 4

Verdict: ACCEPTED

input
1000000011

correct output
2
1 1 

user output
2
1 1 

Test 66

Group: 4

Verdict: ACCEPTED

input
0100010111

correct output
4
1 1 1 1 

user output
4
2 1 1 1 

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 68

Group: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
4
3 2 1 1 

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
3
1 1 1 

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
4
3 2 1 1 

Test 71

Group: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
3
3 1 1 

Test 72

Group: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
4
2 1 1 1 

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
3
1 1 1 

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 75

Group: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ
3
2 1 1 

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...

correct output
30001
1 20000 20000 20000 20000 2000...

user output
(empty)

Test 79

Group: 4

Verdict:

input
010101010101010101010101010101...

correct output
49998
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
(empty)

Test 80

Group: 4

Verdict:

input
111000110000011000001101010010...

correct output
25011
1 12471 12470 12469 12468 1246...

user output
(empty)