Arpakuutiot

input/code.cpp: In function 'int main()':
input/code.cpp:165:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for(int p = 0; p < u1.size(); p++){
                   ~~^~~~~~~~~~~
input/code.cpp:169:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
      if(p != u1.size()-1){
         ~~^~~~~~~~~~~~~~

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

using namespace std;

#define trulse false

char arr[25];
vector<pair<int,int>> z(){
	vector<pair<int,int>> v(0);

	set<int> nn = {1,2,3,4,5,6};

	for(int y = 1; y < 4; y++){
		for(int x = 0; x < 4; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index+1] != '.'){
				int index2 = (y-1)*5+x;
				if(arr[index2] != '.'){
					int index3 = (y+1)*5+x+1;
					if(arr[index3] != '.'){
						/*
						 * A
						 * XX
						 *  B
						 */
						int a = arr[index2]-48, b = arr[index3]-48;
						nn.erase(a);nn.erase(b);
						//cout << "CASE A X:" << x << " Y:" << y << endl;
						if(a > b) swap(a,b);
						v.push_back(make_pair(a,b));
					}
				} else {
					index2++;
					if(arr[index2] != '.'){
						int index3 = (y+1)*5+x;
						if(arr[index3] != '.'){
							/*
							 *  A
							 * XX
							 * B
							 */

							//cout << "CASE B X:" << x << " Y:" << y << endl;
							int a = arr[index2]-48, b = arr[index3]-48;
							nn.erase(a);nn.erase(b);
							if(a > b) swap(a,b);
							v.push_back(make_pair(a,b));
						}
					}
				}
			}
		}
	}

	for(int y = 0; y < 4; y++){
		for(int x = 1; x < 4; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index+5] != '.'){
				int index2 = index-1;//A
				if(arr[index2] != '.'){
					int index3 = (y+1)*5+x+1;//B
					if(arr[index3] != '.'){
						/*
						 * A?
						 *  XB
						 */
						int a = arr[index2]-48, b = arr[index3]-48;
						//cout << "CASE A2 X:" << x << " Y:" << y << endl;
						nn.erase(a);nn.erase(b);
						if(a > b) swap(a,b);
						v.push_back(make_pair(a,b));
					}
				} else {
					index2+=5;//A
					if(arr[index2] != '.'){
						int index3 = y*5+x+1;//B
						if(arr[index3] != '.'){
							/*
							 *  XB
							 * AX
							 */

							//cout << "CASE B2 X:" << x << " Y:" << y << endl;
							int a = arr[index2]-48, b = arr[index3]-48;
							nn.erase(a);nn.erase(b);
							if(a > b) swap(a,b);
							v.push_back(make_pair(a,b));
						}
					}
				}
			}
		}
	}

	for(int y = 1; y < 4; y++){
		for(int x = 0; x < 5; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index-5] != '.' && arr[index+5] != '.'){
				int a = arr[index-5]-48, b = arr[index+5]-48;
				nn.erase(a);nn.erase(b);
				if(a > b) swap(a,b);
				v.push_back(make_pair(a,b));
			}
		}
	}

	for(int y = 0; y < 5; y++){
		for(int x = 1; x < 4; x++){
			int index = y*5+x;
			if(arr[index] != '.' && arr[index-1] != '.' && arr[index+1] != '.'){
				int a = arr[index-1]-48, b = arr[index+1]-48;
				nn.erase(a);nn.erase(b);
				if(a > b) swap(a,b);
				v.push_back(make_pair(a,b));
			}
		}
	}

	if(nn.size() == 2){
		int a = *nn.begin();
		int b = *prev(nn.end());
		v.push_back(make_pair(a,b));
	}

	return v;
}
int main(){
	int n;
	cin >> n;

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

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

		//cout << "a" << t << endl;
		vector<pair<int,int>> p = z();
		sort(p.begin(), p.end());
		/*for(pair<int,int> v: z()){
			cout << v.first << " - " << v.second << endl;
		}*/
		int u = p[0].first + p[0].second*6 + (p[1].first + p[1].second * 6) * 1000 + (p[2].first + p[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: ACCEPTED

Test 12

Group: 2

Verdict: ACCEPTED

Test 13

Group: 2

Verdict: ACCEPTED

Test 14

Group: 2

Verdict: ACCEPTED

Test 15

Group: 2

Verdict: ACCEPTED

Test 16

Group: 2

Verdict: ACCEPTED

Test 17

Group: 2

Verdict: ACCEPTED

Test 18

Group: 2

Verdict: ACCEPTED

Test 19

Group: 2

Verdict: ACCEPTED

Test 20

Group: 2

Verdict: ACCEPTED

Test 21

Group: 2

Verdict: WRONG ANSWER

Test 22

Group: 2

Verdict: ACCEPTED

Test 23

Group: 2

Verdict: WRONG ANSWER

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

Test 30

Group: 2

Verdict: WRONG ANSWER

Test 31

Group: 1, 2

Verdict: WRONG ANSWER