Code Submission Evaluation System Login

Datatähti 2016 alku

Start:2015-09-28 00:00:00
End:2015-10-12 00:00:00
 

Tasks | Scoreboard | Statistics


CSES - Datatähti 2016 alku - Results
History
2015-10-11 23:34:1411
2015-10-11 23:23:2411
2015-10-08 23:51:4511
2015-10-05 18:48:1266
2015-10-05 18:44:450
2015-10-05 18:42:480
2015-10-05 18:41:280
2015-10-05 18:40:040
2015-10-04 21:53:5966
2015-10-04 21:52:210
2015-10-04 21:50:100
2015-10-04 21:02:5338
2015-10-03 00:07:1838
2015-10-03 00:03:4638
2015-10-03 00:00:490
2015-10-02 23:48:0239
2015-10-02 23:10:0711
2015-10-02 22:58:410
2015-10-02 22:38:5411
2015-10-02 22:37:100
2015-10-02 21:42:3711
2015-10-02 21:26:5711
2015-10-02 21:25:550
2015-10-02 21:15:330
2015-09-29 21:28:4111
2015-09-29 21:27:4711
2015-09-29 21:27:0711
2015-09-29 21:26:1711
2015-09-29 21:25:1311
2015-09-29 21:22:360
2015-09-28 16:12:2611
2015-09-28 16:11:1711
2015-09-28 15:58:1811
2015-09-28 15:36:1311
2015-09-28 15:29:0411
2015-09-28 15:26:540
Task:Bittipeli
Sender:Oispa Kaljaa
Submission time:2015-10-05 18:48:12
Language:C++
Status:READY
Score:66

Feedback

groupverdictscore
#1ACCEPTED11
#2ACCEPTED27
#3ACCEPTED28
#4WRONG ANSWER0

Test results

testverdicttime (s)group
#1ACCEPTED0.06 / 1.001details
#2ACCEPTED0.05 / 1.001details
#3ACCEPTED0.05 / 1.001details
#4ACCEPTED0.05 / 1.001details
#5ACCEPTED0.05 / 1.001details
#6ACCEPTED0.05 / 1.001details
#7ACCEPTED0.05 / 1.001details
#8ACCEPTED0.05 / 1.001details
#9ACCEPTED0.05 / 1.001details
#10ACCEPTED0.06 / 1.001details
#11ACCEPTED0.05 / 1.001details
#12ACCEPTED0.06 / 1.001details
#13ACCEPTED0.06 / 1.001details
#14ACCEPTED0.05 / 1.001details
#15ACCEPTED0.05 / 1.001details
#16ACCEPTED0.05 / 1.001details
#17ACCEPTED0.06 / 1.001details
#18ACCEPTED0.05 / 1.001details
#19ACCEPTED0.05 / 1.001details
#20ACCEPTED0.05 / 1.001details
#21ACCEPTED0.06 / 1.002details
#22ACCEPTED0.05 / 1.002details
#23ACCEPTED0.06 / 1.002details
#24ACCEPTED0.06 / 1.002details
#25ACCEPTED0.06 / 1.002details
#26ACCEPTED0.05 / 1.002details
#27ACCEPTED0.06 / 1.002details
#28ACCEPTED0.05 / 1.002details
#29ACCEPTED0.05 / 1.002details
#30ACCEPTED0.06 / 1.002details
#31ACCEPTED0.05 / 1.002details
#32ACCEPTED0.06 / 1.002details
#33ACCEPTED0.06 / 1.002details
#34ACCEPTED0.05 / 1.002details
#35ACCEPTED0.05 / 1.002details
#36ACCEPTED0.05 / 1.002details
#37ACCEPTED0.06 / 1.002details
#38ACCEPTED0.05 / 1.002details
#39ACCEPTED0.05 / 1.002details
#40ACCEPTED0.05 / 1.002details
#41ACCEPTED0.06 / 1.003details
#42ACCEPTED0.06 / 1.003details
#43ACCEPTED0.05 / 1.003details
#44ACCEPTED0.05 / 1.003details
#45ACCEPTED0.05 / 1.003details
#46ACCEPTED0.05 / 1.003details
#47ACCEPTED0.06 / 1.003details
#48ACCEPTED0.05 / 1.003details
#49ACCEPTED0.06 / 1.003details
#50ACCEPTED0.05 / 1.003details
#51ACCEPTED0.05 / 1.003details
#52ACCEPTED0.05 / 1.003details
#53ACCEPTED0.06 / 1.003details
#54ACCEPTED0.05 / 1.003details
#55ACCEPTED0.05 / 1.003details
#56ACCEPTED0.09 / 1.003details
#57ACCEPTED0.09 / 1.003details
#58ACCEPTED0.07 / 1.003details
#59ACCEPTED0.08 / 1.003details
#60ACCEPTED0.08 / 1.003details
#61ACCEPTED0.05 / 1.004details
#62ACCEPTED0.06 / 1.004details
#63ACCEPTED0.05 / 1.004details
#64ACCEPTED0.05 / 1.004details
#65ACCEPTED0.06 / 1.004details
#66ACCEPTED0.11 / 1.004details
#67ACCEPTED0.06 / 1.004details
#68ACCEPTED0.05 / 1.004details
#69ACCEPTED0.05 / 1.004details
#70WRONG ANSWER0.05 / 1.004details
#71ACCEPTED0.05 / 1.004details
#72ACCEPTED0.05 / 1.004details
#73ACCEPTED0.06 / 1.004details
#74ACCEPTED0.05 / 1.004details
#75ACCEPTED0.05 / 1.004details
#76TIME LIMIT EXCEEDED-- / 1.004details
#77TIME LIMIT EXCEEDED-- / 1.004details
#78TIME LIMIT EXCEEDED-- / 1.004details
#79TIME LIMIT EXCEEDED-- / 1.004details
#80TIME LIMIT EXCEEDED-- / 1.004details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:31:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < s.size(); i++)
                   ^
