CSES - Datatähti 2020 alku

Submission details
Task:	Mastot
Sender:	JPaananen
Submission time:	2019-10-13 19:52:09 +0300
Language:	C++ (C++17)
Status:	READY
Result:	0

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

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.01 s	1, 2, 3	details
#2	WRONG ANSWER	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	WRONG ANSWER	0.01 s	1, 2, 3	details
#5	WRONG ANSWER	0.01 s	1, 2, 3	details
#6	WRONG ANSWER	0.01 s	1, 2, 3	details
#7	WRONG ANSWER	0.01 s	1, 2, 3	details
#8	WRONG ANSWER	0.01 s	1, 2, 3	details
#9	ACCEPTED	0.01 s	1, 2, 3	details
#10	ACCEPTED	0.01 s	1, 2, 3	details
#11	WRONG ANSWER	0.01 s	1, 2, 3	details
#12	WRONG ANSWER	0.01 s	1, 2, 3	details
#13	WRONG ANSWER	0.01 s	1, 2, 3	details
#14	WRONG ANSWER	0.01 s	1, 2, 3	details
#15	ACCEPTED	0.01 s	1, 2, 3	details
#16	ACCEPTED	0.01 s	1, 2, 3	details
#17	ACCEPTED	0.01 s	1, 2, 3	details
#18	WRONG ANSWER	0.01 s	1, 2, 3	details
#19	ACCEPTED	0.01 s	1, 2, 3	details
#20	WRONG ANSWER	0.01 s	1, 2, 3	details
#21	WRONG ANSWER	0.01 s	2, 3	details
#22	ACCEPTED	0.01 s	2, 3	details
#23	WRONG ANSWER	0.01 s	2, 3	details
#24	ACCEPTED	0.01 s	2, 3	details
#25	ACCEPTED	0.01 s	2, 3	details
#26	WRONG ANSWER	0.01 s	2, 3	details
#27	WRONG ANSWER	0.01 s	2, 3	details
#28	ACCEPTED	0.01 s	2, 3	details
#29	ACCEPTED	0.01 s	2, 3	details
#30	ACCEPTED	0.01 s	2, 3	details
#31	ACCEPTED	0.01 s	2, 3	details
#32	ACCEPTED	0.01 s	2, 3	details
#33	ACCEPTED	0.01 s	2, 3	details
#34	WRONG ANSWER	0.04 s	3	details
#35	ACCEPTED	0.05 s	3	details
#36	WRONG ANSWER	0.05 s	3	details
#37	WRONG ANSWER	0.05 s	3	details
#38	ACCEPTED	0.10 s	3	details
#39	WRONG ANSWER	0.07 s	3	details
#40	WRONG ANSWER	0.04 s	3	details
#41	WRONG ANSWER	0.05 s	3	details
#42	WRONG ANSWER	0.05 s	3	details
#43	ACCEPTED	0.05 s	3	details
#44	WRONG ANSWER	0.05 s	3	details
#45	WRONG ANSWER	0.05 s	3	details
#46	WRONG ANSWER	0.05 s	3	details

Code

#include <iostream>
#include <cstdlib>
#include <queue>
#include <cstring>

// UNCLEAN VERSION just to make sure it works :^)

using int_t = unsigned; // Don't judge me.
//using uint_t = unsigned long long;

