Pagini recente » Borderou de evaluare (job #2560034) | Borderou de evaluare (job #2741071) | Borderou de evaluare (job #3122155) | Borderou de evaluare (job #106633) | Borderou de evaluare (job #1722766)
Borderou de evaluare (job #1722766)
Raport evaluator
Compilare:
user.cpp: In function ‘double getArea(const std::vector<Point>&)’:
user.cpp:27:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < P.size(); i++) {
^
user.cpp:34:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < P.size() - 1; i++) Ar += fabs(Area(P[i], P[i + 1], C));
^
user.cpp: In function ‘double getPerimeter(const std::vector<Point>&)’:
user.cpp:41:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i = 0; i < P.size() - 1; i++)
^
user.cpp: In function ‘std::vector<Point> reorderPolygon(const std::vector<Point>&, Point)’:
user.cpp:55: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 ‘std::pair<std::pair<Point, Point>, std::pair<Point, Point> > splitInFour(std::vector<Point>&, Point)’:
user.cpp:111:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i++; i < P.size(); i++) Upper.push_back(P[i]);
^
user.cpp: In function ‘Point splitInTwo(const std::vector<Point>&, double, double)’:
user.cpp:90:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
user.cpp: In function ‘std::pair<std::pair<Point, Point>, std::pair<Point, Point> > splitInFour(std::vector<Point>&, Point)’:
user.cpp:140:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 436kb | Killed by signal 11(SIGSEGV). | 0 |
2 | 4ms | 672kb | Killed by signal 6(SIGABRT). | 0 |
3 | 4ms | 584kb | Nu s-a obtinut 4 poligoane | 0 |
4 | 24ms | 732kb | Nu s-a obtinut 4 poligoane | 0 |
5 | 40ms | 1020kb | Nu s-a obtinut 4 poligoane | 0 |
6 | 72ms | 1412kb | Nu s-a obtinut 4 poligoane | 0 |
7 | 204ms | 2784kb | Nu s-a obtinut 4 poligoane | 0 |
8 | 172ms | 2604kb | Nu s-a obtinut 4 poligoane | 0 |
9 | 260ms | 3092kb | Nu s-a obtinut 4 poligoane | 0 |
10 | 320ms | 3448kb | Nu s-a obtinut 4 poligoane | 0 |
Punctaj total | 0 |