Rezumat problemă

Kruskal

#592

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 Kruskal, determinați un arbore parțial de cost minim.

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

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Kruskal

Rezolvă

Detalii

Problema	Kruskal	Operații I/O	kruskal.in/kruskal.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64652207	Utilizator	Postelnicu Alexandru (Postelnicu_Alexandru)
Fișier	kruskal.cpp	Dimensiune	1.50 KB
Data încărcării	20 Mai 2026, 16:24	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

In file included from /usr/include/c++/13/functional:53,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53,
                 from kruskal.cpp:1:
/usr/include/c++/13/tuple: In instantiation of ‘struct std::tuple_element<3, std::tuple<int, int, int> >’:
/usr/include/c++/13/bits/utility.h:84:11:   required by substitution of ‘template<long unsigned int __i, class _Tp> using std::__tuple_element_t = typename std::tuple_element::type [with long unsigned int __i = 3; _Tp = std::tuple<int, int, int>]’
/usr/include/c++/13/tuple:1824:5:   required by substitution of ‘template<long unsigned int __i, class ... _Elements> constexpr std::__tuple_element_t<__i, std::tuple<_Types ...> >&& std::get(const tuple<_Types ...>&&) [with long unsigned int __i = 3; _Elements = {int, int, int}]’
kruskal.cpp:57:24:   required from here
/usr/include/c++/13/tuple:1780:25: error: static assertion failed: tuple index must be in range
 1780 |       static_assert(__i < sizeof...(_Types), "tuple index must be in range");
      |                     ~~~~^~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/tuple:1780:25: note: the comparison reduces to ‘(3 < 3)’
/usr/include/c++/13/tuple:1782:13: error: no type named ‘type’ in ‘struct std::_Nth_type<3, int, int, int>’
 1782 |       using type = typename _Nth_type<__i, _Types...>::type;
      |             ^~~~
kruskal.cpp: In function ‘int main()’:
kruskal.cpp:57:24: error: use of deleted function ‘constexpr std::__enable_if_t<(__i >= sizeof... (_Types))> std::get(const tuple<_Types ...>&) [with long unsigned int __i = 3; _Elements = {int, int, int}; __enable_if_t<(__i >= sizeof... (_Types))> = void]’
   57 |         int cost=get<3>(it);
      |                  ~~~~~~^~~~
/usr/include/c++/13/tuple:1834:5: note: declared here
 1834 |     get(const tuple<_Elements...>&) = delete;
      |     ^~~
kruskal.cpp:37:12: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   37 |     freopen("kruskal.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
kruskal.cpp:38:12: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   38 |     freopen("kruskal.out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Cum funcționează evaluarea?