#3379
nkgraf
Fie N
, K
, P
trei numere naturale nenule. Vom considera toate grafurile orientate care au N
vârfuri şi K
arce, reprezentate prin lista arcelor lor ordonate lexicografic. Vom ordona apoi grafurile lexicografic şi le vom numerota începând cu 1
. Scrieţi un program care, cunoscând N
, K
şi P
, rezolvă următoarele două cerinţe:
1. determină NR
, numărul de grafuri orientate cu N
vârfuri şi K
arce;
2. determină graful orientat cu N
vârfuri şi K
arce având numărul de ordine P
.
Olimpiada Municipala de Informatica, Iasi, 2020
Problema | nkgraf | Operații I/O |
![]() nkgraf.in /nkgraf.out
|
---|---|---|---|
Limita timp | 0.7 secunde | Limita memorie |
Total: 12 MB
/
Stivă 2 MB
|
Id soluție | #50762170 | Utilizator | |
Fișier | nkgraf.cpp | Dimensiune | 1.71 KB |
Data încărcării | 30 Aprilie 2024, 15:48 | Scor / rezultat | Eroare de compilare |
nkgraf.cpp: In function 'int main()': nkgraf.cpp:69:25: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (P <= all.size()) { ^ nkgraf.cpp:71:26: error: invalid initialization of reference of type 'int&' from expression of type 'std::pair<int, int>' for(int &arc : lex) { ^ nkgraf.cpp:72:27: error: request for member 'first' in 'arc', which is of non-class type 'int' fout << arc.first << " " << arc.second << endl; ^ nkgraf.cpp:72:47: error: request for member 'second' in 'arc', which is of non-class type 'int' fout << arc.first << " " << arc.second << endl; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Compare = main()::__lambda0]' nkgraf.cpp:67:8: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' if (__comp(*__i, *__first)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: bool (*)(int&, int&) <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Compare = main()::__lambda0]' nkgraf.cpp:67:8: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' if (__comp(*__i, *__first)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: bool (*)(int&, int&) <conversion> if (__comp(*__i, *__first)) ^ /usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Compare = main()::__lambda0]' nkgraf.cpp:67:8: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' if (__comp(*__a, *__b)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: bool (*)(int&, int&) <conversion> if (__comp(*__a, *__b)) ^ /usr/include/c++/4.8/bits/stl_algo.h:114:28: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' if (__comp(*__b, *__c)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: bool (*)(int&, int&) <conversion> if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:116:25: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' else if (__comp(*__a, *__c)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: bool (*)(int&, int&) <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:118:30: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' else if (__comp(*__a, *__c)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: bool (*)(int&, int&) <conversion> else if (__comp(*__a, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:123:33: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' else if (__comp(*__b, *__c)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: bool (*)(int&, int&) <conversion> else if (__comp(*__b, *__c)) ^ /usr/include/c++/4.8/bits/stl_algo.h:125:33: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /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<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Tp = std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Compare = main()::__lambda0]' nkgraf.cpp:67:8: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, const std::vector<std::pair<int, int> >&)' while (__comp(*__first, __pivot)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: bool (*)(int&, int&) <conversion> while (__comp(*__first, __pivot)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' while (__comp(__pivot, *__last)) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &b) ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: bool (*)(int&, int&) <conversion> while (__comp(__pivot, *__last)) ^ /usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'const std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from nkgraf.cpp:5: /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::vector<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Distance = int; _Tp = std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Compare = main()::__lambda0]' nkgraf.cpp:67:8: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (std::vector<std::pair<int, int> >&, std::vector<std::pair<int, int> >&)' *(__first + (__secondChild - 1)))) ^ nkgraf.cpp:64:36: note: candidates are: sort(all.begin(),all.end(), [](int &a, int &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 nkgraf.cpp:5: /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: bool (*)(int&, int&) <conversion> *(__first + (__secondChild - 1)))) ^ /usr/include/c++/4.8/bits/stl_heap.h:313:40: note: candidate expects 3 arguments, 3 provided nkgraf.cpp:64:52: note: main()::__lambda0 sort(all.begin(),all.end(), [](int &a, int &b) ^ nkgraf.cpp:64:52: note: no known conversion for argument 1 from 'std::vector<std::pair<int, int> >' to 'int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from nkgraf.cpp:5: /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::vector<std::pair<int, int> >*, std::vector<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 nkgraf.cpp:5: /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::vector<std::pair<int, int> >*, std::vector<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::vector<std::pair<int, int> >*, std::vector<std::vector<std::pair<int, int> > > >; _Distance = int; _Tp = std::vector<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, ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema nkgraf 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ă.