CSES - Datatähti 2020 alku - Results
Submission details
Task:Mastot
Sender:caro
Submission time:2019-10-04 17:27:03 +0300
Language:C++11
Status:READY
Result:45
Feedback
groupverdictscore
#1ACCEPTED11
#2ACCEPTED34
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.01 s1, 2, 3details
#11ACCEPTED0.01 s1, 2, 3details
#12ACCEPTED0.01 s1, 2, 3details
#13ACCEPTED0.01 s1, 2, 3details
#14ACCEPTED0.01 s1, 2, 3details
#15ACCEPTED0.01 s1, 2, 3details
#16ACCEPTED0.01 s1, 2, 3details
#17ACCEPTED0.01 s1, 2, 3details
#18ACCEPTED0.01 s1, 2, 3details
#19ACCEPTED0.01 s1, 2, 3details
#20ACCEPTED0.01 s1, 2, 3details
#21ACCEPTED0.01 s2, 3details
#22ACCEPTED0.14 s2, 3details
#23ACCEPTED0.14 s2, 3details
#24ACCEPTED0.12 s2, 3details
#25ACCEPTED0.03 s2, 3details
#26ACCEPTED0.01 s2, 3details
#27ACCEPTED0.01 s2, 3details
#28ACCEPTED0.09 s2, 3details
#29ACCEPTED0.09 s2, 3details
#30ACCEPTED0.09 s2, 3details
#31ACCEPTED0.09 s2, 3details
#32ACCEPTED0.08 s2, 3details
#33ACCEPTED0.09 s2, 3details
#34ACCEPTED0.14 s3details
#350.66 s3details
#360.68 s3details
#370.69 s3details
#380.74 s3details
#39ACCEPTED0.16 s3details
#40ACCEPTED0.14 s3details
#410.69 s3details
#420.70 s3details
#430.67 s3details
#440.68 s3details
#450.70 s3details
#460.70 s3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:64:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(ll l = 0; l < activeCount; l++) {
                 ~~^~~~~~~~~~~~~

Code

#include <bits/stdc++.h>

#define max(a, b) ((a) > (b) ? (a) : (b))
#define min(a, b) ((a) < (b) ? (a) : (b))

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

typedef struct{
	ll strength;
	ull cost;
	ull minCost;
	char minCostSet;

	ull connectorCount;
	ull connectorSize;
	ull *connectors;
} pole_s;

ull d;
ull transmitter;
pole_s *poles;

ull endConnectorCount = 0;
ull endConnectorsSize = 0;
ull *endConnectors = NULL;

ull CostToPoint(ull point){
	if(point <= transmitter) return 0;
	if(poles[point - 1].minCostSet) return poles[point - 1].minCost;
	ull cost = 1e18;
	for(ull i = 0; i < poles[point - 1].connectorCount; i++) {
		cost = min(cost, CostToPoint(poles[point - 1].connectors[i]) + poles[poles[point - 1].connectors[i] - 1].cost);
		if(cost < 2) break;
	}
	poles[point - 1].minCost = cost;
	poles[point - 1].minCostSet = 1;
	return cost;
}

ull CostToPointStart(){
	if(d <= transmitter) return 0;
	ull cost = 1e18;
	for(ull i = 0; i < endConnectorCount; i++) {
		cost = min(cost, CostToPoint(endConnectors[i]) + poles[endConnectors[i] - 1].cost);
	}
	return cost;
}

