CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:Kertor
Submission time:2020-10-11 20:43:09 +0300
Language:C++ (C++11)
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2details
#2ACCEPTED0.01 s1, 2details
#3ACCEPTED0.01 s1, 2details
#4ACCEPTED0.01 s1, 2details
#5ACCEPTED0.01 s1, 2details
#6ACCEPTED0.01 s1, 2details
#7ACCEPTED0.01 s1, 2details
#8ACCEPTED0.01 s1, 2details
#9ACCEPTED0.01 s1, 2details
#10ACCEPTED0.01 s1, 2details
#110.01 s2details
#120.01 s2details
#130.01 s2details
#140.01 s2details
#150.01 s2details
#160.01 s2details
#170.01 s2details
#180.01 s2details
#190.01 s2details
#200.01 s2details
#210.01 s2details
#220.01 s2details
#230.01 s2details
#240.01 s2details
#250.01 s2details
#260.01 s2details
#270.01 s2details
#280.01 s2details
#290.01 s2details
#300.01 s2details
#310.01 s1, 2details

Code

#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;
		}
	}	
	return 'n';
}

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 = 0;
	int start_y = 0;
	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
	cout << endl;
	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 details

Test 1

Group: 1, 2

Verdict: ACCEPTED

input
3
165..
.4...
.3...
.2...
...

correct output
3
-
1

user output


-

Test 2

Group: 1, 2

Verdict: ACCEPTED

input
5
264..
.5...
.3...
.1...
...

correct output
3
4 5
1
2 5
2 4

user output


4 5 

2 5 
...

Test 3

Group: 1, 2

Verdict: ACCEPTED

input
5
152..
.4...
.3...
.6...
...

correct output
3 5
4
1 5
2
1 3

user output

3 5 

1 5 

...

Test 4

Group: 1, 2

Verdict: ACCEPTED

input
5
142..
.6...
.3...
.5...
...

correct output
4 5
3
2
1 5
1 4

user output

4 5 


1 5 
...

Test 5

Group: 1, 2

Verdict: ACCEPTED

input
5
123..
.4...
.6...
.5...
...

correct output
3
4 5
1
2 5
2 4

user output


4 5 

2 5 
...

Test 6

Group: 1, 2

Verdict: ACCEPTED

input
5
213..
.6...
.4...
.5...
...

correct output
4 5
3
2
1 5
1 4

user output

4 5 


1 5 
...

Test 7

Group: 1, 2

Verdict: ACCEPTED

input
5
314..
.5...
.2...
.6...
...

correct output
3
4 5
1
2 5
2 4

user output


4 5 

2 5 
...

Test 8

Group: 1, 2

Verdict: ACCEPTED

input
5
163..
.2...
.5...
.4...
...

correct output
4 5
3
2
1 5
1 4

user output

4 5 


1 5 
...

Test 9

Group: 1, 2

Verdict: ACCEPTED

input
5
264..
.1...
.3...
.5...
...

correct output
2 3
1 3
1 2
5
4

user output

2 3 
1 3 
1 2 

...

Test 10

Group: 1, 2

Verdict: ACCEPTED

input
5
214..
.3...
.5...
.6...
...

correct output
5
3 4
2 4
2 3
1

user output


3 4 
2 4 
2 3 
...

Test 11

Group: 2

Verdict:

input
10
.41..
.5...
.2...
36...
...

correct output
9
4 6 8
7 10
2 6 8
-
...

user output



-
-
...

Test 12

Group: 2

Verdict:

input
10
5....
1436.
.2...
.....
...

correct output
5 8
6 10
4 7 9
3 7 9
1 8
...

user output

-
-
4 7 
3 7 
...

Test 13

Group: 2

Verdict:

input
10
2....
41...
.63..
.5...
...

correct output
4 9 10
5 6 7 8
-
1 9 10
2 6 7 8
...

user output

-

-
-
...

Test 14

Group: 2

Verdict:

input
10
1....
634..
..52.
.....
...

correct output
2 3 4 5 6 9 10
1 3 4 5 6 9 10
1 2 4 5 6 9 10
1 2 3 5 6 9 10
1 2 3 4 6 9 10
...

user output

-
-

2 6 
...

Test 15

Group: 2

Verdict:

input
10
.2...
4516.
3....
.....
...

