CSES - Datatähti 2016 alku

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
group	verdict	score
#1	TIME LIMIT EXCEEDED	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0
#4	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	TIME LIMIT EXCEEDED	--	1	details
#2	ACCEPTED	0.05 s	1	details
#3	ACCEPTED	0.06 s	1	details
#4	ACCEPTED	0.05 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	ACCEPTED	0.05 s	1	details
#7	ACCEPTED	0.05 s	1	details
#8	ACCEPTED	0.05 s	1	details
#9	ACCEPTED	0.05 s	1	details
#10	ACCEPTED	0.05 s	1	details
#11	ACCEPTED	0.06 s	1	details
#12	ACCEPTED	0.05 s	1	details
#13	ACCEPTED	0.06 s	1	details
#14	ACCEPTED	0.05 s	1	details
#15	ACCEPTED	0.06 s	1	details
#16	ACCEPTED	0.05 s	1	details
#17	TIME LIMIT EXCEEDED	--	1	details
#18	ACCEPTED	0.05 s	1	details
#19	ACCEPTED	0.05 s	1	details
#20	TIME LIMIT EXCEEDED	--	1	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	ACCEPTED	0.06 s	2	details
#23	ACCEPTED	0.06 s	2	details
#24	ACCEPTED	0.05 s	2	details
#25	ACCEPTED	0.05 s	2	details
#26	ACCEPTED	0.06 s	2	details
#27	ACCEPTED	0.06 s	2	details
#28	ACCEPTED	0.05 s	2	details
#29	ACCEPTED	0.05 s	2	details
#30	ACCEPTED	0.06 s	2	details
#31	ACCEPTED	0.05 s	2	details
#32	ACCEPTED	0.05 s	2	details
#33	WRONG ANSWER	0.05 s	2	details
#34	ACCEPTED	0.05 s	2	details
#35	ACCEPTED	0.06 s	2	details
#36	TIME LIMIT EXCEEDED	--	2	details
#37	TIME LIMIT EXCEEDED	--	2	details
#38	ACCEPTED	0.06 s	2	details
#39	TIME LIMIT EXCEEDED	--	2	details
#40	ACCEPTED	0.05 s	2	details
#41	TIME LIMIT EXCEEDED	--	3	details
#42	ACCEPTED	0.06 s	3	details
#43	ACCEPTED	0.04 s	3	details
#44	ACCEPTED	0.05 s	3	details
#45	ACCEPTED	0.05 s	3	details
#46	ACCEPTED	0.05 s	3	details
#47	ACCEPTED	0.06 s	3	details
#48	ACCEPTED	0.05 s	3	details
#49	ACCEPTED	0.05 s	3	details
#50	ACCEPTED	0.04 s	3	details
#51	ACCEPTED	0.05 s	3	details
#52	ACCEPTED	0.06 s	3	details
#53	ACCEPTED	0.05 s	3	details
#54	ACCEPTED	0.06 s	3	details
#55	ACCEPTED	0.06 s	3	details
#56	TIME LIMIT EXCEEDED	--	3	details
#57	TIME LIMIT EXCEEDED	--	3	details
#58	ACCEPTED	0.08 s	3	details
#59	TIME LIMIT EXCEEDED	--	3	details
#60	ACCEPTED	0.06 s	3	details
#61	TIME LIMIT EXCEEDED	--	4	details
#62	TIME LIMIT EXCEEDED	--	4	details
#63	ACCEPTED	0.05 s	4	details
#64	ACCEPTED	0.05 s	4	details
#65	ACCEPTED	0.05 s	4	details
#66	ACCEPTED	0.06 s	4	details
#67	ACCEPTED	0.06 s	4	details
#68	ACCEPTED	0.05 s	4	details
#69	ACCEPTED	0.06 s	4	details
#70	WRONG ANSWER	0.05 s	4	details
#71	ACCEPTED	0.05 s	4	details
#72	ACCEPTED	0.05 s	4	details
#73	ACCEPTED	0.05 s	4	details
#74	ACCEPTED	0.05 s	4	details
#75	ACCEPTED	0.05 s	4	details
#76	TIME LIMIT EXCEEDED	--	4	details
#77	TIME LIMIT EXCEEDED	--	4	details
#78	TIME LIMIT EXCEEDED	--	4	details
#79	TIME LIMIT EXCEEDED	--	4	details
#80	TIME LIMIT EXCEEDED	--	4	details

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: TIME LIMIT EXCEEDED

