Pagini recente » Borderou de evaluare (job #2781041) | Borderou de evaluare (job #572186) | Borderou de evaluare (job #2441501) | Borderou de evaluare (job #2111700) | Borderou de evaluare (job #1723060)
Borderou de evaluare (job #1723060)
Raport evaluator
Compilare:
user.cpp: In function ‘double getArea(const std::vector<Point>&)’:
user.cpp:32:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 1; i < P.size(); i++) Ar += fabs(Det(P[0], P[i - 1], P[i]));
^
user.cpp: In function ‘double getPer(const std::vector<Point>&)’:
user.cpp:38:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < P.size() - 2; i++) Per += Dist(P[i], P[i + 1]);
^
user.cpp: In function ‘std::vector<Point> Reorder(const std::vector<Point>&)’:
user.cpp:50:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = Pos; i < P.size(); i++) pNew[i - Pos] = P[i];
^
user.cpp: In function ‘void Solve(std::vector<Point>&)’:
user.cpp:100:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i++; i < P.size(); i++) Up.push_back(P[i]);
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 532kb | Cele 4 poligoane nu au arie egale | 0 |
| 2 | 0ms | 540kb | Cele 4 poligoane nu au arie egale | 0 |
| 3 | 4ms | 584kb | Cele 4 poligoane nu au arie egale | 0 |
| 4 | 20ms | 728kb | Cele 4 poligoane nu au arie egale | 0 |
| 5 | 44ms | 872kb | Cele 4 poligoane nu au arie egale | 0 |
| 6 | 88ms | 1312kb | Cele 4 poligoane nu au arie egale | 0 |
| 7 | 228ms | 2632kb | Cele 4 poligoane nu au arie egale | 0 |
| 8 | 280ms | 3004kb | Cele 4 poligoane nu au arie egale | 0 |
| 9 | 232ms | 2632kb | Cele 4 poligoane nu au arie egale | 0 |
| 10 | 296ms | 3048kb | Cele 4 poligoane nu au arie egale | 0 |
| Punctaj total | 0 |
Vlad Dumitru-Popescu depevlad