Task: | Lennot |
Sender: | nagrodus |
Submission time: | 2015-10-04 00:16:59 +0300 |
Language: | C++ |
Status: | READY |
Result: | 24 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 24 |
#2 | WRONG ANSWER | 0 |
#3 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.06 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 1 | details |
#3 | ACCEPTED | 0.05 s | 1 | details |
#4 | ACCEPTED | 0.05 s | 1 | details |
#5 | ACCEPTED | 0.05 s | 1 | details |
#6 | WRONG ANSWER | 0.05 s | 2 | details |
#7 | WRONG ANSWER | 0.05 s | 2 | details |
#8 | WRONG ANSWER | 0.05 s | 2 | details |
#9 | WRONG ANSWER | 0.04 s | 2 | details |
#10 | WRONG ANSWER | 0.05 s | 2 | details |
#11 | WRONG ANSWER | 0.13 s | 3 | details |
#12 | WRONG ANSWER | 0.15 s | 3 | details |
#13 | WRONG ANSWER | 0.14 s | 3 | details |
#14 | WRONG ANSWER | 0.13 s | 3 | details |
#15 | ACCEPTED | 0.09 s | 3 | details |
#16 | ACCEPTED | 0.09 s | 3 | details |
#17 | ACCEPTED | 0.12 s | 3 | details |
Code
#include <iostream> #include <stdio.h> #include <vector> #include <deque> #include <string> using namespace std; int main(int argc, char* argv[]) { ios_base::sync_with_stdio(0); int cities, flights; cin >> cities >> flights; vector<vector<pair<int,int> > > cityList(cities); for (int i = 0; i < flights; i++){ int from,to,price; cin >> from; cin >> to; cin >> price; from--; to--; cityList[from].push_back(make_pair(to,price)); } vector<int> z; vector<pair<int,int> > price(cities, make_pair(-1,-1)); price[0] = make_pair(-1, 0); z.push_back(0); for (unsigned int i = 0; i < z.size(); i++) { for (unsigned int j = 0; j < cityList[z[i]].size(); j++) { int u = cityList[z[i]][j].first; bool b = false; if ((price[u].first == -1 || price[u].first > price[z[i]].second + cityList[z[i]][j].second) && price[z[i]].second != -1){ price[u].first = price[z[i]].second + cityList[z[i]][j].second; b = true; } if ((price[u].second == -1 || price[u].second > price[z[i]].first) && price[z[i]].first != -1){ price[u].second = price[z[i]].first; b = true; } if (b) z.push_back(u); } } if (price[cities - 1].first != -1){ if (price[cities - 1].second != -1){ if (price[cities - 1].first > price[cities - 1].second) cout << price[cities - 1].second; else cout << price[cities - 1].first; } else cout << price[cities - 1].first; } else cout << price[cities - 1].second; 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: WRONG ANSWER
input |
---|
1000 2000 91 828 365044406 17 984 445675537 251 852 100987451 907 487 58830088 ... |
correct output |
---|
11893353673 |
user output |
---|
-2115945921 |
Test 7
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 2000 722 939 530579090 404 606 268877348 133 750 760086153 506 46 582310443 ... |
correct output |
---|
30248963445 |
user output |
---|
-611722528 |
Test 8
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 2000 340 237 43690066 217 141 453160975 744 202 639037814 605 926 404985542 ... |
correct output |
---|
3126797692 |
user output |
---|
-1850670117 |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 2000 88 312 190442306 480 402 411574469 29 901 397491243 636 459 323246996 ... |
correct output |
---|
18416073173 |
user output |
---|
-1583406809 |
Test 10
Group: 2
Verdict: WRONG ANSWER
input |
---|
1000 2000 333 228 718389176 796 286 323493090 743 43 751876815 128 554 175625940 ... |
correct output |
---|
6399349335 |
user output |
---|
-2059114012 |
Test 11
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 200000 28264 92686 186865663 92570 33956 925976418 87377 71249 644757113 16701 81203 922125505 ... |
correct output |
---|
518249578675 |
user output |
---|
-623295054 |
Test 12
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 200000 95740 71482 846654568 44131 16806 670712211 3967 49254 424174139 39369 53007 830346557 ... |
correct output |
---|
920862321580 |
user output |
---|
-1493424165 |
Test 13
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 200000 79947 25489 71554257 59184 25577 328436360 82945 73554 4942918 22380 92385 874250042 ... |
correct output |
---|
399407698440 |
user output |
---|
-1461303068 |
Test 14
Group: 3
Verdict: WRONG ANSWER
input |
---|
100000 200000 31139 12960 580545990 27744 95556 747296719 46969 42578 840321561 5638 28960 513805324 ... |
correct output |
---|
165235287505 |
user output |
---|
-1847740685 |
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 |