Rezumat problemă

Subgraf1

#419

Se dă lista muchiilor unui graf neorientat cu n vârfuri, etichetate de la 1 la n. Din acest graf se elimină toate vârfurile care au gradul minim. Să se determine câte muchii va avea subgraful obținut.

Fișiere Candale Silviu (silviu) medie

Clasa 11 Teoria Grafurilor Probleme elementare cu grafuri neorientate

Rezolvă

Detalii

Problema	Subgraf1	Operații I/O	subgraf1.in/subgraf1.out
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64405778	Utilizator	Craciun Mihai (Arklahhis)
Fișier	subgraf1.cpp	Dimensiune	666 B
Data încărcării	05 Mai 2026, 13:39	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

subgraf1.cpp:9:25: error: ‘MAX_INT’ was not declared in this scope
    9 | int n, x, y, nr, minn = MAX_INT;
      |                         ^~~~~~~
subgraf1.cpp: In function ‘int main()’:
subgraf1.cpp:18:19: error: no matching function for call to ‘min(int&, const long unsigned int&)’
   18 |         minn = min(minn, min(v[x].size(), v[y].size()));
      |                ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/string:51,
                 from /usr/include/c++/13/bits/locale_classes.h:40,
                 from /usr/include/c++/13/bits/ios_base.h:41,
                 from /usr/include/c++/13/ios:44,
                 from /usr/include/c++/13/ostream:40,
                 from /usr/include/c++/13/iostream:41,
                 from subgraf1.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:233:5: note: candidate: ‘template<class _Tp> const _Tp& std::min(const _Tp&, const _Tp&)’
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
subgraf1.cpp:18:19: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘long unsigned int’)
   18 |         minn = min(minn, min(v[x].size(), v[y].size()));
      |                ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidate: ‘template<class _Tp, class _Compare> const _Tp& std::min(const _Tp&, const _Tp&, _Compare)’
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note:   template argument deduction/substitution failed:
subgraf1.cpp:18:19: note:   deduced conflicting types for parameter ‘const _Tp’ (‘int’ and ‘long unsigned int’)
   18 |         minn = min(minn, min(v[x].size(), v[y].size()));
      |                ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
subgraf1.cpp:22:25: warning: comparison of integer expressions of different signedness: ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   22 |         if (v[i].size() != minn)
      |             ~~~~~~~~~~~~^~~~~~~
subgraf1.cpp:23:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   23 |             for (int j = 0; j < v[i].size(); j++)
      |                             ~~^~~~~~~~~~~~~
subgraf1.cpp:24:39: warning: comparison of integer expressions of different signedness: ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   24 |                 if (v[v[i][j]].size() != minn)
      |                     ~~~~~~~~~~~~~~~~~~^~~~~~~

Cum funcționează evaluarea?