#3365
DigrafulCTC
Se dă un digraf (graf orientat) cu n
noduri numerotate de la 1
la n
. Graful componentelor tare conexe se obține astfel: se construiesc componentele tare conexe, apoi fiecare astfel de componentă devine nod în noul graf. Apoi din lista inițială de arce se păstrează în noul graf numai arcele care au extremitățile în componente tare conexe diferite. Să se afișeze listele de adiacență asociate noului digraf.
Folclorul informatic
Problema | DigrafulCTC | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #34458007 | Utilizator | |
Fișier | digrafulctc.cpp | Dimensiune | 1.68 KB |
Data încărcării | 02 Februarie 2022, 19:25 | Scor / rezultat | Eroare de compilare |
In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from digrafulctc.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Tp = std::vector<int>; _Compare = main()::__lambda4]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Size = int; _Compare = main()::__lambda4]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::vector<int>*, std::vector<std::vector<int> > >; _Compare = main()::__lambda4]' digrafulctc.cpp:47:113: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (std::vector<int>&, const std::vector<int>&)' while (__comp(*__first, __pivot)) ^ digrafulctc.cpp:47:35: note: candidates are: sort(ctc.begin(), ctc.end(), [](vector <int>& a, vector <int>& b){ return ming[a.back()] < ming[b.back()]; }); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from digrafulctc.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(std::vector<int>&, std::vector<int>&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 3 arguments, 3 provided digrafulctc.cpp:47:69: note: main()::__lambda4 sort(ctc.begin(), ctc.end(), [](vector <int>& a, vector <int>& b){ return ming[a.back()] < ming[b.back()]; }); ^ digrafulctc.cpp:47:69: note: no known conversion for argument 2 from 'const std::vector<int>' to 'std::vector<int>&' In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from digrafulctc.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const std::vector<int>&, std::vector<int>&)' while (__comp(__pivot, *__last)) ^ digrafulctc.cpp:47:35: note: candidates are: sort(ctc.begin(), ctc.end(), [](vector <int>& a, vector <int>& b){ return ming[a.back()] < ming[b.back()]; }); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64, from digrafulctc.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(std::vector<int>&, std::vector<int>&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 3 arguments, 3 provided digrafulctc.cpp:47:69: note: main()::__lambda4 sort(ctc.begin(), ctc.end(), [](vector <int>& a, vector <int>& b){ return ming[a.back()] < ming[b.back()]; }); ^ digrafulctc.cpp:47:69: note: no known conversion for argument 1 from 'const std::vector<int>' to 'std::vector<int>&'
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema DigrafulCTC face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.