Borderou de evaluare (job #1722766)

Utilizator depevladVlad Dumitru-Popescu depevlad Data 28 iunie 2016 19:33:59
Problema Split3 Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 0

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
10ms436kbKilled by signal 11(SIGSEGV).0
24ms672kbKilled by signal 6(SIGABRT).0
34ms584kbNu s-a obtinut 4 poligoane0
424ms732kbNu s-a obtinut 4 poligoane0
540ms1020kbNu s-a obtinut 4 poligoane0
672ms1412kbNu s-a obtinut 4 poligoane0
7204ms2784kbNu s-a obtinut 4 poligoane0
8172ms2604kbNu s-a obtinut 4 poligoane0
9260ms3092kbNu s-a obtinut 4 poligoane0
10320ms3448kbNu s-a obtinut 4 poligoane0
Punctaj total0

Ceva nu functioneaza?