Task: | Sadonkorjuu |
Sender: | FenixHongell |
Submission time: | 2022-11-06 21:29:33 +0200 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
#2 | WRONG ANSWER | 0 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#2 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#3 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#4 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#5 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#6 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#7 | WRONG ANSWER | 0.28 s | 2 | details |
#8 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#9 | WRONG ANSWER | 0.28 s | 2 | details |
#10 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#11 | WRONG ANSWER | 0.28 s | 2 | details |
#12 | WRONG ANSWER | 0.26 s | 2 | details |
#13 | WRONG ANSWER | 0.26 s | 2 | details |
#14 | WRONG ANSWER | 0.26 s | 2 | details |
#15 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#16 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#17 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#18 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#19 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#20 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#21 | WRONG ANSWER | 0.25 s | 2 | details |
#22 | WRONG ANSWER | 0.25 s | 2 | details |
#23 | WRONG ANSWER | 0.34 s | 2 | details |
#24 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#25 | WRONG ANSWER | 0.26 s | 2 | details |
#26 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#27 | WRONG ANSWER | 0.22 s | 2 | details |
#28 | WRONG ANSWER | 0.00 s | 1, 2 | details |
#29 | WRONG ANSWER | 0.22 s | 2 | details |
#30 | WRONG ANSWER | 0.01 s | 1, 2 | details |
#31 | WRONG ANSWER | 0.25 s | 2 | details |
Code
#include <iostream> #include <string> #include <list> #include <vector> #include <queue> #include <map> #include <set> #include <climits> using namespace std; template<typename T> class Graph { map<T, list<pair<T, int>>> l; public: void addEdge(T x, T y, int wt) { l[x].push_back({y, wt}); l[y].push_back({x, wt}); } void djikstraSSSP(T src, vector<int>& scores) { map<T, int> dist; for (auto p : l) { T node = p.first; dist[node] = INT_MAX; } dist[src] = 0; set<pair<int, T>> s; s.insert({dist[src], src}); while (!s.empty()) { pair<int, T> p = *s.begin(); s.erase(s.begin()); T currNode = p.second; int currNodeDist = p.first; for (auto nbr : l[currNode]) { T nbrNode = nbr.first; int distInBetween = nbr.second; int nbrNodeDist = dist[nbrNode]; if (currNodeDist + distInBetween < nbrNodeDist) { auto pr = s.find({dist[nbrNode], nbrNode}); if (pr != s.end()) { s.erase(pr); } dist[nbrNode] = currNodeDist + distInBetween; s.insert({dist[nbrNode], nbrNode}); } } } int i = 0; for (auto x : dist) { if (scores[i] != -1) { if (scores[i] > x.second) { scores[i] = x.second; } } else { scores[i] = x.second; } ++i; } } }; int main() { Graph<int> g; int V = 0; cin >> V; int i = 0; int paths = V-1; string roles; std::getline(cin, roles); vector<int> scores(V, -1); while (i < paths) { int a,b,c; cin >> a >> b >> c; g.addEdge(a,b,c); ++i; } int j = 1; for (char& c : roles) { if (string(1,c) == "0") { g.djikstraSSSP(j, scores); ++j; } } int totalLength = 0; for (int num : scores) { totalLength += num; } cout << totalLength; }
Test details
Test 1
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1 0 |
correct output |
---|
0 |
user output |
---|
-1 |
Test 2
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
5 0 0 0 0 0 1 2 1 2 3 2 3 4 3 ... |
correct output |
---|
0 |
user output |
---|
-5 |
Test 3
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
4 1 0 1 1 1 2 10 2 3 20 2 4 30 |
correct output |
---|
60 |
user output |
---|
-4 |
Test 4
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
5 0 1 1 1 0 1 2 10 2 3 20 3 4 30 ... |
correct output |
---|
80 |
user output |
---|
-5 |
Test 5
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
5 0 1 0 1 1 1 2 1 2 3 5 3 4 3 ... |
correct output |
---|
6 |
user output |
---|
-5 |
Test 6
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5506363 |
user output |
---|
-1000 |
Test 7
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1795118520 |
user output |
---|
-200000 |
Test 8
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 1 0 1 1 0 1 0 1 1 0 0 0 1 ... |
correct output |
---|
293576 |
user output |
---|
-1000 |
Test 9
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
816932444 |
user output |
---|
-200000 |
Test 10
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
3089 |
user output |
---|
-1000 |
Test 11
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
40839 |
user output |
---|
-200000 |
Test 12
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
5683983203973 |
user output |
---|
-200000 |
Test 13
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 0 1 1 1 1 1 1 0 0 0 1 1 0 1 0 ... |
correct output |
---|
58572993 |
user output |
---|
-200000 |
Test 14
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
32755 |
user output |
---|
-200000 |
Test 15
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
126238345 |
user output |
---|
-1000 |
Test 16
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 0 1 0 1 1 1 0 0 1 0 1 1 0 ... |
correct output |
---|
278678 |
user output |
---|
-1000 |
Test 17
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 0 0 0 1 0 0 0 1 0 0 0 0 0 0 ... |
correct output |
---|
34929 |
user output |
---|
-1000 |
Test 18
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1543963 |
user output |
---|
-1000 |
Test 19
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
39606 |
user output |
---|
-1000 |
Test 20
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 0 1 0 1 0 0 0 0 1 1 0 0 0 1 ... |
correct output |
---|
321598 |
user output |
---|
-1000 |
Test 21
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
978670626 |
user output |
---|
-200000 |
Test 22
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ... |
correct output |
---|
375218 |
user output |
---|
-200000 |
Test 23
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 0 0 0 0 0 1 0 1 0 1 1 ... |
correct output |
---|
60422556 |
user output |
---|
-200000 |
Test 24
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
291990 |
user output |
---|
-1000 |
Test 25
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
59607954 |
user output |
---|
-200000 |
Test 26
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
990 |
user output |
---|
-1000 |
Test 27
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
199982 |
user output |
---|
-200000 |
Test 28
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
7987 |
user output |
---|
-1000 |
Test 29
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
3137875 |
user output |
---|
-200000 |
Test 30
Group: 1, 2
Verdict: WRONG ANSWER
input |
---|
1000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
4657693 |
user output |
---|
-1000 |
Test 31
Group: 2
Verdict: WRONG ANSWER
input |
---|
200000 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
correct output |
---|
1652889357 |
user output |
---|
-200000 |