input
`1011001010` view save

correct output
`QAQ` view save

user output
(empty)

Test 2

Group: 1

Verdict: ACCEPTED

input
`0000001001` view save

correct output
`3 1 1 1` view save

user output
`3 2 1 1` view save

Test 3

Group: 1

Verdict: ACCEPTED

input
`0111011100` view save

correct output
`3 2 1 1` view save

user output
`3 1 2 1` view save

Test 4

Group: 1

Verdict: ACCEPTED

input
`0100100100` view save

correct output
`4 2 1 1 1` view save

user output
`4 1 2 1 1` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`1110010110` view save

correct output
`4 2 1 1 1` view save

user output
`4 3 2 1 1` view save

Test 6

Group: 1

Verdict: ACCEPTED

input
`1111110110` view save

correct output
`3 1 1 1` view save

user output
`3 2 1 1` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`0011110001` view save

correct output
`3 1 2 1` view save

user output
`3 3 1 1` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`0111111000` view save

correct output
`2 1 1` view save

user output
`2 1 1` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`1111111100` view save

correct output
`2 1 1` view save

user output
`2 1 1` view save

Test 10

Group: 1

Verdict: ACCEPTED

input
`1000010011` view save

correct output
`3 2 1 1` view save

user output
`3 1 2 1` view save

Test 11

Group: 1

Verdict: ACCEPTED

input
`1101110000` view save

correct output
`3 1 1 1` view save

user output
`3 2 1 1` view save

Test 12

Group: 1

Verdict: ACCEPTED

input
`1101101100` view save

correct output
`4 1 2 1 1` view save

user output
`4 2 2 1 1` view save

Test 13

Group: 1

Verdict: ACCEPTED

input
`0100111110` view save

correct output
`3 1 1 1` view save

user output
`3 1 1 1` view save

Test 14

Group: 1

Verdict: ACCEPTED

input
`1101001011` view save

correct output
`4 2 2 2 1` view save

user output
`4 2 2 2 1` view save

Test 15

Group: 1

Verdict: ACCEPTED

input
`1110110010` view save

correct output
`4 1 2 1 1` view save

user output
`4 3 2 1 1` view save

Test 16

Group: 1

Verdict: ACCEPTED

input
`0011011100` view save

correct output
`3 3 2 1` view save

user output
`3 3 2 1` view save

Test 17

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`1100101011` view save

correct output
`QAQ` view save

user output
(empty)

Test 18

Group: 1

Verdict: ACCEPTED

input
`1101100111` view save

correct output
`3 2 2 1` view save

user output
`3 2 2 1` view save

Test 19

Group: 1

Verdict: ACCEPTED

input
`0110000100` view save

correct output
`3 2 1 1` view save

user output
`3 2 1 1` view save

Test 20

Group: 1

Verdict: TIME LIMIT EXCEEDED

input
`0000101000` view save

correct output
`QAQ` view save

user output
(empty)

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`1110010100` view save

correct output
`QAQ` view save

user output
(empty)

Test 22

Group: 2

Verdict: ACCEPTED

input
`1110010000` view save

correct output
`3 2 1 1` view save

user output
`3 2 1 1` view save

Test 23

Group: 2

Verdict: ACCEPTED

input
`1001101100` view save

correct output
`4 1 1 1 1` view save

user output
`4 3 1 1 1` view save

Test 24

Group: 2

Verdict: ACCEPTED

input
`0000000111` view save

correct output
`2 1 1` view save

user output
`2 1 1` view save

Test 25

Group: 2

Verdict: ACCEPTED

input
`0011111110` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 26

Group: 2

Verdict: ACCEPTED

input
`1100101100` view save

correct output
`4 2 1 1 1` view save

user output
`4 3 2 1 1` view save

Test 27

Group: 2

Verdict: ACCEPTED

input
`0111101110` view save

correct output
`3 2 1 1` view save

user output
`3 1 2 1` view save

Test 28

Group: 2

Verdict: ACCEPTED

input
`0000011011` view save

correct output
`3 2 1 1` view save

