Detalii evaluare #22459882

Rezumat problemă

Se dă un graf orientat cu n noduri. Să se determine câte componente tare conexe are graful dat.

Detalii

Problema Tare conexitate Operații I/O tastatură/ecran
Limita timp 0.1 secunde Limita memorie Total: 64 MB / Stivă 8 MB
Id soluție #22459882 Utilizator Parlea Rares (RaresDDB)
Fișier tare_conexitate.cpp Dimensiune 784 B
Data încărcării 13 Aprilie 2020, 20:06 Scor / rezultat Eroare de compilare

Evaluare


Mesaj compilare

tare_conexitate.cpp: In function 'void DFSp(int)':
tare_conexitate.cpp:7:20: error: reference to 'plus' is ambiguous
   if(A[x][i]==1 && plus[i]==0){

                    ^
tare_conexitate.cpp:3:40: note: candidates are: int plus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                        ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:140:12: note:                 template<class _Tp> struct std::plus
     struct plus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:8:4: error: reference to 'plus' is ambiguous
    plus[i]=1;

    ^
tare_conexitate.cpp:3:40: note: candidates are: int plus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                        ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:140:12: note:                 template<class _Tp> struct std::plus
     struct plus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp: In function 'void DFSm(int)':
tare_conexitate.cpp:16:20: error: reference to 'minus' is ambiguous
   if(B[x][i]==1 && minus[i]==0){

                    ^
tare_conexitate.cpp:3:50: note: candidates are: int minus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                                  ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:149:12: note:                 template<class _Tp> struct std::minus
     struct minus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:17:4: error: reference to 'minus' is ambiguous
    minus[i]=1;

    ^
tare_conexitate.cpp:3:50: note: candidates are: int minus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                                  ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:149:12: note:                 template<class _Tp> struct std::minus
     struct minus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp: In function 'int main()':
tare_conexitate.cpp:36:5: error: reference to 'plus' is ambiguous
     plus[i]=minus[i]=0;

     ^
tare_conexitate.cpp:3:40: note: candidates are: int plus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                        ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:140:12: note:                 template<class _Tp> struct std::plus
     struct plus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:36:13: error: reference to 'minus' is ambiguous
     plus[i]=minus[i]=0;

             ^
tare_conexitate.cpp:3:50: note: candidates are: int minus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                                  ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:149:12: note:                 template<class _Tp> struct std::minus
     struct minus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:37:4: error: reference to 'plus' is ambiguous
    plus[i]=1;

    ^
tare_conexitate.cpp:3:40: note: candidates are: int plus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                        ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:140:12: note:                 template<class _Tp> struct std::plus
     struct plus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:39:4: error: reference to 'minus' is ambiguous
    minus[i]=1;

    ^
tare_conexitate.cpp:3:50: note: candidates are: int minus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                                  ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:149:12: note:                 template<class _Tp> struct std::minus
     struct minus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:40:9: error: 'DFS' was not declared in this scope
    DFS(i);

         ^
tare_conexitate.cpp:43:8: error: reference to 'plus' is ambiguous
     if(plus[j]==1 && minus[j]==1)

        ^
tare_conexitate.cpp:3:40: note: candidates are: int plus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                        ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:140:12: note:                 template<class _Tp> struct std::plus
     struct plus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:43:22: error: reference to 'minus' is ambiguous
     if(plus[j]==1 && minus[j]==1)

                      ^
tare_conexitate.cpp:3:50: note: candidates are: int minus [101]
 int n,A[101][101], B[101][101], c[101],plus[101],minus[101];

                                                  ^
In file included from /usr/include/c++/4.8/string:48:0,
                 from /usr/include/c++/4.8/bits/locale_classes.h:40,
                 from /usr/include/c++/4.8/bits/ios_base.h:41,
                 from /usr/include/c++/4.8/ios:42,
                 from /usr/include/c++/4.8/ostream:38,
                 from /usr/include/c++/4.8/iostream:39,
                 from tare_conexitate.cpp:1:
/usr/include/c++/4.8/bits/stl_function.h:149:12: note:                 template<class _Tp> struct std::minus
     struct minus : public binary_function<_Tp, _Tp, _Tp>
            ^
tare_conexitate.cpp:44:10: warning: statement has no effect [-Wunused-value]
      c[j]==nr;

          ^
tare_conexitate.cpp:25:19: warning: unused variable 'k' [-Wunused-variable]
     int m,x,y,i,j,k,OK,nr=0;   

                   ^
tare_conexitate.cpp:25:21: warning: unused variable 'OK' [-Wunused-variable]
     int m,x,y,i,j,k,OK,nr=0;   

                     ^

Cum funcționează evaluarea?

www.pbinfo.ro permite evaluarea a două tipuri de probleme:

  • probleme la care rezolvarea presupune scrierea unui program complet
  • probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.

Problema Tare conexitate face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:

  • Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
  • Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.

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ă.