CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:nagrodus
Submission time:2015-10-05 20:04:08 +0300
Language:C++
Status:READY
Result:24
Feedback
groupverdictscore
#1ACCEPTED24
#20
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.06 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.05 s1details
#60.05 s2details
#70.06 s2details
#80.06 s2details
#90.05 s2details
#100.10 s2details
#110.17 s3details
#120.17 s3details
#130.17 s3details
#140.16 s3details
#150.32 s3details
#160.27 s3details
#170.31 s3details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:25:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0;j< cityList[i].size(); j++){ // loop the outgoing flights from city i
                   ^
input/code.cpp:29:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int k = 0; k < cityList[cityList[i][j].first].size(); k++){ // loop the outgoing flight from the next city
                      ^
input/code.cpp:50:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < v[s].size(); i++) {
                     ^
input/code.cpp:58:28: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long int' [-Wformat=]
  printf("%d", e[cities - 1]);
                            ^
input/code.cpp:12:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_r...

Code

#include <stdio.h>
#include <vector>
#include <queue>

using namespace std;

#define INF 999999999

int main(int argc, char* argv[])
{
	int cities, flights;
	scanf("%d %d", &cities, &flights);
	vector<vector<pair<int,int>> > cityList(cities);
	for (int i = 0; i < flights; i++){
		int from,to,price;
		scanf("%d %d %d", &from, &to, &price);
		if (from != cities){
			from--;
			to--;
			cityList[from].push_back(make_pair(to,price));
		}
	}
	vector<vector<pair<int, int>> > v(cities);
	for (int i = 0; i < cities; i++){ // outgoing flights per city
		for (int j = 0;j< cityList[i].size(); j++){ // loop the outgoing flights from city i
			if (cityList[i][j].first == cities - 1){
				v[i].push_back(make_pair(cityList[i][j].first, cityList[i][j].second));
			}
			for (int k = 0; k < cityList[cityList[i][j].first].size(); k++){ // loop the outgoing flight from the next city
				v[i].push_back(make_pair(cityList[cityList[i][j].first][k].first, cityList[i][j].second));
			}
		}
	}
	priority_queue<pair<long, int>> q;
	int t[100001];
	long e[100001];
	for (int i = 1; i < cities; i++){
		e[i] = INF;
		t[i] = 0;
	}
	t[0] = 0;
	e[0] = 0;
	q.push(make_pair(0, 0));
	while (!q.empty()) {
		int x = -q.top().first;
		int s = q.top().second;
		q.pop();
		if (t[s]) continue;
		t[s] = 1;
		for (int i = 0; i < v[s].size(); i++) {
			int u = v[s][i].first;
			if (x + v[s][i].second < e[u]) {
				e[u] = x + v[s][i].second;
				q.push(make_pair(-e[u], u));
			}
		}
	}
	printf("%d", e[cities - 1]);
	return 0;
}

Test details

Test 1

Group: 1

Verdict: ACCEPTED

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

correct output
8

user output
8

Test 2

Group: 1

Verdict: ACCEPTED

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

correct output
9

user output
9

Test 3

Group: 1

Verdict: ACCEPTED

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

correct output
8

user output
8

Test 4

Group: 1

Verdict: ACCEPTED

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

correct output
13

user output
13

Test 5

Group: 1

Verdict: ACCEPTED

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

correct output
4

user output
4

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
999999999

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
999999999

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
999999999

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
999999999

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
999999999

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
999999999

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
999999999

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
999999999

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
999999999

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
(empty)

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)