CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:hugo-hur
Submission time:2015-10-10 19:27:37 +0300
Language:C++
Status:READY
Result:11
Feedback
groupverdictscore
#1ACCEPTED11
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#2ACCEPTED0.05 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.04 s1details
#5ACCEPTED0.05 s1details
#6ACCEPTED0.06 s1details
#7ACCEPTED0.06 s1details
#8ACCEPTED0.06 s1details
#9ACCEPTED0.10 s1details
#10ACCEPTED0.05 s1details
#11ACCEPTED0.06 s1details
#12ACCEPTED0.06 s1details
#13ACCEPTED0.06 s1details
#14ACCEPTED0.06 s1details
#15ACCEPTED0.05 s1details
#16ACCEPTED0.06 s1details
#17ACCEPTED0.06 s1details
#18ACCEPTED0.05 s1details
#19ACCEPTED0.05 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.05 s2details
#22ACCEPTED0.05 s2details
#23ACCEPTED0.05 s2details
#24ACCEPTED0.06 s2details
#25ACCEPTED0.06 s2details
#26ACCEPTED0.05 s2details
#27ACCEPTED0.06 s2details
#28ACCEPTED0.06 s2details
#290.06 s2details
#30ACCEPTED0.06 s2details
#31ACCEPTED0.06 s2details
#32ACCEPTED0.06 s2details
#33ACCEPTED0.05 s2details
#34ACCEPTED0.05 s2details
#35ACCEPTED0.06 s2details
#36--2details
#37--2details
#38--2details
#39ACCEPTED0.05 s2details
#40ACCEPTED0.05 s2details
#41ACCEPTED0.06 s3details
#42ACCEPTED0.06 s3details
#43ACCEPTED0.05 s3details
#44ACCEPTED0.05 s3details
#450.06 s3details
#46ACCEPTED0.05 s3details
#47ACCEPTED0.05 s3details
#48ACCEPTED0.05 s3details
#49ACCEPTED0.05 s3details
#50ACCEPTED0.05 s3details
#51ACCEPTED0.06 s3details
#52ACCEPTED0.05 s3details
#53ACCEPTED0.05 s3details
#540.05 s3details
#55ACCEPTED0.06 s3details
#56--3details
#57--3details
#580.21 s3details
#59ACCEPTED0.17 s3details
#600.28 s3details
#61ACCEPTED0.05 s4details
#62ACCEPTED0.07 s4details
#63ACCEPTED0.06 s4details
#64ACCEPTED0.06 s4details
#65ACCEPTED0.05 s4details
#66ACCEPTED0.05 s4details
#67ACCEPTED0.06 s4details
#68ACCEPTED0.05 s4details
#69ACCEPTED0.06 s4details
#70ACCEPTED0.06 s4details
#71ACCEPTED0.06 s4details
#72ACCEPTED0.05 s4details
#73ACCEPTED0.05 s4details
#74ACCEPTED0.05 s4details
#75ACCEPTED0.06 s4details
#760.23 s4details
#770.29 s4details
#780.22 s4details
#79--4details
#800.34 s4details

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 long trueSetLen = 0;
	unsigned long 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 (bits.size() < 2){
		return beginSets;
	}
	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;
	}
	

	for (unsigned long 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;
		}
	}
	//TODO take smaller than maximum removable blocks into account
	/*for (unsigned long i = 0; i < beginSets.size(); i++){
		vector<bool> b = beginSets.at(i);
		if (b.size() > 2){
			vector<bool> v;
			v.resize(b.size() - 1, b.front());
			beginSets.push_back(v);
		}
	}*/
	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 long depth, unsigned long i){
		this->depth = depth; this->i = i; leadsToSuccess = false;
	}
	operator bool() const {
		return this->leadsToSuccess;
	}
	unsigned long depth, i;
	bool leadsToSuccess;
};
bool LeadsToSuccess(Tracker t){
	return t.leadsToSuccess;
}
vector<Tracker> possiblePaths(Tracker* t, vector<bool> in, vector<vector<bool> > remSets){
	vector<bool> copy = in;
	vector<Tracker> paths;
	for (unsigned long 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
		auto rs = removableSets(remOut);
		vector<Tracker> newPaths = possiblePaths(&(paths.back()), remOut, rs);
		if (!newPaths.empty()){
			if (std::find(newPaths.begin(), newPaths.end(), true) != newPaths.end()){
				t->leadsToSuccess = true;
				//paths.back().leadsToSuccess = true;
				paths.insert(paths.end(), newPaths.begin(), newPaths.end());
				return paths;
			}
		}
	}
	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: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict: ACCEPTED

input
0000001001

correct output
3
1 1 1 

user output
3
1 1 1 

Test 3

Group: 1

Verdict: ACCEPTED

input
0111011100

correct output
3
2 1 1 

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

Test 6

Group: 1

Verdict: ACCEPTED

input
1111110110

correct output
3
1 1 1 

user output
3
1 1 1 

Test 7

Group: 1

Verdict: ACCEPTED

input
0011110001

correct output
3
1 2 1 

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

Test 11

Group: 1

Verdict: ACCEPTED

input
1101110000

correct output
3
1 1 1 

user output
3
1 1 1 

Test 12

Group: 1

Verdict: ACCEPTED

input
1101101100

correct output
4
1 2 1 1 

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

Test 15

Group: 1

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

user output
4
1 2 1 1 

Test 16

Group: 1

Verdict: ACCEPTED

input
0011011100

correct output
3
3 2 1 

user output
4
1 1 1 1 

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict: ACCEPTED

input
1101100111

correct output
3
2 2 1 

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

input
0000101000

correct output
QAQ

user output
QAQ

Test 21

Group: 2

Verdict: ACCEPTED

input
1110010100

correct output
QAQ

user output
QAQ

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

input
1110011101

correct output
3
3 2 1 

user output
QAQ

Test 30

Group: 2

Verdict: ACCEPTED

input
0001011011

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 31

Group: 2

Verdict: ACCEPTED

input
0010110011

correct output
4
1 1 1 1 

user output
4
1 1 1 1 

Test 32

Group: 2

Verdict: ACCEPTED

input
0011100000

correct output
2
2 1 

user output
3
1 1 1 

Test 33

Group: 2

Verdict: ACCEPTED

input
1110100110

correct output
4
1 1 1 1 

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

input
110011001100110011001100110011...

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

user output
(empty)

Test 39

Group: 2

Verdict: ACCEPTED

input
010101010101010101010101010101...

correct output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
48
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 40

Group: 2

Verdict: ACCEPTED

input
011010000011111011110000110011...

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

user output
28
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

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

Test 44

Group: 3

Verdict: ACCEPTED

input
1110000001

correct output
2
2 1 

user output
2
2 1 

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
4
2 1 1 1 

Test 46

Group: 3

Verdict: ACCEPTED

input
0011100011

correct output
3
1 2 1 

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

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
QAQ

Test 55

Group: 3

Verdict: ACCEPTED

input
1110110010

correct output
4
1 2 1 1 

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

input
110011001100110011001100110011...

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

user output
(empty)

Test 59

Group: 3

Verdict: ACCEPTED

input
010101010101010101010101010101...

correct output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

user output
2498
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 60

Group: 3

Verdict:

input
011100011001011111111000010110...

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

user output
(empty)

Test 61

Group: 4

Verdict: ACCEPTED

input
1110101110

correct output
QAQ

user output
QAQ

Test 62

Group: 4

Verdict: ACCEPTED

input
0111001011

correct output
4
2 1 1 1 

user output
4
2 1 1 1 

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

Test 69

Group: 4

Verdict: ACCEPTED

input
0011111000

correct output
2
2 1 

user output
3
1 1 1 

Test 70

Group: 4

Verdict: ACCEPTED

input
1101001101

correct output
4
2 2 2 1 

user output
4
2 2 2 1 

Test 71

Group: 4

Verdict: ACCEPTED

input
0110111000

correct output
3
2 1 1 

user output
4
1 1 1 1 

Test 72

Group: 4

Verdict: ACCEPTED

input
1100110111

correct output
3
3 2 1 

user output
4
1 2 1 1 

Test 73

Group: 4

Verdict: ACCEPTED

input
1110011111

correct output
2
2 1 

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