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

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:29: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:35:55: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &from, &f.list[TO], &f.list[COST]);
                                                       ^

Code

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

using namespace std;

struct city{
	int cityID;
	int id;
};
struct priceStruct{
	long price[3];
};
struct flight{
	int list[3];
};
typedef struct city city;
typedef struct flight flight;
typedef struct priceStruct priceStruct;

#define NOTSET -1
#define COST 0
#define FREE 1
#define TO 2
#define SWAP(x) ( (x-1) *-1) 

int main(int argc, char* argv[])
{
	int cities, flights;
	scanf("%d %d", &cities, &flights);
	vector<vector<flight> > cityList(cities);
	flight f;
	f.list[FREE] = 0;
	for (int i = 0; i < flights; i++){
		int from;
		scanf("%d %d %d", &from, &f.list[TO], &f.list[COST]);
		if (from != cities && f.list[TO]!=1){
			from--;
			f.list[TO]--;
			cityList[from].push_back(f);
		}
	}
	priceStruct ps;
	ps.price[COST] = -1;
	ps.price[FREE] = -1;
	vector<city> z;
	vector<priceStruct> price(cities, ps);
	price[0].price[COST] = 0;
	price[0].price[FREE] = -1;
	city c;
	c.cityID = 0;
	c.id = COST;
	z.push_back(c);
	for (unsigned int i = 0; i < z.size(); i++) {
		int id = z[i].id;
		for (unsigned int j = 0; j < cityList[z[i].cityID].size(); j++) {
			int dest = cityList[z[i].cityID][j].list[TO];
			city c;
			c.cityID = dest;
			c.id=SWAP(id);
			long prevPrice = price[dest].price[c.id], newPrice = price[z[i].cityID].price[id] + cityList[z[i].cityID][j].list[id];
			if ((prevPrice == NOTSET || newPrice < prevPrice)){
				price[dest].price[c.id] = newPrice;
				z.push_back(c);
			}
		}
	}
	if (price[cities - 1].price[COST] != NOTSET){
		if (price[cities - 1].price[FREE] != NOTSET){
			if (price[cities - 1].price[COST] > price[cities - 1].price[FREE])
				printf("%ld", price[cities - 1].price[FREE]);
			else
				printf("%ld", price[cities - 1].price[COST]);
		}
		else
			printf("%ld", price[cities - 1].price[COST]);
	}
	else
		printf("%ld", price[cities - 1].price[FREE]);
	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
10

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:

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

correct output
518249578675

user output
(empty)

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

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

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: ACCEPTED

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

correct output
1124960

user output
1124960

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
110298

user output
110298