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-10 19:27:3711
2015-10-10 17:50:450
2015-10-10 17:48:050
Task:Bittipeli
Sender:hugo-hur
Submission time:2015-10-10 17:48:05
Language:C++
Status:READY
Score:0

Feedback

groupverdictscore
#1WRONG ANSWER0
#2WRONG ANSWER0
#3WRONG ANSWER0
#4WRONG ANSWER0

Test results

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

Compiler report

input/code.cpp: In function 'std::vector<std::vector<bool> > removableSets(std::vector<bool>)':
input/code.cpp:29:7: warning: unused variable 'last' [-Wunused-variable]
  bool last;
       ^

Code

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <exception>
#include <limits.h>
using namespace std;
unsigned long getSubsetBegin(vector<bool> arr, vector<bool> subset){
	unsigned long match = 0;
	unsigned long subInd = 0;
	for (unsigned long i = 0; i < arr.size(); i++){
		if (arr.at(i) == subset.at(subInd)){
			match++;
			if (match == subset.size()){
				return i - subset.size() + 1;
			}
			subInd++;
		}
		else{
			match = 0;
			subInd = 0;
		}
	}
	return ULONG_MAX;
}
std::vector<std::vector<bool> > removableSets(std::vector<bool> bits){
	std::vector<std::vector<bool> > beginSets;
	bool last;
	unsigned int trueSetLen = 0;
	unsigned int falseSetLen = 0;
	/*if ( std::adjacent_find( myvector.begin(), myvector.end(), std::not_equal_to<int>() ) == myvector.end() )
	{
		std::cout << "All elements are equal each other" << std::endl;
	}*/
	if (std::adjacent_find(bits.begin(), bits.end(), std::not_equal_to<bool>()) == bits.end()){//All elements are equal to each other
		beginSets.push_back(bits);
		return beginSets;
	}
	if (bits.size() <= 2){
		return beginSets;
	}

	for (unsigned int i = 0; i < bits.size()-1; i++){
		
		if (bits.at(i) && bits.at(i + 1)){
			trueSetLen++;
		}
		if (!bits.at(i) && !bits.at(i + 1)){
			falseSetLen++;
		}
		else if (bits.at(i) != bits.at(i + 1)){//Set breaks
			if (trueSetLen > 0){
				std::vector<bool> vect;
				vect.resize(trueSetLen + 1, true);
				vect.at(0) = true;
				//vec.insert(vec.begin(), true, trueSetLen + 1);
				beginSets.push_back(vect);
			}
			if (falseSetLen > 0){
				std::vector<bool> vecf;
				vecf.resize(falseSetLen + 1, false);
				vecf.at(0) = false;
				//vec.insert(vec.begin(), false, falseSetLen + 1);
				beginSets.push_back(vecf);
			}
			trueSetLen = 0;
			falseSetLen = 0;
		}
	}
	return beginSets;
}
vector<bool> remove(vector<bool> in, vector<bool> remSet){
	vector<bool> copy = in;
	unsigned long index = getSubsetBegin(copy, remSet);
	if (index == ULONG_MAX){ throw 0; }
	copy.erase(copy.begin() + index, copy.begin() + index + remSet.size());
	return copy;
}
class Tracker{
	public:
		Tracker(){}
		Tracker(unsigned int depth, unsigned int i){
			this->depth = depth; this->i = i; leadsToSuccess = false;
		}
		unsigned int depth, i;
		bool leadsToSuccess;
};
vector<Tracker> possiblePaths(Tracker* t, vector<bool> in, vector<vector<bool> > remSets){
	vector<bool> copy = in;
	vector<Tracker> paths;
	for (unsigned int i = 0; i < remSets.size(); i++/*std::vector<bool> remSet : remSets*/){
		vector<bool> remSet = remSets.at(i);
		std::vector<bool> remOut = remove(copy, remSet);
		/*if (remOut.size() == 1){
			return paths;
		}*/
		Tracker newT(t->depth + 1, i);
		paths.push_back(newT);
		if (remOut.empty()){
			paths.back().leadsToSuccess = true;
			t->leadsToSuccess = true;
			return paths;
		}
		//Calculate new rem sets
		vector<Tracker> newPaths = possiblePaths(&(paths.back()), remOut, removableSets(remOut));
		if (!newPaths.empty()){
			if (newPaths.front().leadsToSuccess){
				t->leadsToSuccess = true;
				paths.back().leadsToSuccess = true;
			}
			paths.insert(paths.end(), newPaths.begin(), newPaths.end());
		}
	}
	return paths;
}
bool DoesNotSucceed(Tracker t){
	return !t.leadsToSuccess;
}
int main() {
	std::cin.sync_with_stdio(false);//Faster execution
	std::string str;
	std::cin >> str;
	//1001001001
	std::vector<bool> bits;
	for (char c : str){
		if (c == '1'){
			bits.push_back(true);
		}
		else{
			bits.push_back(false);
		}
	}
	//Figure out how this set was formed by inserting set of two or more trues or falses
	std::vector<bool> copy(bits);
	
	std::vector<std::vector<bool> > remSets = removableSets(copy);
	Tracker t(0,0);
	std::vector<Tracker> paths = possiblePaths(&t,copy, remSets);
	if (!t.leadsToSuccess){
		cout << "QAQ";
		return 0;
	}
	vector<Tracker>::iterator it = std::remove_if(paths.begin(), paths.end(), DoesNotSucceed);
	paths.resize(it - paths.begin());
	cout << paths.size() << std::endl;
	for (Tracker t : paths){
		cout << t.i + 1 << ' ';
	}
	return 0;
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
1011001010

view   save

correct output
QAQ

view   save

user output
5
2 1 1 1 1 

view   save

Test 2

Group: 1

Verdict: WRONG ANSWER

input
0000001001

view   save

correct output
3
1 1 1 

view   save

user output
14
1 1 1 2 1 1 1 2 1 1 1 2 1 1 

view   save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
0111011100

view   save

correct output
3
2 1 1 

view   save

user output
12
1 1 1 1 2 1 2 1 1 1 2 1 

view   save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
0100100100

view   save

correct output
4
2 1 1 1 

view   save

user output
QAQ

view   save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
1110010110

view   save

correct output
4
2 1 1 1 

view   save

user output
23
2 1 1 1 2 1 1 1 2 1 1 3 1 1 1 ...
view   save

Test 6

Group: 1

Verdict: WRONG ANSWER

input
1111110110

view   save

correct output
3
1 1 1 

view   save

user output
14
1 1 1 2 1 1 1 2 1 1 1 2 1 1 

view   save

Test 7

Group: 1

Verdict: WRONG ANSWER

input
0011110001

view   save

correct output
3
1 2 1 

view   save

user output
12
1 1 1 1 2 1 2 1 1 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: WRONG ANSWER

input
1000010011

view   save

correct output
3
2 1 1 

view   save

user output
19
1 1 1 1 2 1 2 1 1 1 1 2 1 2 1 ...
view   save

Test 11

Group: 1

Verdict: WRONG ANSWER

input
1101110000

view   save

correct output
3
1 1 1 

view   save

user output
6
1 1 1 2 1 1 

view   save

Test 12

Group: 1

Verdict: WRONG ANSWER

input
1101101100

view   save

correct output
4
1 2 1 1 

view   save

user output
39
1 1 1 1 1 2 1 2 1 1 1 2 1 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: WRONG ANSWER

input
1101001011

view   save

correct output
4
2 2 2 1 

view   save

user output
14
1 1 1 1 1 2 1 1 1 1 2 1 1 1 

view   save

Test 15

Group: 1

Verdict: WRONG ANSWER

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
16
1 2 1 1 2 1 1 1 1 3 1 1 1 2 1 ...
view   save

Test 16

Group: 1

Verdict: WRONG ANSWER

input
0011011100

view   save

correct output
3
3 2 1 

view   save

user output
19
1 1 1 1 2 1 1 2 1 1 1 2 1 3 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: WRONG ANSWER

input
1101100111

view   save

correct output
3
2 2 1 

view   save

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

view   save

Test 23

Group: 2

Verdict: WRONG ANSWER

input
1001101100

view   save

correct output
4
1 1 1 1 

view   save

user output
12
1 1 1 1 2 1 1 1 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: WRONG ANSWER

input
0011111110

view   save

correct output
2
2 1 

view   save

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

view   save

Test 27

Group: 2

Verdict: WRONG ANSWER

input
0111101110

view   save

correct output
3
2 1 1 

view   save

user output
6
1 1 1 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: WRONG ANSWER

input
1110011101

view   save

correct output
3
3 2 1 

view   save

user output
QAQ

view   save

Test 30

Group: 2

Verdict: WRONG ANSWER

input
0001011011

view   save

correct output
4
1 1 1 1 

view   save

user output
8
1 1 1 1 2 1 1 1 

view   save

Test 31

Group: 2

Verdict: WRONG ANSWER

input
0010110011

view   save

correct output
4
1 1 1 1 

view   save

user output
15
1 1 1 1 2 1 1 1 2 1 1 3 1 1 1 

view   save

Test 32

Group: 2

Verdict: WRONG ANSWER

input
0011100000

view   save

correct output
2
2 1 

view   save

user output
5
1 1 1 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
11
1 1 1 1 2 1 1 1 2 1 1 

view   save

Test 34

Group: 2

Verdict: WRONG ANSWER

input
0110110111

view   save

correct output
4
2 1 1 1 

view   save

user output
QAQ

view   save

Test 35

Group: 2

Verdict: WRONG ANSWER

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
16
1 2 1 1 2 1 1 1 1 3 1 1 1 2 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: TIME LIMIT EXCEEDED

input
110011001100110011001100110011...
view   save

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

user output
(empty)

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

input
011010000011111011110000110011...
view   save

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

user output
(empty)

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: WRONG ANSWER

input
0100010110

view   save

correct output
4
2 1 1 1 

view   save

user output
17
1 1 1 1 1 2 1 2 1 1 1 2 1 2 1 ...
view   save

Test 43

Group: 3

Verdict: WRONG ANSWER

input
0100110110

view   save

correct output
4
2 1 1 1 

view   save

user output
15
1 1 1 1 1 2 1 2 1 1 1 3 1 1 1 

view   save

Test 44

Group: 3

Verdict: WRONG ANSWER

input
1110000001

view   save

correct output
2
2 1 

view   save

user output
5
1 1 1 2 1 

view   save

Test 45

Group: 3

Verdict: WRONG ANSWER

input
0001001110

view   save

correct output
3
2 2 1 

view   save

user output
8
1 1 1 1 2 1 1 1 

view   save

Test 46

Group: 3

Verdict: WRONG ANSWER

input
0011100011

view   save

correct output
3
1 2 1 

view   save

user output
12
1 1 1 1 2 1 2 1 1 3 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: WRONG ANSWER

input
0001001000

view   save

correct output
3
2 2 1 

view   save

user output
8
1 1 1 1 2 1 1 1 

view   save

Test 49

Group: 3

Verdict: WRONG ANSWER

input
0100100010

view   save

correct output
4
2 1 1 1 

view   save

user output
8
1 2 1 1 2 1 1 1 

view   save

Test 50

Group: 3

Verdict: WRONG ANSWER

input
1100101110

view   save

correct output
4
2 1 1 1 

view   save

user output
11
2 1 1 1 2 1 1 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: WRONG ANSWER

input
0110011100

view   save

correct output
3
2 1 1 

view   save

user output
12
1 1 1 1 2 1 2 1 1 3 1 1 

view   save

Test 54

Group: 3

Verdict: WRONG ANSWER

input
0001000110

view   save

correct output
3
2 2 1 

view   save

user output
8
1 1 1 1 2 1 1 1 

view   save

Test 55

Group: 3

Verdict: WRONG ANSWER

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
16
1 2 1 1 2 1 1 1 1 3 1 1 1 2 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: RUNTIME ERROR

input
110011001100110011001100110011...
view   save

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

user output
(empty)

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

input
011100011001011111111000010110...
view   save

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

user output
(empty)

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 1 1 

view   save

Test 63

Group: 4

Verdict: WRONG ANSWER

input
1101111101

view   save

correct output
3
2 2 1 

view   save

user output
10
1 1 1 1 2 1 1 1 2 1 

view   save

Test 64

Group: 4

Verdict: WRONG ANSWER

input
1001110001

view   save

correct output
3
2 1 1 

view   save

user output
12
1 1 1 1 2 1 2 1 1 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: WRONG ANSWER

input
0010111101

view   save

correct output
4
1 1 1 1 

view   save

user output
11
1 1 1 1 2 1 1 1 2 1 1 

view   save

Test 69

Group: 4

Verdict: WRONG ANSWER

input
0011111000

view   save

correct output
2
2 1 

view   save

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

Test 71

Group: 4

Verdict: WRONG ANSWER

input
0110111000

view   save

correct output
3
2 1 1 

view   save

user output
9
1 1 1 1 2 1 2 1 1 

view   save

Test 72

Group: 4

Verdict: WRONG ANSWER

input
1100110111

view   save

correct output
3
3 2 1 

view   save

user output
QAQ

view   save

Test 73

Group: 4

Verdict: WRONG ANSWER

input
1110011111

view   save

correct output
2
2 1 

view   save

user output
5
1 1 1 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: WRONG ANSWER

input
1110110010

view   save

correct output
4
1 2 1 1 

view   save

user output
16
1 2 1 1 2 1 1 1 1 3 1 1 1 2 1 ...
view   save

Test 76

Group: 4

Verdict: RUNTIME ERROR

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 77

Group: 4

Verdict: RUNTIME ERROR

input
110011001100110011001100110011...
view   save

correct output
QAQ

view   save

user output
(empty)

Test 78

Group: 4

Verdict: RUNTIME ERROR

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: RUNTIME ERROR

input
111000110000011000001101010010...
view   save

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

user output
(empty)