#2034
Archpsod
Arpsod vă roagă să faceți un program care, pentru un număr N
cunoscut de trageri și poziția fiecărei săgeți pe țintă, determină distanța maximă dintre două săgeți.
EMPOWERSOFT, 2017
Problema | Archpsod | Operații I/O |
![]() archpsod.in /archpsod.out
|
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 4 MB
/
Stivă 2 MB
|
Id soluție | #57300144 | Utilizator | |
Fișier | archpsod.cpp | Dimensiune | 3.83 KB |
Data încărcării | 25 Martie 2025, 00:17 | Scor / rezultat | Eroare de compilare |
archpsod.cpp: In function 'std::vector<std::pair<float, float> > convexHull(std::vector<std::pair<float, float> >&)': archpsod.cpp:45:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int32_t i = 1; i < points.size(); i++) { ^ archpsod.cpp: In lambda function: archpsod.cpp:54:41: error: 'points' is not captured const double cp = cross_product(points[0], a, b); ^ archpsod.cpp:56:21: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp:56:39: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp:56:59: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp:56:77: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp:56:97: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp:56:115: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp:56:135: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp:56:153: error: 'points' is not captured return (points[0].x-a.x)*(points[0].x-a.x) + (points[0].y-a.y)*(points[0].y-a.y) < (points[0].x-b.x)*(points[0].x-b.x) + (points[0].y-b.y)*(points[0].y-b.y); ^ archpsod.cpp: In function 'std::vector<std::pair<float, float> > convexHull(std::vector<std::pair<float, float> >&)': archpsod.cpp:64:41: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int32_t i = 0; i < points.size(); i++) { ^ archpsod.cpp: In function 'int32_t bruteForce(std::vector<std::pair<float, float> >&)': archpsod.cpp:104:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int32_t i = 0; i < points.size() - 1; i++) { ^ archpsod.cpp:105:49: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int32_t j = i + 1; j < points.size(); j++) { ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Archpsod 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ă.