Rezumat problemă

Dijkstra

#588

Se dă un graf orientat ponderat – în care fiecare arc are asociat un cost, număr natural strict pozitiv, și un nod p. Să se determine, folosind algoritmul lui Dijkstra, costul minim al drumului de la p la fiecare nod al grafului.

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

Clasa 11 Teoria Grafurilor Grafuri cu costuri Algoritmul lui Dijkstra

Rezolvă

Detalii

Problema	Dijkstra	Operații I/O	dijkstra.in/dijkstra.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#36837571	Utilizator	Macrisi Denis Constantin (MacrisiDenis)
Fișier	dijkstra.cpp	Dimensiune	1.06 KB
Data încărcării	25 Mai 2022, 12:15	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

dijkstra.cpp:13:1: error: 'vector' does not name a type
 vector <PI> G[100001];

 ^
dijkstra.cpp: In function 'void dijkstra(int)':
dijkstra.cpp:17:5: error: 'priority_queue' was not declared in this scope
     priority_queue < PI , vector<PI> , greater<PI> > Q;

     ^
dijkstra.cpp:17:25: error: expected primary-expression before ',' token
     priority_queue < PI , vector<PI> , greater<PI> > Q;

                         ^
dijkstra.cpp:17:27: error: 'vector' was not declared in this scope
     priority_queue < PI , vector<PI> , greater<PI> > Q;

                           ^
dijkstra.cpp:17:36: error: expected primary-expression before '>' token
     priority_queue < PI , vector<PI> , greater<PI> > Q;

                                    ^
dijkstra.cpp:17:38: error: expected primary-expression before ',' token
     priority_queue < PI , vector<PI> , greater<PI> > Q;

                                      ^
dijkstra.cpp:17:52: error: expected primary-expression before '>' token
     priority_queue < PI , vector<PI> , greater<PI> > Q;

                                                    ^
dijkstra.cpp:17:54: error: 'Q' was not declared in this scope
     priority_queue < PI , vector<PI> , greater<PI> > Q;

                                                      ^
dijkstra.cpp:26:20: error: 'G' was not declared in this scope
        for(auto& q:G[y])

                    ^
dijkstra.cpp: In function 'int main()':
dijkstra.cpp:41:5: error: reference to 'cin' is ambiguous
     cin >> n >> p;

     ^
dijkstra.cpp:8:10: note: candidates are: std::ifstream cin
 ifstream cin("dijkstra.in");

          ^
In file included from dijkstra.cpp:1:0:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
dijkstra.cpp:42:11: error: reference to 'cin' is ambiguous
     while(cin >> x >> y >> w)

           ^
dijkstra.cpp:8:10: note: candidates are: std::ifstream cin
 ifstream cin("dijkstra.in");

          ^
In file included from dijkstra.cpp:1:0:
/usr/include/c++/4.8/iostream:60:18: note:                 std::istream std::cin
   extern istream cin;  /// Linked to standard input
                  ^
dijkstra.cpp:43:9: error: 'G' was not declared in this scope
         G[x].push_back({y , w});

         ^
dijkstra.cpp:49:25: error: reference to 'cout' is ambiguous
         if(D[i] == Inf) cout << "-1 ";

                         ^
dijkstra.cpp:9:10: note: candidates are: std::ofstream cout
 ofstream cout("dijkstra.out");

          ^
In file included from dijkstra.cpp:1:0:
/usr/include/c++/4.8/iostream:61:18: note:                 std::ostream std::cout
   extern ostream cout;  /// Linked to standard output
                  ^
dijkstra.cpp:50:14: error: reference to 'cout' is ambiguous
         else cout << D[i] << " ";

              ^
dijkstra.cpp:9:10: note: candidates are: std::ofstream cout
 ofstream cout("dijkstra.out");

          ^
In file included from dijkstra.cpp:1:0:
/usr/include/c++/4.8/iostream:61:18: note:                 std::ostream std::cout
   extern ostream cout;  /// Linked to standard output
                  ^

Cum funcționează evaluarea?