Arpakuutiot

input/code.cpp: In function 'int main()':
input/code.cpp:52:17: warning: array subscript has type 'char' [-Wchar-subscripts]
    z[get<0>(tu1)]++;
                 ^
input/code.cpp:100:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int p = 0; p < u1.size(); p++){
                   ~~^~~~~~~~~~~
input/code.cpp:104:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(p != u1.size()-1){
         ~~^~~~~~~~~~~~~~
input/code.cpp:38:7: warning: 'sx' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int sx, sy;
       ^~
input/code.cpp:38:11: warning: 'sy' may be used uninitialized in this function [-Wmaybe-uninitialized]
   int sx, sy;
           ^~

#include <bits/stdc++.h>
#include <cstring>

using namespace std;

std::vector<std::pair<char,int>> w;


char arr[25];
void h(int x, int y, bool a, bool b){
	if(x < 0 || x > 4 || y < 0 || y > 4) return;
	int z = y*5+x;
	if(arr[z] == '.') return;
	w.push_back(std::make_pair((char)(int)a+(int)(b*2),arr[y*5+x]-48));
	arr[z] = '.';
	h(x-1, y, a, !b);
	h(x+1, y, a, !b);
	h(x, y-1, !a, b);
	h(x, y+1, !a, b);
}

int main(){
	int n;
	std::cin >> n;

	int mm[n];
	map<int, vector<int>> m;
	for(int t = 0; t < n; t++){
		for(int i = 0; i < 5; i++) {
			std::string str;
			std::cin >> str;


			strncpy(arr+5*i, str.c_str(), 5);
		}

		w.clear();
		int sx, sy;
		for(int i = 0; i < 25; i++){
			if(arr[i] != '.'){
				sx = i%5;
				sy = (i-sx)/5;
				break;
			}
		}

		h(sx, sy, 0, 0);
		sort(w.begin(), w.end());
		char z[4] = {0};
		for(int i = 0; i < 6; i++){
			pair<char,int> tu1 = w[i];
			z[get<0>(tu1)]++;
		}
		char so = -1, sn;
		for(int i = 0; i < 4; i++){
			if(z[i]&1){
				for(int p = i+1; p < 4; p++){
					if(z[p]&1){
						so = i, sn = p;
						break;
					}
				}
				break;
			}
		}

		if(so != -1) for(int i = 0; i < 6; i++) {
			pair<char, int> tu1 = w[i];
			if(tu1.first == (char)so){
				w[i] = make_pair(sn, tu1.second);
				break;
			}
		}
		sort(w.begin(), w.end());

		pair<int,int> v[3];
		for(int i = 0; i < 6; i+=2){
			int a = w[i].second, b = w[i+1].second;
			if(a > b) swap(a,b);

			v[i/2] = make_pair(a,b);
		}
		sort(v, v+3);

		int u = v[0].first + v[0].second*6 + (v[1].first + v[1].second * 6) * 1000 + (v[2].first + v[2].second * 6) * 1000000;
		mm[t] = u;
		auto it = m.find(u);
		if(it == m.end()){
			vector<int> u1 = {t};
			m[u] = u1;
		} else {
			(*it).second.push_back(t);
		}
	}
	for(int i = 0; i < n; i++){
		vector<int> u1 = (*(m.find(mm[i]))).second;
		if(u1.size() == 1){
			cout << "-" << endl;
		} else {
			for(int p = 0; p < u1.size(); p++){
				int u2 = u1[p];
				if(u2 != i){
					cout << (1+u2);
					if(p != u1.size()-1){
						cout << " ";
					}
				}
			}
			cout << endl;
		}
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 1, 2

Verdict: ACCEPTED

Test 7

Group: 1, 2

Verdict: ACCEPTED

Test 8

Group: 1, 2

Verdict: ACCEPTED

Test 9

Group: 1, 2

Verdict: ACCEPTED

Test 10

Group: 1, 2

Verdict: ACCEPTED

Test 11

Group: 2

Verdict: WRONG ANSWER

Test 12

Group: 2

Verdict: WRONG ANSWER

Test 13

Group: 2

Verdict: WRONG ANSWER

Test 14

Group: 2

Verdict: WRONG ANSWER

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: WRONG ANSWER

Test 20

Group: 2

Verdict: WRONG ANSWER

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: WRONG ANSWER

Test 23

Group: 2

Verdict: WRONG ANSWER

Test 24

Group: 2

Verdict: WRONG ANSWER

Test 25

Group: 2

Verdict: ACCEPTED

Test 26

Group: 2

Verdict: WRONG ANSWER

Test 27

Group: 2

Verdict: WRONG ANSWER

Test 28

Group: 2

Verdict: WRONG ANSWER

Test 29

Group: 2

Verdict: WRONG ANSWER

Test 30

Group: 2

Verdict: WRONG ANSWER

Test 31

Group: 1, 2

Verdict: WRONG ANSWER