Šeštadieninė informatikos olimpiadininkų mokykla

Dijkstros algoritmas

• [1] 2025-03-22 12:22 (66.7)
• [2] 2025-03-22 12:39 (66.7)
• [3] 2025-03-22 12:41 (66.7)
• [4] 2025-03-22 12:44 (100)

Taškai: 66.7

Compile: OK

dijkstra.cpp: In function ‘void dijkstra(int, std::vector<std::vector<std::pair<int, int> > >&)’: dijkstra.cpp:14:14: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ 14 | auto [d, node] = pq.top(); | ^ dijkstra.cpp:17:18: warning: structured bindings only available with ‘-std=c++17’ or ‘-std=gnu++17’ 17 | for(auto [neigh, w] : graph[node]) { | ^

nr.	result	time	message
1	True	0.001 s	ok
2	True	0.001 s	ok
3	True	0.127 s	ok
4	False	0.104 s	Neteisinga eilutė
5	True	0.001 s	ok
6	True	0.118 s	ok
7	True	0.118 s	ok
8	True	0.109 s	ok
9	True	0.102 s	ok
10	True	0.144 s	ok
11	True	0.001 s	ok
12	True	0.001 s	ok
13	True	0.001 s	ok
14	False	0.221 s	Neteisinga eilutė
15	False	0.225 s	Neteisinga eilutė
16	False	0.218 s	Neteisinga eilutė
17	False	0.236 s	Neteisinga eilutė
18	False	0.227 s	Neteisinga eilutė