CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Oispa Kaljaa
Submission time:2015-10-02 22:58:41 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1--1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.05 s1details
#7ACCEPTED0.05 s1details
#8ACCEPTED0.05 s1details
#9ACCEPTED0.05 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.06 s1details
#12ACCEPTED0.05 s1details
#13ACCEPTED0.06 s1details
#14ACCEPTED0.05 s1details
#15ACCEPTED0.06 s1details
#16ACCEPTED0.05 s1details
#17--1details
#18ACCEPTED0.05 s1details
#19ACCEPTED0.05 s1details
#20--1details
#21--2details
#22ACCEPTED0.06 s2details
#23ACCEPTED0.06 s2details
#24ACCEPTED0.05 s2details
#25ACCEPTED0.05 s2details
#26ACCEPTED0.06 s2details
#27ACCEPTED0.06 s2details
#28ACCEPTED0.05 s2details
#29ACCEPTED0.05 s2details
#30ACCEPTED0.06 s2details
#31ACCEPTED0.05 s2details
#32ACCEPTED0.05 s2details
#330.05 s2details
#34ACCEPTED0.05 s2details
#35ACCEPTED0.06 s2details
#36--2details
#37--2details
#38ACCEPTED0.06 s2details
#39--2details
#40ACCEPTED0.05 s2details
#41--3details
#42ACCEPTED0.06 s3details
#43ACCEPTED0.04 s3details
#44ACCEPTED0.05 s3details
#45ACCEPTED0.05 s3details
#46ACCEPTED0.05 s3details
#47ACCEPTED0.06 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.05 s3details
#50ACCEPTED0.04 s3details
#51ACCEPTED0.05 s3details
#52ACCEPTED0.06 s3details
#53ACCEPTED0.05 s3details
#54ACCEPTED0.06 s3details
#55ACCEPTED0.06 s3details
#56--3details
#57--3details
#58ACCEPTED0.08 s3details
#59--3details
#60ACCEPTED0.06 s3details
#61--4details
#62--4details
#63ACCEPTED0.05 s4details
#64ACCEPTED0.05 s4details
#65ACCEPTED0.05 s4details
#66ACCEPTED0.06 s4details
#67ACCEPTED0.06 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.06 s4details
#700.05 s4details
#71ACCEPTED0.05 s4details
#72ACCEPTED0.05 s4details
#73ACCEPTED0.05 s4details
#74ACCEPTED0.05 s4details
#75ACCEPTED0.05 s4details
#76--4details
#77--4details
#78--4details
#79--4details
#80--4details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:23:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < s.size(); i++)
                   ^
