— Dark mode

Datatähti 2021 alku

Arpakuutiot

  • Start: 2020-09-28 00:00:00
  • End: 2020-10-12 00:00:00
CSES - Datatähti 2021 alku - Results
Submission details
Task:Arpakuutiot
Sender:_Ahrou
Submission time:2020-10-04 16:52:27 +0300
Language:C++11
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
Test results
testverdicttimegroup
#10.01 s1, 2details
#20.01 s1, 2details
#30.01 s1, 2details
#40.01 s1, 2details
#50.01 s1, 2details
#60.01 s1, 2details
#70.01 s1, 2details
#80.01 s1, 2details
#90.01 s1, 2details
#100.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

Compiler report

input/code.cpp: In member function 'bool dice::operator==(const dice&)':
input/code.cpp:267:101: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    similar_pair(relations[0], other.relations[0]) && similar_pair(relations[1], other.relations[1]) && similar_pair(relations[2], other.relations[2]) ||
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:270:101: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    similar_pair(relations[0], other.relations[1]) && similar_pair(relations[1], other.relations[0]) && similar_pair(relations[2], other.relations[2]) ||
    ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
input/code.cpp:271:101: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
    similar_pair(relations[0], other...

Code

#include <vector>
#include <string>
#include <algorithm>
#include <iostream>


std::pair<int, int> get_grid_dimensions(const std::string& grid)
{
	std::pair<int, int> dims;
	int counter = 0;
	for (auto c : grid)
	{
		if (c == '\n')
		{
			dims.first = counter;
			dims.second = grid.size() / dims.first;
			break;
		}
		counter++;
	}
	return dims;
}

class dice
{
private:
	enum class places
	{
		top = 0, right = 1, left = 2, front = 3, back = 4, bottom = 5
	};
private:
	template<typename T>
	bool similar_pair(const std::pair<T, T>& f, const std::pair<T, T>& s)
	{
		return f.first == s.first || f.first == s.second && f.second == s.first || f.second == s.second;
	}
	void get_nexts(int state, int cur_pos, const std::string& grid, std::vector<std::pair<int,int>>& places, int width, int height)//state = called from, cur_pos = pos of the called in the grid
	{
		// places top, right, left, front, back, bottom
		if (std::any_of(places.begin(), places.end(), [](std::pair<int,int> num) {return num.first == 0; }))
		{
			if (state == 0)// called  top 
			{
				if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47)
				{
					places[1].first = grid[cur_pos + 1];
					places[1].second = cur_pos + 1;
					get_nexts(1, cur_pos + 1, grid, places, width, height);
				}
				if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47)
				{
					places[3].first = grid[cur_pos + width];
					places[3].second = cur_pos + width;
					get_nexts(3, cur_pos + width, grid, places, width, height);
				}
			}
			if (state == 1)// called right 
			{
				if (places[0].second + 1 == cur_pos)//called from top
				{
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[5].first == 0)
					{
						places[5].first = grid[cur_pos + 1];
						places[5].second = cur_pos + 1;
						get_nexts(5, cur_pos + 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[3].first == 0)
					{
						places[3].first = grid[cur_pos + width];
						places[3].second = cur_pos + width;
						get_nexts(3, cur_pos + width, grid, places, width, height);
					}

				}
				else
				{
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[4].first == 0)
					{
						places[4].first = grid[cur_pos + 1];
						places[4].second = cur_pos + 1;
						get_nexts(5, cur_pos + 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[5].first == 0)
					{
						places[5].first = grid[cur_pos + width];
						places[5].second = cur_pos + width;
						get_nexts(5, cur_pos + width, grid, places, width, height);
					}
				}
			}
			if (state == 2)// called  left
			{
				if (places[5].second - 1 == cur_pos || places[3].second + width == cur_pos)
				{
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[4].first == 0)
					{
						places[4].first = grid[cur_pos + width];
						places[4].second = cur_pos + width;
						get_nexts(4, cur_pos + width, grid, places, width, height);
					}
				}
				else
				{
					if (grid[cur_pos - 1] < 58 && grid[cur_pos - 1] > 47 && places[4].first == 0)
					{
						places[4].first = grid[cur_pos - 1];
						places[4].second = cur_pos - 1;
						get_nexts(4, cur_pos - 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[5].first == 0)
					{
						places[5].first = grid[cur_pos + width];
						places[5].second = cur_pos + width;
						get_nexts(5, cur_pos + width, grid, places, width, height);
					}
				}
			}
			if (state == 3)//called front
			{
				if (places[1].second + width == cur_pos || places[5].second + width == cur_pos) // called from right or bottom
				{
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[5].first == 0)
					{
						places[5].first = grid[cur_pos + 1];
						places[5].second = cur_pos + 1;
						get_nexts(5, cur_pos + 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[2].first == 0)
					{
						places[2].first = grid[cur_pos + width];
						places[2].second = cur_pos + width;
						get_nexts(2, cur_pos + width, grid, places, width, height);
					}
				}
				else // called from top
				{
					if (grid[cur_pos - 1] < 58 && grid[cur_pos - 1] > 47 && places[2].first == 0)
					{
						places[2].first = grid[cur_pos - 1];
						places[2].second = cur_pos - 1;
						get_nexts(2, cur_pos - 1, grid, places, width, height);
					}
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[1].first == 0)
					{
						places[1].first = grid[cur_pos + 1];
						places[1].second = cur_pos + 1;
						get_nexts(1, cur_pos + 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[5].first == 0)
					{
						places[5].first = grid[cur_pos + width];
						places[5].second = cur_pos + width;
						get_nexts(5, cur_pos + width, grid, places, width, height);
					}
				}
			}
			if (state == 4)// called  back
			{
				if (places[5].second + width == cur_pos)//called from bottom
				{
					if (grid[cur_pos - 1] < 58 && grid[cur_pos - 1] > 47 && places[2].first == 0)
					{
						places[2].first = grid[cur_pos - 1];
						places[2].second = cur_pos - 1;
						get_nexts(2, cur_pos - 1, grid, places, width, height);
					}
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[1].first == 0)
					{
						places[1].first = grid[cur_pos + 1];
						places[1].second = cur_pos + 1;
						get_nexts(1, cur_pos + 1, grid, places, width, height);
					}
				}
				if (places[2].second - 1 == cur_pos) // called from left
				{
					if (grid[cur_pos - 1] < 58 && grid[cur_pos - 1] > 47 && places[1].first == 0)
					{
						places[1].first = grid[cur_pos + 1];
						places[1].second = cur_pos + 1;
						get_nexts(1, cur_pos - 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[5].first == 0)
					{
						places[5].first = grid[cur_pos + width];
						places[5].second = cur_pos + width;
						get_nexts(5, cur_pos + width, grid, places, width, height);
					}
				}
				if (places[1].second + 1 == cur_pos)// called from right
				{
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[2].first == 0)
					{
						places[2].first = grid[cur_pos + 1];
						places[2].second = cur_pos + 1;
						get_nexts(2, cur_pos + 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[5].first == 0)
					{
						places[5].first = grid[cur_pos + width];
						places[5].second = cur_pos + width;
						get_nexts(5, cur_pos + width, grid, places, width, height);
					}
				}
			}
			if (state == 5)// called  bottom
			{
				if (places[3].second - width == places[1].second && places[3].second + 1 == cur_pos)//being called from a turned front
				{
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[4].first == 0)
					{
						places[4].first = grid[cur_pos + 1];
						places[4].second = cur_pos + 1;
						get_nexts(4, cur_pos + 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[2].first == 0) 
					{
						places[2].first = grid[cur_pos + width];
						places[2].second = cur_pos + width;
						get_nexts(2, cur_pos + width, grid, places, width, height);
					}
				}
				else
				{
					if (grid[cur_pos + 1] < 58 && grid[cur_pos + 1] > 47 && places[1].first == 0)
					{
						places[1].first = grid[cur_pos + 1];
						places[1].second = cur_pos + 1;
						get_nexts(1, cur_pos + 1, grid, places, width, height);
					}
					if (grid[cur_pos - 1] < 58 && grid[cur_pos - 1] > 47 && places[2].first == 0)
					{
						places[2].first = grid[cur_pos - 1];
						places[2].second = cur_pos - 1;
						get_nexts(2, cur_pos - 1, grid, places, width, height);
					}
					if (grid[cur_pos + width] < 58 && grid[cur_pos + width] > 47 && places[4].first == 0)
					{
						places[4].first = grid[cur_pos + width];
						places[4].second = cur_pos + width;
						get_nexts(4, cur_pos + width, grid, places, width, height);
					}
				}
			}
		}
	}