int main() {
	std::ios_base::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int dist;
	std::cin >> dist;

	int goal = dist;
	
	int* ds = (int*) malloc((dist + 1) * sizeof(int));
	//memset(ds, 0, (dist + 1) * sizeof(int));
	int* cs = (int*) malloc((dist + 1) * sizeof(int));
	//memset(cs, 0, (dist + 1) * sizeof(int));

	//std::cout << "Length of ds: " << (dist + 1) << std::endl;
	//std::cout << "Length of cs: " << (dist + 1) << std::endl;

	for (int i = 0; i < dist; ++i)
		std::cin >> ds[i];
	ds[dist] = 0;
	
	for (int i = 0; i < dist - 1; ++i)
		std::cin >> cs[i+1];
	cs[dist - 1] = 0;
	cs[dist] = 0;
	cs[0] = 0;

	//std::cout << "Reach map: [ ";
	//for (int i = 0; i < dist; ++i) {
	//	std::cout << ds[i];
	//	if (i == dist - 1)
	//		std::cout << " ]" << std::endl;
	//	else
	//		std::cout << ", ";
	//}

	//std::cout << "Cost map:  [ -, ";
	//for (int i = 1; i < dist; ++i) {
	//	std::cout << cs[i];
	//	if (i == dist - 1)
	//		std::cout << " ]" << std::endl;
	//	else
	//		std::cout << ", ";
	//}



	struct Node {
		Node(int _pos, int_t _priority) : pos(_pos), priority(_priority) {}
		int pos;
		int_t priority;
	};

	auto cmp = [](const Node& lhs, const Node& rhs) {
		return lhs.priority > rhs.priority;
	};

	std::vector<Node> container;
	container.reserve(dist);
	std::priority_queue<Node, decltype(container), decltype(cmp)> frontier(cmp, std::move(container));
	
	frontier.emplace(0, 0);

	int* cameFrom = (int*) malloc((dist + 1) * sizeof(int));
	memset(cameFrom, 0, (dist + 1) * sizeof(int));
	//std::cout << "Length of cameFrom: " << dist << std::endl;
	//memset(cameFrom, -1, nPylons * sizeof(int));
	cameFrom[0] = 0;

	constexpr int_t NOT_PRESENT = std::numeric_limits<int_t>::max()-1;
	//std::cout << NOT_PRESENT << std::endl;
	int_t* costSoFar = (int_t*) malloc((dist + 1) * sizeof(int_t));
	memset(costSoFar, NOT_PRESENT, (dist + 1) * sizeof(int_t));
	//std::cout << "Length of costSoFar: " << dist << std::endl;
	/*for (int i = 0; i < dist + 1; ++i)
		costSoFar[i] = NOT_PRESENT;*/

	costSoFar[0] = 0;

	auto heuristic = [](int goal, int next) -> int_t {
		//if (next >= goal)
		//	std::cout << "!!! Goal: " << goal << ", next: " << next << std::endl;
		return goal - next;
	};

	//int iter = 0;
	while (!frontier.empty()) {
		//std::cout << std::endl << "## Iteration " << (iter++) << " ##" << std::endl;

		Node curr = frontier.top(); 
		frontier.pop();
		
		int pos = curr.pos;
		//std::cout << "Popped node: " << pos << ". Cost so far: " << costSoFar[pos] << ", Reach: " << ds[pos] << ", Cost to Fix: " << cs[pos] << std::endl;

		if (pos == goal) {
			//std::cout << costSoFar[pos];

			//std::cout << "Found goal! Total cost: " << costSoFar[pos] << std::endl;
			//std::cout << pos;
			//do {
			//	//std::cout << "(Reading from cameFrom[" << pos << "])" << std::endl;
			//	pos = cameFrom[pos];
			//	//std::cout << "(Reading from costSoFar[" << pos << "])" << std::endl;
			//	std::cout << " -> " << pos;
			//} while (pos != 0);

			std::cout << costSoFar[pos] << std::endl;

			return 0;
		}

		int reach = ds[pos];
		for (int i = 1; i <= reach; ++i) {
			int nbPos = pos + i;
			if (nbPos > goal)
				break;

			//std::cout << "Examining neighbor: " << nbPos << ". Reach: " << ds[nbPos] << ", Cost to Fix: " << cs[nbPos] << std::endl;

			//std::cout << "{Reading from costSoFar[" << pos << "] and cs[" << nbPos << "]}" << std::endl;
			int_t newCost = costSoFar[pos] + cs[nbPos];
			//std::cout << "> New cost: " << newCost << std::endl;

			//std::cout << "{Reading from costSoFar[" << nbPos << "]}" << std::endl;
			int_t neighborCost = costSoFar[nbPos];
			//std::cout << "> Neighbor cost: " << neighborCost << std::endl;
			if (/*neighborCost == NOT_PRESENT || */newCost < neighborCost) {
				//std::cout << " -> Adding to queue! Total cost to neighbor: " << newCost << std::endl;

				//std::cout << "{Writing 'costSoFar[" << nbPos << "] = " << newCost << "'}" << std::endl;
				costSoFar[nbPos] = newCost;
				int_t priority = newCost + heuristic(goal, nbPos);

				frontier.emplace(nbPos, priority);
				//std::cout << "{Writing 'cameFrom[" << nbPos << "] = " << pos << "'}" << std::endl;
				cameFrom[nbPos] = pos;
			}
		}
	}
	//std::cout << "No path found!!!" << std::endl;
	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`6 2 2 3 1 2 4 4 1 3 4 2` view save

correct output
`3` view save

user output
`1` view save

Test 2

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`2 1 1 1` view save

correct output
`1` view save

user output
`0` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 2 1 1` view save

correct output
`0` view save

user output
`0` view save

Test 4

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`3 2 2 1 1 2` view save

correct output
`1` view save

user output
`0` view save

Test 5

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`3 2 2 1 2 1` view save

correct output
`1` view save

user output
`0` view save

Test 6

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`4 1 1 1 1 1000000000 1000000000 10000000...` view save

correct output
`3000000000` view save

user output
`2000000000` view save

Test 7

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`19000000000` view save

user output
`820130816` view save

Test 8

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 1 1 2 1 1 1 2 1 1 2 1 1 1 2 1 ...` view save

correct output
`4609157377` view save

user output
`680275854` view save

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
`20 20 20 20 20 20 20 20 20 20 20 ...` view save

correct output
`0` view save

user output
`0` view save

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
`19 16 10 9 17 1 16 19 4 18 13 5 3...` view save

correct output
`8424700` view save

user output
`8424700` view save

Test 11

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 2 4 3 4 4 4 4 1 1 3 4 2 1 3 3 ...` view save

correct output
`2817777553` view save

user output
`2275262109` view save

Test 12

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 4 4 4 4 3 4 1 3 4 1 1 4 1 3 1 ...` view save

correct output
`3020673750` view save

user output
`2775641747` view save

Test 13

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 5 1 3 4 2 4 2 2 5 1 3 3 2 4 1 ...` view save

correct output
`2064735712` view save

user output
`2059283845` view save

Test 14

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 8 1 2 6 8 6 9 1 4 9 9 8 6 3 3 ...` view save

correct output
`378551508` view save

user output
`324721576` view save

Test 15

Group: 1, 2, 3

Verdict: ACCEPTED

input
`20 5 2 8 9 4 10 1 8 9 9 8 1 7 8 9...` view save

correct output
`457149308` view save

user output
`457149308` view save

Test 16

Group: 1, 2, 3

Verdict: ACCEPTED

input
`20 7 6 2 6 1 3 10 4 6 3 5 2 2 10 ...` view save

correct output
`471575451` view save

user output
`471575451` view save

Test 17

Group: 1, 2, 3

Verdict: ACCEPTED

input
`20 6 2 2 3 8 7 2 10 8 9 6 3 10 5 ...` view save

correct output
`620685913` view save

user output
`620685913` view save

Test 18

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 4 5 3 8 2 8 5 9 6 3 7 5 1 6 9 ...` view save

correct output
`1132427688` view save

user output
`811844076` view save

Test 19

Group: 1, 2, 3

Verdict: ACCEPTED

input
`20 15 9 7 18 3 20 19 20 17 16 16 ...` view save

correct output
`333300698` view save

user output
`333300698` view save

Test 20

Group: 1, 2, 3

Verdict: WRONG ANSWER

input
`20 19 18 17 16 15 14 13 12 11 10 ...` view save

correct output
`660514815` view save

user output
`0` view save

Test 21

Group: 2, 3

Verdict: WRONG ANSWER

input
`5000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`4999000000000` view save

user output
(empty)

Test 22

Group: 2, 3

Verdict: ACCEPTED

input
`5000 5000 5000 5000 5000 5000 5000 ...` view save

correct output
`0` view save

user output
`0` view save

Test 23

Group: 2, 3

Verdict: WRONG ANSWER

input
`5000 4999 4998 4997 4996 4995 4994 ...` view save

correct output
`576616581` view save

user output
`0` view save

Test 24

Group: 2, 3

Verdict: ACCEPTED

input
`5000 3343 3711 2568 137 2621 3850 4...` view save

correct output
`671570` view save

user output
`671570` view save

Test 25

Group: 2, 3

Verdict: ACCEPTED

input
`5000 119 203 420 133 175 334 461 10...` view save

correct output
`85700253` view save

user output
`85700253` view save

Test 26

Group: 2, 3

Verdict: WRONG ANSWER

input
`5000 8 6 2 1 4 5 7 3 4 2 1 10 3 6 6...` view save

correct output
`193210576015` view save

user output
`2783777908` view save

Test 27

Group: 2, 3

Verdict: WRONG ANSWER

input
`5000 1 2 1 2 2 1 2 2 1 1 1 2 1 2 2 ...` view save

correct output
`1576581428593` view save

user output
(empty)

Test 28

Group: 2, 3

Verdict: ACCEPTED

input
`5000 300 1937 2136 770 429 2388 197...` view save

correct output
`3584707` view save

user output
`3584707` view save

Test 29

Group: 2, 3

Verdict: ACCEPTED

input
`5000 949 46 29 2237 2413 36 42 1162...` view save

correct output
`3210354` view save

user output
`3210354` view save

Test 30

Group: 2, 3

Verdict: ACCEPTED

input
`5000 1557 1727 1787 360 1698 2423 1...` view save

correct output
`3177107` view save

user output
`3177107` view save

Test 31

Group: 2, 3

Verdict: ACCEPTED

input
`5000 484 1991 2309 1326 1901 2426 8...` view save

correct output
`4863018` view save

user output
`4863018` view save

Test 32

Group: 2, 3

Verdict: ACCEPTED

input
`5000 1833 459 1994 2050 272 31 708 ...` view save

correct output
`2876923` view save

user output
`2876923` view save

Test 33

Group: 2, 3

Verdict: ACCEPTED

input
`4999 530 2248 1916 859 2394 1403 24...` view save

correct output
`5194452` view save

user output
`5194452` view save

Test 34

Group: 3

Verdict: WRONG ANSWER

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`199999000000000` view save

user output
(empty)

Test 35

Group: 3

Verdict: ACCEPTED

input
`200000 200000 200000 200000 200000 20...` view save

correct output
`0` view save

user output
`0` view save

Test 36

Group: 3

Verdict: WRONG ANSWER

input
`200000 199999 199998 199997 199996 19...` view save

correct output
`819945000` view save

user output
`0` view save

Test 37

Group: 3

Verdict: WRONG ANSWER

input
`200000 9036 179861 197509 187949 9444...` view save

correct output
`59563` view save

user output
`98824` view save

Test 38

Group: 3

Verdict: ACCEPTED

input
`200000 357 1516 141 399 860 1591 544 ...` view save

correct output
`247414000` view save

user output
`247414000` view save

Test 39

Group: 3

Verdict: WRONG ANSWER

input
`200000 10 4 1 7 1 8 8 4 8 2 2 4 2 4 8...` view save

correct output
`7789595210075` view save

user output
`2892346574` view save

Test 40

Group: 3

Verdict: WRONG ANSWER

input
`200000 1 2 1 1 1 1 2 1 2 2 1 2 2 2 2 ...` view save

correct output
`62777824801872` view save

user output
(empty)

Test 41

Group: 3

Verdict: WRONG ANSWER

input
`200000 9473 42975 69773 60909 9354 20...` view save

correct output
`76814` view save

user output
`85170` view save

Test 42

Group: 3

Verdict: WRONG ANSWER

input
`200000 31087 18493 14158 65333 95850 ...` view save

correct output
`180614` view save

user output
`196849` view save

Test 43

Group: 3

Verdict: ACCEPTED

input
`200000 66563 17340 2293 5101 35636 96...` view save

correct output
`56642` view save

user output
`56642` view save

Test 44

Group: 3

Verdict: WRONG ANSWER

input
`200000 4005 35201 22254 56956 49098 7...` view save

correct output
`287201` view save

user output
`300772` view save

Test 45

Group: 3

Verdict: WRONG ANSWER

input
`200000 99266 91407 53419 70750 93505 ...` view save

correct output
`54045` view save

user output
`64970` view save

Test 46

Group: 3

Verdict: WRONG ANSWER

input
`199999 23098 95019 27998 22880 40713 ...` view save

correct output
`184595` view save

user output
`221799` view save

Datatähti 2020 alku

Mastot

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

Test 32

Test 33

Test 34

Test 35

Test 36

Test 37

Test 38

Test 39

Test 40

Test 41

Test 42

Test 43

Test 44

Test 45

Test 46

Tasks

Submissions (JPaananen)