Šeštadieninė informatikos olimpiadininkų mokykla

Dijkstros algoritmas

• [1] 2025-03-22 12:20 (5.6)
• [2] 2025-03-22 12:21 (5.6)
• [3] 2025-03-22 12:21 (5.6)
• [4] 2025-03-22 12:23 (5.6)
• [5] 2025-03-22 12:24 (5.6)
• [6] 2025-03-22 12:25 (5.6)
• [7] 2025-03-22 12:26 (5.6)
• [8] 2025-03-22 12:27 (5.6)
• [9] 2025-03-22 12:28 (5.6)
• [10] 2025-03-22 12:29 (22.2)
• [11] 2025-03-22 12:33 (100)

Taškai: 100

Compile: OK

dijkstra.cpp: In function ‘int main()’: dijkstra.cpp:33:14: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ 33 | auto [distCur, from]= pq.top(); | ^ dijkstra.cpp:39:18: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ 39 | for(auto [to, distTo] : G[from]){ | ^

nr.	result	time	message
1	True	0.001 s	ok
2	True	0.001 s	ok
3	True	0.147 s	ok
4	True	0.13 s	ok
5	True	0.001 s	ok
6	True	0.13 s	ok
7	True	0.138 s	ok
8	True	0.119 s	ok
9	True	0.111 s	ok
10	True	0.16 s	ok
11	True	0.001 s	ok
12	True	0.001 s	ok
13	True	0.001 s	ok
14	True	0.264 s	ok
15	True	0.265 s	ok
16	True	0.268 s	ok
17	True	0.26 s	ok
18	True	0.256 s	ok