Detalii evaluare: ~50996816

Detalii evaluare #50996816

Rezumat problema
Detalii
Evaluare
Ajutor

Rezumat problemă

`#1887` Dijkstra2

Dijkstra are nevoie de ajutorul vostru pentru a-și duce la bun sfârșit datoria. Acesta vrea să afle drumurile de lungime minimă de la casa prietenului său Vlad la celelalte case ale vecinilor. Nu are foarte mult timp la dispoziție așa ca trebuie să vă mișcați repede. Îl veți ajuta?

Fișiere
Munteanu Vlad (vladm98)
Vlad Munteanu
dificilă

Rezolvă

Detalii

Problema	Dijkstra2	Operații I/O	`dijkstra2.in`/`dijkstra2.out`
Limita timp	0.2 secunde	Limita memorie	Total: `64 MB` / Stivă `8 MB`
Id soluție	`#50996816`	Utilizator	Popescu-Ilioniu Andrei (andreiilioniu)
Fișier	dijkstra2.cpp	Dimensiune	1.49 KB
Data încărcării	17 Mai 2024, 19:43	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

dijkstra2.cpp: In function 'void citire()':
dijkstra2.cpp:17:16: error: '__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> > >::value_type' has no member named 'push_back'
         adj[x].push_back({y, z});

                ^
dijkstra2.cpp:18:16: error: '__gnu_cxx::__alloc_traits<std::allocator<std::pair<int, int> > >::value_type' has no member named 'push_back'
         adj[y].push_back({x, z}); // Since the graph is undirected

                ^
