Pagini recente » Borderou de evaluare (job #2122987) | Borderou de evaluare (job #3203197) | Borderou de evaluare (job #996041) | Borderou de evaluare (job #2862170) | Borderou de evaluare (job #2600699)
Borderou de evaluare (job #2600699)
Raport evaluator
Compilare:
main.cpp: In function 'bool bfs(int)':
main.cpp:20:26: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
viz[i] = tata[i] = 0;
~~~~~~~~^~~
main.cpp:26:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( int i = 0; i < graph[node].size ( ); i++ ){
~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'void bfs2(int)':
main.cpp:44:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( int i = 0; i < graph[node].size ( ); i++ ){
~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:66:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( i = 0; i < graph[n].size ( ); i++ ){
~~^~~~~~~~~~~~~~~~~~~
main.cpp:87:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( int j = 0; j < graph[i].size ( ); j++ ){
~~^~~~~~~~~~~~~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 2ms | 262kb | Okay! | 10 |
| 2 | 3ms | 262kb | Okay! | 10 |
| 3 | 4ms | 524kb | Okay! | 10 |
| 4 | 4ms | 655kb | Too bad! | 0 |
| 5 | 5ms | 917kb | Too bad! | 0 |
| 6 | 15ms | 1048kb | Too bad! | 0 |
| 7 | 29ms | 1703kb | Too bad! | 0 |
| 8 | 12ms | 1179kb | Too bad! | 0 |
| 9 | 10ms | 1048kb | Too bad! | 0 |
| 10 | 22ms | 4718kb | Too bad! | 0 |
| Punctaj total | 30 |