CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Oispa Kaljaa
Submission time:2015-10-05 18:41:28 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#10.06 s1details
#20.06 s1details
#30.05 s1details
#40.05 s1details
#50.06 s1details
#60.06 s1details
#70.05 s1details
#80.05 s1details
#90.05 s1details
#100.06 s1details
#110.06 s1details
#120.05 s1details
#130.06 s1details
#140.06 s1details
#150.06 s1details
#160.06 s1details
#170.05 s1details
#180.06 s1details
#190.06 s1details
#200.05 s1details
#210.06 s2details
#220.05 s2details
#230.05 s2details
#240.06 s2details
#250.06 s2details
#260.05 s2details
#270.06 s2details
#280.05 s2details
#290.06 s2details
#300.05 s2details
#310.05 s2details
#320.04 s2details
#330.05 s2details
#340.05 s2details
#350.06 s2details
#360.06 s2details
#370.05 s2details
#380.05 s2details
#390.05 s2details
#400.05 s2details
#410.06 s3details
#420.05 s3details
#430.05 s3details
#440.05 s3details
#450.05 s3details
#460.05 s3details
#470.05 s3details
#480.06 s3details
#490.05 s3details
#500.05 s3details
#510.05 s3details
#520.05 s3details
#530.05 s3details
#540.05 s3details
#550.06 s3details
#560.09 s3details
#570.07 s3details
#580.07 s3details
#590.10 s3details
#600.08 s3details
#610.06 s4details
#620.07 s4details
#630.05 s4details
#640.05 s4details
#650.05 s4details
#660.05 s4details
#670.06 s4details
#680.05 s4details
#690.06 s4details
#700.06 s4details
#710.05 s4details
#720.06 s4details
#730.06 s4details
#740.06 s4details
#750.06 s4details
#760.00 s4details
#770.00 s4details
#780.00 s4details
#790.00 s4details
#800.00 s4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:35:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < s.size(); i++)
                    ^
input/code.cpp:89:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
        if(has && i == 0 || i+le == n)
               ^
input/code.cpp:99:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
        if(has && i == 0 || i+le == n)
               ^
input/code.cpp:143:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < ans.size(); i++)
                    ^

Code

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;

//toimii toisella, toisella ei, korjaa
//suosii sita varia jota poistettu vahemman

