— Dark mode

Datatähti 2016 alku

Bittipeli

  • Start: 2015-09-28 00:00:00
  • End: 2015-10-12 00:00:00
CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Oispa Kaljaa
Submission time:2015-10-02 22:37:10 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#10.06 s1details
#20.05 s1details
#30.05 s1details
#40.05 s1details
#50.06 s1details
#60.05 s1details
#70.06 s1details
#80.06 s1details
#90.05 s1details
#100.06 s1details
#110.05 s1details
#120.05 s1details
#130.05 s1details
#140.05 s1details
#150.05 s1details
#160.06 s1details
#170.05 s1details
#180.06 s1details
#190.05 s1details
#200.05 s1details
#210.05 s2details
#220.05 s2details
#230.05 s2details
#240.05 s2details
#250.05 s2details
#260.05 s2details
#270.06 s2details
#280.06 s2details
#290.05 s2details
#300.06 s2details
#310.05 s2details
#320.06 s2details
#330.05 s2details
#340.05 s2details
#350.05 s2details
#360.05 s2details
#370.05 s2details
#380.06 s2details
#390.05 s2details
#400.05 s2details
#410.06 s3details
#420.05 s3details
#430.05 s3details
#440.05 s3details
#450.05 s3details
#460.06 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.05 s3details
#560.10 s3details
#570.10 s3details
#580.08 s3details
#590.00 s3details
#600.07 s3details
#610.06 s4details
#620.06 s4details
#630.04 s4details
#640.07 s4details
#650.06 s4details
#660.05 s4details
#670.05 s4details
#680.06 s4details
#690.05 s4details
#700.05 s4details
#710.06 s4details
#720.05 s4details
#730.06 s4details
#740.05 s4details
#750.05 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: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();
	
	for(int i = 0; i < n; i++){
		//cout << "paikka: " << i << endl;
		int a = i;
		int b = i;
		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){
			
			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 << "kay" << endl;
			goto ohi3;
		}
		

	}
	cout << "QAQ" << endl;

	ohi3:
	1==1;
	}
	}

	return 0;
}

Test details

Test 1

Group: 1

Verdict:

input
1011001010
view save

correct output
QAQ
view save

user output
nyt: 1011001010
nyt: 10111010
nyt: 10010
nyt: 110
nyt: 0
...
view save

Test 2

Group: 1

Verdict:

input
0000001001
view save

correct output
3
1 1 1 
view save

user output
nyt: 0000001001
nyt: 00000011
nyt: 11
3
2 1 1 
view save

Test 3

Group: 1

Verdict:

input
0111011100
view save

correct output
3
2 1 1 
view save

user output
nyt: 0111011100
nyt: 0011100
nyt: 0000
3
1 2 1 
view save

Test 4

Group: 1

Verdict:

input
0100100100
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 0100100100
nyt: 01100100
nyt: 011100
nyt: 000
4
...
view save

Test 5

Group: 1

Verdict:

input
1110010110
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 1110010110
nyt: 11100100
nyt: 111100
nyt: 00
4
...
view save

Test 6

Group: 1

Verdict:

input
1111110110
view save

correct output
3
1 1 1 
view save

user output
nyt: 1111110110
nyt: 11111100
nyt: 00
3
2 1 1 
view save

Test 7

Group: 1

Verdict:

input
0011110001
view save

correct output
3
1 2 1 
view save

user output
nyt: 0011110001
nyt: 0011111
nyt: 11111
3
3 1 1 
view save

Test 8

Group: 1

Verdict:

input
0111111000
view save

correct output
2
1 1 
view save

user output
nyt: 0111111000
nyt: 0000
2
1 1 
view save

Test 9

Group: 1

Verdict:

input
1111111100
view save

correct output
2
1 1 
view save

user output
nyt: 1111111100
nyt: 00
2
1 1 
view save

Test 10

Group: 1

Verdict:

input
1000010011
view save

correct output
3
2 1 1 
view save

user output
nyt: 1000010011
nyt: 110011
nyt: 1111
3
1 2 1 
view save

Test 11

Group: 1

Verdict:

input
1101110000
view save

correct output
3
1 1 1 
view save

user output
nyt: 1101110000
nyt: 1100000
nyt: 00000
3
2 1 1 
view save

Test 12

Group: 1

Verdict:

input
1101101100
view save

correct output
4
1 2 1 1 
view save

user output
nyt: 1101101100
nyt: 11001100
nyt: 111100
nyt: 00
4
...
view save

Test 13

Group: 1

Verdict:

input
0100111110
view save

correct output
3
1 1 1 
view save