dijkstra2.cpp: In function 'void dijkstra()':
dijkstra2.cpp:38:32: error: no matching function for call to 'begin(std::pair<int, int>&)'
         for (auto &edge : adj[u]) {

                                ^
dijkstra2.cpp:38:32: note: candidates are:
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94:0,
                 from dijkstra2.cpp:1:
/usr/include/c++/4.8/valarray:1206:5: note: template<class _Tp> const _Tp* std::begin(const std::valarray<_Tp>&)
     begin(const valarray<_Tp>& __va)
     ^
/usr/include/c++/4.8/valarray:1206:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94:0,
                 from dijkstra2.cpp:1:
/usr/include/c++/4.8/valarray:1196:5: note: template<class _Tp> _Tp* std::begin(std::valarray<_Tp>&)
     begin(valarray<_Tp>& __va)
     ^
/usr/include/c++/4.8/valarray:1196:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   'std::pair<int, int>' is not derived from 'std::valarray<_Tp>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/c++/4.8/bits/basic_string.h:42:0,
                 from /usr/include/c++/4.8/string:52,
                 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 dijkstra2.cpp:1:
/usr/include/c++/4.8/initializer_list:89:5: note: template<class _Tp> constexpr const _Tp* std::begin(std::initializer_list<_Tp>)
     begin(initializer_list<_Tp> __ils) noexcept
     ^
/usr/include/c++/4.8/initializer_list:89:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   'std::pair<int, int>' is not derived from 'std::initializer_list<_Tp>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/c++/4.8/string:51: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 dijkstra2.cpp:1:
/usr/include/c++/4.8/bits/range_access.h:87:5: note: template<class _Tp, unsigned int _Nm> _Tp* std::begin(_Tp (&)[_Nm])
     begin(_Tp (&__arr)[_Nm])
     ^
/usr/include/c++/4.8/bits/range_access.h:87:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   mismatched types '_Tp [_Nm]' and 'std::pair<int, int>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/c++/4.8/string:51: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 dijkstra2.cpp:1:
/usr/include/c++/4.8/bits/range_access.h:58:5: note: template<class _Container> decltype (__cont.begin()) std::begin(const _Container&)
     begin(const _Container& __cont) -> decltype(__cont.begin())
     ^
/usr/include/c++/4.8/bits/range_access.h:58:5: note:   template argument deduction/substitution failed:
/usr/include/c++/4.8/bits/range_access.h: In substitution of 'template<class _Container> decltype (__cont.begin()) std::begin(const _Container&) [with _Container = std::pair<int, int>]':
dijkstra2.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/range_access.h:58:5: error: 'const struct std::pair<int, int>' has no member named 'begin'
/usr/include/c++/4.8/bits/range_access.h:48:5: note: template<class _Container> decltype (__cont.begin()) std::begin(_Container&)
     begin(_Container& __cont) -> decltype(__cont.begin())
     ^
/usr/include/c++/4.8/bits/range_access.h:48:5: note:   template argument deduction/substitution failed:
/usr/include/c++/4.8/bits/range_access.h: In substitution of 'template<class _Container> decltype (__cont.begin()) std::begin(_Container&) [with _Container = std::pair<int, int>]':
dijkstra2.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/range_access.h:48:5: error: 'struct std::pair<int, int>' has no member named 'begin'
dijkstra2.cpp:38:32: error: no matching function for call to 'end(std::pair<int, int>&)'
         for (auto &edge : adj[u]) {

                                ^
dijkstra2.cpp:38:32: note: candidates are:
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94:0,
                 from dijkstra2.cpp:1:
/usr/include/c++/4.8/valarray:1226:5: note: template<class _Tp> const _Tp* std::end(const std::valarray<_Tp>&)
     end(const valarray<_Tp>& __va)
     ^
/usr/include/c++/4.8/valarray:1226:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   'std::pair<int, int>' is not derived from 'const std::valarray<_Tp>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:94:0,
                 from dijkstra2.cpp:1:
/usr/include/c++/4.8/valarray:1216:5: note: template<class _Tp> _Tp* std::end(std::valarray<_Tp>&)
     end(valarray<_Tp>& __va)
     ^
/usr/include/c++/4.8/valarray:1216:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   'std::pair<int, int>' is not derived from 'std::valarray<_Tp>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/c++/4.8/bits/basic_string.h:42:0,
                 from /usr/include/c++/4.8/string:52,
                 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 dijkstra2.cpp:1:
/usr/include/c++/4.8/initializer_list:99:5: note: template<class _Tp> constexpr const _Tp* std::end(std::initializer_list<_Tp>)
     end(initializer_list<_Tp> __ils) noexcept
     ^
/usr/include/c++/4.8/initializer_list:99:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   'std::pair<int, int>' is not derived from 'std::initializer_list<_Tp>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/c++/4.8/string:51: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 dijkstra2.cpp:1:
/usr/include/c++/4.8/bits/range_access.h:97:5: note: template<class _Tp, unsigned int _Nm> _Tp* std::end(_Tp (&)[_Nm])
     end(_Tp (&__arr)[_Nm])
     ^
/usr/include/c++/4.8/bits/range_access.h:97:5: note:   template argument deduction/substitution failed:
dijkstra2.cpp:38:32: note:   mismatched types '_Tp [_Nm]' and 'std::pair<int, int>'
         for (auto &edge : adj[u]) {

                                ^
In file included from /usr/include/c++/4.8/string:51: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 dijkstra2.cpp:1:
/usr/include/c++/4.8/bits/range_access.h:78:5: note: template<class _Container> decltype (__cont.end()) std::end(const _Container&)
     end(const _Container& __cont) -> decltype(__cont.end())
     ^
/usr/include/c++/4.8/bits/range_access.h:78:5: note:   template argument deduction/substitution failed:
/usr/include/c++/4.8/bits/range_access.h: In substitution of 'template<class _Container> decltype (__cont.end()) std::end(const _Container&) [with _Container = std::pair<int, int>]':
dijkstra2.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/range_access.h:78:5: error: 'const struct std::pair<int, int>' has no member named 'end'
/usr/include/c++/4.8/bits/range_access.h:68:5: note: template<class _Container> decltype (__cont.end()) std::end(_Container&)
     end(_Container& __cont) -> decltype(__cont.end())
     ^
/usr/include/c++/4.8/bits/range_access.h:68:5: note:   template argument deduction/substitution failed:
/usr/include/c++/4.8/bits/range_access.h: In substitution of 'template<class _Container> decltype (__cont.end()) std::end(_Container&) [with _Container = std::pair<int, int>]':
dijkstra2.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/range_access.h:68:5: error: 'struct std::pair<int, int>' has no member named 'end'

Cum funcționează evaluarea?

www.pbinfo.ro permite evaluarea a două tipuri de probleme:

probleme la care rezolvarea presupune scrierea unui program complet
probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.

Problema Dijkstra2 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:

Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.

Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.