Rezumat problemă

ctcmax

#3423

Se dă un graf orientat cu n vârfuri și m arce prin lista arcelor. Afișați componentele tare conexe formate din număr maxim de vârfuri.

Consola Muresan Ciprian (mcip1977) Ciprian Muresan ușoară

Clasa 11 Teoria Grafurilor Probleme diverse cu grafuri orientate Algoritmul lui Kosaraju

Rezolvă

Detalii

Problema	ctcmax	Operații I/O	tastatură/ecran
Limita timp	0.1 secunde	Limita memorie	Total: 64 MB / Stivă 8 MB
Id soluție	#64813017	Utilizator	Pislaru Natalia (Natalia244psrl)
Fișier	ctcmax.cpp	Dimensiune	1.18 KB
Data încărcării	02 Iunie 2026, 23:44	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

ctcmax.cpp: In function ‘int main()’:
ctcmax.cpp:64:35: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’
   64 |     sort(scc.begin(),scc.end(),[](auto &a,auto &b){
      |                                   ^~~~
ctcmax.cpp:64:43: error: use of ‘auto’ in lambda parameter declaration only available with ‘-std=c++14’ or ‘-std=gnu++14’
   64 |     sort(scc.begin(),scc.end(),[](auto &a,auto &b){
      |                                           ^~~~
ctcmax.cpp: In lambda function:
ctcmax.cpp:65:17: error: invalid types ‘int[int]’ for array subscript
   65 |         return a[0]<b[0];
      |                 ^
ctcmax.cpp:65:22: error: invalid types ‘int[int]’ for array subscript
   65 |         return a[0]<b[0];
      |                      ^
ctcmax.cpp: In function ‘int main()’:
ctcmax.cpp:69:20: warning: comparison of integer expressions of different signedness: ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} and ‘int’ [-Wsign-compare]
   69 |         if(v.size()==mx){
      |            ~~~~~~~~^~~~
In file included from /usr/include/c++/13/bits/stl_algobase.h:71,
                 from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from ctcmax.cpp:1:
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_iter<_Compare>::operator()(_Iterator1, _Iterator2) [with _Iterator1 = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Iterator2 = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Compare = main()::<lambda(int&, int&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1819:14:   required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = main()::<lambda(int&, int&)>]’
ctcmax.cpp:64:9:   required from here
/usr/include/c++/13/bits/predefined_ops.h:158:30: error: no match for call to ‘(main()::<lambda(int&, int&)>) (std::vector<int>&, std::vector<int>&)’
  158 |         { return bool(_M_comp(*__it1, *__it2)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~~~
ctcmax.cpp:64:32: note: candidate: ‘main()::<lambda(int&, int&)>’
   64 |     sort(scc.begin(),scc.end(),[](auto &a,auto &b){
      |                                ^
ctcmax.cpp:64:32: note:   no known conversion for argument 1 from ‘std::vector<int>’ to ‘int&’
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Val_comp_iter<_Compare>::operator()(_Value&, _Iterator) [with _Value = std::vector<int>; _Iterator = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Compare = main()::<lambda(int&, int&)>]’:
/usr/include/c++/13/bits/stl_algo.h:1799:20:   required from ‘void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Val_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1827:36:   required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1859:25:   required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1950:31:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = main()::<lambda(int&, int&)>]’
ctcmax.cpp:64:9:   required from here
/usr/include/c++/13/bits/predefined_ops.h:240:30: error: no match for call to ‘(main()::<lambda(int&, int&)>) (std::vector<int>&, std::vector<int>&)’
  240 |         { return bool(_M_comp(__val, *__it)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
ctcmax.cpp:64:32: note: candidate: ‘main()::<lambda(int&, int&)>’
   64 |     sort(scc.begin(),scc.end(),[](auto &a,auto &b){
      |                                ^
ctcmax.cpp:64:32: note:   no known conversion for argument 1 from ‘std::vector<int>’ to ‘int&’
/usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_comp_val<_Compare>::operator()(_Iterator, _Value&) [with _Iterator = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Value = std::vector<int>; _Compare = main()::<lambda(int&, int&)>]’:
/usr/include/c++/13/bits/stl_heap.h:140:48:   required from ‘void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Distance = long int; _Tp = vector<int>; _Compare = __gnu_cxx::__ops::_Iter_comp_val<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_heap.h:247:23:   required from ‘void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Distance = long int; _Tp = vector<int>; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_heap.h:356:22:   required from ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1635:23:   required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1910:25:   required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1926:27:   required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Size = long int; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:1947:25:   required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = __gnu_cxx::__ops::_Iter_comp_iter<main()::<lambda(int&, int&)> >]’
/usr/include/c++/13/bits/stl_algo.h:4894:18:   required from ‘void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<vector<int>*, vector<vector<int> > >; _Compare = main()::<lambda(int&, int&)>]’
ctcmax.cpp:64:9:   required from here
/usr/include/c++/13/bits/predefined_ops.h:196:30: error: no match for call to ‘(main()::<lambda(int&, int&)>) (std::vector<int>&, std::vector<int>&)’
  196 |         { return bool(_M_comp(*__it, __val)); }
      |                       ~~~~~~~^~~~~~~~~~~~~~
ctcmax.cpp:64:32: note: candidate: ‘main()::<lambda(int&, int&)>’
   64 |     sort(scc.begin(),scc.end(),[](auto &a,auto &b){
      |                                ^
ctcmax.cpp:64:32: note:   no known conversion for argument 1 from ‘std::vector<int>’ to ‘int&’

Cum funcționează evaluarea?