#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.
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 | #47044204 | Utilizator | |
Fișier | intersectie_segmente.cpp | Dimensiune | 2.10 KB |
Data încărcării | 30 Noiembrie 2023, 15:39 | Scor / rezultat | Eroare de compilare |
intersectie_segmente.cpp: In function 'int main()': intersectie_segmente.cpp:87:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while (i < cso.size() && cso[i].x <= segment.x) { ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from intersectie_segmente.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<segm_vert*, std::vector<segm_vert> >; _Tp = segm_vert]': /usr/include/c++/4.8/bits/stl_algo.h:2283:70: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<segm_vert*, std::vector<segm_vert> >]' /usr/include/c++/4.8/bits/stl_algo.h:2315:54: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<segm_vert*, std::vector<segm_vert> >; _Size = int]' /usr/include/c++/4.8/bits/stl_algo.h:5461:36: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<segm_vert*, std::vector<segm_vert> >]' intersectie_segmente.cpp:79:30: required from here /usr/include/c++/4.8/bits/stl_algo.h:2245:19: error: passing 'const segm_vert' as 'this' argument of 'bool segm_vert::operator<(segm_vert)' discards qualifiers [-fpermissive] while (__pivot < *__last) ^ /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<capat_segm_oriz*, std::vector<capat_segm_oriz> >; _Tp = capat_segm_oriz]': /usr/include/c++/4.8/bits/stl_algo.h:2283:70: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<capat_segm_oriz*, std::vector<capat_segm_oriz> >]' /usr/include/c++/4.8/bits/stl_algo.h:2315:54: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<capat_segm_oriz*, std::vector<capat_segm_oriz> >; _Size = int]' /usr/include/c++/4.8/bits/stl_algo.h:5461:36: required from 'void std::sort(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<capat_segm_oriz*, std::vector<capat_segm_oriz> >]' intersectie_segmente.cpp:80:32: required from here /usr/include/c++/4.8/bits/stl_algo.h:2245:19: error: passing 'const capat_segm_oriz' as 'this' argument of 'bool capat_segm_oriz::operator<(capat_segm_oriz)' discards qualifiers [-fpermissive]
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Intersectie Segmente 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ă.