CSES - Datatähti 2016 alku - Results
Submission details
Task:Bittipeli
Sender:Oispa Kaljaa
Submission time:2015-09-29 21:22:36 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
#40
Test results
testverdicttimegroup
#1ACCEPTED0.05 s1details
#20.05 s1details
#30.05 s1details
#40.06 s1details
#50.05 s1details
#60.06 s1details
#70.06 s1details
#80.06 s1details
#90.05 s1details
#100.06 s1details
#110.05 s1details
#120.05 s1details
#130.05 s1details
#140.06 s1details
#150.04 s1details
#160.06 s1details
#17ACCEPTED0.06 s1details
#180.05 s1details
#190.05 s1details
#20ACCEPTED0.05 s1details
#21ACCEPTED0.05 s2details
#220.06 s2details
#230.05 s2details
#240.06 s2details
#250.05 s2details
#260.05 s2details
#270.06 s2details
#280.06 s2details
#290.05 s2details
#300.06 s2details
#310.06 s2details
#320.06 s2details
#330.06 s2details
#340.06 s2details
#350.05 s2details
#36ACCEPTED0.09 s2details
#37ACCEPTED0.52 s2details
#38--2details
#390.05 s2details
#400.06 s2details
#41ACCEPTED0.05 s3details
#420.06 s3details
#430.05 s3details
#440.05 s3details
#450.06 s3details
#460.06 s3details
#470.06 s3details
#480.05 s3details
#490.05 s3details
#500.05 s3details
#510.05 s3details
#520.05 s3details
#530.06 s3details
#540.05 s3details
#550.06 s3details
#56--3details
#57--3details
#58--3details
#590.23 s3details
#60--3details
#61ACCEPTED0.05 s4details
#620.06 s4details
#630.05 s4details
#640.05 s4details
#650.07 s4details
#660.06 s4details
#670.06 s4details
#680.05 s4details
#690.05 s4details
#700.05 s4details
#710.06 s4details
#720.05 s4details
#730.06 s4details
#740.06 s4details
#750.06 s4details
#760.56 s4details
#770.54 s4details
#780.50 s4details
#79--4details
#800.59 s4details

Compiler report

input/code.cpp: In function 'bool hae()':
input/code.cpp:41:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i = 0; i < ans.size(); i++)
                    ^