int main(){
	cin >> d;
	cin >> transmitter;

	ull *activeConnectors = (ull*)malloc(sizeof(ull) * (d - 1));
	ull activeCount = 0;
	poles = (pole_s*) malloc(sizeof(pole_s) * (d - 1));
	for(ull i = 0; i < d - 1; i++) {
		cin >> poles[i].strength;
		poles[i].connectorCount = 0;
		poles[i].connectorSize = 0;
		poles[i].connectors = NULL;
		for(ll l = 0; l < activeCount; l++) {
			if(poles[activeConnectors[l] - 1].strength + activeConnectors[l] < i + 1) {
				activeConnectors[l] = activeConnectors[--activeCount];
				l--;
			}
			else {
				if(poles[i].connectorCount >= poles[i].connectorSize) 
					poles[i].connectors = 
						(ull*)realloc(poles[i].connectors, sizeof(ull) * (poles[i].connectorSize += 4));
				poles[i].connectors[poles[i].connectorCount++] = activeConnectors[l];
			}
		}
		activeConnectors[activeCount++] = i + 1;
	}

	for(ull i = 0; i < activeCount; i++) {
		if(poles[activeConnectors[i] - 1].strength + activeConnectors[i] >= d) {
			if(endConnectorCount >= endConnectorsSize)
				endConnectors = (ull*)realloc(endConnectors, sizeof(ull) * (endConnectorsSize += 4));
			endConnectors[endConnectorCount++] = activeConnectors[i];
		}
	}

	for(ull i = 0; i < d - 1; i++) {
		cin >> poles[i].cost;
		poles[i].minCostSet = 0;
		poles[i].minCost = 0;
	}

	ull totalCost = CostToPointStart();

	cout << totalCost << '\n';

	return 0;
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
6
2 2 3 1 2 4
4 1 3 4 2

correct output
3

user output
3

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
2
1 1
1

correct output
1

user output
1

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
2
2 1
1

correct output
0

user output
0

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
3
2 2 1
1 2

correct output
1

user output
1

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
3
2 2 1
2 1

correct output
1

user output
1

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
4
1 1 1 1
1000000000 1000000000 10000000...

correct output
3000000000

user output
3000000000

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
19000000000

user output
19000000000

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
1 1 2 1 1 1 2 1 1 2 1 1 1 2 1 ...

correct output
4609157377

user output
4609157377

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
20 20 20 20 20 20 20 20 20 20 ...

correct output
0

user output
0

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
8424700

user output
8424700

Test 11

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
2 4 3 4 4 4 4 1 1 3 4 2 1 3 3 ...

correct output
2817777553

user output
2817777553

Test 12

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
4 4 4 4 3 4 1 3 4 1 1 4 1 3 1 ...

correct output
3020673750

user output
3020673750

Test 13

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
5 1 3 4 2 4 2 2 5 1 3 3 2 4 1 ...

correct output
2064735712

user output
2064735712

Test 14

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
8 1 2 6 8 6 9 1 4 9 9 8 6 3 3 ...

correct output
378551508

user output
378551508

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

correct output
457149308

user output
457149308

Test 16

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
7 6 2 6 1 3 10 4 6 3 5 2 2 10 ...

correct output
471575451

user output
471575451

Test 17

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
6 2 2 3 8 7 2 10 8 9 6 3 10 5 ...

correct output
620685913

user output
620685913

Test 18

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
1132427688

user output
1132427688

Test 19

Group: 1, 2, 3

Verdict: ACCEPTED

input
20
15 9 7 18 3 20 19 20 17 16 16 ...

correct output
333300698

user output
333300698

Test 20

Group: 1, 2, 3

Verdict: ACCEPTED

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

correct output
660514815

user output
660514815

Test 21

Group: 2, 3

Verdict: ACCEPTED

input
5000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
4999000000000

user output
4999000000000

Test 22

Group: 2, 3

Verdict: ACCEPTED

input
5000
5000 5000 5000 5000 5000 5000 ...

correct output
0

user output
0

Test 23

Group: 2, 3

Verdict: ACCEPTED

input
5000
4999 4998 4997 4996 4995 4994 ...

correct output
576616581

user output
576616581

Test 24

Group: 2, 3

Verdict: ACCEPTED

input
5000
3343 3711 2568 137 2621 3850 4...

correct output
671570

user output
671570

Test 25

Group: 2, 3

Verdict: ACCEPTED

input
5000
119 203 420 133 175 334 461 10...

correct output
85700253

user output
85700253

Test 26

Group: 2, 3

Verdict: ACCEPTED

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

correct output
193210576015

user output
193210576015

Test 27

Group: 2, 3

Verdict: ACCEPTED

input
5000
1 2 1 2 2 1 2 2 1 1 1 2 1 2 2 ...

correct output
1576581428593

user output
1576581428593

Test 28

Group: 2, 3

Verdict: ACCEPTED

input
5000
300 1937 2136 770 429 2388 197...

correct output
3584707

user output
3584707

Test 29

Group: 2, 3

Verdict: ACCEPTED

input
5000
949 46 29 2237 2413 36 42 1162...

correct output
3210354

user output
3210354

Test 30

Group: 2, 3

Verdict: ACCEPTED

input
5000
1557 1727 1787 360 1698 2423 1...

correct output
3177107

user output
3177107

Test 31

Group: 2, 3

Verdict: ACCEPTED

input
5000
484 1991 2309 1326 1901 2426 8...

correct output
4863018

user output
4863018

Test 32

Group: 2, 3

Verdict: ACCEPTED

input
5000
1833 459 1994 2050 272 31 708 ...

correct output
2876923

user output
2876923

Test 33

Group: 2, 3

Verdict: ACCEPTED

input
4999
530 2248 1916 859 2394 1403 24...

correct output
5194452

user output
5194452

Test 34

Group: 3

Verdict: ACCEPTED

input
200000
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...

correct output
199999000000000

user output
199999000000000

Test 35

Group: 3

Verdict:

input
200000
200000 200000 200000 200000 20...

correct output
0

user output
(empty)

Test 36

Group: 3

Verdict:

input
200000
199999 199998 199997 199996 19...

correct output
819945000

user output
(empty)

Test 37

Group: 3

Verdict:

input
200000
9036 179861 197509 187949 9444...

correct output
59563

user output
(empty)

Test 38

Group: 3

Verdict:

input
200000
357 1516 141 399 860 1591 544 ...

correct output
247414000

user output
(empty)

Test 39

Group: 3

Verdict: ACCEPTED

input
200000
10 4 1 7 1 8 8 4 8 2 2 4 2 4 8...

correct output
7789595210075

user output
7789595210075

Test 40

Group: 3

Verdict: ACCEPTED

input
200000
1 2 1 1 1 1 2 1 2 2 1 2 2 2 2 ...

correct output
62777824801872

user output
62777824801872

Test 41

Group: 3

Verdict:

input
200000
9473 42975 69773 60909 9354 20...

correct output
76814

user output
(empty)

Test 42

Group: 3

Verdict:

input
200000
31087 18493 14158 65333 95850 ...

correct output
180614

user output
(empty)

Test 43

Group: 3

Verdict:

input
200000
66563 17340 2293 5101 35636 96...

correct output
56642

user output
(empty)

Test 44

Group: 3

Verdict:

input
200000
4005 35201 22254 56956 49098 7...

correct output
287201

user output
(empty)

Test 45

Group: 3

Verdict:

input
200000
99266 91407 53419 70750 93505 ...

correct output
54045

user output
(empty)

Test 46

Group: 3

Verdict:

input
199999
23098 95019 27998 22880 40713 ...

correct output
184595

user output
(empty)