Detalii evaluare: ~20404212

Detalii evaluare #20404212

Rezumat problema
Detalii
Evaluare
Ajutor
Rezumat problemă

`#2968` conexidad

Fie un graf neorientat cu N noduri și M muchii, care NU este conex. Să i se adauge grafului un număr minim de muchii, astfel încât acesta să devină conex. Fie extra_i numărul de muchii nou-adăugate care sunt incidente cu nodul i, iar max_extra cea mai mare dintre valorile extra₁, extra₂,… , extra_N. Mulțimea de muchii adăugate trebuie să respecte condiția ca valoarea max_extra să fie minimă.
OJI 2019
Fișiere
Pracsiu Dan (dnprx)
Mihai Calancea
concurs
Rezolvă
Detalii

Problema	conexidad	Operații I/O	`conexidad.in`/`conexidad.out`
Limita timp	1 secunde	Limita memorie	Total: `64 MB` / Stivă `32 MB`
Id soluție	`#20404212`	Utilizator	Vintila Valentin (Wi)
Fișier	conexidad.cpp	Dimensiune	1.76 KB
Data încărcării	29 Ianuarie 2020, 12:35	Scor / rezultat	Eroare de compilare
Evaluare

Mesaj compilare

conexidad.cpp: In function 'int main()':
conexidad.cpp:44:31: error: parameter declared 'auto'
         sort(v, v+q, [](auto& a, auto& b) {

                               ^
conexidad.cpp:44:40: error: parameter declared 'auto'
         sort(v, v+q, [](auto& a, auto& b) {

                                        ^
conexidad.cpp: In lambda function:
conexidad.cpp:45:21: error: 'a' was not declared in this scope
             return (a.size() >= b.size());

                     ^
conexidad.cpp:45:33: error: 'b' was not declared in this scope
             return (a.size() >= b.size());

                                 ^
conexidad.cpp: In function 'int main()':
conexidad.cpp:52:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int k = 0; k < v[i].size() && j < q; ++k) {

                                          ^
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 conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]':
/usr/include/c++/4.8/bits/stl_algo.h:2226:70:   required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
conexidad.cpp:46:10:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
    if (__comp(*__i, *__first))
                             ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]':
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _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 = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
conexidad.cpp:46:10:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
  if (__comp(*__i, *__first))
                           ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/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 = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]':
/usr/include/c++/4.8/bits/stl_algo.h:2295:13:   required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _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 = std::vector<std::pair<int, bool> >*; _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 = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
conexidad.cpp:46:10:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
       if (__comp(*__a, *__b))
                            ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
    if (__comp(*__b, *__c))
                         ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
    else if (__comp(*__a, *__c))
                              ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
       else if (__comp(*__a, *__c))
                                 ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
       else if (__comp(*__b, *__c))
                                 ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.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 = std::vector<std::pair<int, bool> >*; _Tp = std::vector<std::pair<int, bool> >; _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 = std::vector<std::pair<int, bool> >*; _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 = std::vector<std::pair<int, bool> >*; _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 = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
conexidad.cpp:46:10:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, const std::vector<std::pair<int, bool> >&)'
    while (__comp(*__first, __pivot))
                                   ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
    while (__comp(__pivot, *__last))
                                  ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
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 conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _Distance = int; _Tp = std::vector<std::pair<int, bool> >; _Compare = main()::__lambda4]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:1946:47:   required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:5349:59:   required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:2332:68:   required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _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 = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]'
conexidad.cpp:46:10:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4) (std::vector<std::pair<int, bool> >&, std::vector<std::pair<int, bool> >&)'
        *(__first + (__secondChild - 1))))
                                        ^
conexidad.cpp:44:23: note: candidates are:
         sort(v, v+q, [](auto& a, auto& b) {

                       ^
In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from conexidad.cpp:1:
/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
conexidad.cpp:44:41: note: main()::__lambda4
         sort(v, v+q, [](auto& a, auto& b) {

                                         ^
conexidad.cpp:44:41: note:   candidate expects 0 arguments, 2 provided
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 conexidad.cpp:1:
/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 = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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 /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from conexidad.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::vector<std::pair<int, bool> >*; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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 = std::vector<std::pair<int, bool> >*; _Distance = int; _Tp = std::vector<std::pair<int, bool> >; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', 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 conexidad 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ă.