Bittipeli

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

#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;
string s; 
int n;
vector<int> ans;
unordered_set<string> d;
int hnum = 1000000;
int cc = 0;
bool hae(string s, int n0, int n1){
	cc++;
	if(cc > hnum)
		return true;
	if(d.count(s))
		return false;
	d.insert(s);
	if(n0 == 1 || n1 == 1)
		return false;
	//cout << "nyt: " << s << endl;
	if(s.size() == 0){
		cout << ans.size() << endl;
		for(int i = 0; i < ans.size(); i++)
			cout << ans[i] << " ";
		cout << 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<pair<pii, pii>, pii> > 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){

			
			if(s[i] == '1'){
				haut.push_back({{{num, i}, {i+le, s.size()-(i+le)}}, {n0, n1-le}});
				//re|=hae(s.substr(0, i)+s.substr(i+le, s.size()-(i+le)), n0, n1-le);
			}
			else{
				haut.push_back({{{num, i}, {i+le, s.size()-(i+le)}}, {n0-le, n1}});
				//re|=hae(s.substr(0, i)+s.substr(i+le, s.size()-(i+le)), n0-le, n1);
			}
			
			
			num++;
			if(re)
				return re;
		}
		i+=le;
		
		
	}
	random_shuffle(haut.begin(), haut.end());
	for(auto f: haut){
		ans.push_back(f.first.first.first);
		re|=hae(s.substr(0, f.first.first.second)+s.substr(f.first.second.first, f.first.second.second), f.second.first, f.second.second);
		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(s, n0, n1)){
		cout << "QAQ" << endl;
	}
	if(cc > hnum){
		cout << "QAQ" << endl;
	}
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 1

Verdict: ACCEPTED

Test 7

Group: 1

Verdict: ACCEPTED

Test 8

Group: 1

Verdict: ACCEPTED

Test 9

Group: 1

Verdict: ACCEPTED

Test 10

Group: 1

Verdict: ACCEPTED

Test 11

Group: 1

Verdict: ACCEPTED

Test 12

Group: 1

Verdict: ACCEPTED

Test 13

Group: 1

Verdict: ACCEPTED

Test 14

Group: 1

Verdict: ACCEPTED

Test 15

Group: 1

Verdict: ACCEPTED

Test 16

Group: 1

Verdict: ACCEPTED

Test 17

Group: 1

Verdict: ACCEPTED

Test 18

Group: 1

Verdict: ACCEPTED

Test 19

Group: 1

Verdict: ACCEPTED

Test 20

Group: 1

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: ACCEPTED

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: ACCEPTED

Test 24

Group: 2

Verdict: ACCEPTED

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: ACCEPTED

Test 27

Group: 2

Verdict: ACCEPTED

Test 28

Group: 2

Verdict: ACCEPTED

Test 29

Group: 2

Verdict: ACCEPTED

Test 30

Group: 2

Verdict: ACCEPTED

Test 31

Group: 2

Verdict: ACCEPTED

Test 32

Group: 2

Verdict: ACCEPTED

Test 33

Group: 2

Verdict: ACCEPTED

Test 34

Group: 2

Verdict: ACCEPTED

Test 35

Group: 2

Verdict: ACCEPTED

Test 36

Group: 2

Verdict: ACCEPTED

Test 37

Group: 2

Verdict: ACCEPTED

Test 38

Group: 2

Verdict: WRONG ANSWER

Test 39

Group: 2

Verdict: ACCEPTED

Test 40

Group: 2

Verdict: ACCEPTED

Test 41

Group: 3

Verdict: ACCEPTED

Test 42

Group: 3

Verdict: ACCEPTED

Test 43

Group: 3

Verdict: ACCEPTED

Test 44

Group: 3

Verdict: ACCEPTED

Test 45

Group: 3

Verdict: ACCEPTED

Test 46

Group: 3

Verdict: ACCEPTED

Test 47

Group: 3

Verdict: ACCEPTED

Test 48

Group: 3

Verdict: ACCEPTED

Test 49

Group: 3

Verdict: ACCEPTED

Test 50

Group: 3

Verdict: ACCEPTED

Test 51

Group: 3

Verdict: ACCEPTED

Test 52

Group: 3

Verdict: ACCEPTED

Test 53

Group: 3

Verdict: ACCEPTED

Test 54

Group: 3

Verdict: ACCEPTED

Test 55

Group: 3

Verdict: ACCEPTED

Test 56

Group: 3

Verdict: RUNTIME ERROR

Test 57

Group: 3

Verdict: RUNTIME ERROR

Test 58

Group: 3

Verdict: RUNTIME ERROR

Test 59

Group: 3

Verdict: ACCEPTED

Test 60

Group: 3

Verdict: ACCEPTED

Test 61

Group: 4

Verdict: ACCEPTED

Test 62

Group: 4

Verdict: ACCEPTED

Test 63

Group: 4

Verdict: ACCEPTED

Test 64

Group: 4

Verdict: ACCEPTED

Test 65

Group: 4

Verdict: ACCEPTED

Test 66

Group: 4

Verdict: ACCEPTED

Test 67

Group: 4

Verdict: ACCEPTED

Test 68

Group: 4

Verdict: ACCEPTED

Test 69

Group: 4

Verdict: ACCEPTED

Test 70

Group: 4

Verdict: ACCEPTED

Test 71

Group: 4

Verdict: ACCEPTED

Test 72

Group: 4

Verdict: ACCEPTED

Test 73

Group: 4

Verdict: ACCEPTED

Test 74

Group: 4

Verdict: ACCEPTED

Test 75

Group: 4

Verdict: ACCEPTED

Test 76

Group: 4

Verdict: RUNTIME ERROR

Test 77

Group: 4

Verdict: RUNTIME ERROR

Test 78

Group: 4

Verdict: RUNTIME ERROR

Test 79

Group: 4

Verdict: RUNTIME ERROR

Test 80

Group: 4

Verdict: RUNTIME ERROR