CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Arpakuutiot
Sender:	Kertor
Submission time:	2020-10-10 03:51:41 +0300
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.01 s	1, 2	details
#2	WRONG ANSWER	0.01 s	1, 2	details
#3	WRONG ANSWER	0.01 s	1, 2	details
#4	WRONG ANSWER	0.01 s	1, 2	details
#5	WRONG ANSWER	0.01 s	1, 2	details
#6	WRONG ANSWER	0.01 s	1, 2	details
#7	WRONG ANSWER	0.01 s	1, 2	details
#8	WRONG ANSWER	0.01 s	1, 2	details
#9	WRONG ANSWER	0.01 s	1, 2	details
#10	WRONG ANSWER	0.01 s	1, 2	details
#11	TIME LIMIT EXCEEDED	--	2	details
#12	TIME LIMIT EXCEEDED	--	2	details
#13	TIME LIMIT EXCEEDED	--	2	details
#14	TIME LIMIT EXCEEDED	--	2	details
#15	TIME LIMIT EXCEEDED	--	2	details
#16	TIME LIMIT EXCEEDED	--	2	details
#17	TIME LIMIT EXCEEDED	--	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	TIME LIMIT EXCEEDED	--	2	details
#21	TIME LIMIT EXCEEDED	--	2	details
#22	TIME LIMIT EXCEEDED	--	2	details
#23	TIME LIMIT EXCEEDED	--	2	details
#24	TIME LIMIT EXCEEDED	--	2	details
#25	TIME LIMIT EXCEEDED	--	2	details
#26	TIME LIMIT EXCEEDED	--	2	details
#27	TIME LIMIT EXCEEDED	--	2	details
#28	TIME LIMIT EXCEEDED	--	2	details
#29	TIME LIMIT EXCEEDED	--	2	details
#30	TIME LIMIT EXCEEDED	--	2	details
#31	WRONG ANSWER	0.01 s	1, 2	details

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;
 
int Target_x = 0;
int Target_y = 0;
 
string grid_a[5][5];
 
bool isDuplicate(string compare, vector<string> usedLib)
{
	for(int i = 0; i < (int)usedLib.size(); i++)
	{
		if(usedLib[i].find_first_not_of(compare) == string::npos)
		{
			return true;
		}
	}
	return false;
}
 
string convert_string(int x)
{
	stringstream ss;
    ss << x;
    return ss.str();
}
 
string areaSearch(bool RowWithFour, bool searchTarget, int start_x, int start_y)
{
	//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};
	
	bool SearchNew = false;
	//Find a pair for starter node
		while(true)
		{
		int q = (SearchNew && RowWithFour)?8:4;
		for(int o = 0; o < q; o++)
		{	
			int x_ax = start_x + primary_x[o];
			int y_ax = start_y + primary_y[o];
			
			if(SearchNew && RowWithFour)
			{
				x_ax = start_x + FourRow_x[o];
				y_ax = start_y + FourRow_y[o];
			}
			if(SearchNew && !RowWithFour)
			{
				x_ax = start_x + NoFourRow_x[o];
				y_ax = start_y + NoFourRow_y[o];
			}
			if(searchTarget)
			{
				x_ax = start_x + NewTarget_x[o];
				y_ax = start_y + NewTarget_y[o];
			}
			
			//Is node within bounds? No? Then lets skip it cause we aint gon cause no outofbound exception
			if(x_ax < 0 || y_ax < 0 || x_ax >= 5 || y_ax >= 5) {
				continue;
			}
			
			else if(grid_a[x_ax][y_ax] != ".")
			{
				Target_x = x_ax;
				Target_y = y_ax;			
				string s = ""+grid_a[x_ax][y_ax];
				
				return s;
			}
		}
			SearchNew = true;
		}
}
 
 
 
string new_rep(string xy[])
{
	string result = "";
	
	for(int j = 0; j < 25; j++)
	{
		result += xy[j];
	}
	
	string pair1[2];
	string pair2[2];
	string pair3[2];
	
	string grid[5][5];
	
	string inp = result;
	
	int index = 0;
	
	int start_x = -1;
	int start_y = -1;
	
	int RWF = 0;
	bool RowWithFour = false;
 
	for(int y = 0; y < 5; y++)
	{
		RWF = 0;
		for(int x = 0; x < 5; x++)
		{
			grid[x][y] = inp[index];
			grid_a[x][y] = inp[index];
 
			bool isN = inp[index] != '.';
			
			if(isN && start_x == -1)
			{
				start_x = x;
				start_y = y;
			}
			if(isN)
			{
				RWF++;
			}
			index++;
			if(RWF == 4) {
				RowWithFour = true;
			}
		}
	}
	
	//Used for finding last pair
	pair1[0] = grid[start_x][start_y];
	pair1[1] = areaSearch(RowWithFour, false, start_x, start_y);
	
	pair2[0] = areaSearch(RowWithFour, true, start_x, start_y);
	pair2[1] = areaSearch(RowWithFour, false, Target_x, Target_y);
	
	string Used_Numbers = "" + pair1[0] + pair1[1] + pair2[0] + pair2[1];
	for(int i = 1; i <= 6; i++)
	{
		if(Used_Numbers.find(convert_string(i)) == std::string::npos)
		{
			Used_Numbers += convert_string(i);
		}
	}
	
	return Used_Numbers;
 
}
 
