Pagini recente » Borderou de evaluare (job #2677926) | Borderou de evaluare (job #1255918) | Borderou de evaluare (job #2977379) | Borderou de evaluare (job #2950376) | Borderou de evaluare (job #1217218)
Borderou de evaluare (job #1217218)
Raport evaluator
Compilare:
user.cpp: In function ‘void read()’:
user.cpp:46:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0; i<robot.size(); ++i)
^
user.cpp: In function ‘void convex_hull(std::vector<std::pair<int, int> >&)’:
user.cpp:76:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0; i<poly.size(); ++i)
^
user.cpp:90:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0; i<poly.size(); ++i)
^
user.cpp: In function ‘void get_newob()’:
user.cpp:107:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j=0; j<ob[i].size(); ++j)
^
user.cpp:108:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int k=0; k<robot.size(); ++k)
^
user.cpp: In function ‘void build_graph()’:
user.cpp:122:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int j=0; j<newob[i].size(); ++j)
^
user.cpp: In function ‘bool segment_polygon_intersection(const std::pair<int, int>&, const std::pair<int, int>&, const std::vector<std::pair<int, int> >&)’:
user.cpp:193:18: warning: suggest parentheses around ‘&&’ within ‘||’ [-Wparentheses]
if (ok1 == 0 && ok2 == 0 || ok1 == 1 || ok2 == 1)
^
user.cpp: In function ‘void dijkstra()’:
user.cpp:223:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=1; i<graph.size(); ++i)
^
user.cpp:240:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for (int i=0; i<graph.size(); ++i)
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 480kb | Ok! | 5 |
2 | 0ms | 476kb | Ok! | 5 |
3 | 0ms | 432kb | Wrong answer! | 0 |
4 | 0ms | 440kb | Wrong answer! | 0 |
5 | 0ms | 432kb | Wrong answer! | 0 |
6 | 0ms | 480kb | Ok! | 5 |
7 | 0ms | 476kb | Ok! | 5 |
8 | 0ms | 484kb | Ok! | 5 |
9 | 0ms | 480kb | Ok! | 5 |
10 | 0ms | 440kb | Wrong answer! | 0 |
11 | 16ms | 520kb | Ok! | 5 |
12 | 8ms | 528kb | Ok! | 5 |
13 | 4ms | 512kb | Ok! | 5 |
14 | 8ms | 516kb | Ok! | 5 |
15 | 0ms | 488kb | Ok! | 5 |
16 | 4ms | 500kb | Wrong answer! | 0 |
17 | 0ms | 496kb | Ok! | 5 |
18 | 0ms | 488kb | Ok! | 5 |
19 | 0ms | 492kb | Ok! | 5 |
20 | 0ms | 472kb | Ok! | 5 |
Punctaj total | 75 |