public:
	dice(const std::string& grid)
	{
		std::vector<std::pair<int, int>> places = { {0, -1}, {0, -1}, {0, -1}, {0, -1}, {0, -1}, {0, -1} };
		int top_pos = 0;
		for (auto c = grid.begin(); c != grid.end(); ++c)
		{
			if (*c < 58 && *c > 47)
			{
				top_pos = c - grid.begin();
				places[0].first = *c;
				places[0].second = c - grid.begin();
				break;
			}
		}
		get_nexts(0, top_pos, grid, places, 5, 5);
		relations = { {places[0].first - 48, places[5].first - 48}, {places[1].first - 48, places[2].first - 48}, {places[3].first - 48, places[4].first - 48} };
	}
	bool operator==(const dice& other)
	{
		return (
			similar_pair(relations[0], other.relations[0]) && similar_pair(relations[1], other.relations[1]) && similar_pair(relations[2], other.relations[2]) ||
			similar_pair(relations[0], other.relations[0]) && similar_pair(relations[1], other.relations[2]) && similar_pair(relations[2], other.relations[1]) ||

			similar_pair(relations[0], other.relations[1]) && similar_pair(relations[1], other.relations[0]) && similar_pair(relations[2], other.relations[2]) ||
			similar_pair(relations[0], other.relations[1]) && similar_pair(relations[1], other.relations[2]) && similar_pair(relations[2], other.relations[0]) ||

			similar_pair(relations[0], other.relations[2]) && similar_pair(relations[1], other.relations[1]) && similar_pair(relations[2], other.relations[0]) ||
			similar_pair(relations[0], other.relations[2]) && similar_pair(relations[1], other.relations[0]) && similar_pair(relations[2], other.relations[1]) );
	}
