Borderou de evaluare (job #2461427)

Utilizator CharacterMeCharacter Me CharacterMe Data 25 septembrie 2019 17:59:19
Problema Interclasare Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 40

Raport evaluator

Compilare: main.cpp: In function 'void solve()': main.cpp:30:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation] for(i=2; i<=n; ++i) bins(0, list[0][i]); pos=mx[v]; sol+=v; ^~~ main.cpp:30:46: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the 'for' for(i=2; i<=n; ++i) bins(0, list[0][i]); pos=mx[v]; sol+=v; ^~~ main.cpp: In function 'int main()': main.cpp:12:43: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("interclasare.in", "r", stdin); ^ main.cpp:13:45: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result] freopen("interclasare.out", "w", stdout); ^ main.cpp: In function 'void read()': main.cpp:22:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", &n); ^ main.cpp:23:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] for(i=1; i<=n; ++i) scanf("%lld", &list[0][i]); ^ main.cpp:24:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] scanf("%lld", &m); ^ main.cpp:25:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result] for(i=1; i<=m; ++i) scanf("%lld", &list[1][i]); ^ main.cpp: In function 'void bins(ll, ll)': main.cpp:85:18: warning: 'm' may be used uninitialized in this function [-Wmaybe-uninitialized] ll l=1, r=v, m; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
14ms262kbNu exista subsir crescator de lungime maxima!4
25ms262kbNu exista subsir crescator de lungime maxima!4
37ms262kbNu exista subsir crescator de lungime maxima!4
49ms393kbNu exista subsir crescator de lungime maxima!4
510ms393kbNu exista subsir crescator de lungime maxima!4
612ms524kbNu exista subsir crescator de lungime maxima!4
714ms524kbNu exista subsir crescator de lungime maxima!4
815ms524kbNu exista subsir crescator de lungime maxima!4
917ms655kbNu exista subsir crescator de lungime maxima!4
1019ms655kbNu exista subsir crescator de lungime maxima!4
Punctaj total40

Ceva nu functioneaza?