Rezumat problemă

graph

#146

Călinuţa tocmai a găsit o foaie de hârtie pe care este desenat un graf orientat aciclic cu N noduri şi M arce, fiecare arc având o distanţă de valoare întreagă. Dându-se N, M şi cele M arce cu distanţele dintre ele, trebuie să calculaţi pentru Călinuţa distanţa minimă dintre fiecare două noduri.

Grigore Moisil 2013

Fișiere Candale Silviu (silviu) Cosmin Tutunaru concurs

Clasa 11 Teoria Grafurilor Grafuri cu costuri Sortare topologică Algoritmul lui Dijkstra

Rezolvă

Detalii

Problema	graph	Operații I/O	graph.in/graph.out
Limita timp	1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64011823	Utilizator	Peter Tobias (PeterTobias)
Fișier	graph.cpp	Dimensiune	1.97 KB
Data încărcării	05 Aprilie 2026, 14:09	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

graph.cpp: In function 'void sort()':
graph.cpp:47:9: error: reference to 'hash' is ambiguous
         hash[node] = i;

         ^
graph.cpp:13:5: note: candidates are: int hash [1513]
 int hash[nMax];

     ^
In file included from /usr/include/c++/4.8/bits/stl_bvector.h:1134:0,
                 from /usr/include/c++/4.8/vector:65,
                 from graph.cpp:4:
/usr/include/c++/4.8/bits/functional_hash.h:58:12: note:                 template<class _Tp> struct std::hash
     struct hash;
            ^
graph.cpp: In function 'void solve()':
graph.cpp:56:22: error: reference to 'hash' is ambiguous
         for (int j = hash[i+1]; j < n; ++j) {

                      ^
graph.cpp:13:5: note: candidates are: int hash [1513]
 int hash[nMax];

     ^
In file included from /usr/include/c++/4.8/bits/stl_bvector.h:1134:0,
                 from /usr/include/c++/4.8/vector:65,
                 from graph.cpp:4:
/usr/include/c++/4.8/bits/functional_hash.h:58:12: note:                 template<class _Tp> struct std::hash
     struct hash;
            ^
In file included from /usr/include/c++/4.8/cassert:43:0,
                 from graph.cpp:3:
graph.cpp:62:27: error: reference to 'hash' is ambiguous
                assert(j < hash[v[node][k].first]);

                           ^
graph.cpp:13:5: note: candidates are: int hash [1513]
 int hash[nMax];

     ^
In file included from /usr/include/c++/4.8/bits/stl_bvector.h:1134:0,
                 from /usr/include/c++/4.8/vector:65,
                 from graph.cpp:4:
/usr/include/c++/4.8/bits/functional_hash.h:58:12: note:                 template<class _Tp> struct std::hash
     struct hash;
            ^
graph.cpp: In function 'void read()':
graph.cpp:17:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);

                           ^
graph.cpp:20:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d %d %d", &x, &y, &z);

                                      ^
graph.cpp: In function 'int main()':
graph.cpp:77:32: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(infile, "r", stdin);

                                ^
graph.cpp:78:34: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     freopen(outfile, "w", stdout);

                                  ^

Cum funcționează evaluarea?