Rezumat problemă

TollRoads

#2933

N oraşe sunt conectate între ele prin M autostrăzi bidirecţionale, fiecare autostradă (a, b) având un cost de tranzit c ataşat. Se doreşte revizuirea sistemului de taxare, însă sunt câteva aspecte ce trebuie luate în calcul şi necesită investigaţie, deoarece o parte dintre cele N oraşe sunt centre comerciale sau turistice importante. Se doreşte să se afle răspunsul la o serie de Q întrebări de forma: (X, T) – câte dintre celelalte N-1 oraşe au acces către oraşul X, cu o taxă totală de cel mult T către fiecare oraş?

Info Oltenia 2019

Fișiere Andrei Visalon (Prekzursil) Cosmin Piț-Rada concurs

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Dijkstra Algoritmul lui Dial

Rezolvă

Detalii

Problema	TollRoads	Operații I/O	tollroads.in/tollroads.out
Limita timp	1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#50325715	Utilizator	David Alex (AleXutzZu)
Fișier	tollroads.cpp	Dimensiune	2.24 KB
Data încărcării	04 Aprilie 2024, 17:22	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

tollroads.cpp: In member function 'std::vector<int> Graph::dial(int, int)':
tollroads.cpp:31:30: error: expected unqualified-id before '[' token
             for (const auto &[next, weight]: adj[node]) {

                              ^
tollroads.cpp:31:30: error: expected ';' before '[' token
tollroads.cpp:31:31: error: 'next' was not declared in this scope
             for (const auto &[next, weight]: adj[node]) {

                               ^
tollroads.cpp:31:31: note: suggested alternative:
In file included from /usr/include/c++/4.8/bits/stl_algobase.h:66:0,
                 from /usr/include/c++/4.8/bits/char_traits.h:39,
                 from /usr/include/c++/4.8/ios:40,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tollroads.cpp:1:
/usr/include/c++/4.8/bits/stl_iterator_base_funcs.h:184:5: note:   'std::next'
     next(_ForwardIterator __x, typename
     ^
tollroads.cpp:31:37: error: 'weight' was not declared in this scope
             for (const auto &[next, weight]: adj[node]) {

                                     ^
tollroads.cpp: In lambda function:
tollroads.cpp:31:44: error: expected '{' before ':' token
             for (const auto &[next, weight]: adj[node]) {

                                            ^
tollroads.cpp: In member function 'std::vector<int> Graph::dial(int, int)':
tollroads.cpp:31:44: error: expected ';' before ':' token
tollroads.cpp:31:44: error: expected primary-expression before ':' token
tollroads.cpp:31:44: error: expected ')' before ':' token
tollroads.cpp:31:44: error: expected primary-expression before ':' token
tollroads.cpp:31:44: error: expected ';' before ':' token
tollroads.cpp:40:5: error: expected '}' at end of input
     }

     ^
tollroads.cpp:40:5: error: expected '}' at end of input
tollroads.cpp:40:5: warning: no return statement in function returning non-void [-Wreturn-type]
tollroads.cpp: In function 'int main()':
tollroads.cpp:68:40: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("tollroads.in", "r", stdin);

                                        ^
tollroads.cpp:69:42: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen("tollroads.out", "w", stdout);

                                          ^

Cum funcționează evaluarea?