user output
nyt: 0100111110
nyt: 01111110
nyt: 00
3
1 1 1 
view save

Test 14

Group: 1

Verdict:

input
1101001011
view save

correct output
4
2 2 2 1 
view save

user output
nyt: 1101001011
nyt: 11011011
nyt: 110011
nyt: 1111
4
...
view save

Test 15

Group: 1

Verdict:

input
1110110010
view save

correct output
4
1 2 1 1 
view save

user output
nyt: 1110110010
nyt: 11101110
nyt: 11100
nyt: 00
4
...
view save

Test 16

Group: 1

Verdict:

input
0011011100
view save

correct output
3
3 2 1 
view save

user output
nyt: 0011011100
nyt: 0011000
nyt: 00000
3
3 2 1 
view save

Test 17

Group: 1

Verdict:

input
1100101011
view save

correct output
QAQ
view save

user output
nyt: 1100101011
nyt: 11101011
nyt: 01011
nyt: 1101010011
nyt: 11010111
...
view save

Test 18

Group: 1

Verdict:

input
1101100111
view save

correct output
3
2 2 1 
view save

user output
nyt: 1101100111
nyt: 11000111
nyt: 11111
3
2 2 1 
view save

Test 19

Group: 1

Verdict:

input
0110000100
view save

correct output
3
2 1 1 
view save

user output
nyt: 0110000100
nyt: 011100
nyt: 000
3
2 1 1 
view save

Test 20

Group: 1

Verdict:

input
0000101000
view save

correct output
QAQ
view save

user output
nyt: 0000101000
nyt: 101000
nyt: 0001010000
nyt: 1010000
QAQ
view save

Test 21

Group: 2

Verdict:

input
1110010100
view save

correct output
QAQ
view save

user output
nyt: 1110010100
nyt: 11110100
nyt: 0010100111
nyt: 00101111
QAQ
view save

Test 22

Group: 2

Verdict:

input
1110010000
view save

correct output
3
2 1 1 
view save

user output
nyt: 1110010000
nyt: 11110000
nyt: 0000
3
2 1 1 
view save

Test 23

Group: 2

Verdict:

input
1001101100
view save

correct output
4
1 1 1 1 
view save

user output
nyt: 1001101100
nyt: 10011000
nyt: 111000
nyt: 000
4
...
view save

Test 24

Group: 2

Verdict:

input
0000000111
view save

correct output
2
1 1 
view save

user output
nyt: 0000000111
nyt: 111
2
1 1 
view save

Test 25

Group: 2

Verdict:

input
0011111110
view save

correct output
2
2 1 
view save

user output
nyt: 0011111110
nyt: 000
2
2 1 
view save

Test 26

Group: 2

Verdict:

input
1100101100
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 1100101100
nyt: 11001000
nyt: 111000
nyt: 000
4
...
view save

Test 27

Group: 2

Verdict:

input
0111101110
view save

correct output
3
2 1 1 
view save

user output
nyt: 0111101110
nyt: 001110
nyt: 000
3
1 2 1 
view save

Test 28

Group: 2

Verdict:

input
0000011011
view save

correct output
3
2 1 1 
view save

user output
nyt: 0000011011
nyt: 00000011
nyt: 11
3
2 1 1 
view save

Test 29

Group: 2

Verdict:

input
1110011101
view save

correct output
3
3 2 1 
view save

user output
nyt: 1110011101
nyt: 1110001
nyt: 1111
3
3 2 1 
view save

Test 30

Group: 2

Verdict:

input
0001011011
view save

correct output
4
1 1 1 1 
view save

user output
nyt: 0001011011
nyt: 00010011
nyt: 000111
nyt: 111
4
...
view save

Test 31

Group: 2

Verdict:

input
0010110011
view save

correct output
4
1 1 1 1 
view save

user output
nyt: 0010110011
nyt: 00100011
nyt: 00111
nyt: 111
4
...
view save

Test 32

Group: 2

Verdict:

input
0011100000
view save

correct output
2
2 1 
view save

user output
nyt: 0011100000
nyt: 0000000
2
2 1 
view save

Test 33

Group: 2

Verdict:

input
1110100110
view save

correct output
4
1 1 1 1 
view save

user output
nyt: 1110100110
nyt: 11101000
nyt: 0110010111
nyt: 01110111
nyt: 00111
...
view save

Test 34

Group: 2

Verdict:

input
0110110111
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 0110110111
nyt: 00110111
nyt: 000111
nyt: 111
4
...
view save

Test 35

Group: 2

Verdict:

input
1110110010
view save

correct output
4
1 2 1 1 
view save