user output
`3 2 1 1` view save

Test 29

Group: 2

Verdict: ACCEPTED

input
`1110011101` view save

correct output
`3 3 2 1` view save

user output
`3 3 2 1` view save

Test 30

Group: 2

Verdict: ACCEPTED

input
`0001011011` view save

correct output
`4 1 1 1 1` view save

user output
`4 2 2 1 1` view save

Test 31

Group: 2

Verdict: ACCEPTED

input
`0010110011` view save

correct output
`4 1 1 1 1` view save

user output
`4 2 2 1 1` view save

Test 32

Group: 2

Verdict: ACCEPTED

input
`0011100000` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 33

Group: 2

Verdict: WRONG ANSWER

input
`1110100110` view save

correct output
`4 1 1 1 1` view save

user output
`4 2 1 2 1` view save

Test 34

Group: 2

Verdict: ACCEPTED

input
`0110110111` view save

correct output
`4 2 1 1 1` view save

user output
`4 1 2 1 1` view save

Test 35

Group: 2

Verdict: ACCEPTED

input
`1110110010` view save

correct output
`4 1 2 1 1` view save

user output
`4 3 2 1 1` view save

Test 36

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`110011001100110011001010101010...` view save

correct output
`QAQ` view save

user output
(empty)

Test 37

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`110011001100110011001100101010...` view save

correct output
`QAQ` view save

user output
(empty)

Test 38

Group: 2

Verdict: ACCEPTED

input
`110011001100110011001100110011...` view save

correct output
`31 1 20 20 20 20 20 20 20 20 20 2...` view save

user output
`31 21 21 21 21 21 21 21 21 21 21 ...` view save

Test 39

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`010101010101010101010101010101...` view save

correct output
`48 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 40

Group: 2

Verdict: ACCEPTED

input
`011010000011111011110000110011...` view save

correct output
`23 13 13 12 11 11 11 11 10 9 9 9 ...` view save

user output
`23 1 13 13 13 8 15 3 2 2 15 14 13...` view save

Test 41

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`0010101000` view save

correct output
`QAQ` view save

user output
(empty)

Test 42

Group: 3

Verdict: ACCEPTED

input
`0100010110` view save

correct output
`4 2 1 1 1` view save

user output
`4 1 1 2 1` view save

Test 43

Group: 3

Verdict: ACCEPTED

input
`0100110110` view save

correct output
`4 2 1 1 1` view save

user output
`4 3 1 1 1` view save

Test 44

Group: 3

Verdict: ACCEPTED

input
`1110000001` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 45

Group: 3

Verdict: ACCEPTED

input
`0001001110` view save

correct output
`3 2 2 1` view save

user output
`3 2 2 1` view save

Test 46

Group: 3

Verdict: ACCEPTED

input
`0011100011` view save

correct output
`3 1 2 1` view save

user output
`3 2 1 1` view save

Test 47

Group: 3

Verdict: ACCEPTED

input
`0100111100` view save

correct output
`3 1 1 1` view save

user output
`3 1 1 1` view save

Test 48

Group: 3

Verdict: ACCEPTED

input
`0001001000` view save

correct output
`3 2 2 1` view save

user output
`3 2 2 1` view save

Test 49

Group: 3

Verdict: ACCEPTED

input
`0100100010` view save

correct output
`4 2 1 1 1` view save

user output
`4 1 2 1 1` view save

Test 50

Group: 3

Verdict: ACCEPTED

input
`1100101110` view save

correct output
`4 2 1 1 1` view save

user output
`4 3 2 1 1` view save

Test 51

Group: 3

Verdict: ACCEPTED

input
`1000111011` view save

correct output
`3 2 1 1` view save

user output
`3 2 1 1` view save

Test 52

Group: 3

Verdict: ACCEPTED

input
`1000111111` view save

correct output
`2 1 1` view save

user output
`2 1 1` view save

Test 53

Group: 3

Verdict: ACCEPTED

input
`0110011100` view save

correct output
`3 2 1 1` view save

user output
`3 3 1 1` view save

Test 54

Group: 3

Verdict: ACCEPTED

input
`0001000110` view save

correct output
`3 2 2 1` view save

user output
`3 2 2 1` view save

Test 55

Group: 3

Verdict: ACCEPTED

input
`1110110010` view save

correct output
`4 1 2 1 1` view save

user output
`4 3 2 1 1` view save

Test 56

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`110011001100110011001100110011...` view save

correct output
`QAQ` view save

user output
(empty)

Test 57

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`110011001100110011001100110011...` view save

correct output
`QAQ` view save

user output
(empty)

Test 58

Group: 3

Verdict: ACCEPTED

input
`110011001100110011001100110011...` view save

correct output
`1501 1 1000 1000 1000 1000 1000 100...` view save

user output
`1501 1001 1001 1001 1001 1001 1001 ...` view save

Test 59

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`010101010101010101010101010101...` view save

correct output
`2498 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 60