input/code.cpp:90:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
        if(has && i == 0 || i+le == n)
               ^
input/code.cpp:100:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
        if(has && i == 0 || i+le == n)
               ^
input/code.cpp:144:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < ans.size(); i++)
                    ^
input/code.cpp:153:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < s.size(); i++)
                    ^
input/code.cpp:207:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
        if(has && i == 0 || i+le == n)
               ^
input/code.cpp:217:15: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
        if(has && i == 0 || i+le == n)
               ^
input/code.cpp:260:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < s.size(); i++)
                   ^
input/code.cpp:294:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < ans.size(); i++)
                    ^
input/code.cpp:301: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 sb = s;
	string rev = s;
	reverse(rev.begin(), rev.end());
	vector<int> ans;
	int c[2] = {0};
	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;
		int num = 1;
		bool shas = false;
		
		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 ohi;
				}
				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 ohi;
							si = i;
							sle = le;
							sre = num;
							has = true;
						}
					}
					else{
						if(c[1]-le != 1){
							if(has && i == 0 || i+le == n)
								goto ohi;
							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++;
			}
			ohi:
			i+=le;
		}
		if(sre == -1)
			break;
		ans.push_back(sre);
		//cout << "poistetaan "<< s[si] << " last " << last << endl;
		
		//cout << si << " " << sle << " " << sre << endl;
		s = s.substr(0, si)+s.substr(si+sle, s.size()-(si+sle));


	}
	if(s.size() == 0){
		cout << ans.size() << endl;
		for(int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << endl;
	}
	else{
		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;
		ans.push_back(num-sre);
		s = s.substr(0, si)+s.substr(si+sle, s.size()-(si+sle));

	}
	if(s.size() > 0){
	c[0] = 0;
	c[1] = 0;
	s = sb;
	ans.clear();
	for(int i = 0; i < s.size(); i++)
		c[s[i] == '1']++;
	
	while(s.size()){
		//cout << s << endl;
		int sle = 99999999;
		int si = -1;
		int n = s.size();
		int num = 1;
		int nre = -1;
		for(int i = 0; i < n;){
			int le = 1;
			while(i+le < n && s[i+le] == s[i])
				le++;
			
			if(le < sle && le > 1 && c[s[i] == '1']-le != 1){
				sle = le;
				si = i;
				nre = num;
			}
			if(le > 1)
				num++;
			i+=le;
		}
		if(si == -1)
			break;
		ans.push_back(nre);
		s = s.substr(0, si)+s.substr(si+sle, n-(si+sle));
	}
	if(s.size()){
		cout << "QAQ" << endl;
	}
	else{
		cout << ans.size() << endl;
		for(int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << 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: ACCEPTED

input
1011001010
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001
view   save

correct output
3
1 1 1
view   save

user output
3
2 2 1
view   save

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100
view   save

correct output
3
2 1 1
view   save

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

Test 10

Group: 1

Verdict: ACCEPTED

input
1000010011
view   save

correct output
3
2 1 1
view   save

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

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100
view   save

correct output
4
1 2 1 1
view   save

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

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100
view   save

correct output
3
3 2 1
view   save

user output
4
3 3 2 1
view   save

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111
view   save

correct output
3
2 2 1
view   save

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

input
0000101000
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 22

Group: 2

Verdict: ACCEPTED

input
1110010000
view   save

correct output
3
2 1 1
view   save

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

Test 24

Group: 2

Verdict: ACCEPTED

input
0000000111
view   save

correct output
2
1 1
view   save

user output
2
2 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 2 1
view   save

Test 27

Group: 2

Verdict: ACCEPTED

input
0111101110
view   save

correct output
3
2 1 1
view   save

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

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000
view   save

correct output
2
2 1
view   save

user output
3
3 2 1
view   save

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110
view   save

correct output
4
1 1 1 1
view   save

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

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

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
40
21 21 21 21 21 21 21 21 21 21 ...
view   save

Test 39

Group: 2

Verdict: ACCEPTED

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
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

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
25
23 22 21 19 17 15 15 15 14 13 ...
view   save

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 42

Group: 3

Verdict: ACCEPTED

input
0100010110
view   save

correct output
4
2 1 1 1
view   save

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

Test 56

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 57

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 58

Group: 3

Verdict: ACCEPTED

input
110011001100110011001100110011...
view   save

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

user output
2000
1001 1001 1001 1001 1001 1001 ...
view   save

Test 59

Group: 3

Verdict: ACCEPTED

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
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
view   save

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
1573
7 7 9 21 22 34 42 48 48 49 49 ...
view   save

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110
view   save

correct output
QAQ
view   save

user output
QAQ
view   save

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011
view   save

correct output
4
2 1 1 1
view   save

user output
4
2 1 2 1
view   save

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 2 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 2 1
view   save

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000
view   save

correct output
2
2 1
view   save

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

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111
view   save

correct output
3
3 2 1
view   save

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

Test 76

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
(no output)
view   save

Test 77

Group: 4

Verdict: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

correct output
QAQ
view   save

user output
(no output)
view   save

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
(no output)
view   save

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
(no output)
view   save

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
(no output)
view   save