Dijkstros algoritmas
- [1] 2025-03-22 12:08 (66.7)
- [2] 2025-03-22 12:10 (100)
Taškai: 66.7
Compile: OK
dijkstra.cpp: In function ‘int main()’: dijkstra.cpp:34:14: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ 34 | auto [kel, id] = pq.top(); | ^ dijkstra.cpp:42:18: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ 42 | for(auto [j, d] : ajs[id]) | ^
nr. | result | time | message |
---|---|---|---|
1 | True | 0.001 s | ok |
2 | True | 0.001 s | ok |
3 | True | 0.135 s | ok |
4 | False | 0.121 s | Neteisinga eilutė |
5 | True | 0.001 s | ok |
6 | True | 0.124 s | ok |
7 | True | 0.134 s | ok |
8 | True | 0.123 s | ok |
9 | True | 0.123 s | ok |
10 | True | 0.17 s | ok |
11 | True | 0.001 s | ok |
12 | True | 0.001 s | ok |
13 | True | 0.001 s | ok |
14 | False | 0.256 s | Neteisinga eilutė |
15 | False | 0.241 s | Neteisinga eilutė |
16 | False | 0.239 s | Neteisinga eilutė |
17 | False | 0.264 s | Neteisinga eilutė |
18 | False | 0.25 s | Neteisinga eilutė |