input/code.cpp:33:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < s.size();){
                    ^
input/code.cpp:37:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    while(i+le < s.size() && s[i+le] == s[i])
               ^
input/code.cpp:44:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
        if(i+le+1 < s.size()){
                  ^
input/code.cpp:50:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       else if(i+le == s.size()-1){
                    ^
input/code.cpp:57:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       else if(i == 0 || i+le =...

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;

//101101001011111
int main(){

	string s; cin >> s;
	string rev = s;
	reverse(rev.begin(), rev.end());
	string sb = s;
	vector<int> ans;
	int c[2] = {0};
	for(int i = 0; i < s.size(); i++)
		c[s[i] == '1']++;
	while(s.size() > 0){
		//cout << "nyt: " << s << endl;
		int mle = 0;
		int num = 1;
		int remn = -1;
		bool isal = false;
		int si = 0;
		bool dhs = false;
		for(int i = 0; i < s.size();){
			if(dhs)
				break;
			int le = 1;
			while(i+le < s.size() && s[i+le] == s[i])
				le++;
			if(le > 1){
				bool has12 = false;
						bool has22 = false;
						if(i == 1){
							has12 = true;
							if(i+le+1 < s.size()){
								if(s[i+le] != s[i] && s[i+le+1] == s[i])
									has22 = true;
							}

						}
						else if(i+le == s.size()-1){
							has12 = true;
							if(i-2 >= 0){
								if(s[i-1] != s[i] && s[i-2] == s[i])
									has22 = true;
							}
						}
						else if(i == 0 || i+le == s.size())
							has12 = false;
						else{
							if(s[i-2] == s[i])
								has12 = true;
							if(s[i+le+1] == s[i])
								has22 = true;
						}
						if(has12 && has22){
							remn = num;
							si = i;
							mle = le;
							dhs = true;
						}
				if(s[i] == '0'){
					if(c[0]-le == 1)
						goto ohi;
				}
				else{
					if(c[1]-le == 1)
						goto ohi;	
				}

				if(i == 0 || i+le == s.size()){
					if(le < mle)
						goto ohi;
					if(i+le == s.size()){
						if(remn != -1)
							goto ohi;
					}
					isal = true;
					remn = num;
					mle = le;
					si = i;
				}
				else{
					if(isal){
						isal = false;
						remn = num;
						mle = le;
						si = i;
					}
					else if(le > mle){
						mle = le;
						remn = num;
						si = i;
					}
					else if(le == mle){
						bool has1 = false;
						bool has2 = false;
						if(i == 1){
							has1 = true;
							if(i+le+1 < s.size()){
								if(s[i+le] != s[i] && s[i+le+1] == s[i])
									has2 = true;
							}

						}
						else if(i+le == s.size()-1){
							has1 = true;
							if(i-2 >= 0){
								if(s[i-1] != s[i] && s[i-2] == s[i])
									has2 = true;
							}
						}
						else if(i == 0 || i+le == s.size())
							has1 = false;
						else{
							if(s[i-2] == s[i])
								has1 = true;
							if(s[i+le+1] == s[i])
								has2 = true;
						}
						if(has1 && has2){
							remn = num;
							si = i;
							dhs = true;
							mle = le;
						}
						else if(has1 || has2 && !dhs){
							remn = num;
							si = i;
						}
					}
				}

				ohi:
				num++;
			}

			i+=le;
		}
		if(remn == -1)
			break;
		if(s[si] == '0'){
			c[0]-=mle;
		}
		else{
			c[1]-=mle;
		}
		//cout << si << " " << mle << " " << num << endl;
		s = s.substr(0, si)+s.substr(si+mle, s.size()-(si+mle));
		ans.push_back(remn);

	}

	if(s.size() == 0){
		cout << ans.size() << endl;

		for(int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << endl;
	}
	else{
		s = rev;
		ans.clear();
	c[0] = 0;
	c[1] = 0;
	for(int i = 0; i < s.size(); i++)
		c[s[i] == '1']++;
	while(s.size() > 0){
		//cout << "nyt: " << s << endl;
		int mle = 0;
		int num = 1;
		int remn = -1;
		bool isal = false;
		int si = 0;
		bool dhs = false;
		for(int i = 0; i < s.size();){
			if(dhs)
				break;
			int le = 1;
			while(i+le < s.size() && s[i+le] == s[i])
				le++;
			if(le > 1){
				bool has12 = false;
						bool has22 = false;
						if(i == 1){
							has12 = true;
							if(i+le+1 < s.size()){
								if(s[i+le] != s[i] && s[i+le+1] == s[i])
									has22 = true;
							}

						}
						else if(i+le == s.size()-1){
							has12 = true;
							if(i-2 >= 0){
								if(s[i-1] != s[i] && s[i-2] == s[i])
									has22 = true;
							}
						}
						else if(i == 0 || i+le == s.size())
							has12 = false;
						else{
							if(s[i-2] == s[i])
								has12 = true;
							if(s[i+le+1] == s[i])
								has22 = true;
						}
						if(has12 && has22){
							remn = num;
							si = i;
							dhs = true;
							mle = le;
						}
						
				if(s[i] == '0'){
					if(c[0]-le == 1)
						goto ohi2;
				}
				else{
					if(c[1]-le == 1)
						goto ohi2;	
				}

				if(i == 0 || i+le == s.size()){
					if(le < mle)
						goto ohi2;
					if(i+le == s.size()){
						if(remn != -1)
							goto ohi2;
					}
					isal = true;
					remn = num;
					mle = le;
					si = i;
				}
				else{
					if(isal){
						isal = false;
						remn = num;
						mle = le;
						si = i;
					}
					else if(le > mle){
						mle = le;
						remn = num;
						si = i;
					}
					else if(le == mle){
						bool has1 = false;
						bool has2 = false;
						if(i == 1){
							has1 = true;
							if(i+le+1 < s.size()){
								if(s[i+le] != s[i] && s[i+le+1] == s[i])
									has2 = true;
							}

						}
						else if(i+le == s.size()-1){
							has1 = true;
							if(i-2 >= 0){
								if(s[i-1] != s[i] && s[i-2] == s[i])
									has2 = true;
							}
						}
						else if(i == 0 || i+le == s.size())
							has1 = false;
						else{
							if(s[i-2] == s[i])
								has1 = true;
							if(s[i+le+1] == s[i])
								has2 = true;
						}
						if(has1 && has2){
							remn = num;
							si = i;
							dhs = true;
							mle = le;
						}
						else if(has1 || has2 && !dhs){
							remn = num;
							si = i;
						}
					}
				}

				ohi2:
				num++;
			}

			i+=le;
		}
		if(remn == -1)
			break;
		if(s[si] == '0'){
			c[0]-=mle;
		}
		else{
			c[1]-=mle;
		}
		//cout << si << " " << mle << " " << num << endl;
		s = s.substr(0, si)+s.substr(si+mle, s.size()-(si+mle));
		ans.push_back(num-remn);

	}

	if(s.size() == 0){
		cout << ans.size() << endl;

		for(int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << endl;
	}
	else{
		s = sb;
		int n = s.length();
	int num = 1;
	for(int i = 0; i < n;){
		//cout << "paikka: " << i << endl;
		vector<int> ans;
		int pnum = num;
		ans.push_back(pnum);
		int a = i;
		int b = i;
		int lee = 1;
		while(i+lee < n && s[i+lee] == s[i])
			lee++;
		while(a-1 >= 0 && s[a-1] == s[i])
			a--;
		while(b+1 < n && s[b+1] == s[i])
			b++;
		if(b-a < 1)
			continue;
		int cc = 0;
		bool ok = true;
		int lastlen = -1;
		bool can1 = false;
		

		while(ok){
			pnum--;
			ans.push_back(max(1, pnum));
			int le = 0;
			int ri = 0;
			if(cc%2 == 0){
				while(a-1 >= 0 && s[a-1] != s[i]){
					a--;
					le++;
				}
				while(b+1 < n && s[b+1] != s[i]){
					b++;
					le++;
				}
			}
			else{
				while(a-1 >= 0 && s[a-1] == s[i]){
					a--;
					ri++;
				}
				while(b+1 < n && s[b+1] == s[i]){
					b++;
					ri++;
				}
			}
			//cout << a << "-" << b << " " << endl;
			if(ri+le < 2){
				if(ri+le == 0){
					break;
				}

				if(can1 && cc > 0){
					can1 = false;
				}
				else{
					ok = false;
					break;
				}

			}
			else if(a == 0 && b == n-1){
				break;
			}
			if(ri != 1 && le != 1)
				can1 = false;
			else
				can1 = false;
			lastlen = ri+le;
			cc++;
		}
		if(ok){
			cout << ans.size() << endl;
			for(int i = 0; i < ans.size(); i++)
				cout << ans[i] << " ";
			cout << endl;
			goto ohi3;
		}
		
		i+=lee;
		if(lee > 1)
			num++;
	}
	cout << "QAQ" << endl;

	ohi3:
	1==1;
	}
	}

	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1011001010

correct output
QAQ

user output
(empty)

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: ACCEPTED

input
0111011100

correct output
3
2 1 1 

user output
3
1 2 1 

Test 4

Group: 1

Verdict: ACCEPTED

input
0100100100

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 5

Group: 1

Verdict: ACCEPTED

input
1110010110

correct output
4
2 1 1 1 

user output
4
3 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: ACCEPTED

input
0011110001

correct output
3
1 2 1 

user output
3
3 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: ACCEPTED

input
1000010011

correct output
3
2 1 1 

user output
3
1 2 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
4
2 2 1 1 

Test 13

Group: 1

Verdict: ACCEPTED

input
0100111110

correct output
3
1 1 1 

user output
3
1 1 1 

Test 14

Group: 1

Verdict: ACCEPTED

input
1101001011

correct output
4
2 2 2 1 

user output
4
2 2 2 1 

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
3
3 2 1 

Test 17

Group: 1

Verdict:

input
1100101011

correct output
QAQ

user output
(empty)

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

user output
3
2 2 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:

input
0000101000

correct output
QAQ

user output
(empty)

Test 21

Group: 2

Verdict:

input
1110010100

correct output
QAQ

user output
(empty)

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000

correct output
3
2 1 1 

user output
3
2 1 1 

Test 23

Group: 2

Verdict: ACCEPTED

input
1001101100

correct output
4
1 1 1 1 

user output
4
3 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: ACCEPTED

input
0011111110

correct output
2
2 1 

user output
2
2 1 

Test 26

Group: 2

Verdict: ACCEPTED

input
1100101100

correct output
4
2 1 1 1 

user output
4
3 2 1 1 

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110

correct output
3
2 1 1 

user output
3
1 2 1 

Test 28

Group: 2

Verdict: ACCEPTED

input
0000011011

correct output
3
2 1 1 

user output
3
2 1 1 

Test 29

Group: 2

Verdict: ACCEPTED

input
1110011101

correct output
3
3 2 1 

user output
3
3 2 1 

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
2
2 1 

Test 33

Group: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
4
2 1 2 1 

Test 34

Group: 2

Verdict: ACCEPTED

input
0110110111

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 35

Group: 2

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 36

Group: 2

Verdict:

input
110011001100110011001010101010...

correct output
QAQ

user output
(empty)

Test 37

Group: 2

Verdict:

input
110011001100110011001100101010...

correct output
QAQ

user output
(empty)

Test 38

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100110011...

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

user output
31
21 21 21 21 21 21 21 21 21 21 ...

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
(empty)

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...

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

user output
23
1 13 13 13 8 15 3 2 2 15 14 13...

Test 41

Group: 3

Verdict:

input
0010101000

correct output
QAQ

user output
(empty)

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110

correct output
4
2 1 1 1 

user output
4
1 1 2 1 

Test 43

Group: 3

Verdict: ACCEPTED

input
0100110110

correct output
4
2 1 1 1 

user output
4
3 1 1 1 

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

correct output
2
2 1 

user output
2
2 1 

Test 45

Group: 3

Verdict: ACCEPTED

input
0001001110

correct output
3
2 2 1 

user output
3
2 2 1 

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

user output
3
2 1 1 

Test 47

Group: 3

Verdict: ACCEPTED

input
0100111100

correct output
3
1 1 1 

user output
3
1 1 1 

Test 48

Group: 3

Verdict: ACCEPTED

input
0001001000

correct output
3
2 2 1 

user output
3
2 2 1 

Test 49

Group: 3

Verdict: ACCEPTED

input
0100100010

correct output
4
2 1 1 1 

user output
4
1 2 1 1 

Test 50

Group: 3

Verdict: ACCEPTED

input
1100101110

correct output
4
2 1 1 1 

user output
4
3 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
3 1 1 

Test 54

Group: 3

Verdict: ACCEPTED

input
0001000110

correct output
3
2 2 1 

user output
3
2 2 1 

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
3 2 1 1 

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...

correct output
QAQ

user output
(empty)

Test 58

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...

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

user output
1501
1001 1001 1001 1001 1001 1001 ...

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
(empty)

Test 60

Group: 3

Verdict: ACCEPTED

input
011100011001011111111000010110...

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

user output
1272
7 7 9 21 22 34 42 48 48 49 49 ...

Test 61

Group: 4

Verdict:

input
1110101110

correct output
QAQ

user output
(empty)

Test 62

Group: 4

Verdict:

input
0111001011

correct output
4
2 1 1 1 

user output
(empty)

Test 63

Group: 4

Verdict: ACCEPTED

input
1101111101

correct output
3
2 2 1 

user output
3
2 2 1 

Test 64

Group: 4

Verdict: ACCEPTED

input
1001110001

correct output
3
2 1 1 

user output
3
3 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
1 1 1 1 

Test 67

Group: 4

Verdict: ACCEPTED

input
0100111010

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 68

Group: 4

Verdict: ACCEPTED

input
0010111101

correct output
4
1 1 1 1 

user output
4
2 2 1 1 

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
2
2 1 

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
4
2 1 2 1 

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
3
1 2 1 

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
3
3 2 1 

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

user output
2
2 1 

Test 74

Group: 4

Verdict: ACCEPTED

input
1011000101

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

Test 75

Group: 4

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
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)