//laita tama valinta bruteen, nopeuttaa??
//poista keskimmäinen
//poista pienin?
int main(){
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	string s; cin >> s;
	
	string rev = s;
	reverse(rev.begin(), rev.end());
	vector<int> ans;
	int c[2] = {0};
	
		s = rev;
		c[0] = 0;
		c[1] = 1;
		ans.clear();
		for(int i = 0; i < s.size(); i++)
		c[s[i] == '1']++;
		while(s.size() > 0){
		cout << s << endl;
		int n = s.size();
		int si = -1, sle = -1, sre = -1;
		bool has = false;
		bool shas = false;
		int num = 1;
		for(int i = 0; i < n;){
			int le = 1;
			while(i+le < n && s[i+le] == s[i])
				le++;
			bool hasl = false, hasr = false;
			if(i == 1)
				hasl = true;
			else if(i > 1 && s[i-2] == s[i])
				hasl = true;

			if(i+le == n-1)
				hasr = true;
			else if(i+le+1 < n && s[i+le+1] == s[i])
				hasr = true;

			if(le > 1){
				if(shas){
					num++;
					goto ohi2;
				}
				if(hasl && hasr){
					if(s[i] == '0'){
						if(c[0]-le != 1){
							si = i;
							sle = le;
							sre = num;
							has = true;
							if(i != 1 && i+le != n-1)
								shas = true;
						}
					}
					else{
						if(c[1]-le != 1){
							si = i;
							sle = le;
							sre = num;
							has = true;
							if(i != 1 && i+le != n-1)
								shas = true;
						}
					}
				}
				else if(hasl || hasr){
					if(s[i] == '0'){
						if(c[0]-le != 1){
							if(has && i == 0 || i+le == n)
								goto ohi2;
							si = i;
							sle = le;
							sre = num;
							has = true;
						}
					}
					else{
						if(c[1]-le != 1){
							if(has && i == 0 || i+le == n)
								goto ohi2;
							si = i;
							sle = le;
							sre = num;
							has = true;
						}
					}
				}
				else if(!has){
					if(s[i] == '0'){
						if(c[0]-le != 1){
							si = i;
							sle = le;
							sre = num;
							
						}
					}
					else{
						if(c[1]-le != 1){
							si = i;
							sle = le;
							sre = num;
							
						}
					}
				}
				num++;
			}
			ohi2:
			i+=le;
		}
		if(sre == -1)
			break;
		c[s[si] == '1']-=sle;
		ans.push_back(num-sre);
		s = s.substr(0, si)+s.substr(si+sle, s.size()-(si+sle));

	}
	if(s.size() > 0){
		cout << "QAQ" << endl;
	}
	else{
		cout << ans.size() << endl;
		for(int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << endl;
	}
	
	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1011001010

correct output
QAQ

user output
0101001101
01010001
01011
QAQ

Test 2

Group: 1

Verdict:

input
0000001001

correct output
3
1 1 1 

user output
1001000000
11000000
11
QAQ

Test 3

Group: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
0011101110
0011100
00111
111
QAQ

Test 4

Group: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
0010010010
00110010
001110
QAQ

Test 5

Group: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
0110100111
01101111
001111
1111
QAQ

Test 6

Group: 1

Verdict:

input
1111110110

correct output
3
1 1 1 

user output
0110111111
00111111
111111
QAQ

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
1000111100
1111100
11111
QAQ

Test 8

Group: 1

Verdict:

input
0111111000

correct output
2
1 1 

user output
0001111110
QAQ

Test 9

Group: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
0011111111
11111111
QAQ

Test 10

Group: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
1100100001
110011
1100
11
QAQ

Test 11

Group: 1

Verdict:

input
1101110000

correct output
3
1 1 1 

user output
0000111011
0000011
11
QAQ

Test 12

Group: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
0011011011
00110011
001100
0011
11
...

Test 13

Group: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
0111110010
01111110
QAQ

Test 14

Group: 1

Verdict:

input
1101001011

correct output
4
2 2 2 1 

user output
1101001011
11011011
110011
1100
11
...

Test 15

Group: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
0100110111
01000111
01000
QAQ

Test 16

Group: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
0011101100
00111000
00111
111
QAQ

Test 17

Group: 1

Verdict:

input
1100101011

correct output
QAQ

user output
1101010011
11010111
010111
QAQ

Test 18

Group: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
1110011011
11100011
111000
111
QAQ

Test 19

Group: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

user output
0010000110
00100000
100000
QAQ

Test 20

Group: 1

Verdict:

input
0000101000

correct output
QAQ

user output
0001010000
1010000
QAQ

Test 21

Group: 2

Verdict:

input
1110010100

correct output
QAQ

user output
0010100111
00101111
QAQ

Test 22

Group: 2

Verdict:

input
1110010000

correct output
3
2 1 1 

user output
0000100111
00001111
1111
QAQ

Test 23

Group: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
0011011001
00110111
000111
111
QAQ

Test 24

Group: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
1110000000
111
QAQ

Test 25

Group: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
0111111100
QAQ

Test 26

Group: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
0011010011
00110111
000111
111
QAQ

Test 27

Group: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
0111011110
011100
QAQ

Test 28

Group: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
1101100000
11000000
11
QAQ

Test 29

Group: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
1011100111
1000111
1111
QAQ

Test 30

Group: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
1101101000
11001000
111000
111
QAQ

Test 31

Group: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
1100110100
11000100
11100
111
QAQ

Test 32

Group: 2

Verdict:

input
0011100000

correct output
2
2 1 

user output
0000011100
00000111
111
QAQ

Test 33

Group: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
0110010111
01110111
00111
111
QAQ

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
1110110110
11100110
111000
111
QAQ

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
0100110111
01000111
01000
QAQ

Test 36

Group: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
001100110011001100110101010101...

Test 37

Group: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
001100110011001100110011010101...

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...

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

user output
001100110011001100110011001100...

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
010101010101010101010101010101...

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...

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

user output
010111000001100001000110000010...

Test 41

Group: 3

Verdict:

input
0010101000

correct output
QAQ

user output
0001010100
1010100
QAQ

Test 42

Group: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
0110100010
0110110
01100
QAQ

Test 43

Group: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
0110110010
01101110
01100
QAQ

Test 44

Group: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
1000000111
1111
QAQ

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
0111001000
01111000
QAQ

Test 46

Group: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
1100011100
11000111
11000
11
QAQ

Test 47

Group: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
0011110010
00111110
QAQ

Test 48

Group: 3

Verdict:

input
0001001000

correct output
3
2 2 1 

user output
0001001000
00011000
00011
11
QAQ

Test 49

Group: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
0100010010
0110010
01110
QAQ

Test 50

Group: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
0111010011
01110111
00111
111
QAQ

Test 51

Group: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
1101110001
1100001
111
QAQ

Test 52

Group: 3

Verdict:

input
1000111111

correct output
2
1 1 

user output
1111110001
1111111
QAQ

Test 53

Group: 3

Verdict:

input
0110011100

correct output
3
2 1 1 

user output
0011100110
00111000
00111
111
QAQ

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
0110001000
0111000
QAQ

Test 55

Group: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
0100110111
01000111
01000
QAQ

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
001100110011001100110011001100...

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
001100110011001100110011001100...

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...

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

user output
001100110011001100110011001100...

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
010101010101010101010101010101...

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

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

user output
111010001100100110011010010001...

Test 61

Group: 4

Verdict:

input
1110101110

correct output
QAQ

user output
0111010111
0010111
QAQ

Test 62

Group: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
1101001110
1101000
01000
QAQ

Test 63

Group: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
1011111011
10011
111
QAQ

Test 64

Group: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
1000111001
10001111
11111
QAQ

Test 65

Group: 4

Verdict:

input
1000000011

correct output
2
1 1 

user output
1100000001
111
QAQ

Test 66

Group: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
1110100010
1110110
11100
111
QAQ

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
0101110010
01011110
0100
QAQ

Test 68

Group: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
1011110100
100100
1100
11
QAQ

Test 69

Group: 4

Verdict:

input
0011111000

correct output
2
2 1 

user output
0001111100
00011111
11111
QAQ

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
1011001011
10111011
10011
111
QAQ

Test 71

Group: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
0001110110
00011100
000111
111
QAQ

Test 72

Group: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
1110110011
11100011
111000
111
QAQ

Test 73

Group: 4

Verdict:

input
1110011111

correct output
2
2 1 

user output
1111100111
1111100
11111
QAQ

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
1010001101
10100001
QAQ

Test 75

Group: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
0100110111
01000111
01000
QAQ

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)