CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:nagrodus
Submission time:2015-10-11 16:18:31 +0300
Language:C++
Status:READY
Result:61
Feedback
groupverdictscore
#1ACCEPTED24
#2ACCEPTED37
#30
Test results
testverdicttimegroup
#1ACCEPTED0.06 s1details
#2ACCEPTED0.06 s1details
#3ACCEPTED0.05 s1details
#4ACCEPTED0.05 s1details
#5ACCEPTED0.06 s1details
#6ACCEPTED0.05 s2details
#7ACCEPTED0.06 s2details
#8ACCEPTED0.05 s2details
#9ACCEPTED0.05 s2details
#10ACCEPTED0.06 s2details
#11ACCEPTED0.13 s3details
#12ACCEPTED0.14 s3details
#13ACCEPTED0.14 s3details
#14ACCEPTED0.12 s3details
#15ACCEPTED0.09 s3details
#16--3details
#17--3details

Compiler report

input/code.cpp: In member function 'bool Order::operator()(const P&, const P&) const':
input/code.cpp:15:54: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   return a.second < b.second || a.second == b.second && a.first < b.first;
                                                      ^
input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:49:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int k = 0; k < v[s].size(); k++){
                     ^
input/code.cpp:22:35: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &cities, &flights);
                                   ^
input/code.cpp:26:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &from, &to, &price);
                                        ^

Code

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

using namespace std;

#define ll long long
const long long INF = 10000000000000000L;

typedef pair<ll, int> P;
struct Order
{
	bool operator()(P const& a, P const& b) const
	{
		return a.second < b.second || a.second == b.second && a.first < b.first;
	}
};

int main(int argc, char* argv[])
{
	int cities, flights;
	scanf("%d %d", &cities, &flights);
	vector<vector<pair<int, int>> > v(cities);
	for (int i = 0; i < flights; i++){
		int from, to, price;
		scanf("%d %d %d", &from, &to, &price);
		if (from != cities){
			from--;
			to--;
			v[from].push_back(make_pair(to, price));
		}
	}
	priority_queue<pair<ll, int>> q;
	char *t=new char[cities];
	ll *e=new ll[cities];
	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()) {
		ll x = -q.top().first;
		int s = q.top().second;
		q.pop();
		if (t[s]) continue;
		t[s] = 1;
		for (int k = 0; k < v[s].size(); k++){
			if (v[s][k].first == cities - 1){
				int u = v[s][k].first;
				if (x + v[s][k].second < e[u]) 
					e[u] = x + v[s][k].second;
			}
			else{
				for (unsigned int i = 0; i < v[v[s][k].first].size(); i++) {
					int u = v[v[s][k].first][i].first;
					if (u != s){
						if (x + v[s][k].second < e[u]) {
							e[u] = x + v[s][k].second;
							q.push(make_pair(-e[u], u));
						}
					}
				}
			}
		}
	}
	printf("%lld", e[cities - 1]);
	delete[]t;
	delete[]e;
	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: ACCEPTED

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

correct output
11893353673

user output
11893353673

Test 7

Group: 2

Verdict: ACCEPTED

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

correct output
30248963445

user output
30248963445

Test 8

Group: 2

Verdict: ACCEPTED

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

correct output
3126797692

user output
3126797692

Test 9

Group: 2

Verdict: ACCEPTED

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

correct output
18416073173

user output
18416073173

Test 10

Group: 2

Verdict: ACCEPTED

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

correct output
6399349335

user output
6399349335

Test 11

Group: 3

Verdict: ACCEPTED

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

correct output
518249578675

user output
518249578675

Test 12

Group: 3

Verdict: ACCEPTED

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

correct output
920862321580

user output
920862321580

Test 13

Group: 3

Verdict: ACCEPTED

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

correct output
399407698440

user output
399407698440

Test 14

Group: 3

Verdict: ACCEPTED

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

correct output
165235287505

user output
165235287505

Test 15

Group: 3

Verdict: ACCEPTED

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

correct output
2

user output
2

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)