Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #49822859
Rezumat problemă
#2740
LungimeRandMax1
În arta tipografică un râu este o înșiruire de spații care se întinde pe verticală, pe liniile consecutive ale unui text. Mai precis, un râu este definit ca o secvență de cel puțin 2 spații în care oricare 2 spații de pe linii consecutive sunt adiacente pe verticală sau diagonală.
Să se scrie un program care citește numerele naturale L N și apoi un text formatat pe N linii de cel mult L caractere (vezi #LungimeRandMax ), și afișează lungimea celui mai lung râu din text, dacă acesta există sau mesajul NU, dacă nu există niciun râu.
Andrei Visalon (Prekzursil) Detalii
| Problema | LungimeRandMax1 | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 64 MB
|
| Id soluție | #49822859 | Utilizator |
Sabin Teodorescu (sabinteodorescu)
|
| Fișier | lungimerandmax1.cpp | Dimensiune | 1.47 KB |
| Data încărcării | 15 Martie 2024, 22:19 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
lungimerandmax1.cpp: In function 'int main()': lungimerandmax1.cpp:24:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j < sV[i].size(); j++) { ^ lungimerandmax1.cpp:31:37: error: parameter declared 'auto' sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:49: error: parameter declared 'auto' sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp: In lambda function: lungimerandmax1.cpp:32:17: error: request for member 'second' in 'std::left', which is of non-class type 'std::ios_base&(std::ios_base&)' return left.second < right.second; ^ lungimerandmax1.cpp:32:32: error: request for member 'second' in 'std::right', which is of non-class type 'std::ios_base&(std::ios_base&)' return left.second < right.second; ^ lungimerandmax1.cpp: In function 'int main()': lungimerandmax1.cpp:44:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < v.size(); i++) { ^ lungimerandmax1.cpp:46:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = i + 1; j < v.size(); j++) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' lungimerandmax1.cpp:33:4: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' lungimerandmax1.cpp:33:4: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)() <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' lungimerandmax1.cpp:33:4: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__a, *__b)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)() <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__b, *__c)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)() <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)() <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__b, *__c)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)() <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Tp = std::pair<int, int>; _Compare = main()::__lambda0]': /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' lungimerandmax1.cpp:33:4: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, const std::pair<int, int>&)' while (__comp(*__first, __pivot)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)() <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::pair<int, int>&, std::pair<int, int>&)' while (__comp(__pivot, *__last)) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)() <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda0]' /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::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' lungimerandmax1.cpp:33:4: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, std::pair<int, int>&)' *(__first + (__secondChild - 1)))) ^ lungimerandmax1.cpp:31:29: note: candidates are: sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 1 argument, 3 provided lungimerandmax1.cpp:31:54: note: main()::__lambda0 sort(v.begin(), v.end(), [](auto &left, auto &right) { ^ lungimerandmax1.cpp:31:54: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h: At global scope: /usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __unguarded_linear_insert(_RandomAccessIterator __last, ^ In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from lungimerandmax1.cpp:4: /usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, ^ /usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Distance = int; _Tp = std::pair<int, int>; _Compare = main()::__lambda0]', declared using local type 'main()::__lambda0', is used but never defined [-fpermissive] __push_heap(_RandomAccessIterator __first, _Distance __holeIndex, ^
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 LungimeRandMax1 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ă.