private:
	std::vector<std::pair<int, int>> relations;
};

int main()
{
	int n;
	std::cin >> n;
	std::vector<std::string> grids(n);
	for (int i = 0; i < n; i++)
	{
		for (int x = 0; x < 5; x++)
		{
			std::string temp;
			std::cin >> temp;
			grids[i] += temp;
		}
	}
	std::vector<dice> di;
	for (auto grid : grids)
	{
		di.emplace_back(dice(grid));
	}
	for (int i = 0; i < n; i++)
	{
		int c = 1;
		for (auto d : di)
		{
			if (di[i] == d && c -1 != i)
			{
				std::cout << c << " "; 
			}
			c++;
		}
		std::cout << '\n';
	}
	return 0;
}

Test details

Test 1

Group: 1, 2

Verdict:

input
3
165..
.4...
.3...
.2...
...
view save

correct output
3
-
1
view save

user output
2 3 
1 3 
1 2 
view save

Test 2

Group: 1, 2

Verdict:

input
5
264..
.5...
.3...
.1...
...
view save

correct output
3
4 5
1
2 5
2 4
view save

user output

5 

5 
2 4 
view save

Test 3

Group: 1, 2

Verdict:

input
5
152..
.4...
.3...
.6...
...
view save

correct output
3 5
4
1 5
2
1 3
view save

user output
5 

5 

1 3 
view save

Test 4

Group: 1, 2

Verdict:

input
5
142..
.6...
.3...
.5...
...
view save

correct output
4 5
3
2
1 5
1 4
view save

user output
4 
3 4 
2 
1 2 
view save

Test 5

Group: 1, 2

Verdict:

input
5
123..
.4...
.6...
.5...
...
view save

correct output
3
4 5
1
2 5
2 4
view save

user output

4 
5 
2 
3 
view save

Test 6

Group: 1, 2

Verdict:

input
5
213..
.6...
.4...
.5...
...
view save

correct output
4 5
3
2
1 5
1 4
view save

user output

3 5 
2 5 

2 3 
view save

Test 7

Group: 1, 2

Verdict:

input
5
314..
.5...
.2...
.6...
...
view save

correct output
3
4 5
1
2 5
2 4
view save

user output

4 5 

2 5 
2 4 
view save

Test 8

Group: 1, 2

Verdict:

input
5
163..
.2...
.5...
.4...
...
view save

correct output
4 5
3
2
1 5
1 4
view save

user output
4 5 


1 5 
1 4 
view save

Test 9

Group: 1, 2

Verdict:

input
5
264..
.1...
.3...
.5...
...
view save

correct output
2 3
1 3
1 2
5
4
view save

user output
2 
1 
view save

Test 10

Group: 1, 2

Verdict:

input
5
214..
.3...
.5...
.6...
...
view save

correct output
5
3 4
2 4
2 3
1
view save

user output
3 4 5 

1 4 
1 3 
1 
view save

Test 11

Group: 2

Verdict:

input
10
.41..
.5...
.2...
36...
...
view save

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

user output
9 
4 5 6 7 8 
7 8 9 
2 
2 9 
...
view save

Test 12

Group: 2

Verdict:

input
10
5....
1436.
.2...
.....
...
view save

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

user output
5 6 
6 8 10 
4 6 7 
3 5 7 
1 4 6 
...
view save

Test 13

Group: 2

Verdict:

input
10
2....
41...
.63..
.5...
...
view save

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

user output
2 5 6 
1 5 6 

10 
1 2 6 7 8 9 
...
view save

Test 14

Group: 2

Verdict:

input
10
1....
634..
..52.
.....
...
view save

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
...
view save

user output
4 6 
3 4 5 6 9 10 
2 4 9 
1 2 3 5 6 9 10 
2 4 6 8 
...
view save

Test 15

Group: 2

Verdict:

input
10
.2...
4516.
3....
.....
...
view save

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

user output
5 6 7 9 
3 4 8 
2 4 6 
2 3 6 9 
1 7 9 
...
view save

Test 16

