CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:retki5
Submission time:2015-10-01 08:14:06
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#1--1details
#2--1details
#3--1details
#4--1details
#5--1details
#60.06 s2details
#70.06 s2details
#80.06 s2details
#90.06 s2details
#100.05 s2details
#110.29 s3details
#120.29 s3details
#130.30 s3details
#140.30 s3details
#15--3details
#160.20 s3details
#17--3details

Compiler report

input/code.cpp: In function 'int main()':
input/code.cpp:29:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < k[cn].size(); i++) {
                      ^
input/code.cpp:38:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i = 0; i < k[cn].size(); i++) {
                      ^

Code

#include <iostream>
#include <vector>
#include <algorithm>
int main() {
	int n, m;
	std::cin >> n >> m;
	int * hcp = new int[n];
	int * hcf = new int[n];
	//hcp last one was paid
	//hcf last one was free
	const int noi = 99999;
	for (int i = 1; i <= n; i++) {
		hcp[i] = noi;
		hcf[i] = noi;
	}
	hcf[1] = 0;
	std::vector<std::pair<int, int>> * k = new std::vector<std::pair<int, int>>[m];
	for (int i = 0; i < m; i++) {
		int a, b, h;
		std::cin >> a >> b >> h;
		k[a].push_back(std::make_pair(b, h));
	}
	int cn = 1;
	while (true) {
		//last was free
		int next = cn + 1;
		if (hcf[cn] != noi) {
		//eri kun noi -> tänne pääse jotain reittiä
			for (int i = 0; i < k[cn].size(); i++) {
				//std::cout << k[cn].at(i).second << std::endl;
				hcp[k[cn].at(i).first] = std::min(hcp[k[cn].at(i).first], hcf[cn] + k[cn].at(i).second);
				next = std::min(k[cn].at(i).first, next);
				//std::cout << hcp[k[cn].at(i).second] << std::endl;
			}
		}
		if (hcp[cn] != noi) {
			//std::cout << cn << ", " << std::endl;
			for (int i = 0; i < k[cn].size(); i++) {
				hcf[k[cn].at(i).first] = std::min(hcf[k[cn].at(i).first], hcp[cn]);
				next = std::min(k[cn].at(i).first, next);
				//std::cout << hcp[k[cn].at(i).second] << std::endl;
			}
		}
		cn = next;
		if (cn > n) break;
	}
	
	//std::cout << "hcp, hcf" << std::endl;
	for (int i = 1; i <= n; i++) {
		//std::cout << hcp[i] << ", " << hcf[i] << std::endl;
	}
	std::cout << std::min(hcf[n], hcp[n]) << "\n";
	return 0;
}

Test details

Test 1

Group: 1

Verdict:

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

correct output
8

user output
(empty)

Test 2

Group: 1

Verdict:

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

correct output
9

user output
(empty)

Test 3

Group: 1

Verdict:

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

correct output
8

user output
(empty)

Test 4

Group: 1

Verdict:

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

correct output
13

user output
(empty)

Test 5

Group: 1

Verdict:

input
10 20
10 8 5
2 4 7
9 4 7
9 4 1
...

correct output
4

user output
(empty)

Test 6

Group: 2

Verdict:

input
1000 2000
91 828 365044406
17 984 445675537
251 852 100987451
907 487 58830088
...

correct output
11893353673

user output
99999

Test 7

Group: 2

Verdict:

input
1000 2000
722 939 530579090
404 606 268877348
133 750 760086153
506 46 582310443
...

correct output
30248963445

user output
99999

Test 8

Group: 2

Verdict:

input
1000 2000
340 237 43690066
217 141 453160975
744 202 639037814
605 926 404985542
...

correct output
3126797692

user output
99999

Test 9

Group: 2

Verdict:

input
1000 2000
88 312 190442306
480 402 411574469
29 901 397491243
636 459 323246996
...

correct output
18416073173

user output
99999

Test 10

Group: 2

Verdict:

input
1000 2000
333 228 718389176
796 286 323493090
743 43 751876815
128 554 175625940
...

correct output
6399349335

user output
99999

Test 11

Group: 3

Verdict:

input
100000 200000
28264 92686 186865663
92570 33956 925976418
87377 71249 644757113
16701 81203 922125505
...

correct output
518249578675

user output
99999

Test 12

Group: 3

Verdict:

input
100000 200000
95740 71482 846654568
44131 16806 670712211
3967 49254 424174139
39369 53007 830346557
...

correct output
920862321580

user output
99999

Test 13

Group: 3

Verdict:

input
100000 200000
79947 25489 71554257
59184 25577 328436360
82945 73554 4942918
22380 92385 874250042
...

correct output
399407698440

user output
99999

Test 14

Group: 3

Verdict:

input
100000 200000
31139 12960 580545990
27744 95556 747296719
46969 42578 840321561
5638 28960 513805324
...

correct output
165235287505

user output
99999

Test 15

Group: 3

Verdict:

input
99993 199980
1 3 1
3 2 1
1 4 1
4 2 1
...

correct output
2

user output
(empty)

Test 16

Group: 3

Verdict:

input
100000 149994
93867 98509 1755709
85029 99843 1347591
10305 35305 6447
75638 80585 1829972
...

correct output
1124960

user output
99999

Test 17

Group: 3

Verdict:

input
100000 200000
70413 71496 49
15963 40963 18635
81291 89420 1850028
8848 33848 17316
...

correct output
110298

user output
(empty)