Borderou de evaluare (job #2132586)

Utilizator SqueekDanielTodasca Daniel SqueekDaniel Data 15 februarie 2018 21:34:56
Problema Marele Zgomot Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 10

Raport evaluator

Compilare: user.cpp: In function ‘void inregistrare(int, int)’: user.cpp:53:33: warning: narrowing conversion of ‘t’ from ‘int’ to ‘short int’ inside { } [-Wnarrowing] crc.push_back({p1, p2, t, l}); ^ user.cpp: In function ‘void explorare(int, int)’: user.cpp:81:15: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses] if((y1 == crc[ap[y1][x1]].cap1.first || y1 == crc[ap[y1][x1]].cap2.first) && (x1 == crc[ap[y1][x1]].cap1.second || x1 == crc[ap[y1][x1]].cap2.second)) ^ user.cpp: In function ‘void inregistrare(int, int)’: user.cpp:49:84: warning: array subscript is above array bounds [-Warray-bounds] parc = std::pair <int, int> (parc.first + dy[i], parc.second + dx[i]), val[parc.first][parc.second] = -1, ap[parc.first][parc.second] = crc.size(), l++; ^ user.cpp:49:63: warning: array subscript is above array bounds [-Warray-bounds] parc = std::pair <int, int> (parc.first + dy[i], parc.second + dx[i]), val[parc.first][parc.second] = -1, ap[parc.first][parc.second] = crc.size(), l++; ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
14ms7540kbOk!10
24ms11664kbNumar gresit de circuite.0
38ms13748kbNumar gresit de circuite.0
48ms13708kbNumar gresit de circuite.0
544ms34496kbNumar gresit de circuite.0
680ms34316kbNumar gresit de circuite.0
728ms13784kbNumar gresit de circuite.0
888msDepăşitMemory limit exceeded.0
988msDepăşitMemory limit exceeded.0
1088msDepăşitMemory limit exceeded.0
Punctaj total10

Ceva nu functioneaza?