Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #54511387
Rezumat problemă
#2103
Intersectie Segmente
Se dau N segmente în plan, fiecare fiind paralel cu una dintre axele de coordonate. Determinați numărul total de puncte de intersecție între două segmente.
- Fișiere
-
Marius Nicoli (mariusn)
- Nicoli Marius
- medie
Detalii
| Problema | Intersectie Segmente | Operații I/O |
is.in/is.out
|
|---|---|---|---|
| Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #54511387 | Utilizator |
Bledea Alexandru (BledeaAlex)
|
| Fișier | intersectie_segmente.cpp | Dimensiune | 3.20 KB |
| Data încărcării | 30 Noiembrie 2024, 20:00 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
intersectie_segmente.cpp: In function 'void ReadArray()': intersectie_segmente.cpp:57:23: warning: narrowing conversion of '((y1 == y2) ? 1 : 2)' from 'int' to 'short int' inside { } [-Wnarrowing] points[2 * i] = {x1, y1, 2 * i + 1, (y1 == y2) ? 1 : 2}; ^ intersectie_segmente.cpp:58:27: warning: narrowing conversion of '((y1 == y2) ? 1 : 2)' from 'int' to 'short int' inside { } [-Wnarrowing] points[2 * i + 1] = {x2, y2, 2 * i, (y1 == y2) ? 1 : 2}; ^ intersectie_segmente.cpp: In function 'long long int Solve()': intersectie_segmente.cpp:87:69: error: parameter declared 'auto' sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:84: error: parameter declared 'auto' sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp: In lambda function: intersectie_segmente.cpp:88:27: error: 'a' was not declared in this scope const Point &p1 = a.first, &p2 = b.first; ^ intersectie_segmente.cpp:89:23: error: 'p2' was not declared in this scope return p1.y < p2.y || (p1.y == p2.y && p1.x < p2.x); ^ 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 intersectie_segmente.cpp:1: /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]': /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' intersectie_segmente.cpp:90:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' if (__comp(*__i, *__first)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.cpp:1: /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]': /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Size = int; _Compare = Solve()::__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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' intersectie_segmente.cpp:90:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' if (__comp(*__i, *__first)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.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 = __gnu_cxx::__normal_iterator<std::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]': /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Size = int; _Compare = Solve()::__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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' intersectie_segmente.cpp:90:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' if (__comp(*__a, *__b)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' if (__comp(*__b, *__c)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' else if (__comp(*__a, *__c)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' else if (__comp(*__a, *__c)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' else if (__comp(*__b, *__c)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Tp = std::pair<Point, int>; _Compare = Solve()::__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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Size = int; _Compare = Solve()::__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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' intersectie_segmente.cpp:90:6: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, const std::pair<Point, int>&)' while (__comp(*__first, __pivot)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.cpp:1: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(Solve()::__lambda4) (const std::pair<Point, int>&, std::pair<Point, int>&)' while (__comp(__pivot, *__last)) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.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 = __gnu_cxx::__normal_iterator<std::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Distance = int; _Tp = std::pair<Point, int>; _Compare = Solve()::__lambda4]': /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Size = int; _Compare = Solve()::__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::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]' intersectie_segmente.cpp:90:6: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(Solve()::__lambda4) (std::pair<Point, int>&, std::pair<Point, int>&)' *(__first + (__secondChild - 1)))) ^ intersectie_segmente.cpp:87:55: note: candidates are: sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const 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 intersectie_segmente.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 intersectie_segmente.cpp:87:85: note: Solve()::__lambda4 sort(indexedPoints.begin(), indexedPoints.end(), [](const auto &a, const auto &b) { ^ intersectie_segmente.cpp:87:85: 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 intersectie_segmente.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 = __gnu_cxx::__normal_iterator<std::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]', declared using local type 'Solve()::__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 intersectie_segmente.cpp:1: /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<Point, int>*, std::vector<std::pair<Point, int> > >; _Compare = Solve()::__lambda4]', declared using local type 'Solve()::__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 = __gnu_cxx::__normal_iterator<std::pair<Point, int>*, std::vector<std::pair<Point, int> > >; _Distance = int; _Tp = std::pair<Point, int>; _Compare = Solve()::__lambda4]', declared using local type 'Solve()::__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 Intersectie Segmente 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ă.