user output
nyt: 1110110010
nyt: 11101110
nyt: 11100
nyt: 00
4
...
view save

Test 36

Group: 2

Verdict:

input
110011001100110011001010101010...
view save

correct output
QAQ
view save

user output
nyt: 1100110011001100110010101...
view save

Test 37

Group: 2

Verdict:

input
110011001100110011001100101010...
view save

correct output
QAQ
view save

user output
nyt: 1100110011001100110011001...
view save

Test 38

Group: 2

Verdict:

input
110011001100110011001100110011...
view save

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

user output
nyt: 1100110011001100110011001...
view save

Test 39

Group: 2

Verdict:

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
nyt: 0101010101010101010101010...
view save

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...
view save

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

user output
nyt: 0110100000111110111100001...
view save

Test 41

Group: 3

Verdict:

input
0010101000
view save

correct output
QAQ
view save

user output
nyt: 0010101000
nyt: 10101000
nyt: 10101
nyt: 0001010100
nyt: 1010100
...
view save

Test 42

Group: 3

Verdict:

input
0100010110
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 0100010110
nyt: 0110110
nyt: 00110
nyt: 000
4
...
view save

Test 43

Group: 3

Verdict:

input
0100110110
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 0100110110
nyt: 01001100
nyt: 011100
nyt: 000
4
...
view save

Test 44

Group: 3

Verdict:

input
1110000001
view save

correct output
2
2 1 
view save

user output
nyt: 1110000001
nyt: 1111
2
2 1 
view save

Test 45

Group: 3

Verdict:

input
0001001110
view save

correct output
3
2 2 1 
view save

user output
nyt: 0001001110
nyt: 00011110
nyt: 0000
3
2 2 1 
view save

Test 46

Group: 3

Verdict:

input
0011100011
view save

correct output
3
1 2 1 
view save

user output
nyt: 0011100011
nyt: 0000011
nyt: 11
3
2 1 1 
view save

Test 47

Group: 3

Verdict:

input
0100111100
view save

correct output
3
1 1 1 
view save

user output
nyt: 0100111100
nyt: 01111100
nyt: 000
3
1 1 1 
view save

Test 48

Group: 3

Verdict:

input
0001001000
view save

correct output
3
2 2 1 
view save

user output
nyt: 0001001000
nyt: 00011000
nyt: 000000
3
2 2 1 
view save

Test 49

Group: 3

Verdict:

input
0100100010
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 0100100010
nyt: 01100010
nyt: 01110
nyt: 00
4
...
view save

Test 50

Group: 3

Verdict:

input
1100101110
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 1100101110
nyt: 1100100
nyt: 11100
nyt: 00
4
...
view save

Test 51

Group: 3

Verdict:

input
1000111011
view save

correct output
3
2 1 1 
view save

user output
nyt: 1000111011
nyt: 1000011
nyt: 111
3
2 1 1 
view save

Test 52

Group: 3

Verdict:

input
1000111111
view save

correct output
2
1 1 
view save

user output
nyt: 1000111111
nyt: 1111111
2
1 1 
view save

Test 53

Group: 3

Verdict:

input
0110011100
view save

correct output
3
2 1 1 
view save

user output
nyt: 0110011100
nyt: 0110000
nyt: 00000
3
3 1 1 
view save

Test 54

Group: 3

Verdict:

input
0001000110
view save

correct output
3
2 2 1 
view save

user output
nyt: 0001000110
nyt: 0001110
nyt: 0000
3
2 2 1 
view save

Test 55

Group: 3

Verdict:

input
1110110010
view save

correct output
4
1 2 1 1 
view save

user output
nyt: 1110110010
nyt: 11101110
nyt: 11100
nyt: 00
4
...
view save

Test 56

Group: 3

Verdict:

input
110011001100110011001100110011...
view save

correct output
QAQ
view save

user output
nyt: 1100110011001100110011001...
view save

Test 57

Group: 3

Verdict:

input
110011001100110011001100110011...
view save

correct output
QAQ
view save

user output
nyt: 1100110011001100110011001...
view save

Test 58

Group: 3

Verdict:

input
110011001100110011001100110011...
view save

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

user output
nyt: 1100110011001100110011001...
view save

Test 59

Group: 3

Verdict:

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:

input
011100011001011111111000010110...
view save

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

user output
nyt: 0111000110010111111110000...
view save

Test 61

Group: 4

Verdict:

input
1110101110
view save

correct output
QAQ
view save

user output
nyt: 1110101110
nyt: 1110100
nyt: 0111010111
nyt: 0010111
QAQ
view save

Test 62

Group: 4

Verdict:

