Pagini recente » Borderou de evaluare (job #160125) | Borderou de evaluare (job #2518947) | Borderou de evaluare (job #3265452) | Borderou de evaluare (job #279356) | Borderou de evaluare (job #1794754)
Borderou de evaluare (job #1794754)
Raport evaluator
Compilare:
user.cpp: In function ‘int climb(int*, int)’:
user.cpp:28:43: warning: array subscript has type ‘char’ [-Wchar-subscripts]
min = MIN(min, cost[lg[level & -level]][*u]);
^
user.cpp:29:35: warning: array subscript has type ‘char’ [-Wchar-subscripts]
*u = father[lg[level & -level]][*u];
^
user.cpp: In function ‘int main()’:
user.cpp:39:36: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f, "%d %d %d", &N, &M, &P);
^
user.cpp:41:52: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f, "%hd %d", &father[0][i], &cost[0][i]);
^
user.cpp:44:57: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
fscanf(f, "%d %d %d %d %d %d", &X, &Y, &A, &B, &C, &D);
^
user.cpp:60:35: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’, declared with attribute warn_unused_result [-Wunused-result]
freopen("atac.out", "w", stdout);
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 372kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
2 | 0ms | 376kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
3 | 80ms | 456kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
4 | 80ms | 456kb | esti tare! dar abia astept sa vad ce faci pe testele mari | 10 |
5 | 96ms | 3160kb | oho! ai bifat solutia ;) | 10 |
6 | 100ms | 3160kb | oho! ai bifat solutia ;) | 10 |
7 | 100ms | 3156kb | oho! ai bifat solutia ;) | 10 |
8 | 268ms | 3152kb | oho! ai bifat solutia ;) | 10 |
9 | 276ms | 3160kb | oho! ai bifat solutia ;) | 10 |
10 | 124ms | 3152kb | oho! ai bifat solutia ;) | 10 |
Punctaj total | 100 |