Mai intai trebuie sa te autentifici.
Borderou de evaluare (job #2036598)
| Utilizator | Data | 10 octombrie 2017 20:41:39 | |
|---|---|---|---|
| Problema | Algoritmul Bellman-Ford | Status | done |
| Runda | Arhiva educationala | Compilator | cpp | Vezi sursa |
| Scor | 100 | ||
Raport evaluator
Compilare:
user.cpp: In function ‘void bellmanford(int, int, int)’:
user.cpp:26:50: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for ( int i = 0; i < v[ coada.front() ].size(); i++ ) {
^
user.cpp: In function ‘bool verif(int, int)’:
user.cpp:41:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for( int j = 0; j < v[i].size(); j++ ) {
^
user.cpp: In function ‘int main()’:
user.cpp:53:45: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf( fin, "%d%d", &nr_nod, &nr_muchii );
^
user.cpp:55:40: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf( fin, "%d%d%d", &x, &y, &c );
^
| Test | Timp executie | Memorie folosita | Mesaj | Punctaj/test | Punctaj/grupa |
|---|---|---|---|---|---|
| 1 | 0ms | 844kb | OK | 5 | 5 |
| 2 | 0ms | 844kb | OK | 5 | 5 |
| 3 | 0ms | 852kb | OK | 5 | 5 |
| 4 | 0ms | 856kb | OK | 5 | 5 |
| 5 | 0ms | 876kb | OK | 5 | 5 |
| 6 | 0ms | 864kb | OK | 5 | 10 |
| 7 | 8ms | 988kb | OK | 5 | |
| 8 | 28ms | 1192kb | OK | 5 | 15 |
| 9 | 44ms | 1596kb | OK | 5 | |
| 10 | 20ms | 2048kb | OK | 5 | |
| 11 | 48ms | 1448kb | OK | 5 | 20 |
| 12 | 112ms | 2556kb | OK | 5 | |
| 13 | 76ms | 2040kb | OK | 5 | |
| 14 | 152ms | 3132kb | OK | 5 | |
| 15 | 196ms | 3612kb | OK | 5 | 15 |
| 16 | 148ms | 2972kb | OK | 5 | |
| 17 | 28ms | 1100kb | OK | 5 | |
| 18 | 220ms | 3816kb | OK | 5 | 15 |
| 19 | 268ms | 4512kb | OK | 5 | |
| 20 | 96ms | 4740kb | OK | 5 | |
| Punctaj total | 100 | ||||
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
