Arpakuutiot

input/code.cpp: In function 'char areaSearch(bool, int, int)':
input/code.cpp:85:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^
input/code.cpp: In function 'int main()':
input/code.cpp:158:36: warning: 'start_y' may be used uninitialized in this function [-Wmaybe-uninitialized]
   new_opposite.push_back(areaSearch(FourInRow, start_x, start_y));
                          ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:158:36: warning: 'start_x' may be used uninitialized in this function [-Wmaybe-uninitialized]

#include <iostream>
#include <iomanip>
#include <sstream>
#include <string>
#include <sstream>
#include <vector>
#include <string>
#include <algorithm>
#include <bits/stdc++.h> 
#define lint long long int
 
using namespace std;

	//Moves
	int primary_x[] = {-2,2,0,0};
	int primary_y[] = {0,0,-2,2};
	
	int FourRow_x[] = {-1,-1,  1, 1,-2,-2, 2, 2};
	int FourRow_y[] = {-2, 2, -2, 2,-2, 2,-2, 2};
	
	int NoFourRow_x[] = {-2, -2, 2, 2};
	int NoFourRow_y[] = {-1, 1, -1, 1};
	
	int NewTarget_x[] = {-1,1,0,0};
	int NewTarget_y[] = {0,0,-1,1};
	
	int NewFriend_x;
	int NewFriend_y;
	
	char Dice_Grid[5][5];

//THIS FUNCTION SEARCHES THE INPUT AND FINDS THE OPPOSITE NUMBERS
char areaSearch(bool FourInRow, int start_x, int start_y)
{
	int index_x;
	int index_y;
	for(int i = 0; i < 4; i++)
	{
		index_x = start_x + NewTarget_x[i];
		index_y = start_y + NewTarget_y[i];
		if(index_x < 0 || index_x > 4 || index_y < 0 || index_y > 4) {
			continue;
		}
		char gridChar = Dice_Grid[index_x][index_y];
		if(gridChar != '.')
		{
			NewFriend_x = index_x;
			NewFriend_y = index_y;
		}	
	}
	for(int i = 0; i < 4; i++)
	{
		index_x = start_x + primary_x[i];
		index_y = start_y + primary_y[i];
		if(index_x < 0 || index_x > 4 || index_y < 0 || index_y > 4) {
			continue;
		}
		char gridChar = Dice_Grid[index_x][index_y];
		if(gridChar != '.')
		{
			return gridChar;
		}	
	}
	for(int i = 0; i < 8; i++)
	{
		if(FourInRow)
		{
			index_x = start_x + FourRow_x[i];
			index_y = start_y + FourRow_y[i];
		}
		else
		{
			index_x = start_x + NoFourRow_x[i];
			index_y = start_y + NoFourRow_y[i];
		}
		if(index_x < 0 || index_x > 4 || index_y < 0 || index_y > 4) {
			continue;
		}
		char gridChar = Dice_Grid[index_x][index_y];
		if(gridChar != '.')
		{
			return gridChar;
		}
	}	
}

bool AreSame(string x, string y)
{
	string part1 = y.substr(0,2);
	string part2 = y.substr(2,2);
	string part3 = y.substr(4,2);
	string parts[] = {part1,part2,part3};
	
	
	bool one = false;
	bool two = false;
	for(int i = 0; i < 3; i++)
	{
		if(parts[i].find(x[0])!=string::npos && parts[i].find(x[1])!=string::npos)
		{
			one = true;
		}
		if(parts[i].find(x[2])!=string::npos && parts[i].find(x[3])!=string::npos)
		{
			two = true;
		}
	}
	return one && two;
}

int main()
{
	int n;
	cin >> n;
	string Dice_Opposites[n];
	
	int start_x;
	int start_y;
	bool startPointDeclared = false;
	
	//INPUT ALL DICE THEN ADD ONE BY ONE TO ARRAY
	for(int main = 0; main < n; main++)
	{
		std::string new_opposite = "";
		bool FourInRow = false;
		int FourRowChecker = 0;
		startPointDeclared = false;
		for(int y = 0; y < 5; y++)
		for(int x = 0; x < 5; x++)
		{
			char currentChar;
			cin >> currentChar;
			Dice_Grid[x][y] = currentChar;
			
			if(FourRowChecker > 3)
			{
				FourInRow = true;
				continue;
			}	
			else if(currentChar != '.')
			{
				FourRowChecker++;
				if(!startPointDeclared)
				{
					start_x = x;
					start_y = y;
					startPointDeclared = true;
				}
			}
			else
			{
				FourRowChecker = 0;
			}
			
		}
		
		new_opposite.push_back(Dice_Grid[start_x][start_y]);
		new_opposite.push_back(areaSearch(FourInRow, start_x, start_y));
		
		int temp1 = NewFriend_x;
		int temp2 = NewFriend_y;
		
		new_opposite.push_back(Dice_Grid[temp1][temp2]);
		new_opposite.push_back(areaSearch(FourInRow, temp1, temp2));
		
		string numbers = "123456";
		for(int i = 0; i < 6; i++)
		{
			if(new_opposite.find(numbers[i]) == string::npos)
			{
				new_opposite.push_back(numbers[i]);
			}
		}
		Dice_Opposites[main] = new_opposite;
	}
	//At this point we have all opposites
	bool Empty = true;
	for(int i = 0; i < n; i++)
	{
		Empty = true;
		for(int j = 0; j < n; j++)
		{
			if(j==i) continue;
			
			if(AreSame(Dice_Opposites[i], Dice_Opposites[j]))
			{
				Empty = false;
				cout << j+1 << " "; 
			}		
		}
		if(Empty)
		{
			cout << "-";
		}
		cout << endl;
	}
	return 0;

}

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

Test 16

Group: 2

Verdict: WRONG ANSWER

Test 17

Group: 2

Verdict: WRONG ANSWER

Test 18

Group: 2

Verdict: WRONG ANSWER

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

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