#591
Firma
Într-o țară sunt n
orașe, numerotate de la 1
la n
, unite între ele prin m
șosele bidirecționale de lungimi cunoscute, între oricare două orașe existând drum, fie șosea directă, fie prin alte orașe. O firmă dorește să-și stabilească sediul în unul dintre orașe, astfel încât suma lungimilor drumurilor minime de la orașul în care se află sediul la toate celelaltele orașe să fie minimă. Determinați orașul care va fi ales pentru sediul firmei. Dacă sunt mai multe orașe care pot fi alese, se va alege cel cu numărul de ordine mai mic.
Problema | Firma | Operații I/O |
![]() firma.in /firma.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #49542539 | Utilizator | |
Fișier | firma.cpp | Dimensiune | 1.32 KB |
Data încărcării | 06 Martie 2024, 14:00 | Scor / rezultat | Eroare de compilare |
firma.cpp:9:1: error: expected ']' before 'int' int n , m , x , y , w , D[101] , mini , ind; ^ firma.cpp: In function 'void init()': firma.cpp:13:26: error: 'n' was not declared in this scope for(int i = 1 ; i <= n ; i++) ^ firma.cpp:14:9: error: 'D' was not declared in this scope D[i] = Inf; ^ firma.cpp: In function 'void dijkstra(int)': firma.cpp:20:5: error: 'D' was not declared in this scope D[nod] = 0; ^ firma.cpp:28:21: error: 'G' was not declared in this scope for(auto& p:G[y]) ^ firma.cpp:35:44: error: no matching function for call to 'std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int> >, std::greater<std::pair<int, int> > >::push(<brace-enclosed initializer list>)' Q.push({D[nodnou] , nodnou}); ^ firma.cpp:35:44: note: candidates are: In file included from /usr/include/c++/4.8/queue:64:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:85, from firma.cpp:1: /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(const value_type&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::greater<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>] push(const value_type& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:496:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'const value_type& {aka const std::pair<int, int>&}' /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: void std::priority_queue<_Tp, _Sequence, _Compare>::push(std::priority_queue<_Tp, _Sequence, _Compare>::value_type&&) [with _Tp = std::pair<int, int>; _Sequence = std::vector<std::pair<int, int> >; _Compare = std::greater<std::pair<int, int> >; std::priority_queue<_Tp, _Sequence, _Compare>::value_type = std::pair<int, int>] push(value_type&& __x) ^ /usr/include/c++/4.8/bits/stl_queue.h:504:7: note: no known conversion for argument 1 from '<brace-enclosed initializer list>' to 'std::priority_queue<std::pair<int, int>, std::vector<std::pair<int, int> >, std::greater<std::pair<int, int> > >::value_type&& {aka std::pair<int, int>&&}' firma.cpp: In function 'int main()': firma.cpp:43:5: error: reference to 'cin' is ambiguous cin >> n >> m; ^ firma.cpp:3:10: note: candidates are: std::ifstream cin ifstream cin("firma.in"); ^ In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0, from firma.cpp:1: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ firma.cpp:43:12: error: 'n' was not declared in this scope cin >> n >> m; ^ firma.cpp:43:17: error: 'm' was not declared in this scope cin >> n >> m; ^ firma.cpp:46:9: error: reference to 'cin' is ambiguous cin >> x >> y >> w; ^ firma.cpp:3:10: note: candidates are: std::ifstream cin ifstream cin("firma.in"); ^ In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0, from firma.cpp:1: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ firma.cpp:46:16: error: 'x' was not declared in this scope cin >> x >> y >> w; ^ firma.cpp:46:21: error: 'y' was not declared in this scope cin >> x >> y >> w; ^ firma.cpp:46:26: error: 'w' was not declared in this scope cin >> x >> y >> w; ^ firma.cpp:47:9: error: 'G' was not declared in this scope G[x].push_back({y , w}); ^ firma.cpp:50:5: error: 'mini' was not declared in this scope mini = Inf; ^ firma.cpp:57:20: error: 'D' was not declared in this scope sum += D[j]; ^ firma.cpp:58:37: error: 'ind' was not declared in this scope if(sum < mini) mini = sum , ind = i; ^ firma.cpp:60:5: error: reference to 'cout' is ambiguous cout << ind; ^ firma.cpp:4:10: note: candidates are: std::ofstream cout ofstream cout("firma.out"); ^ In file included from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:74:0, from firma.cpp:1: /usr/include/c++/4.8/iostream:61:18: note: std::ostream std::cout extern ostream cout; /// Linked to standard output ^ firma.cpp:60:13: error: 'ind' was not declared in this scope cout << ind; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Firma face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.