Rezumat problemă

vacanta2020

#3547

În anul 2020, profitând de lipsa oamenilor de pe şosele, guvernul a construit atâtea şosele încât poţi ajunge din orice oraş al patriei în oricare altul. Drumul dintre două oraşe are şi un cost, cel al benzinei consumate. Dorel s-a hotărât să plece într-o excursie, pornind din oraşul 1 până într-un oraş oarecare. El profită şi de oferta guvernului de relansare a turismului, având k vouchere de călătorie. Un voucher îl scuteşte de plata benzinei între două oraşe consecutiv vizitate, traseu pe care îl alege el pentru scutirea plăţii, de asemenea nefiind obligatorie folosirea tuturor voucherelor primite. Aflaţi costul minim al călătoriei din oraşul 1 pâna la fiecare oraş.

Fișiere Bunget Mihai (mihaibun) dificilă

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Dijkstra

Rezolvă

Detalii

Problema	vacanta2020	Operații I/O	vacanta2020.in/vacanta2020.out
Limita timp	2.5 secunde	Limita memorie	Total: 256 MB / Stivă 128 MB
Id soluție	#53180282	Utilizator	Marina Luca (Marina_Luca)
Fișier	vacanta2020.cpp	Dimensiune	1.94 KB
Data încărcării	20 Octombrie 2024, 14:56	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

vacanta2020.cpp: In function 'std::vector<int> bfs_modified(int, int, std::vector<std::vector<Edge> >&)':
vacanta2020.cpp:20:21: error: converting to 'std::queue<std::tuple<int, int, int> >::value_type {aka std::tuple<int, int, int>}' from initializer list would use explicit constructor 'constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int, int, int}; <template-parameter-2-2> = void; _Elements = {int, int, int}]'
     q.push({0, 1, 0});  // {cost, node, vouchers_used}

                     ^
vacanta2020.cpp:23:14: error: expected unqualified-id before '[' token
         auto [cost, node, vouchers_used] = q.front();

              ^
vacanta2020.cpp:26:33: error: 'node' was not declared in this scope
         for (auto& edge : graph[node]) {

                                 ^
vacanta2020.cpp:31:33: error: 'vouchers_used' was not declared in this scope
             if (dist[next_node][vouchers_used] > cost + next_cost) {

                                 ^
vacanta2020.cpp:31:50: error: 'cost' was not declared in this scope
             if (dist[next_node][vouchers_used] > cost + next_cost) {

                                                  ^
vacanta2020.cpp:33:82: error: no matching function for call to 'std::queue<std::tuple<int, int, int> >::push(<brace-enclosed initializer list>)'
                 q.push({dist[next_node][vouchers_used], next_node, vouchers_used});

                                                                                  ^
vacanta2020.cpp:33:82: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from vacanta2020.cpp:3:
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::tuple<int, int, int>&}'
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::tuple<int, int, int> >::value_type&& {aka std::tuple<int, int, int>&&}'
vacanta2020.cpp:37:17: error: 'vouchers_used' was not declared in this scope
             if (vouchers_used < k && dist[next_node][vouchers_used + 1] > cost) {

                 ^
vacanta2020.cpp:37:75: error: 'cost' was not declared in this scope
             if (vouchers_used < k && dist[next_node][vouchers_used + 1] > cost) {

                                                                           ^
vacanta2020.cpp:39:60: error: no matching function for call to 'std::queue<std::tuple<int, int, int> >::push(<brace-enclosed initializer list>)'
                 q.push({cost, next_node, vouchers_used + 1});

                                                            ^
vacanta2020.cpp:39:60: note: candidates are:
In file included from /usr/include/c++/4.8/queue:64:0,
                 from vacanta2020.cpp:3:
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note: void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(const value_type& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:212:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::tuple<int, int, int>&}'
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note: void std::queue<_Tp, _Sequence>::push(std::queue<_Tp, _Sequence>::value_type&&) [with _Tp = std::tuple<int, int, int>; _Sequence = std::deque<std::tuple<int, int, int>, std::allocator<std::tuple<int, int, int> > >; std::queue<_Tp, _Sequence>::value_type = std::tuple<int, int, int>]
       push(value_type&& __x)
       ^
/usr/include/c++/4.8/bits/stl_queue.h:217:7: note:   no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::queue<std::tuple<int, int, int> >::value_type&& {aka std::tuple<int, int, int>&&}'
vacanta2020.cpp:46:64: error: 'min_element' was not declared in this scope
         result[i] = *min_element(dist[i].begin(), dist[i].end());

                                                                ^

Cum funcționează evaluarea?