input/code.cpp:49:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 1; i < s.size(); i++){
                   ^
input/code.cpp:56:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0; i < s.size();){
                   ^
input/code.cpp:58:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(i+le < s.size() && s[i+le] == s[i+le-1])
              ^

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;\
//tee hashsegpuu, 1 ja nolla paivitys segpuulla, alueiden yhdistys set?

//hae eri sivuilta parit toisille, katso pystyyko sisustaa poistaa??

//10100110
string s; 
int n;
vector<int> ans;
unordered_set<string> d;
int nhaku = 0;
int numit = 10000000;
bool hae(){
	//cout << "nyt: " << s << endl;
	nhaku++;
	if(nhaku > numit){
		return true;
	}
	if(d.count(s))
		return false;
	d.insert(s);
	bool okk = true;
	for(int i = 1; i < n; i++){
		if(s[i] != s[i-1])
			okk = false;
	}
	
	if(okk){
		cout << ans.size() << endl;
		for(int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << 1 << endl;
		return true;
	}
	bool re = 0;
	int num = 1;
	bool ok = false;
	for(int i = 1; i < s.size(); i++){
		if(s[i] == s[i-1])
			ok = true;
	}
	if(!ok)
		return false;
	vector<pair<pii, pair<char, int> > > haut;
	for(int i = 0; i < s.size();){
		int le = 1;
		while(i+le < s.size() && s[i+le] == s[i+le-1])
			le++;
		if(le > 1 && i!= 0 && i+le != n){

			haut.push_back({{i, le}, {s[i], num}});
			
			num++;
			if(re)
				return re;
		}
		i+=le;
		
		
	}
	random_shuffle(haut.begin(), haut.end());
	for(auto f: haut){
		ans.push_back(f.second.second);
		for(int i = f.first.first; i < f.first.first+f.first.second; i++)
			s[i] = f.second.first == '1' ? '0': '1';
		//cout << "haku: " << f.first.first << "-" << f.first.first+f.first.second << endl;
		re|=hae();

		for(int i = f.first.first; i < f.first.first+f.first.second; i++)
			s[i] = f.second.first == '1' ? '1': '0';
		ans.pop_back();
		if(re)
			return re;
	}
	return re;
}

int main(){
	srand ( unsigned ( std::time(0) ) );
	cin.sync_with_stdio(0);
	cin.tie(0);
	
	cin >> s;
	n = s.length();
	int n0 = 0, n1 = 0;
	for(int i = 0; i < n; i++){
		if(s[i] == '0')
			n0++;
		else
			n1++;
	}
	if(!hae()){
		cout << "QAQ" << endl;
	}
	if(nhaku > numit){
		cout << "QAQ" << endl;
	}
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

input
1011001010

correct output
QAQ

user output
QAQ

Test 2

Group: 1

Verdict:

input
0000001001

correct output
3
1 1 1 

user output
QAQ

Test 3

Group: 1

Verdict:

input
0111011100

correct output
3
2 1 1 

user output
2
2 1 1

Test 4

Group: 1

Verdict:

input
0100100100

correct output
4
2 1 1 1 

user output
3
2 1 1 1

Test 5

Group: 1

Verdict:

input
1110010110

correct output
4
2 1 1 1 

user output
QAQ

Test 6

Group: 1

Verdict:

input
1111110110

correct output
3
1 1 1 

user output
QAQ

Test 7

Group: 1

Verdict:

input
0011110001

correct output
3
1 2 1 

user output
QAQ

Test 8

Group: 1

Verdict:

input
0111111000

correct output
2
1 1 

user output
1
1 1

Test 9

Group: 1

Verdict:

input
1111111100

correct output
2
1 1 

user output
QAQ

Test 10

Group: 1

Verdict:

input
1000010011

correct output
3
2 1 1 

user output
2
1 1 1

Test 11

Group: 1

Verdict:

input
1101110000

correct output
3
1 1 1 

user output
QAQ

Test 12

Group: 1

Verdict:

input
1101101100

correct output
4
1 2 1 1 

user output
QAQ

Test 13

Group: 1

Verdict:

input
0100111110

correct output
3
1 1 1 

user output
2
1 1 1

Test 14

Group: 1

Verdict:

input
1101001011

correct output
4
2 2 2 1 

user output
3
1 1 1 1

Test 15

Group: 1

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

Test 16

Group: 1

Verdict:

input
0011011100

correct output
3
3 2 1 

user output
2
1 1 1

Test 17

Group: 1

Verdict: ACCEPTED

input
1100101011

correct output
QAQ

user output
QAQ

Test 18

Group: 1

Verdict:

input
1101100111

correct output
3
2 2 1 

user output
2
1 1 1

Test 19

Group: 1

Verdict:

input
0110000100

correct output
3
2 1 1 

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

input
1110010000

correct output
3
2 1 1 

user output
QAQ

Test 23

Group: 2

Verdict:

input
1001101100

correct output
4
1 1 1 1 

user output
QAQ

Test 24

Group: 2

Verdict:

input
0000000111

correct output
2
1 1 

user output
QAQ

Test 25

Group: 2

Verdict:

input
0011111110

correct output
2
2 1 

user output
1
1 1

Test 26

Group: 2

Verdict:

input
1100101100

correct output
4
2 1 1 1 

user output
QAQ

Test 27

Group: 2

Verdict:

input
0111101110

correct output
3
2 1 1 

user output
2
1 1 1

Test 28

Group: 2

Verdict:

input
0000011011

correct output
3
2 1 1 

user output
QAQ

Test 29

Group: 2

Verdict:

input
1110011101

correct output
3
3 2 1 

user output
2
2 1 1

Test 30

Group: 2

Verdict:

input
0001011011

correct output
4
1 1 1 1 

user output
QAQ

Test 31

Group: 2

Verdict:

input
0010110011

correct output
4
1 1 1 1 

user output
QAQ

Test 32

Group: 2

Verdict:

input
0011100000

correct output
2
2 1 

user output
1
1 1

Test 33

Group: 2

Verdict:

input
1110100110

correct output
4
1 1 1 1 

user output
QAQ

Test 34

Group: 2

Verdict:

input
0110110111

correct output
4
2 1 1 1 

user output
QAQ

Test 35

Group: 2

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

Test 36

Group: 2

Verdict: ACCEPTED

input
110011001100110011001010101010...

correct output
QAQ

user output
QAQ

Test 37

Group: 2

Verdict: ACCEPTED

input
110011001100110011001100101010...

correct output
QAQ

user output
QAQ

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:

input
010101010101010101010101010101...

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

user output
47
2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

Test 40

Group: 2

Verdict:

input
011010000011111011110000110011...

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

user output
22
21 14 13 6 5 7 7 8 5 9 6 2 2 1...

Test 41

Group: 3

Verdict: ACCEPTED

input
0010101000

correct output
QAQ

user output
QAQ

Test 42

Group: 3

Verdict:

input
0100010110

correct output
4
2 1 1 1 

user output
3
1 1 1 1

Test 43

Group: 3

Verdict:

input
0100110110

correct output
4
2 1 1 1 

user output
3
3 1 1 1

Test 44

Group: 3

Verdict:

input
1110000001

correct output
2
2 1 

user output
1
1 1

Test 45

Group: 3

Verdict:

input
0001001110

correct output
3
2 2 1 

user output
2
1 1 1

Test 46

Group: 3

Verdict:

input
0011100011

correct output
3
1 2 1 

user output
QAQ

Test 47

Group: 3

Verdict:

input
0100111100

correct output
3
1 1 1 

user output
2
1 1 1

Test 48

Group: 3

Verdict:

input
0001001000

correct output
3
2 2 1 

user output
2
1 1 1

Test 49

Group: 3

Verdict:

input
0100100010

correct output
4
2 1 1 1 

user output
3
2 1 1 1

Test 50

Group: 3

Verdict:

input
1100101110

correct output
4
2 1 1 1 

user output
QAQ

Test 51

Group: 3

Verdict:

input
1000111011

correct output
3
2 1 1 

user output
2
2 1 1

Test 52

Group: 3

Verdict:

input
1000111111

correct output
2
1 1 

user output
1
1 1

Test 53

Group: 3

Verdict:

input
0110011100

correct output
3
2 1 1 

user output
2
3 1 1

Test 54

Group: 3

Verdict:

input
0001000110

correct output
3
2 2 1 

user output
2
1 1 1

Test 55

Group: 3

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

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:

input
010101010101010101010101010101...

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

user output
2497
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:

input
0111001011

correct output
4
2 1 1 1 

user output
QAQ

Test 63

Group: 4

Verdict:

input
1101111101

correct output
3
2 2 1 

user output
2
1 1 1

Test 64

Group: 4

Verdict:

input
1001110001

correct output
3
2 1 1 

user output
2
1 1 1

Test 65

Group: 4

Verdict:

input
1000000011

correct output
2
1 1 

user output
1
1 1

Test 66

Group: 4

Verdict:

input
0100010111

correct output
4
1 1 1 1 

user output
QAQ

Test 67

Group: 4

Verdict:

input
0100111010

correct output
4
2 1 1 1 

user output
3
2 1 1 1

Test 68

Group: 4

Verdict:

input
0010111101

correct output
4
1 1 1 1 

user output
QAQ

Test 69

Group: 4

Verdict:

input
0011111000

correct output
2
2 1 

user output
1
1 1

Test 70

Group: 4

Verdict:

input
1101001101

correct output
4
2 2 2 1 

user output
3
1 1 1 1

Test 71

Group: 4

Verdict:

input
0110111000

correct output
3
2 1 1 

user output
2
1 1 1

Test 72

Group: 4

Verdict:

input
1100110111

correct output
3
3 2 1 

user output
2
2 1 1

Test 73

Group: 4

Verdict:

input
1110011111

correct output
2
2 1 

user output
1
1 1

Test 74

Group: 4

Verdict:

input
1011000101

correct output
4
2 1 1 1 

user output
3
2 1 1 1

Test 75

Group: 4

Verdict:

input
1110110010

correct output
4
1 2 1 1 

user output
QAQ

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)