Borderou de evaluare (job #2858535)

Utilizator Max_CalincuMaxim Calincu Max_Calincu Data 27 februarie 2022 19:24:54
Problema BFS - Parcurgere in latime Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'void solve()': main.cpp:48:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 48 | for(int i = 0; i<a[x].size(); i++){ | ~^~~~~~~~~~~~ main.cpp:55:2: warning: this 'for' clause does not guard... [-Wmisleading-indentation] 55 | for(int i = 0; i<n; i++) if(ans[i] == mod) cout << "-1 "; else cout << ans[i] << " "; cout << "\n"; | ^~~ main.cpp:55:88: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for' 55 | for(int i = 0; i<n; i++) if(ans[i] == mod) cout << "-1 "; else cout << ans[i] << " "; cout << "\n"; | ^~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
16ms2605kbOK10
26ms2641kbOK10
36ms2654kbOK10
411ms2744kbOK10
516ms2965kbOK10
663ms4390kbOK10
7188ms6971kbOK10
8168ms7540kbOK10
9900ms19312kbOK10
10898ms19312kbOK10
Punctaj total100

Ceva nu functioneaza?