Borderou de evaluare (job #2268798)

Utilizator danin01Nastase Daniel danin01 Data 25 octombrie 2018 12:32:38
Problema Arbore partial de cost minim Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 10

Raport evaluator

Compilare: main.cpp: In function 'int main()': main.cpp:44:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=0;j<arbori[muchii[i].second.second].size();++j) ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:55:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=0;j<arbori[locatie[muchii[i].second.first]].size();++j) ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:55:21: warning: this 'for' clause does not guard... [-Wmisleading-indentation] for(int j=0;j<arbori[locatie[muchii[i].second.first]].size();++j) ^~~ main.cpp:57:25: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for' cout<<'\n'; ^~~~ main.cpp:63:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=0;j<arbori[muchii[i].second.first].size();++j) ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:72:34: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=0;j<arbori[locatie[muchii[i].second.second]].size();++j) ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp:72:21: warning: this 'for' clause does not guard... [-Wmisleading-indentation] for(int j=0;j<arbori[locatie[muchii[i].second.second]].size();++j) ^~~ main.cpp:74:25: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for' cout<<'\n'; ^~~~ main.cpp:85:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0;i<arbori[1].size();++i) ~^~~~~~~~~~~~~~~~~ main.cpp:91:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0;i<v.size();++i) ~^~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
110ms4980kbCorect10
212ms4980kbCost incorect0
313ms4980kbCost incorect0
413ms4980kbCost incorect0
513ms4980kbCost incorect0
6208ms7839kbCost incorect0
7401ms11395kbTime limit exceeded0
889ms6160kbCost incorect0
970ms5767kbCost incorect0
10382ms10264kbCost incorect0
Punctaj total10

Ceva nu functioneaza?