correct output
5 7 9 10
8
4 6
3 6
1 7 9 10
...

user output

5 7 

4 6 
3 6 
...

Test 16

Group: 2

Verdict:

input
10
.56..
.2...
.4...
31...
...

correct output
4 9
3 5 10
2 5 10
1 9
2 3 10
...

user output

4 5 



...

Test 17

Group: 2

Verdict:

input
10
..62.
.31..
45...
.....
...

correct output
2 3 4 8
1 3 4 8
1 2 4 8
1 2 3 8
6 7 9 10
...

user output

-
-
-
1 3 8 
...

Test 18

Group: 2

Verdict:

input
10
532..
.4...
.1...
.6...
...

correct output
3 8 9
5 6
1 8 9
7 10
2 6
...

user output

8 9 10 
5 6 
-

...

Test 19

Group: 2

Verdict:

input
10
.64..
.1...
.3...
52...
...

correct output
2 5 6 7 8 9
1 5 6 7 8 9
4 10
3 10
1 2 6 7 8 9
...

user output

5 9 
-
-
10 
...

Test 20

Group: 2

Verdict:

input
10
.4...
326..
.1...
.5...
...

correct output
4 7 8
6 9 10
5
1 7 8
3
...

user output


6 9 

-
...

Test 21

Group: 2

Verdict:

input
20
.6...
.4...
31...
.25..
...

correct output
3 7 11 16
6
1 7 11 16
5 19
4 19
...

user output

6 7 
-
11 
-
...

Test 22

Group: 2

Verdict:

input
20
3....
5614.
..2..
.....
...

correct output
7 10 11 17 20
12
4 9 13 15 18
3 9 13 15 18
8 14 16
...

user output

2 7 10 13 17 
13 
-
3 9 18 
...

Test 23

Group: 2

Verdict:

input
20
42...
.316.
.5...
.....
...

correct output
5 12 13 15 18
16 20
6 8 14
9 19
1 12 13 15 18
...

user output

12 15 
-
6 8 14 
-
...

Test 24

Group: 2

Verdict:

input
20
..5..
.623.
41...
.....
...

correct output
2 6 11 12 13
1 6 11 12 13
5 16 18
7 14
3 16 18
...

user output

-
-
-
7 14 
...
Truncated

Test 25

Group: 2

Verdict:

input
20
.46..
53...
.1...
.2...
...

correct output
2 3 5 7 15 17 19
1 3 5 7 15 17 19
1 2 5 7 15 17 19
8 10 11 14
1 2 3 7 15 17 19
...

user output

2 3 7 11 15 
1 3 7 15 
1 2 7 15 
8 10 14 
...
Truncated

Test 26

Group: 2

Verdict:

input
20
.61..
.4...
35...
.2...
...

correct output
8 10 20
3 17 18 19
2 17 18 19
14 15
6 7 9 13
...

user output

8 10 
20 
17 19 
-
...
Truncated

Test 27

Group: 2

Verdict:

input
20
..2..
1463.
.5...
.....
...

correct output
2 3 5 6 9 20
1 3 5 6 9 20
1 2 5 6 9 20
11 19
1 2 3 6 9 20
...

user output

6 12 20 
-
-
11 18 19 
...
Truncated

Test 28

Group: 2

Verdict:

input
20
...4.
5132.
6....
.....
...

correct output
2 8 10 12 13 19
1 8 10 12 13 19
4 5 15 16 17
3 5 15 16 17
3 4 15 16 17
...

user output

-
8 10 12 19 
4 5 15 17 
3 5 15 17 
...
Truncated

Test 29

Group: 2

Verdict:

input
20
.2...
.31..
45...
6....
...

correct output
5 8 9 14 17
3 10 16
2 10 16
13 15 19
1 8 9 14 17
...

user output


1 5 8 10 14 16 
-

...
Truncated

Test 30

Group: 2

Verdict:

input
20
3....
452..
.1...
.6...
...

correct output
3 7 8 9 14 15 16 19
4 12 13 17
1 7 8 9 14 15 16 19
2 12 13 17
11 20
...

user output

-

7 9 14 16 
-
...
Truncated

Test 31

Group: 1, 2

Verdict:

input
2
546..
.3...
.2...
.1...
...

correct output
-
-

user output