Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #56688400
Rezumat problemă
modernizare
#2893
Primăria din Iași a hotărât să modernizeze șoselele din localitate. O șosea este o porțiune de drum care unește două intersecții. Firma constructoare a făcut un studiu pentru a determina costurile pentru fiecare șosea. Fondurile sunt limitate, astfel că în prima fază vor fi modernizate doar drumurile din apropierea Palas-ului, care se află la intersecția cu numărul 1. Mai precis: orice șosea modernizată trebuie sa fie cel puțin la fel de aproape de Palas ca orice șosea ce nu va fi modernizată.
Lungimea drumului dintre două intersecții a și b este numărul cel mai mic de intersecții ce trebuie parcurse pentru a ajunge de la a la b. Șoseaua (a, b) este mai aproape de Palas față de șoseaua (c, d) dacă lungimea drumului de la Palas până la cea mai apropiată intersecție dintre a și b este mai mică decât până la cea mai apropiată intersecție dintre c și d. Dacă lungimile drumurilor până la cele mai apropiate intersecții sunt egale, se compară lungimile drumurilor până la celelalte două intersecții. De exemplu dacă pentru șoselele (4, 7) și (3, 5) avem distanțele de la Palas până la intersecțiile: 3, 4, 5, 7 egale cu: 10, 10, 10, 11 în această ordine, atunci (3, 5) e mai aproape de Palas față de (4, 7) deoarece distanțele minime sunt ambele egale cu 10 dar distanța până la intersecția 3 este tot 10, mai mică față de distanța până la intersecția 7 care este 11. Dacă nu există cale de acces de la Palas la o intersecție a atunci șoselele legate de a nu vor fi modernizate.
Cunoscând: N – numărul de intersecții din oraș codificate prin numere naturale din mulțimea 1..N, M – numărul de șosele și șoselele împreună cu costul de modernizare, și F – fondurile de care dispune primăria, să se afle K – numărul maxim de șosele care pot fi modernizate.
Olimpiada Municipală Iași, clasele XI-XII
Pracsiu Dan (dnprx) Detalii
| Problema | modernizare | Operații I/O |
modernizare.in/modernizare.out
|
|---|---|---|---|
| Limita timp | 2 secunde | Limita memorie |
Total: 16 MB
/
Stivă 1 MB
|
| Id soluție | #56688400 | Utilizator |
Kristensen Chelcea Nectarie Ioan (Kristensen_Chelcea_Nectarie_Io)
|
| Fișier | modernizare.cpp | Dimensiune | 2.26 KB |
| Data încărcării | 02 Martie 2025, 21:10 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
modernizare.cpp: In function 'int main()': modernizare.cpp:22:37: error: converting to 'std::vector<std::tuple<int, int, int> >::value_type {aka std::tuple<int, int, int>}' from initializer list would use explicit constructor 'constexpr std::tuple< <template-parameter-1-1> >::tuple(_UElements&& ...) [with _UElements = {int&, int&, int&}; <template-parameter-2-2> = void; _Elements = {int, int, int}]' edges.push_back({u, v, cost}); ^ modernizare.cpp:57:63: error: parameter declared 'auto' sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:72: error: parameter declared 'auto' sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp: In lambda function: modernizare.cpp:58:13: error: 'a' was not declared in this scope if (a.first.first == b.first.first) ^ modernizare.cpp:58:30: error: 'b' was not declared in this scope if (a.first.first == b.first.first) ^ modernizare.cpp:60:16: error: 'a' was not declared in this scope return a.first.first < b.first.first; ^ modernizare.cpp:60:32: error: 'b' was not declared in this scope return a.first.first < b.first.first; ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.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::pair<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Compare = main()::__lambda0]' modernizare.cpp:61:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' if (__comp(*__i, *__first)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.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::pair<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Compare = main()::__lambda0]' modernizare.cpp:61:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' if (__comp(*__i, *__first)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.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::pair<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Compare = main()::__lambda0]' modernizare.cpp:61:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' if (__comp(*__a, *__b)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' if (__comp(*__b, *__c)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' else if (__comp(*__a, *__c)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' else if (__comp(*__a, *__c)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' else if (__comp(*__b, *__c)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.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::pair<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Tp = std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Compare = main()::__lambda0]' modernizare.cpp:61:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, const std::pair<std::pair<int, int>, int>&)' while (__comp(*__first, __pivot)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' while (__comp(__pivot, *__last)) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.cpp:5: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/queue:62:0, from modernizare.cpp:3: /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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Distance = int; _Tp = std::pair<std::pair<int, int>, int>; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Compare = main()::__lambda0]' modernizare.cpp:61:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda0) (std::pair<std::pair<int, int>, int>&, std::pair<std::pair<int, int>, int>&)' *(__first + (__secondChild - 1)))) ^ modernizare.cpp:57:55: note: candidates are: sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ In file included from /usr/include/c++/4.8/queue:62:0, from modernizare.cpp:3: /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 modernizare.cpp:57:73: note: main()::__lambda0 sort(eligibleEdges.begin(), eligibleEdges.end(), [](auto &a, auto &b) { ^ modernizare.cpp:57:73: note: candidate expects 0 arguments, 2 provided In file included from /usr/include/c++/4.8/algorithm:62:0, from modernizare.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::pair<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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/queue:62:0, from modernizare.cpp:3: /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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, 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<std::pair<int, int>, int>*, std::vector<std::pair<std::pair<int, int>, int> > >; _Distance = int; _Tp = std::pair<std::pair<int, 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 modernizare 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ă.