Š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: 5.6

Compile: OK

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

nr.	result	time	message
1	False	0.002 s	Neteisinga eilutė
2	False	0.001 s	Neteisinga eilutė
3	False	0.052 s	Caught fatal signal 11
4	False	0.052 s	Caught fatal signal 11
5	True	0.001 s	ok
6	False	0.052 s	Caught fatal signal 11
7	False	0.052 s	Caught fatal signal 11
8	False	0.051 s	Caught fatal signal 11
9	False	0.055 s	Caught fatal signal 11
10	False	0.053 s	Caught fatal signal 11
11	False	0.001 s	Neteisinga eilutė
12	False	0.001 s	Neteisinga eilutė
13	False	0.001 s	Neteisinga eilutė
14	False	0.063 s	Caught fatal signal 11
15	False	0.068 s	Caught fatal signal 11
16	False	0.053 s	Caught fatal signal 11
17	False	0.051 s	Caught fatal signal 11
18	False	0.053 s	Caught fatal signal 11