CSES - Datatähti 2021 alku

CSES - Datatähti 2021 alku - Results

Submission details
Task:	Arpakuutiot
Sender:	Kertor
Submission time:	2020-10-08 14:48:08 +0300
Language:	C++ (C++11)
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	RUNTIME ERROR	0
#2	RUNTIME ERROR	0

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

Compiler report

input/code.cpp: In function 'std::__cxx11::string cross(std::__cxx11::string, std::__cxx11::string, std::__cxx11::string, std::__cxx11::string)':
input/code.cpp:65:6: warning: unused variable 'NewTarget_x' [-Wunused-variable]
  int NewTarget_x[] = {-1,1,0,0};
      ^~~~~~~~~~~
input/code.cpp:66:6: warning: unused variable 'NewTarget_y' [-Wunused-variable]
  int NewTarget_y[] = {0,0,-1,1};
      ^~~~~~~~~~~
input/code.cpp:70:7: warning: variable 'SearchNewTarget' set but not used [-Wunused-but-set-variable]
  bool SearchNewTarget = false;
       ^~~~~~~~~~~~~~~
input/code.cpp:116:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

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;
 
string cross(string first, string second, string third, string fourth)
{
	string pair1[2];
	string pair2[2];
	string pair3[2];
	
	string grid[5][4];
	
	string inp = first + second + third + fourth;
	int index = 0;
	
	int start_x = -1;
	int start_y = -1;
	
	int RWF = 0;
	bool RowWithFour = false;
	
	for(int y = 0; y < 4; y++)
	{
		RWF = 0;
		for(int x = 0; x < 5; x++)
		{
			grid[x][y] = inp[index];
			if(inp[index] != '-' && start_x == -1)
			{
				start_x = x;
				start_y = y;
			}
			index++;
			RWF++;
			if(RWF == 4) {
				RowWithFour = true;
			}
		}
	}
	
	//Used for finding last pair
	string Used_Numbers = "";
 
	pair1[0] = grid[start_x][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 NodeFound = false;
	bool SearchNew = false;
	bool SearchNewTarget = false;
	bool NewTargetFound = false;
	
	//Find a pair for starter node
	for(int i = 0; i < 3; i++)
	{
		if(NodeFound) {
			SearchNewTarget = true;
		}
		if(NewTargetFound) {
			
		}
		for(int o = 0; o < 4; 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];
			}
			
			//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 >= 4) {
				continue;
			}
			
			if(grid[x_ax][y_ax] != "-")
			{
				pair1[1] = grid[x_ax][y_ax];
				NodeFound = true;
				break;
			}
		}
		SearchNew = true;
	}
	
	
	
}
 
int main()
{
	string first =  "-1---";
	string second = "-23--"; 
	string third =  "--45-";
	string fourth = "---6-";
	cout << cross(first, second, third, fourth);
	return 0;
}

Test details

Test 1

Group: 1, 2

Verdict: RUNTIME ERROR

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

correct output
`3 - 1` view save

user output
(empty)

Test 2

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 3

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 4

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 5

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 6

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 7

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 8

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 9

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 10

Group: 1, 2

Verdict: RUNTIME ERROR

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

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

user output
(empty)

Test 11

Group: 2

Verdict: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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: RUNTIME ERROR

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

correct output
`- -` view save

user output
(empty)

Datatähti 2021 alku

Arpakuutiot

Compiler report

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)