Pagini recente » Borderou de evaluare (job #545622) | Borderou de evaluare (job #43405) | Borderou de evaluare (job #946296)
Borderou de evaluare (job #946296)
Raport evaluator
Compilare:
user.cpp: In function ‘void unic(std::vector<point>&)’:
user.cpp:81:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( int i = 1 ; i < A.size() ; ++i ){
^
user.cpp: In function ‘void nofitpolygon(std::vector<point>&, std::vector<point>&)’:
user.cpp:119:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( int i = 0 ; i < poligon.size() ; ++i ){
^
user.cpp:120:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( int j = 0 ; j < origine.size() ; ++j ){
^
user.cpp: In function ‘void build_graph()’:
user.cpp:224:84: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
point prec = P[p][x == 0 ? P[p].size()-2 : x-1],next = P[p][x == P[p].size()-1 ? 1 : x+1];
^
user.cpp:236:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if ( x <= P[p].size()-1 ){
^
user.cpp:237:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
point next = P[p][x == P[p].size()-1 ? 1 : x+1];
^
user.cpp:244:89: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
point prec = P[p][vf1 == 0 ? P[p].size()-2 : vf1-1],next = P[p][vf1 == P[p].size()-1 ? 1 : vf1+1];
^
user.cpp:250:89: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
point prec = P[p][vf2 == 0 ? P[p].size()-2 : vf2-1],next = P[p][vf2 == P[p].size()-1 ? 1 : vf2+1];
^
user.cpp:262:89: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
point prec = P[p][vf1 == 0 ? P[p].size()-2 : vf1-1],next = P[p][vf1 == P[p].size()-1 ? 1 : vf1+1];
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 4ms | 652kb | Ok! | 5 |
2 | 4ms | 648kb | Ok! | 5 |
3 | 4ms | 668kb | Ok! | 5 |
4 | 4ms | 652kb | Ok! | 5 |
5 | 4ms | 660kb | Ok! | 5 |
6 | 4ms | 656kb | Ok! | 5 |
7 | 4ms | 644kb | Ok! | 5 |
8 | 4ms | 652kb | Ok! | 5 |
9 | 4ms | 652kb | Ok! | 5 |
10 | 4ms | 656kb | Wrong answer! | 0 |
11 | 112ms | 712kb | Ok! | 5 |
12 | 100ms | 720kb | Ok! | 5 |
13 | 12ms | 680kb | Ok! | 5 |
14 | 16ms | 668kb | Wrong answer! | 0 |
15 | 4ms | 648kb | Ok! | 5 |
16 | 88ms | 724kb | Ok! | 5 |
17 | 16ms | 668kb | Ok! | 5 |
18 | 4ms | 656kb | Ok! | 5 |
19 | 8ms | 664kb | Ok! | 5 |
20 | 4ms | 640kb | Ok! | 5 |
Punctaj total | 90 |