CSES - Datatähti 2016 alku - Results
Submission details
Task:Lennot
Sender:nagrodus
Submission time:2015-10-03 21:39:20 +0300
Language:C++
Status:READY
Result:0
Feedback
groupverdictscore
#10
#20
#30
Test results
testverdicttimegroup
#10.32 s1details
#20.29 s1details
#30.29 s1details
#40.29 s1details
#50.28 s1details
#60.34 s2details
#70.32 s2details
#80.34 s2details
#90.35 s2details
#100.35 s2details
#110.50 s3details
#120.50 s3details
#130.50 s3details
#140.50 s3details
#150.29 s3details
#160.40 s3details
#170.41 s3details

Compiler report

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:74:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < z.size(); i++) {
                    ^
input/code.cpp:75:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < cityList[z[i]].size(); j++) { 
                     ^
input/code.cpp:96:17: warning: ignoring return value of 'int system(const char*)', declared with attribute warn_unused_result [-Wunused-result]
  system("pause");
                 ^

Code

// DT4.cpp : Defines the entry point for the console application.
//

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

using namespace std;

#define ll long long

struct flight {
	int from;
	int to;
	int price;
};
struct flightPlan {
	//struct flight f;
	int flightsLeft;
	int unevenCost;
	int evenCost;
	vector<int> visited;
};
struct city {
	//vector<flight> flightsFrom;
	vector<flight> flightsIn;
	vector<flightPlan> plans;
};
typedef struct flight flight;
typedef struct city city;
typedef struct flightPlan flightPlan;

/*int haku(city *cityList,int pos,int cities,int price,int count){
	if (pos == cities-1)
		return price;
	cityList[pos].isVisited = 1;
	int bestPrice = -1;
	for (int i = 0; i < cityList[pos].flightsFrom.size(); i++){
		if (cityList[cityList[pos].flightsFrom[i].to].isVisited==0){
			int newPos = cityList[pos].flightsFrom[i].to;
			int newPrice = price;
			if (count % 2 != 0)
				newPrice += cityList[pos].flightsFrom[i].price;
			//cout << "taking flight from " << pos << " to " << newPos << endl;
			int ret = haku(cityList, newPos, cities, newPrice, count + 1);
			//cout << "ret from: " << ret << "  ( from " << pos << " to " << newPos << ")" << endl;
			if ((ret != -1) && (ret < bestPrice || bestPrice == -1))
				bestPrice = ret;
		}
	}
	cityList[pos].isVisited = 0;
	return bestPrice;
}*/

int main(int argc, char* argv[])
{
	ios_base::sync_with_stdio(0);
	int cities, flights;
	cin >> cities >> flights;
	vector<vector<pair<ll, ll> > > cityList(cities);

	for (int i = 0; i < flights; i++){
		int from,to,price;
		cin >> from >> to >> price;
		from--;
		to--;
		cityList[from].push_back(make_pair(to, price));
	}
	vector<int> z;
	vector<pair<ll, ll> > price(cities, make_pair(0, 0));
	vector<pair<int,int> > isAdded(cities, make_pair(0, 0));
	z.push_back(0);
	for (int i = 0; i < z.size(); i++) {
		for (int j = 0; j < cityList[z[i]].size(); j++) { 
			int u = cityList[z[i]][j].first; 
			if ((i + 1) % 2 != 0){
				//if (isAdded[u].first) continue;
				isAdded[u].first = 1;
				if (price[u].first == 0 || price[u].first > price[z[i]].second + cityList[z[i]][j].second)
					price[u].first = price[z[i]].second + cityList[z[i]][j].second;
			}
			else{
				//if (isAdded[u].second) continue;
				isAdded[u].second = 1;
				if (price[u].second == 0 || price[u].first > price[z[i]].second)
					price[u].second = price[z[i]].first;
			}
			z.push_back(u);
		}
	}
	if (cities%2==0)
		cout << price[cities - 1].first;
	else
		cout << price[cities - 1].second;
	system("pause");
	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
(empty)

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

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

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

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

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:

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

correct output
165235287505

user output
(empty)

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)