CSES - Datatähti 2016 alku

CSES - Datatähti 2016 alku - Results

Submission details
Task:	Lennot
Sender:	while(false)
Submission time:	2015-10-10 22:25:08 +0300
Language:	C++
Status:	READY
Result:	0

Feedback
group	verdict	score
#1	WRONG ANSWER	0
#2	WRONG ANSWER	0
#3	WRONG ANSWER	0

Test results
test	verdict	time	group
#1	WRONG ANSWER	0.05 s	1	details
#2	ACCEPTED	0.05 s	1	details
#3	WRONG ANSWER	0.05 s	1	details
#4	WRONG ANSWER	0.06 s	1	details
#5	ACCEPTED	0.05 s	1	details
#6	WRONG ANSWER	0.05 s	2	details
#7	WRONG ANSWER	0.06 s	2	details
#8	WRONG ANSWER	0.05 s	2	details
#9	WRONG ANSWER	0.06 s	2	details
#10	WRONG ANSWER	0.05 s	2	details
#11	WRONG ANSWER	0.29 s	3	details
#12	WRONG ANSWER	0.32 s	3	details
#13	WRONG ANSWER	0.27 s	3	details
#14	WRONG ANSWER	0.30 s	3	details
#15	WRONG ANSWER	0.20 s	3	details
#16	ACCEPTED	0.20 s	3	details
#17	ACCEPTED	0.26 s	3	details

Code

#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

long long * PriceE;
long long * PriceO;
int * CityE;
int * CityO;

long long price(int c, bool o);

int main() {
	int n, m = 0;
	cin >> n >> m;
	PriceE = new long long[n];
	PriceO = new long long[n];
	CityE = new int[n];
	CityO = new int[n];

	for (int i = 0; i < n; i++) {
		PriceE[i] = -1;
		PriceO[i] = -1;
		CityE[i] = 0;
		CityO[i] = 0;
	}
	PriceE[0] = 0;

	vector<pair<pair<int, int>, long long>> input;
	for (int i = 0; i < m; i++) {
		int a, b = 0;
		long long h = 0;
		cin >> a >> b >> h;
		a--;
		b--;
		input.push_back(make_pair(make_pair(a, b), h));
	}
	sort(input.begin(), input.end());

	for (int i = 0; i < m; i++) {
		int a = input[i].first.first;
		int b = input[i].first.second;
		long long h = input[i].second;
		if ((PriceE[a] != -1) && ((PriceO[b] == -1) || (price(a, false) + h < price(b, true)))) {
			PriceO[b] = h;
			CityO[b] = a;
		}
		if ((PriceO[a] != -1) && ((PriceE[b] == -1) || (price(a, true) < price(b, false)))) {
			PriceE[b] = 0;
			CityE[b] = a;
		}
	}

	long long Price1 = price(n - 1, false);
	long long Price2 = price(n - 1, true);
	if (Price1 < Price2) {
		cout << Price1;
	}
	else {
		cout << Price2;
	}

	delete[] PriceE;
	delete[] PriceO;
	delete[] CityE;
	delete[] CityO;
	return 0;
}

long long price(int c, bool o) {
	long long output = 0;
	while (c != 0) {
		if (o) {
			output += PriceO[c];
			if (PriceO[c] == -1) {
				return 9223372036854775807LL;
			}
			c = CityO[c];
		}
		else {
			output += PriceE[c];
			if (PriceE[c] == -1) {
				return 9223372036854775807LL;
			}
			c = CityE[c];
		}
		o = !o;
	}
	return output;
}

Test details

Test 1

Group: 1

Verdict: WRONG ANSWER

input
`10 20 2 1 3 7 6 4 1 6 7 1 6 1 ...` view save

correct output
`8` view save

user output
`9223372036854775807` view save

Test 2

Group: 1

Verdict: ACCEPTED

input
`10 20 4 3 10 1 10 9 3 4 10 2 6 7 ...` view save

correct output
`9` view save

user output
`9` view save

Test 3

Group: 1

Verdict: WRONG ANSWER

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

correct output
`8` view save

user output
`9223372036854775807` view save

Test 4

Group: 1

Verdict: WRONG ANSWER

input
`10 20 1 6 2 5 3 3 7 3 6 5 6 2 ...` view save

correct output
`13` view save

user output
`9223372036854775807` view save

Test 5

Group: 1

Verdict: ACCEPTED

input
`10 20 10 8 5 2 4 7 9 4 7 9 4 1 ...` view save

correct output
`4` view save

user output
`4` view save

Test 6

Group: 2

Verdict: WRONG ANSWER

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

correct output
`11893353673` view save

user output
`9223372036854775807` view save

Test 7

Group: 2

Verdict: WRONG ANSWER

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

correct output
`30248963445` view save

user output
`9223372036854775807` view save

Test 8

Group: 2

Verdict: WRONG ANSWER

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

correct output
`3126797692` view save

user output
`9223372036854775807` view save

Test 9

Group: 2

Verdict: WRONG ANSWER

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

correct output
`18416073173` view save

user output
`9223372036854775807` view save

Test 10

Group: 2

Verdict: WRONG ANSWER

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

correct output
`6399349335` view save

user output
`9223372036854775807` view save

Test 11

Group: 3

Verdict: WRONG ANSWER

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

correct output
`518249578675` view save

user output
`9223372036854775807` view save

Test 12

Group: 3

Verdict: WRONG ANSWER

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

correct output
`920862321580` view save

user output
`9223372036854775807` view save

Test 13

Group: 3

Verdict: WRONG ANSWER

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

correct output
`399407698440` view save

user output
`9223372036854775807` view save

Test 14

Group: 3

Verdict: WRONG ANSWER

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

correct output
`165235287505` view save

user output
`9223372036854775807` view save

Test 15

Group: 3

Verdict: WRONG ANSWER

input
`99993 199980 1 3 1 3 2 1 1 4 1 4 2 1 ...` view save

correct output
`2` view save

user output
`9223372036854775807` view save

Test 16

Group: 3

Verdict: ACCEPTED

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

correct output
`1124960` view save

user output
`1124960` view save

Test 17

Group: 3

Verdict: ACCEPTED

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

correct output
`110298` view save

user output
`110298` view save

Datatähti 2016 alku

Lennot

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Tasks

Submissions (while(false))