Rezumat problemă

Prim

#590

Se dă un graf neorientat ponderat conex cu n vârfuri și m muchii – în care fiecare muchie are asociat un cost, număr natural strict pozitiv. Folosind algoritmul lui Prim, determinați un arbore parțial de cost minim, cu rădăcina în vârful 1.

Fișiere Candale Silviu (silviu) ușoară

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Prim

Rezolvă

Detalii

Problema	Prim	Operații I/O	prim.in/prim.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#57777407	Utilizator	The Silentbit (bonta_patric)
Fișier	prim.cpp	Dimensiune	4.05 KB
Data încărcării	15 Aprilie 2025, 18:16	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

prim.cpp: In function 'int prim_mst()':
prim.cpp:193:76: error: wrong number of template arguments (0, should be 1)
  priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<>> Q;

                                                                            ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/istream:38,
                 from /usr/include/c++/4.8/sstream:38,
                 from /usr/include/c++/4.8/complex:45,
                 from /usr/include/c++/4.8/ccomplex:38,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:52,
                 from prim.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:222:12: error: provided for 'template<class _Tp> struct std::greater'
     struct greater : public binary_function<_Tp, _Tp, bool>
            ^
prim.cpp:193:77: error: template argument 3 is invalid
  priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<>> Q;

                                                                             ^
prim.cpp:193:81: error: invalid type in declaration before ';' token
  priority_queue<tuple<int, int, int>, vector<tuple<int, int, int>>, greater<>> Q;

                                                                                 ^
prim.cpp:198:4: error: request for member 'push' in 'Q', which is of non-class type 'int'
  Q.push({0, 1, 0}); // weight, node

    ^
prim.cpp:200:11: error: request for member 'empty' in 'Q', which is of non-class type 'int'
  while(!Q.empty()) {

           ^
prim.cpp:201:8: error: expected unqualified-id before '[' token
   auto [weight, to, from] = Q.top();

        ^
prim.cpp:202:5: error: request for member 'pop' in 'Q', which is of non-class type 'int'
   Q.pop();

     ^
prim.cpp:205:14: error: 'to' was not declared in this scope
   if(visited[to]) {

              ^
prim.cpp:209:10: error: 'weight' was not declared in this scope
   rez += weight;

          ^
prim.cpp:210:11: error: 'to' was not declared in this scope
   visited[to] = 1;

           ^
prim.cpp:211:20: error: 'from' was not declared in this scope
   mstparents[to] = from;

                    ^
prim.cpp:215:7: error: request for member 'push' in 'Q', which is of non-class type 'int'
     Q.push({x.second, x.first, to});

       ^

Cum funcționează evaluarea?