Group: 3

Verdict: ACCEPTED

input
`011100011001011111111000010110...` view save

correct output
`1272 1 1 648 647 646 646 645 645 64...` view save

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

Test 61

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`1110101110` view save

correct output
`QAQ` view save

user output
(empty)

Test 62

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`0111001011` view save

correct output
`4 2 1 1 1` view save

user output
(empty)

Test 63

Group: 4

Verdict: ACCEPTED

input
`1101111101` view save

correct output
`3 2 2 1` view save

user output
`3 2 2 1` view save

Test 64

Group: 4

Verdict: ACCEPTED

input
`1001110001` view save

correct output
`3 2 1 1` view save

user output
`3 3 1 1` view save

Test 65

Group: 4

Verdict: ACCEPTED

input
`1000000011` view save

correct output
`2 1 1` view save

user output
`2 1 1` view save

Test 66

Group: 4

Verdict: ACCEPTED

input
`0100010111` view save

correct output
`4 1 1 1 1` view save

user output
`4 1 1 1 1` view save

Test 67

Group: 4

Verdict: ACCEPTED

input
`0100111010` view save

correct output
`4 2 1 1 1` view save

user output
`4 2 1 1 1` view save

Test 68

Group: 4

Verdict: ACCEPTED

input
`0010111101` view save

correct output
`4 1 1 1 1` view save

user output
`4 2 2 1 1` view save

Test 69

Group: 4

Verdict: ACCEPTED

input
`0011111000` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 70

Group: 4

Verdict: WRONG ANSWER

input
`1101001101` view save

correct output
`4 2 2 2 1` view save

user output
`4 2 1 2 1` view save

Test 71

Group: 4

Verdict: ACCEPTED

input
`0110111000` view save

correct output
`3 2 1 1` view save

user output
`3 1 2 1` view save

Test 72

Group: 4

Verdict: ACCEPTED

input
`1100110111` view save

correct output
`3 3 2 1` view save

user output
`3 3 2 1` view save

Test 73

Group: 4

Verdict: ACCEPTED

input
`1110011111` view save

correct output
`2 2 1` view save

user output
`2 2 1` view save

Test 74

Group: 4

Verdict: ACCEPTED

input
`1011000101` view save

correct output
`4 2 1 1 1` view save

user output
`4 2 1 1 1` view save

Test 75

Group: 4

Verdict: ACCEPTED

input
`1110110010` view save

correct output
`4 1 2 1 1` view save

user output
`4 3 2 1 1` view save

Test 76

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`110011001100110011001100110011...` view save

correct output
`QAQ` view save

user output
(empty)

Test 77

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`110011001100110011001100110011...` view save

correct output
`QAQ` view save

user output
(empty)

Test 78

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`110011001100110011001100110011...` view save

correct output
`30001 1 20000 20000 20000 20000 2000...` view save

user output
(empty)

Test 79

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`010101010101010101010101010101...` view save

correct output
`49998 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

user output
(empty)

Test 80

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
`111000110000011000001101010010...` view save

correct output
`25011 1 12471 12470 12469 12468 1246...` view save

user output
(empty)

Datatähti 2016 alku

Bittipeli

Compiler report

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Test 47

Test 48

Test 49

Test 50

Test 51

Test 52

Test 53

Test 54

Test 55

Test 56

Test 57

Test 58

Test 59

Test 60

Test 61

Test 62

Test 63

Test 64

Test 65

Test 66

Test 67

Test 68

Test 69

Test 70

Test 71

Test 72

Test 73

Test 74

Test 75