bool areSame(string one, string two)
{
	
	string one_sub1 = one.substr(0,2);
	string one_sub2 = one.substr(2,2);
	
	string two_subs[] = {two.substr(0,2),two.substr(2,2),two.substr(4,2)};
	
	bool ContainsOne = false;
	for(int i = 0; i < 3; i++)
	{
		if(two_subs[i].find(one_sub1[0]) != std::string::npos && two_subs[i].find(one_sub1[1]) != std::string::npos)
		{
			ContainsOne = true;
		}
	}
	bool ContainsTwo = false;
	for(int i = 0; i < 3; i++)
	{
		if(two_subs[i].find(one_sub2[0]) != std::string::npos && two_subs[i].find(one_sub2[1]) != std::string::npos)
		{
			ContainsTwo = true;
		}
	}
	return ContainsOne && ContainsTwo;
}
 
int main()
{
	int n;
	cin >> n;
	string dice[25];
	
	string Dice_Collection[n];
 
	for(int dices = 0; dices < n; dices++)
	{
		int n = 0;
		
		for(int i = n; i < 25; i++)
		{
			char c;
			cin >> c;
			string s(1,c);
			dice[i] = s;
		}
		Dice_Collection[dices] = new_rep(dice);
	}
	
	string library[n*n];
	bool Empty = true;
	int s = 0;
	//NOW COMPARE ALL
	for(int i = 0; i < n; i++)
	{
		Empty = true;
		for(int j = 0; j < n; j++)
		{
			if(i == j) {
				continue;
			}
			//Check if two dice are the same
			if(areSame(Dice_Collection[abs(i-(n-1))], Dice_Collection[abs(j-(n-1))]))
			{
				library[s] = convert_string(abs(i-n)) + " " + convert_string(abs(j-n)) + '\n';
				Empty = false;
				s++;
			}
			//If havent been same for whole loop;
		}
		if(Empty)
		{
			library[s] = "-\n";
			s++;
		}
	}
	
	//REVERSE THIS LIBRARY CAUSE WE WANT TO ITERATE IT 0 TO 1
	int begin = 0;
	int ending = s - 1;
 
	while (begin < ending)
    {
        string emp = library[begin]; 
        library[begin] = library[ending];
        library[ending] = emp;
        begin++;
        ending--;
    } 
    
    vector<string> used_lib;
    vector<string> last_library;
	
	//NOW FIND DUPLICATES
	for(int i = 0; i < s; i++)
	{
		if(library[i] == "-")
		{
			last_library.push_back(library[i]);
			continue;
		}
		if(!isDuplicate(library[i], used_lib))
		{
			used_lib.push_back(library[i]);
			last_library.push_back(library[i]);
		}
	}

	cout << endl;
	for(int i = (int)last_library.size()-1; i >= 0; i--)
	{
		cout << last_library[i];
	}
	return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: WRONG ANSWER

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

correct output
`3 - 1` view save

user output
`- 1 3` view save

Test 2

Group: 1, 2

Verdict: WRONG ANSWER

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

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

user output
`4 5 2 5 2 4 1 3` view save

Test 3

Group: 1, 2

Verdict: WRONG ANSWER

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

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

user output
`3 5 2 4 1 5 1 3` view save

Test 4

Group: 1, 2

Verdict: WRONG ANSWER

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

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

user output
`4 5 2 3 1 5 1 4` view save

Test 5

Group: 1, 2

Verdict: WRONG ANSWER

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 5 2 4 1 3` view save

Test 6

Group: 1, 2

Verdict: WRONG ANSWER

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

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

user output
`4 5 2 3 1 5 1 4` view save

Test 7

Group: 1, 2

Verdict: WRONG ANSWER

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 1 3` view save

Test 8

Group: 1, 2

Verdict: WRONG ANSWER

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

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

user output
`4 5 2 3 1 5 1 4` view save

Test 9

Group: 1, 2

Verdict: WRONG ANSWER

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

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

user output
`4 5 2 3 1 3 1 2` view save

Test 10

Group: 1, 2

Verdict: WRONG ANSWER

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

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

user output
`3 4 2 4 2 3 1 5` view save

Test 11

Group: 2

Verdict: TIME LIMIT EXCEEDED

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

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

user output
(empty)

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 17

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 20

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 21

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 22

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 23

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 24

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 25

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 26

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 27

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 28

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 29

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 30

Group: 2

Verdict: TIME LIMIT EXCEEDED

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
(empty)

Test 31

Group: 1, 2

Verdict: WRONG ANSWER

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

correct output
`- -` view save

user output
`1 2` view save

Datatähti 2021 alku

Arpakuutiot

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Test 30

Test 31

Tasks

Submissions (Kertor)