CSES - Datatähti 2017 loppu

Submission details
Task:	Ohjelma
Sender:	kapesu8
Submission time:	2017-01-19 16:47:11 +0200
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	TIME LIMIT EXCEEDED	0
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.04 s	1	details
#2	ACCEPTED	0.04 s	1	details
#3	WRONG ANSWER	0.04 s	1	details
#4	WRONG ANSWER	0.03 s	1	details
#5	WRONG ANSWER	0.03 s	1	details
#6	WRONG ANSWER	0.04 s	1	details
#7	ACCEPTED	0.05 s	1	details
#8	ACCEPTED	0.04 s	1	details
#9	ACCEPTED	0.03 s	1	details
#10	WRONG ANSWER	0.03 s	1	details
#11	ACCEPTED	0.03 s	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	ACCEPTED	0.04 s	2	details
#18	TIME LIMIT EXCEEDED	--	2	details
#19	TIME LIMIT EXCEEDED	--	2	details
#20	ACCEPTED	0.03 s	2	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	TIME LIMIT EXCEEDED	--	3	details
#23	TIME LIMIT EXCEEDED	--	3	details
#24	TIME LIMIT EXCEEDED	--	3	details
#25	TIME LIMIT EXCEEDED	--	3	details
#26	TIME LIMIT EXCEEDED	--	3	details
#27	TIME LIMIT EXCEEDED	--	3	details
#28	TIME LIMIT EXCEEDED	--	3	details
#29	TIME LIMIT EXCEEDED	--	3	details
#30	TIME LIMIT EXCEEDED	--	3	details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:59:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i = 0;i < solutions.size();i++)
                                   ^

Code

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




struct btree
{
	btree* parent;
	btree* right;
	btree* left;
	int rl;
	int level;
	int value;
};

btree* start_node;
std::vector<btree*> solutions;
std::vector<unsigned char> reversed_steps;

void build_steps(btree* node,int req)
{
	if(node->value == req)
	{
		solutions.push_back(node);
		return;
	}
	if(node->value > req)
		return;
	node->right = new btree;
	node->left = new btree;
	node->right->value = node->value * 2;
	node->right->rl = 1;
	node->left->rl = 0;	
	node->left->value = node->value + 3;
	node->right->level = node->left->level = node->level + 1;
	node->right->parent = node->left->parent = node;
	build_steps(node->right,req);
	build_steps(node->left,req);
}


int main()
{
	int n;
	std::cin >> n;
	if(n % 3 == 0)
	{
		std::cout << '0';
		return 0;
	}
	start_node = new btree;
	start_node->value = 1;
	start_node->level = 0;
	build_steps(start_node,n);
	btree* quickest = (btree*)NULL;
	int quickest_steps = 0x0000FFFFF;
	for(int i = 0;i < solutions.size();i++)
	{
		if(solutions[i]->level < quickest_steps)
		{
			quickest = solutions[i];
			quickest_steps = solutions[i]->level;
		}
	}
	reversed_steps.push_back(2); 
	btree* next = quickest;
	while(next != start_node)
	{
		if(next->rl == 1)
			reversed_steps.push_back(1);
		else
			reversed_steps.push_back(0);
		next = next->parent;
	}
	for(int i = reversed_steps.size()-1;i >= 0;i--)
	{
		if(reversed_steps[i] == 0)
			std::cout << "ADD\n";
		else if(reversed_steps[i] == 1)
			std::cout << "MUL\n";
		else
			std::cout << "END\n";
	}
	return 0;
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
`58` view save

correct output
`8 MUL ADD MUL ADD ...` view save

user output
`MUL ADD MUL ADD MUL ...` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`72` view save

correct output
`0` view save

user output
`0` view save

Test 3

Group: 1

Verdict: WRONG ANSWER

input
`83` view save

correct output
`8 MUL ADD MUL MUL ...` view save

user output
`MUL ADD MUL MUL MUL ...` view save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
`53` view save

correct output
`8 ADD MUL ADD MUL ...` view save

user output
`ADD MUL ADD MUL ADD ...` view save

Test 5

Group: 1

Verdict: WRONG ANSWER

input
`100` view save

correct output
`8 ADD MUL ADD MUL ...` view save

user output
`ADD MUL ADD MUL ADD ...` view save

Test 6

Group: 1

Verdict: WRONG ANSWER

input
`64` view save

correct output
`6 ADD MUL MUL MUL ...` view save

user output
`ADD MUL MUL MUL MUL ...` view save

Test 7

Group: 1

Verdict: ACCEPTED

input
`84` view save

correct output
`0` view save

user output
`0` view save

Test 8

Group: 1

Verdict: ACCEPTED

input
`60` view save

correct output
`0` view save

user output
`0` view save

Test 9

Group: 1

Verdict: ACCEPTED

input
`51` view save

correct output
`0` view save

user output
`0` view save

Test 10

Group: 1

Verdict: WRONG ANSWER

input
`77` view save

correct output
`9 ADD ADD MUL ADD ...` view save

user output
`ADD ADD MUL ADD MUL ...` view save

Test 11

Group: 2

Verdict: ACCEPTED

input
`941694` view save

correct output
`0` view save

user output
`0` view save

Test 12

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`905674` view save

correct output
`30 MUL ADD MUL ADD ...` view save

user output
(empty)

Test 13

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`908426` view save

correct output
`29 ADD MUL ADD MUL ...` view save

user output
(empty)

Test 14

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`960500` view save

correct output
`31 ADD ADD MUL MUL ...` view save

user output
(empty)

Test 15

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`902101` view save

correct output
`27 MUL ADD MUL ADD ...` view save

user output
(empty)

Test 16

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`994208` view save

correct output
`27 ADD ADD MUL MUL ...` view save

user output
(empty)

Test 17

Group: 2

Verdict: ACCEPTED

input
`923538` view save

correct output
`0` view save

user output
`0` view save

Test 18

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`950287` view save

correct output
`24 MUL ADD MUL ADD ...` view save

user output
(empty)

Test 19

Group: 2

Verdict: TIME LIMIT EXCEEDED

input
`950516` view save

correct output
`29 ADD ADD MUL MUL ...` view save

user output
(empty)

Test 20

Group: 2

Verdict: ACCEPTED

input
`921882` view save

correct output
`0` view save

user output
`0` view save

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`933942296856681219` view save

correct output
`0` view save

user output
(empty)

Test 22

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`955775764385016720` view save

correct output
`0` view save

user output
(empty)

Test 23

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`981578916796073406` view save

correct output
`0` view save

user output
(empty)

Test 24

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`927875200723222396` view save

correct output
`94 MUL ADD MUL MUL ...` view save

user output
(empty)

Test 25

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`990125206148420558` view save

correct output
`84 ADD MUL ADD MUL ...` view save

user output
(empty)

Test 26

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`964804802247123102` view save

correct output
`0` view save

user output
(empty)

Test 27

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`996610423667404231` view save

correct output
`96 MUL ADD MUL ADD ...` view save

user output
(empty)

Test 28

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`948665008088793691` view save

correct output
`86 MUL ADD MUL ADD ...` view save

user output
(empty)

Test 29

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`969397787818953279` view save

correct output
`0` view save

user output
(empty)

Test 30

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`918471787211371085` view save

correct output
`90 ADD MUL ADD MUL ...` view save

user output
(empty)

Datatähti 2017 loppu

Ohjelma

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

Tasks

Submissions (kapesu8)