Rezumat problemă

pitici1

#4213

În vârful muntelui Acrom trăiesc pe timpul verii K pitici, numerotaţi de la 1 la K. Pe munte există N cabane, aflate la altitudini diferite, legate între ele de M poteci. Cabana piticilor este numerotată cu 1, iar cabana de la poalele muntelui cu N. Fiindcă iarna este prea frig, piticii se mută în cabana de la poalele muntelui, unde este mai cald. Piticii sunt disciplinaţi şi coboară de pe munte în ordinea crescătoare a numerelor lor. Scrieţi un program care să determine lungimea drumului ales de fiecare pitic, drum ce respectă condiţiile din enunţ.

Lot informatică, Ploiești, 2006

Fișiere Pracsiu Dan (dnprx) Dan-Ionuț Fechete concurs

Clasa 11 Teoria Grafurilor Probleme diverse cu grafuri orientate Heapuri

Rezolvă

Detalii

Problema	pitici1	Operații I/O	pitici.in/pitici.out
Limita timp	0.5 secunde	Limita memorie	Total: 128 MB / Stivă 64 MB
Id soluție	#62696690	Utilizator	Luncan Raul (raulluncan)
Fișier	pitici1.cpp	Dimensiune	2.70 KB
Data încărcării	29 Ianuarie 2026, 20:56	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

pitici1.cpp: In function 'int main()':
pitici1.cpp:77:48: error: 'edge' was not declared in this scope
                     heap.push({dist[pred][k] + edge.cost, pred, k});

                                                ^
pitici1.cpp:77:67: error: no matching function for call to 'std::priority_queue<HeapNode>::push(<brace-enclosed initializer list>)'
                     heap.push({dist[pred][k] + edge.cost, pred, k});

                                                                   ^
pitici1.cpp:77:67: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:85,
                 from pitici1.cpp:1:
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = HeapNode; _Sequence = std::vector<HeapNode, std::allocator<HeapNode> >; _Compare = std::less<HeapNode>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = HeapNode]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const HeapNode&}'
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = HeapNode; _Sequence = std::vector<HeapNode, std::allocator<HeapNode> >; _Compare = std::less<HeapNode>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = HeapNode]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<HeapNode>::value_type&& {aka HeapNode&&}'
pitici1.cpp:92:64: error: 'edge' was not declared in this scope
                 heap.push({dist[current.node][current.k + 1] + edge.cost, current.node, current.k + 1});

                                                                ^
pitici1.cpp:92:103: error: no matching function for call to 'std::priority_queue<HeapNode>::push(<brace-enclosed initializer list>)'
                 heap.push({dist[current.node][current.k + 1] + edge.cost, current.node, current.k + 1});

                                                                                                       ^
pitici1.cpp:92:103: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:85,
                 from pitici1.cpp:1:
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = HeapNode; _Sequence = std::vector<HeapNode, std::allocator<HeapNode> >; _Compare = std::less<HeapNode>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = HeapNode]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:496:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const HeapNode&}'
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = HeapNode; _Sequence = std::vector<HeapNode, std::allocator<HeapNode> >; _Compare = std::less<HeapNode>; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = HeapNode]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:504:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<HeapNode>::value_type&& {aka HeapNode&&}'

Cum funcționează evaluarea?