input
0111001011
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 0111001011
nyt: 0001011
nyt: 1101001110
nyt: 1101000
kay
view save

Test 63

Group: 4

Verdict:

input
1101111101
view save

correct output
3
2 2 1 
view save

user output
nyt: 1101111101
nyt: 11001
nyt: 111
3
2 2 1 
view save

Test 64

Group: 4

Verdict:

input
1001110001
view save

correct output
3
2 1 1 
view save

user output
nyt: 1001110001
nyt: 1001111
nyt: 11111
3
3 1 1 
view save

Test 65

Group: 4

Verdict:

input
1000000011
view save

correct output
2
1 1 
view save

user output
nyt: 1000000011
nyt: 111
2
1 1 
view save

Test 66

Group: 4

Verdict:

input
0100010111
view save

correct output
4
1 1 1 1 
view save

user output
nyt: 0100010111
nyt: 0110111
nyt: 00111
nyt: 111
4
...
view save

Test 67

Group: 4

Verdict:

input
0100111010
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 0100111010
nyt: 0100010
nyt: 0110
nyt: 00
4
...
view save

Test 68

Group: 4

Verdict:

input
0010111101
view save

correct output
4
1 1 1 1 
view save

user output
nyt: 0010111101
nyt: 001001
nyt: 0011
nyt: 11
4
...
view save

Test 69

Group: 4

Verdict:

input
0011111000
view save

correct output
2
2 1 
view save

user output
nyt: 0011111000
nyt: 00000
2
2 1 
view save

Test 70

Group: 4

Verdict:

input
1101001101
view save

correct output
4
2 2 2 1 
view save

user output
nyt: 1101001101
nyt: 11010001
nyt: 11011
nyt: 011
nyt: 0
...
view save

Test 71

Group: 4

Verdict:

input
0110111000
view save

correct output
3
2 1 1 
view save

user output
nyt: 0110111000
nyt: 00111000
nyt: 00000
3
1 2 1 
view save

Test 72

Group: 4

Verdict:

input
1100110111
view save

correct output
3
3 2 1 
view save

user output
nyt: 1100110111
nyt: 11000111
nyt: 11111
3
3 2 1 
view save

Test 73

Group: 4

Verdict:

input
1110011111
view save

correct output
2
2 1 
view save

user output
nyt: 1110011111
nyt: 11111111
2
2 1 
view save

Test 74

Group: 4

Verdict:

input
1011000101
view save

correct output
4
2 1 1 1 
view save

user output
nyt: 1011000101
nyt: 1011101
nyt: 1001
nyt: 11
4
...
view save

Test 75

Group: 4

Verdict:

input
1110110010
view save

correct output
4
1 2 1 1 
view save

user output
nyt: 1110110010
nyt: 11101110
nyt: 11100
nyt: 00
4
...
view save

Test 76

Group: 4

Verdict:

input
110011001100110011001100110011...
view save

correct output
QAQ
view save

user output
(empty)

Test 77

Group: 4

Verdict:

input
110011001100110011001100110011...
view save

correct output
QAQ
view save

user output
(empty)

Test 78

Group: 4

Verdict:

input
110011001100110011001100110011...
view save

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

user output
(empty)

Test 79

Group: 4

Verdict:

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:

input
111000110000011000001101010010...
view save

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

user output
(empty)

Tasks

A Osajono-B Kirjat-C Tontti-D Lennot-E Bittipeli-

Submissions (Oispa Kaljaa)

2015-10-11 23:34:14 112015-10-11 23:23:24 112015-10-08 23:51:45 112015-10-05 18:48:12 662015-10-05 18:44:45 02015-10-05 18:42:48 02015-10-05 18:41:28 02015-10-05 18:40:04 02015-10-04 21:53:59 662015-10-04 21:52:21 02015-10-04 21:50:10 02015-10-04 21:02:53 382015-10-03 00:07:18 382015-10-03 00:03:46 382015-10-03 00:00:49 02015-10-02 23:48:02 392015-10-02 23:10:07 112015-10-02 22:58:41 02015-10-02 22:38:54 112015-10-02 22:37:10 02015-10-02 21:42:37 112015-10-02 21:26:57 112015-10-02 21:25:55 02015-10-02 21:15:33 02015-09-29 21:28:41 112015-09-29 21:27:47 112015-09-29 21:27:07 112015-09-29 21:26:17 112015-09-29 21:25:13 112015-09-29 21:22:36 02015-09-28 16:12:26 112015-09-28 16:11:17 112015-09-28 15:58:18 112015-09-28 15:36:13 112015-09-28 15:29:04 112015-09-28 15:26:54 0