Group: 2

Verdict:

input
10
.56..
.2...
.4...
31...
...
view save

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

user output
2 4 6 9 10 
1 3 4 6 9 10 
2 5 7 
1 2 6 9 10 
3 
...
view save

Test 17

Group: 2

Verdict:

input
10
..62.
.31..
45...
.....
...
view save

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

user output
2 4 7 8 
1 3 4 6 8 
2 4 8 
1 2 3 5 8 
4 6 7 8 9 10 
...
view save

Test 18

Group: 2

Verdict:

input
10
532..
.4...
.1...
.6...
...
view save

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

user output
3 8 9 
5 9 
1 4 8 9 
3 5 7 8 
2 4 8 9 
...
view save

Test 19

Group: 2

Verdict:

input
10
.64..
.1...
.3...
52...
...
view save

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

user output
3 4 5 7 9 10 
5 6 
1 4 9 10 
1 3 5 9 10 
1 2 4 6 7 9 10 
...
view save

Test 20

Group: 2

Verdict:

input
10
.4...
326..
.1...
.5...
...
view save

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

user output
3 7 8 10 
6 7 8 9 10 
1 5 
8 
3 10 
...
view save

Test 21

Group: 2

Verdict:

input
20
.6...
.4...
31...
.25..
...
view save

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

user output
2 6 7 9 11 16 
1 3 6 7 12 13 18 
2 6 7 11 13 
9 12 13 16 19 20 
8 10 11 12 13 15 
...
view save

Test 22

Group: 2

Verdict:

input
20
3....
5614.
..2..
.....
...
view save

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

user output
11 14 
4 20 
4 9 13 15 
2 3 9 14 18 
8 14 16 19 
...
view save

Test 23

Group: 2

Verdict:

input
20
42...
.316.
.5...
.....
...
view save

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

user output
8 11 12 13 15 16 18 19 20 
5 11 12 15 16 19 
6 8 9 10 11 12 14 
6 20 
2 10 13 19 20 
...
view save

Test 24

Group: 2

Verdict:

input
20
..5..
.623.
41...
.....
...
view save

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

user output
3 4 11 14 15 16 18 
9 11 12 13 14 16 
1 5 11 13 17 18 19 
1 7 11 12 14 15 18 20 
3 18 
...
view save

Test 25

Group: 2

Verdict:

input
20
.46..
53...
.1...
.2...
...
view save

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
...
view save

user output
2 3 7 15 16 17 
1 3 7 14 15 16 17 
1 2 5 7 13 16 17 
8 9 10 14 19 
3 10 12 18 19 20 
...
view save

Test 26

Group: 2

Verdict:

input
20
.61..
.4...
35...
.2...
...
view save

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

user output
6 8 10 
5 
10 12 17 18 19 
11 13 14 16 19 20 
2 6 7 12 13 15 
...
view save

Test 27

Group: 2

Verdict:

input
20
..2..
1463.
.5...
.....
...
view save

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
...
view save

user output
3 5 6 9 10 14 15 17 20 
13 
1 5 6 8 9 12 13 19 20 
7 10 12 13 15 
1 3 6 8 9 12 13 19 20 
...
view save

Test 28

Group: 2

Verdict:

input
20
...4.
5132.
6....
.....
...
view save

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
...
view save

user output
2 8 10 19 
1 8 10 11 16 19 
4 5 6 8 11 14 15 16 17 
3 5 11 15 16 17 
3 4 6 8 14 15 16 17 18 
...
view save

Test 29

Group: 2

Verdict:

input
20
.2...
.31..
45...
6....
...
view save

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

user output
2 3 4 5 8 9 10 11 14 16 17 19 
1 4 5 6 7 8 9 10 13 14 16 17 2...
view save

Test 30

Group: 2

Verdict:

input
20
3....
452..
.1...
.6...
...
view save

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
...
view save

user output
3 5 6 7 9 12 13 15 16 20 
5 12 13 17 20 
1 6 7 9 14 15 16 18 20 
5 12 13 14 17 
1 2 4 9 12 13 15 16 17 19 20 
...
view save

Test 31

Group: 1, 2

Verdict:

input
2
546..
.3...
.2...
.1...
...
view save

correct output
-
-
view save

user output
2 
1 
view save

Tasks

A Sanalista-B Ratsun reitit-C Alitaulukot-D 2021-luvut-E Arpakuutiot-

Submissions (_Ahrou)

2020-10-08 12:40:46 02020-10-08 12:38:40 02020-10-07 15:50:35 02020-10-07 15:47:26 02020-10-07 12:03:06 02020-10-04 21:12:27 02020-10-04 20:54:27 02020-10-04 20:52:31 02020-10-04 20:51:30 02020-10-04 20:48:50 02020-10-04 20:29:48 02020-10-04 16:54:17 02020-10-04 16:52:27 0